Relaxing the Irrevocability Requirement for Online Graph Algorithms Article Swipe

View

Joan Boyar , Lene M. Favrholdt , Michal Kotrbčı́k , Kim S. Larsen ·

YOU? · · 2022 · Open Access · · DOI: https://doi.org/10.1007/s00453-022-00944-w

Related Topics

Theory Of Computation

Combinatorics

Mathematics

Vertex (Graph Theory)

Mathematical Analysis

Concepts

Theory of computation Vertex cover Combinatorics Mathematics Competitive analysis Graph Vertex (graph theory) Preemption Matching (statistics) Set (abstract data type) Constant (computer programming) Planar graph Computer science Algorithm Upper and lower bounds Statistics Programming language Mathematical analysis Operating system

Metadata

Type: article
Language: en
Landing Page: https://doi.org/10.1007/s00453-022-00944-w
OA Status: green
Cited By: 7
References: 40
Related Works: 10
OpenAlex ID: https://openalex.org/W2952999756

All OpenAlex metadata

Raw OpenAlex JSON

OpenAlex ID: https://openalex.org/W2952999756

Canonical identifier for this work in OpenAlex
DOI: https://doi.org/10.1007/s00453-022-00944-w

Digital Object Identifier
Title: Relaxing the Irrevocability Requirement for Online Graph Algorithms

Work title
Type: article

OpenAlex work type
Language: en

Primary language
Publication year: 2022

Year of publication
Publication date: 2022-02-25

Full publication date if available
Authors: Joan Boyar, Lene M. Favrholdt, Michal Kotrbčı́k, Kim S. Larsen

List of authors in order
Landing page: https://doi.org/10.1007/s00453-022-00944-w

Publisher landing page
Open access: Yes

Whether a free full text is available
OA status: green

Open access status per OpenAlex
OA URL: https://portal.findresearcher.sdu.dk/da/publications/1b4e1848-5aeb-4f30-9f45-b6bc920e454c

Direct OA link when available
Concepts: Theory of computation, Vertex cover, Combinatorics, Mathematics, Competitive analysis, Graph, Vertex (graph theory), Preemption, Matching (statistics), Set (abstract data type), Constant (computer programming), Planar graph, Computer science, Algorithm, Upper and lower bounds, Statistics, Programming language, Mathematical analysis, Operating system

Top concepts (fields/topics) attached by OpenAlex
Cited by: 7

Total citation count in OpenAlex
Citations by year (recent): 2025: 2, 2023: 2, 2022: 1, 2020: 2

Per-year citation counts (last 5 years)
References (count): 40

Number of works referenced by this work
Related works (count): 10

Other works algorithmically related by OpenAlex

Full payload

id	https://openalex.org/W2952999756
doi	https://doi.org/10.1007/s00453-022-00944-w
ids.doi	https://doi.org/10.1007/s00453-022-00944-w
ids.mag	2952999756
ids.openalex	https://openalex.org/W2952999756
fwci	1.07120872
type	article
title	Relaxing the Irrevocability Requirement for Online Graph Algorithms
awards[0].id	https://openalex.org/G6298695570
awards[0].funder_id	https://openalex.org/F4320310490
awards[0].display_name
awards[0].funder_award_id	VKR023219
awards[0].funder_display_name	Villum Fonden
awards[1].id	https://openalex.org/G834198560
awards[1].funder_id	https://openalex.org/F4320310485
awards[1].display_name
awards[1].funder_award_id	DFF-0135-00018B
awards[1].funder_display_name	Natur og Univers, Det Frie Forskningsråd
biblio.issue	7
biblio.volume	84
biblio.last_page	1951
biblio.first_page	1916
topics[0].id	https://openalex.org/T12288
topics[0].field.id	https://openalex.org/fields/17
topics[0].field.display_name	Computer Science
topics[0].score	1.0
topics[0].domain.id	https://openalex.org/domains/3
topics[0].domain.display_name	Physical Sciences
topics[0].subfield.id	https://openalex.org/subfields/1705
topics[0].subfield.display_name	Computer Networks and Communications
topics[0].display_name	Optimization and Search Problems
topics[1].id	https://openalex.org/T11478
topics[1].field.id	https://openalex.org/fields/17
topics[1].field.display_name	Computer Science
topics[1].score	0.9951000213623047
topics[1].domain.id	https://openalex.org/domains/3
topics[1].domain.display_name	Physical Sciences
topics[1].subfield.id	https://openalex.org/subfields/1705
topics[1].subfield.display_name	Computer Networks and Communications
topics[1].display_name	Caching and Content Delivery
topics[2].id	https://openalex.org/T11182
topics[2].field.id	https://openalex.org/fields/18
topics[2].field.display_name	Decision Sciences
topics[2].score	0.9932000041007996
topics[2].domain.id	https://openalex.org/domains/2
topics[2].domain.display_name	Social Sciences
topics[2].subfield.id	https://openalex.org/subfields/1803
topics[2].subfield.display_name	Management Science and Operations Research
topics[2].display_name	Auction Theory and Applications
funders[0].id	https://openalex.org/F4320310485
funders[0].ror	https://ror.org/03ge1nb22
funders[0].display_name	Natur og Univers, Det Frie Forskningsråd
funders[1].id	https://openalex.org/F4320310490
funders[1].ror	https://ror.org/007ww2d15
funders[1].display_name	Villum Fonden
is_xpac	False
apc_list.value	2290
apc_list.currency	EUR
apc_list.value_usd	2890
apc_paid
concepts[0].id	https://openalex.org/C24858836
concepts[0].level	2
concepts[0].score	0.671533465385437
concepts[0].wikidata	https://www.wikidata.org/wiki/Q844718
concepts[0].display_name	Theory of computation
concepts[1].id	https://openalex.org/C40687702
concepts[1].level	3
concepts[1].score	0.579925537109375
concepts[1].wikidata	https://www.wikidata.org/wiki/Q11515519
concepts[1].display_name	Vertex cover
concepts[2].id	https://openalex.org/C114614502
concepts[2].level	1
concepts[2].score	0.5570656061172485
concepts[2].wikidata	https://www.wikidata.org/wiki/Q76592
concepts[2].display_name	Combinatorics
concepts[3].id	https://openalex.org/C33923547
concepts[3].level	0
concepts[3].score	0.5425648093223572
concepts[3].wikidata	https://www.wikidata.org/wiki/Q395
concepts[3].display_name	Mathematics
concepts[4].id	https://openalex.org/C102408133
concepts[4].level	3
concepts[4].score	0.5401912927627563
concepts[4].wikidata	https://www.wikidata.org/wiki/Q5156350
concepts[4].display_name	Competitive analysis
concepts[5].id	https://openalex.org/C132525143
concepts[5].level	2
concepts[5].score	0.5245402455329895
concepts[5].wikidata	https://www.wikidata.org/wiki/Q141488
concepts[5].display_name	Graph
concepts[6].id	https://openalex.org/C80899671
concepts[6].level	3
concepts[6].score	0.5134857296943665
concepts[6].wikidata	https://www.wikidata.org/wiki/Q1304193
concepts[6].display_name	Vertex (graph theory)
concepts[7].id	https://openalex.org/C206952183
concepts[7].level	2
concepts[7].score	0.44806116819381714
concepts[7].wikidata	https://www.wikidata.org/wiki/Q1193100
concepts[7].display_name	Preemption
concepts[8].id	https://openalex.org/C165064840
concepts[8].level	2
concepts[8].score	0.4379411041736603
concepts[8].wikidata	https://www.wikidata.org/wiki/Q1321061
concepts[8].display_name	Matching (statistics)
concepts[9].id	https://openalex.org/C177264268
concepts[9].level	2
concepts[9].score	0.4267508387565613
concepts[9].wikidata	https://www.wikidata.org/wiki/Q1514741
concepts[9].display_name	Set (abstract data type)
concepts[10].id	https://openalex.org/C2777027219
concepts[10].level	2
concepts[10].score	0.4194561243057251
concepts[10].wikidata	https://www.wikidata.org/wiki/Q1284190
concepts[10].display_name	Constant (computer programming)
concepts[11].id	https://openalex.org/C101837359
concepts[11].level	3
concepts[11].score	0.4158291518688202
concepts[11].wikidata	https://www.wikidata.org/wiki/Q547823
concepts[11].display_name	Planar graph
concepts[12].id	https://openalex.org/C41008148
concepts[12].level	0
concepts[12].score	0.37595927715301514
concepts[12].wikidata	https://www.wikidata.org/wiki/Q21198
concepts[12].display_name	Computer science
concepts[13].id	https://openalex.org/C11413529
concepts[13].level	1
concepts[13].score	0.3522096276283264
concepts[13].wikidata	https://www.wikidata.org/wiki/Q8366
concepts[13].display_name	Algorithm
concepts[14].id	https://openalex.org/C77553402
concepts[14].level	2
concepts[14].score	0.2495599389076233
concepts[14].wikidata	https://www.wikidata.org/wiki/Q13222579
concepts[14].display_name	Upper and lower bounds
concepts[15].id	https://openalex.org/C105795698
concepts[15].level	1
concepts[15].score	0.09808611869812012
concepts[15].wikidata	https://www.wikidata.org/wiki/Q12483
concepts[15].display_name	Statistics
concepts[16].id	https://openalex.org/C199360897
concepts[16].level	1
concepts[16].score	0.0
concepts[16].wikidata	https://www.wikidata.org/wiki/Q9143
concepts[16].display_name	Programming language
concepts[17].id	https://openalex.org/C134306372
concepts[17].level	1
concepts[17].score	0.0
concepts[17].wikidata	https://www.wikidata.org/wiki/Q7754
concepts[17].display_name	Mathematical analysis
concepts[18].id	https://openalex.org/C111919701
concepts[18].level	1
concepts[18].score	0.0
concepts[18].wikidata	https://www.wikidata.org/wiki/Q9135
concepts[18].display_name	Operating system
keywords[0].id	https://openalex.org/keywords/theory-of-computation
keywords[0].score	0.671533465385437
keywords[0].display_name	Theory of computation
keywords[1].id	https://openalex.org/keywords/vertex-cover
keywords[1].score	0.579925537109375
keywords[1].display_name	Vertex cover
keywords[2].id	https://openalex.org/keywords/combinatorics
keywords[2].score	0.5570656061172485
keywords[2].display_name	Combinatorics
keywords[3].id	https://openalex.org/keywords/mathematics
keywords[3].score	0.5425648093223572
keywords[3].display_name	Mathematics
keywords[4].id	https://openalex.org/keywords/competitive-analysis
keywords[4].score	0.5401912927627563
keywords[4].display_name	Competitive analysis
keywords[5].id	https://openalex.org/keywords/graph
keywords[5].score	0.5245402455329895
keywords[5].display_name	Graph
keywords[6].id	https://openalex.org/keywords/vertex
keywords[6].score	0.5134857296943665
keywords[6].display_name	Vertex (graph theory)
keywords[7].id	https://openalex.org/keywords/preemption
keywords[7].score	0.44806116819381714
keywords[7].display_name	Preemption
keywords[8].id	https://openalex.org/keywords/matching
keywords[8].score	0.4379411041736603
keywords[8].display_name	Matching (statistics)
keywords[9].id	https://openalex.org/keywords/set
keywords[9].score	0.4267508387565613
keywords[9].display_name	Set (abstract data type)
keywords[10].id	https://openalex.org/keywords/constant
keywords[10].score	0.4194561243057251
keywords[10].display_name	Constant (computer programming)
keywords[11].id	https://openalex.org/keywords/planar-graph
keywords[11].score	0.4158291518688202
keywords[11].display_name	Planar graph
keywords[12].id	https://openalex.org/keywords/computer-science
keywords[12].score	0.37595927715301514
keywords[12].display_name	Computer science
keywords[13].id	https://openalex.org/keywords/algorithm
keywords[13].score	0.3522096276283264
keywords[13].display_name	Algorithm
keywords[14].id	https://openalex.org/keywords/upper-and-lower-bounds
keywords[14].score	0.2495599389076233
keywords[14].display_name	Upper and lower bounds
keywords[15].id	https://openalex.org/keywords/statistics
keywords[15].score	0.09808611869812012
keywords[15].display_name	Statistics
language	en
locations[0].id	doi:10.1007/s00453-022-00944-w
locations[0].is_oa	False
locations[0].source.id	https://openalex.org/S89324355
locations[0].source.issn	0178-4617, 1432-0541
locations[0].source.type	journal
locations[0].source.is_oa	False
locations[0].source.issn_l	0178-4617
locations[0].source.is_core	True
locations[0].source.is_in_doaj	False
locations[0].source.display_name	Algorithmica
locations[0].source.host_organization	https://openalex.org/P4310319900
locations[0].source.host_organization_name	Springer Science+Business Media
locations[0].source.host_organization_lineage	https://openalex.org/P4310319900, https://openalex.org/P4310319965
locations[0].source.host_organization_lineage_names	Springer Science+Business Media, Springer Nature
locations[0].license
locations[0].pdf_url
locations[0].version	publishedVersion
locations[0].raw_type	journal-article
locations[0].license_id
locations[0].is_accepted	True
locations[0].is_published	True
locations[0].raw_source_name	Algorithmica
locations[0].landing_page_url	https://doi.org/10.1007/s00453-022-00944-w
locations[1].id	pmh:oai:sdu.dk:openaire/1b4e1848-5aeb-4f30-9f45-b6bc920e454c
locations[1].is_oa	True
locations[1].source.id	https://openalex.org/S4306400423
locations[1].source.issn
locations[1].source.type	repository
locations[1].source.is_oa	False
locations[1].source.issn_l
locations[1].source.is_core	False
locations[1].source.is_in_doaj	False
locations[1].source.display_name	University of Southern Denmark Research Portal (University of Southern Denmark)
locations[1].source.host_organization	https://openalex.org/I177969490
locations[1].source.host_organization_name	University of Southern Denmark
locations[1].source.host_organization_lineage	https://openalex.org/I177969490
locations[1].license	other-oa
locations[1].pdf_url
locations[1].version	publishedVersion
locations[1].raw_type	info:eu-repo/semantics/publishedVersion
locations[1].license_id	https://openalex.org/licenses/other-oa
locations[1].is_accepted	True
locations[1].is_published	True
locations[1].raw_source_name	Boyar, J, Favrholdt, L M, Kotrbčík, M & Larsen, K S 2022, 'Relaxing the Irrevocability Requirement for Online Graph Algorithms', Algorithmica, vol. 84, no. 7, pp. 1916-1951. https://doi.org/10.1007/s00453-022-00944-w
locations[1].landing_page_url	https://portal.findresearcher.sdu.dk/da/publications/1b4e1848-5aeb-4f30-9f45-b6bc920e454c
indexed_in	crossref
authorships[0].author.id	https://openalex.org/A5068354624
authorships[0].author.orcid	https://orcid.org/0000-0002-0725-8341
authorships[0].author.display_name	Joan Boyar
authorships[0].countries	DK
authorships[0].affiliations[0].institution_ids	https://openalex.org/I177969490
authorships[0].affiliations[0].raw_affiliation_string	Department of Mathematics and Computer Science, University of Southern Denmark, Campusvej 55, 5230, Odense M, Denmark
authorships[0].institutions[0].id	https://openalex.org/I177969490
authorships[0].institutions[0].ror	https://ror.org/03yrrjy16
authorships[0].institutions[0].type	education
authorships[0].institutions[0].lineage	https://openalex.org/I177969490
authorships[0].institutions[0].country_code	DK
authorships[0].institutions[0].display_name	University of Southern Denmark
authorships[0].author_position	first
authorships[0].raw_author_name	Joan Boyar
authorships[0].is_corresponding	False
authorships[0].raw_affiliation_strings	Department of Mathematics and Computer Science, University of Southern Denmark, Campusvej 55, 5230, Odense M, Denmark
authorships[1].author.id	https://openalex.org/A5023065140
authorships[1].author.orcid	https://orcid.org/0000-0003-3054-2997
authorships[1].author.display_name	Lene M. Favrholdt
authorships[1].countries	DK
authorships[1].affiliations[0].institution_ids	https://openalex.org/I177969490
authorships[1].affiliations[0].raw_affiliation_string	Department of Mathematics and Computer Science, University of Southern Denmark, Campusvej 55, 5230, Odense M, Denmark
authorships[1].institutions[0].id	https://openalex.org/I177969490
authorships[1].institutions[0].ror	https://ror.org/03yrrjy16
authorships[1].institutions[0].type	education
authorships[1].institutions[0].lineage	https://openalex.org/I177969490
authorships[1].institutions[0].country_code	DK
authorships[1].institutions[0].display_name	University of Southern Denmark
authorships[1].author_position	middle
authorships[1].raw_author_name	Lene M. Favrholdt
authorships[1].is_corresponding	False
authorships[1].raw_affiliation_strings	Department of Mathematics and Computer Science, University of Southern Denmark, Campusvej 55, 5230, Odense M, Denmark
authorships[2].author.id	https://openalex.org/A5011375558
authorships[2].author.orcid
authorships[2].author.display_name	Michal Kotrbčı́k
authorships[2].countries	AU
authorships[2].affiliations[0].institution_ids	https://openalex.org/I165143802
authorships[2].affiliations[0].raw_affiliation_string	School of Mathematics and Physics, The University of Queensland, St Lucia, Brisbane, QLD, 4072, Australia
authorships[2].institutions[0].id	https://openalex.org/I165143802
authorships[2].institutions[0].ror	https://ror.org/00rqy9422
authorships[2].institutions[0].type	education
authorships[2].institutions[0].lineage	https://openalex.org/I165143802
authorships[2].institutions[0].country_code	AU
authorships[2].institutions[0].display_name	The University of Queensland
authorships[2].author_position	middle
authorships[2].raw_author_name	Michal Kotrbčík
authorships[2].is_corresponding	False
authorships[2].raw_affiliation_strings	School of Mathematics and Physics, The University of Queensland, St Lucia, Brisbane, QLD, 4072, Australia
authorships[3].author.id	https://openalex.org/A5000210653
authorships[3].author.orcid	https://orcid.org/0000-0003-0560-3794
authorships[3].author.display_name	Kim S. Larsen
authorships[3].countries	DK
authorships[3].affiliations[0].institution_ids	https://openalex.org/I177969490
authorships[3].affiliations[0].raw_affiliation_string	Department of Mathematics and Computer Science, University of Southern Denmark, Campusvej 55, 5230, Odense M, Denmark
authorships[3].institutions[0].id	https://openalex.org/I177969490
authorships[3].institutions[0].ror	https://ror.org/03yrrjy16
authorships[3].institutions[0].type	education
authorships[3].institutions[0].lineage	https://openalex.org/I177969490
authorships[3].institutions[0].country_code	DK
authorships[3].institutions[0].display_name	University of Southern Denmark
authorships[3].author_position	last
authorships[3].raw_author_name	Kim S. Larsen
authorships[3].is_corresponding	False
authorships[3].raw_affiliation_strings	Department of Mathematics and Computer Science, University of Southern Denmark, Campusvej 55, 5230, Odense M, Denmark
has_content.pdf	False
has_content.grobid_xml	False
is_paratext	False
open_access.is_oa	True
open_access.oa_url	https://portal.findresearcher.sdu.dk/da/publications/1b4e1848-5aeb-4f30-9f45-b6bc920e454c
open_access.oa_status	green
open_access.any_repository_has_fulltext	False
created_date	2025-10-10T00:00:00
display_name	Relaxing the Irrevocability Requirement for Online Graph Algorithms
has_fulltext	False
is_retracted	False
updated_date	2025-11-06T03:46:38.306776
primary_topic.id	https://openalex.org/T12288
primary_topic.field.id	https://openalex.org/fields/17
primary_topic.field.display_name	Computer Science
primary_topic.score	1.0
primary_topic.domain.id	https://openalex.org/domains/3
primary_topic.domain.display_name	Physical Sciences
primary_topic.subfield.id	https://openalex.org/subfields/1705
primary_topic.subfield.display_name	Computer Networks and Communications
primary_topic.display_name	Optimization and Search Problems
related_works	https://openalex.org/W2752015945, https://openalex.org/W2051209951, https://openalex.org/W1493790977, https://openalex.org/W2358378335, https://openalex.org/W3135987664, https://openalex.org/W1996475154, https://openalex.org/W4297052981, https://openalex.org/W1992519595, https://openalex.org/W2081642962, https://openalex.org/W2803566534
cited_by_count	7
counts_by_year[0].year	2025
counts_by_year[0].cited_by_count	2
counts_by_year[1].year	2023
counts_by_year[1].cited_by_count	2
counts_by_year[2].year	2022
counts_by_year[2].cited_by_count	1
counts_by_year[3].year	2020
counts_by_year[3].cited_by_count	2
locations_count	2
best_oa_location.id	pmh:oai:sdu.dk:openaire/1b4e1848-5aeb-4f30-9f45-b6bc920e454c
best_oa_location.is_oa	True
best_oa_location.source.id	https://openalex.org/S4306400423
best_oa_location.source.issn
best_oa_location.source.type	repository
best_oa_location.source.is_oa	False
best_oa_location.source.issn_l
best_oa_location.source.is_core	False
best_oa_location.source.is_in_doaj	False
best_oa_location.source.display_name	University of Southern Denmark Research Portal (University of Southern Denmark)
best_oa_location.source.host_organization	https://openalex.org/I177969490
best_oa_location.source.host_organization_name	University of Southern Denmark
best_oa_location.source.host_organization_lineage	https://openalex.org/I177969490
best_oa_location.license	other-oa
best_oa_location.pdf_url
best_oa_location.version	publishedVersion
best_oa_location.raw_type	info:eu-repo/semantics/publishedVersion
best_oa_location.license_id	https://openalex.org/licenses/other-oa
best_oa_location.is_accepted	True
best_oa_location.is_published	True
best_oa_location.raw_source_name	Boyar, J, Favrholdt, L M, Kotrbčík, M & Larsen, K S 2022, 'Relaxing the Irrevocability Requirement for Online Graph Algorithms', Algorithmica, vol. 84, no. 7, pp. 1916-1951. https://doi.org/10.1007/s00453-022-00944-w
best_oa_location.landing_page_url	https://portal.findresearcher.sdu.dk/da/publications/1b4e1848-5aeb-4f30-9f45-b6bc920e454c
primary_location.id	doi:10.1007/s00453-022-00944-w
primary_location.is_oa	False
primary_location.source.id	https://openalex.org/S89324355
primary_location.source.issn	0178-4617, 1432-0541
primary_location.source.type	journal
primary_location.source.is_oa	False
primary_location.source.issn_l	0178-4617
primary_location.source.is_core	True
primary_location.source.is_in_doaj	False
primary_location.source.display_name	Algorithmica
primary_location.source.host_organization	https://openalex.org/P4310319900
primary_location.source.host_organization_name	Springer Science+Business Media
primary_location.source.host_organization_lineage	https://openalex.org/P4310319900, https://openalex.org/P4310319965
primary_location.source.host_organization_lineage_names	Springer Science+Business Media, Springer Nature
primary_location.license
primary_location.pdf_url
primary_location.version	publishedVersion
primary_location.raw_type	journal-article
primary_location.license_id
primary_location.is_accepted	True
primary_location.is_published	True
primary_location.raw_source_name	Algorithmica
primary_location.landing_page_url	https://doi.org/10.1007/s00453-022-00944-w
publication_date	2022-02-25
publication_year	2022
referenced_works	https://openalex.org/W2041839348, https://openalex.org/W2893780080, https://openalex.org/W2611885862, https://openalex.org/W2341403126, https://openalex.org/W2952359104, https://openalex.org/W1973221673, https://openalex.org/W2076855469, https://openalex.org/W2762990162, https://openalex.org/W2165753192, https://openalex.org/W2081414879, https://openalex.org/W2259315298, https://openalex.org/W4206501214, https://openalex.org/W1980280644, https://openalex.org/W2082721953, https://openalex.org/W2174718091, https://openalex.org/W2029437526, https://openalex.org/W1589175915, https://openalex.org/W2046731583, https://openalex.org/W2011670396, https://openalex.org/W1608917902, https://openalex.org/W4251221220, https://openalex.org/W1599161138, https://openalex.org/W1489273657, https://openalex.org/W1992523338, https://openalex.org/W2469267808, https://openalex.org/W2885283474, https://openalex.org/W112063162, https://openalex.org/W2041645394, https://openalex.org/W1513400187, https://openalex.org/W2070459622, https://openalex.org/W2028468530, https://openalex.org/W4255288880, https://openalex.org/W345637930, https://openalex.org/W2963961281, https://openalex.org/W2537728301, https://openalex.org/W3101104511, https://openalex.org/W2576677780, https://openalex.org/W1590242304, https://openalex.org/W2962942578, https://openalex.org/W2335836144
referenced_works_count	40
abstract_inverted_index
cited_by_percentile_year.max	97
cited_by_percentile_year.min	89
countries_distinct_count	2
institutions_distinct_count	4
sustainable_development_goals[0].id	https://metadata.un.org/sdg/15
sustainable_development_goals[0].score	0.550000011920929
sustainable_development_goals[0].display_name	Life in Land
citation_normalized_percentile.value	0.7085151
citation_normalized_percentile.is_in_top_1_percent	False
citation_normalized_percentile.is_in_top_10_percent	False