Recognizing DAGs with page-number 2 is NP-complete Article Swipe

View

Michael A. Bekos , Giordano Da Lozzo , Fabrizio Frati , Martin Gronemann , Tamara Mchedlidze , Chrysanthi N. Raftopoulou ·

YOU? · · 2023 · Open Access · · DOI: https://doi.org/10.1016/j.tcs.2023.113689

The page-number of a directed acyclic graph (a DAG, for short) is the minimum k for which the DAG has a topological order and a k-coloring of its edges such that no two edges of the same color cross, i.e., have alternating endpoints along the topological order. In 1999, Heath and Pemmaraju conjectured that the recognition of DAGs with page-number 2 is NP -complete and proved that recognizing DAGs with page-number 6 is NP-complete (Heath and Pemmaraju (1999) [15]). Binucci et al. recently strengthened this result by proving that recognizing DAGs with page-number k is NP-complete, for every k >= 3 (Binucci et al. (2019) [6]). In this paper, we finally resolve Heath and Pemmaraju's conjecture in the affirmative. In particular, our NP-completeness result holds even for st-planar graphs and planar posets.(c) 2023 Elsevier B.V. All rights reserved.

Related Topics

Directed Acyclic Graph

Combinatorics

Mathematics

Discrete Mathematics

Concepts

Directed acyclic graph Combinatorics Mathematics Conjecture Discrete mathematics Planar graph Graph

Metadata

Type: article
Language: en
Landing Page: https://doi.org/10.1016/j.tcs.2023.113689
OA Status: hybrid
Cited By: 6
References: 30
Related Works: 10
OpenAlex ID: https://openalex.org/W4319324280

All OpenAlex metadata

Raw OpenAlex JSON

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

Canonical identifier for this work in OpenAlex
DOI: https://doi.org/10.1016/j.tcs.2023.113689

Digital Object Identifier
Title: Recognizing DAGs with page-number 2 is NP-complete

Work title
Type: article

OpenAlex work type
Language: en

Primary language
Publication year: 2023

Year of publication
Publication date: 2023-01-11

Full publication date if available
Authors: Michael A. Bekos, Giordano Da Lozzo, Fabrizio Frati, Martin Gronemann, Tamara Mchedlidze, Chrysanthi N. Raftopoulou

List of authors in order
Landing page: https://doi.org/10.1016/j.tcs.2023.113689

Publisher landing page
Open access: Yes

Whether a free full text is available
OA status: hybrid

Open access status per OpenAlex
OA URL: https://doi.org/10.1016/j.tcs.2023.113689

Direct OA link when available
Concepts: Directed acyclic graph, Combinatorics, Mathematics, Conjecture, Discrete mathematics, Planar graph, Graph

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

Total citation count in OpenAlex
Citations by year (recent): 2024: 1, 2023: 4, 2022: 1

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

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

Other works algorithmically related by OpenAlex

Full payload

id	https://openalex.org/W4319324280
doi	https://doi.org/10.1016/j.tcs.2023.113689
ids.doi	https://doi.org/10.1016/j.tcs.2023.113689
ids.openalex	https://openalex.org/W4319324280
fwci	1.54480602
type	article
title	Recognizing DAGs with page-number 2 is NP-complete
biblio.issue
biblio.volume	946
biblio.last_page	113689
biblio.first_page	113689
topics[0].id	https://openalex.org/T10374
topics[0].field.id	https://openalex.org/fields/17
topics[0].field.display_name	Computer Science
topics[0].score	0.9979000091552734
topics[0].domain.id	https://openalex.org/domains/3
topics[0].domain.display_name	Physical Sciences
topics[0].subfield.id	https://openalex.org/subfields/1703
topics[0].subfield.display_name	Computational Theory and Mathematics
topics[0].display_name	Advanced Graph Theory Research
topics[1].id	https://openalex.org/T10996
topics[1].field.id	https://openalex.org/fields/17
topics[1].field.display_name	Computer Science
topics[1].score	0.9966999888420105
topics[1].domain.id	https://openalex.org/domains/3
topics[1].domain.display_name	Physical Sciences
topics[1].subfield.id	https://openalex.org/subfields/1704
topics[1].subfield.display_name	Computer Graphics and Computer-Aided Design
topics[1].display_name	Computational Geometry and Mesh Generation
topics[2].id	https://openalex.org/T12923
topics[2].field.id	https://openalex.org/fields/17
topics[2].field.display_name	Computer Science
topics[2].score	0.9945999979972839
topics[2].domain.id	https://openalex.org/domains/3
topics[2].domain.display_name	Physical Sciences
topics[2].subfield.id	https://openalex.org/subfields/1707
topics[2].subfield.display_name	Computer Vision and Pattern Recognition
topics[2].display_name	Digital Image Processing Techniques
is_xpac	False
apc_list.value	2690
apc_list.currency	USD
apc_list.value_usd	2690
apc_paid.value	2690
apc_paid.currency	USD
apc_paid.value_usd	2690
concepts[0].id	https://openalex.org/C74197172
concepts[0].level	2
concepts[0].score	0.8314870595932007
concepts[0].wikidata	https://www.wikidata.org/wiki/Q1195339
concepts[0].display_name	Directed acyclic graph
concepts[1].id	https://openalex.org/C114614502
concepts[1].level	1
concepts[1].score	0.8119039535522461
concepts[1].wikidata	https://www.wikidata.org/wiki/Q76592
concepts[1].display_name	Combinatorics
concepts[2].id	https://openalex.org/C33923547
concepts[2].level	0
concepts[2].score	0.6535932421684265
concepts[2].wikidata	https://www.wikidata.org/wiki/Q395
concepts[2].display_name	Mathematics
concepts[3].id	https://openalex.org/C2780990831
concepts[3].level	2
concepts[3].score	0.5604833364486694
concepts[3].wikidata	https://www.wikidata.org/wiki/Q319141
concepts[3].display_name	Conjecture
concepts[4].id	https://openalex.org/C118615104
concepts[4].level	1
concepts[4].score	0.464958518743515
concepts[4].wikidata	https://www.wikidata.org/wiki/Q121416
concepts[4].display_name	Discrete mathematics
concepts[5].id	https://openalex.org/C101837359
concepts[5].level	3
concepts[5].score	0.41453057527542114
concepts[5].wikidata	https://www.wikidata.org/wiki/Q547823
concepts[5].display_name	Planar graph
concepts[6].id	https://openalex.org/C132525143
concepts[6].level	2
concepts[6].score	0.3507397174835205
concepts[6].wikidata	https://www.wikidata.org/wiki/Q141488
concepts[6].display_name	Graph
keywords[0].id	https://openalex.org/keywords/directed-acyclic-graph
keywords[0].score	0.8314870595932007
keywords[0].display_name	Directed acyclic graph
keywords[1].id	https://openalex.org/keywords/combinatorics
keywords[1].score	0.8119039535522461
keywords[1].display_name	Combinatorics
keywords[2].id	https://openalex.org/keywords/mathematics
keywords[2].score	0.6535932421684265
keywords[2].display_name	Mathematics
keywords[3].id	https://openalex.org/keywords/conjecture
keywords[3].score	0.5604833364486694
keywords[3].display_name	Conjecture
keywords[4].id	https://openalex.org/keywords/discrete-mathematics
keywords[4].score	0.464958518743515
keywords[4].display_name	Discrete mathematics
keywords[5].id	https://openalex.org/keywords/planar-graph
keywords[5].score	0.41453057527542114
keywords[5].display_name	Planar graph
keywords[6].id	https://openalex.org/keywords/graph
keywords[6].score	0.3507397174835205
keywords[6].display_name	Graph
language	en
locations[0].id	doi:10.1016/j.tcs.2023.113689
locations[0].is_oa	True
locations[0].source.id	https://openalex.org/S90727058
locations[0].source.issn	0304-3975, 1879-2294
locations[0].source.type	journal
locations[0].source.is_oa	False
locations[0].source.issn_l	0304-3975
locations[0].source.is_core	True
locations[0].source.is_in_doaj	False
locations[0].source.display_name	Theoretical Computer Science
locations[0].source.host_organization	https://openalex.org/P4310320990
locations[0].source.host_organization_name	Elsevier BV
locations[0].source.host_organization_lineage	https://openalex.org/P4310320990
locations[0].source.host_organization_lineage_names	Elsevier BV
locations[0].license	cc-by
locations[0].pdf_url
locations[0].version	publishedVersion
locations[0].raw_type	journal-article
locations[0].license_id	https://openalex.org/licenses/cc-by
locations[0].is_accepted	True
locations[0].is_published	True
locations[0].raw_source_name	Theoretical Computer Science
locations[0].landing_page_url	https://doi.org/10.1016/j.tcs.2023.113689
locations[1].id	pmh:oai:iris.uniroma3.it:11590/433547
locations[1].is_oa	False
locations[1].source.id	https://openalex.org/S4377196120
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	Iris (Roma Tre University)
locations[1].source.host_organization	https://openalex.org/I119003972
locations[1].source.host_organization_name	Roma Tre University
locations[1].source.host_organization_lineage	https://openalex.org/I119003972
locations[1].license
locations[1].pdf_url
locations[1].version	submittedVersion
locations[1].raw_type	info:eu-repo/semantics/article
locations[1].license_id
locations[1].is_accepted	False
locations[1].is_published	False
locations[1].raw_source_name
locations[1].landing_page_url	https://hdl.handle.net/11590/433547
indexed_in	crossref
authorships[0].author.id	https://openalex.org/A5006472576
authorships[0].author.orcid	https://orcid.org/0000-0002-3414-7444
authorships[0].author.display_name	Michael A. Bekos
authorships[0].countries	GR
authorships[0].affiliations[0].institution_ids	https://openalex.org/I194019607
authorships[0].affiliations[0].raw_affiliation_string	Department of Mathematics, University of Ioannina, Ioannina, Greece
authorships[0].institutions[0].id	https://openalex.org/I194019607
authorships[0].institutions[0].ror	https://ror.org/01qg3j183
authorships[0].institutions[0].type	education
authorships[0].institutions[0].lineage	https://openalex.org/I194019607
authorships[0].institutions[0].country_code	GR
authorships[0].institutions[0].display_name	University of Ioannina
authorships[0].author_position	first
authorships[0].raw_author_name	Michael A. Bekos
authorships[0].is_corresponding	False
authorships[0].raw_affiliation_strings	Department of Mathematics, University of Ioannina, Ioannina, Greece
authorships[1].author.id	https://openalex.org/A5006893407
authorships[1].author.orcid	https://orcid.org/0000-0003-2396-5174
authorships[1].author.display_name	Giordano Da Lozzo
authorships[1].countries	IT
authorships[1].affiliations[0].institution_ids	https://openalex.org/I119003972
authorships[1].affiliations[0].raw_affiliation_string	Department of Engineering, Roma Tre University, Italy
authorships[1].institutions[0].id	https://openalex.org/I119003972
authorships[1].institutions[0].ror	https://ror.org/05vf0dg29
authorships[1].institutions[0].type	education
authorships[1].institutions[0].lineage	https://openalex.org/I119003972
authorships[1].institutions[0].country_code	IT
authorships[1].institutions[0].display_name	Roma Tre University
authorships[1].author_position	middle
authorships[1].raw_author_name	Giordano Da Lozzo
authorships[1].is_corresponding	False
authorships[1].raw_affiliation_strings	Department of Engineering, Roma Tre University, Italy
authorships[2].author.id	https://openalex.org/A5025842302
authorships[2].author.orcid	https://orcid.org/0000-0001-5987-8713
authorships[2].author.display_name	Fabrizio Frati
authorships[2].countries	IT
authorships[2].affiliations[0].institution_ids	https://openalex.org/I119003972
authorships[2].affiliations[0].raw_affiliation_string	Department of Engineering, Roma Tre University, Italy
authorships[2].institutions[0].id	https://openalex.org/I119003972
authorships[2].institutions[0].ror	https://ror.org/05vf0dg29
authorships[2].institutions[0].type	education
authorships[2].institutions[0].lineage	https://openalex.org/I119003972
authorships[2].institutions[0].country_code	IT
authorships[2].institutions[0].display_name	Roma Tre University
authorships[2].author_position	middle
authorships[2].raw_author_name	Fabrizio Frati
authorships[2].is_corresponding	True
authorships[2].raw_affiliation_strings	Department of Engineering, Roma Tre University, Italy
authorships[3].author.id	https://openalex.org/A5080178526
authorships[3].author.orcid	https://orcid.org/0000-0003-2565-090X
authorships[3].author.display_name	Martin Gronemann
authorships[3].countries	AT
authorships[3].affiliations[0].institution_ids	https://openalex.org/I145847075
authorships[3].affiliations[0].raw_affiliation_string	Algorithms and Complexity Group, TU Wien, Vienna, Austria
authorships[3].institutions[0].id	https://openalex.org/I145847075
authorships[3].institutions[0].ror	https://ror.org/04d836q62
authorships[3].institutions[0].type	education
authorships[3].institutions[0].lineage	https://openalex.org/I145847075
authorships[3].institutions[0].country_code	AT
authorships[3].institutions[0].display_name	TU Wien
authorships[3].author_position	middle
authorships[3].raw_author_name	Martin Gronemann
authorships[3].is_corresponding	False
authorships[3].raw_affiliation_strings	Algorithms and Complexity Group, TU Wien, Vienna, Austria
authorships[4].author.id	https://openalex.org/A5037539653
authorships[4].author.orcid	https://orcid.org/0000-0001-6249-3419
authorships[4].author.display_name	Tamara Mchedlidze
authorships[4].countries	NL
authorships[4].affiliations[0].institution_ids	https://openalex.org/I193662353
authorships[4].affiliations[0].raw_affiliation_string	Department of Computer Science, Utrecht University, Utrecht, the Netherlands
authorships[4].institutions[0].id	https://openalex.org/I193662353
authorships[4].institutions[0].ror	https://ror.org/04pp8hn57
authorships[4].institutions[0].type	education
authorships[4].institutions[0].lineage	https://openalex.org/I193662353
authorships[4].institutions[0].country_code	NL
authorships[4].institutions[0].display_name	Utrecht University
authorships[4].author_position	middle
authorships[4].raw_author_name	Tamara Mchedlidze
authorships[4].is_corresponding	False
authorships[4].raw_affiliation_strings	Department of Computer Science, Utrecht University, Utrecht, the Netherlands
authorships[5].author.id	https://openalex.org/A5056184296
authorships[5].author.orcid	https://orcid.org/0000-0001-6457-516X
authorships[5].author.display_name	Chrysanthi N. Raftopoulou
authorships[5].countries	GR
authorships[5].affiliations[0].institution_ids	https://openalex.org/I174458059
authorships[5].affiliations[0].raw_affiliation_string	School of Applied Mathematical & Physical Sciences, NTUA, Athens, Greece
authorships[5].institutions[0].id	https://openalex.org/I174458059
authorships[5].institutions[0].ror	https://ror.org/03cx6bg69
authorships[5].institutions[0].type	education
authorships[5].institutions[0].lineage	https://openalex.org/I174458059
authorships[5].institutions[0].country_code	GR
authorships[5].institutions[0].display_name	National Technical University of Athens
authorships[5].author_position	last
authorships[5].raw_author_name	Chrysanthi N. Raftopoulou
authorships[5].is_corresponding	False
authorships[5].raw_affiliation_strings	School of Applied Mathematical & Physical Sciences, NTUA, Athens, Greece
has_content.pdf	False
has_content.grobid_xml	False
is_paratext	False
open_access.is_oa	True
open_access.oa_url	https://doi.org/10.1016/j.tcs.2023.113689
open_access.oa_status	hybrid
open_access.any_repository_has_fulltext	False
created_date	2025-10-10T00:00:00
display_name	Recognizing DAGs with page-number 2 is NP-complete
has_fulltext	False
is_retracted	False
updated_date	2025-11-06T03:46:38.306776
primary_topic.id	https://openalex.org/T10374
primary_topic.field.id	https://openalex.org/fields/17
primary_topic.field.display_name	Computer Science
primary_topic.score	0.9979000091552734
primary_topic.domain.id	https://openalex.org/domains/3
primary_topic.domain.display_name	Physical Sciences
primary_topic.subfield.id	https://openalex.org/subfields/1703
primary_topic.subfield.display_name	Computational Theory and Mathematics
primary_topic.display_name	Advanced Graph Theory Research
related_works	https://openalex.org/W2731094954, https://openalex.org/W2789273959, https://openalex.org/W4302345037, https://openalex.org/W2952978498, https://openalex.org/W2951616510, https://openalex.org/W1606013690, https://openalex.org/W4293743430, https://openalex.org/W3006156235, https://openalex.org/W4297794376, https://openalex.org/W2073591271
cited_by_count	6
counts_by_year[0].year	2024
counts_by_year[0].cited_by_count	1
counts_by_year[1].year	2023
counts_by_year[1].cited_by_count	4
counts_by_year[2].year	2022
counts_by_year[2].cited_by_count	1
locations_count	2
best_oa_location.id	doi:10.1016/j.tcs.2023.113689
best_oa_location.is_oa	True
best_oa_location.source.id	https://openalex.org/S90727058
best_oa_location.source.issn	0304-3975, 1879-2294
best_oa_location.source.type	journal
best_oa_location.source.is_oa	False
best_oa_location.source.issn_l	0304-3975
best_oa_location.source.is_core	True
best_oa_location.source.is_in_doaj	False
best_oa_location.source.display_name	Theoretical Computer Science
best_oa_location.source.host_organization	https://openalex.org/P4310320990
best_oa_location.source.host_organization_name	Elsevier BV
best_oa_location.source.host_organization_lineage	https://openalex.org/P4310320990
best_oa_location.source.host_organization_lineage_names	Elsevier BV
best_oa_location.license	cc-by
best_oa_location.pdf_url
best_oa_location.version	publishedVersion
best_oa_location.raw_type	journal-article
best_oa_location.license_id	https://openalex.org/licenses/cc-by
best_oa_location.is_accepted	True
best_oa_location.is_published	True
best_oa_location.raw_source_name	Theoretical Computer Science
best_oa_location.landing_page_url	https://doi.org/10.1016/j.tcs.2023.113689
primary_location.id	doi:10.1016/j.tcs.2023.113689
primary_location.is_oa	True
primary_location.source.id	https://openalex.org/S90727058
primary_location.source.issn	0304-3975, 1879-2294
primary_location.source.type	journal
primary_location.source.is_oa	False
primary_location.source.issn_l	0304-3975
primary_location.source.is_core	True
primary_location.source.is_in_doaj	False
primary_location.source.display_name	Theoretical Computer Science
primary_location.source.host_organization	https://openalex.org/P4310320990
primary_location.source.host_organization_name	Elsevier BV
primary_location.source.host_organization_lineage	https://openalex.org/P4310320990
primary_location.source.host_organization_lineage_names	Elsevier BV
primary_location.license	cc-by
primary_location.pdf_url
primary_location.version	publishedVersion
primary_location.raw_type	journal-article
primary_location.license_id	https://openalex.org/licenses/cc-by
primary_location.is_accepted	True
primary_location.is_published	True
primary_location.raw_source_name	Theoretical Computer Science
primary_location.landing_page_url	https://doi.org/10.1016/j.tcs.2023.113689
publication_date	2023-01-11
publication_year	2023
referenced_works	https://openalex.org/W6632723973, https://openalex.org/W2100223096, https://openalex.org/W6776173703, https://openalex.org/W2115754974, https://openalex.org/W4312002273, https://openalex.org/W6760960337, https://openalex.org/W2029841189, https://openalex.org/W2002906478, https://openalex.org/W2023293538, https://openalex.org/W2147560631, https://openalex.org/W2116216196, https://openalex.org/W1989142182, https://openalex.org/W2995965358, https://openalex.org/W6629186060, https://openalex.org/W4232763292, https://openalex.org/W2008003769, https://openalex.org/W1999897678, https://openalex.org/W6768303161, https://openalex.org/W6798397475, https://openalex.org/W4288073110, https://openalex.org/W2058177791, https://openalex.org/W6683697071, https://openalex.org/W2089581134, https://openalex.org/W6608076508, https://openalex.org/W2068287758, https://openalex.org/W6641012541, https://openalex.org/W2119115989, https://openalex.org/W3033382536, https://openalex.org/W3099097085, https://openalex.org/W3090082925
referenced_works_count	30
abstract_inverted_index.2	60
abstract_inverted_index.3	100
abstract_inverted_index.6	71
abstract_inverted_index.a	3, 20, 24
abstract_inverted_index.k	14, 93, 98
abstract_inverted_index.(a	7
abstract_inverted_index.In	47, 106, 119
abstract_inverted_index.NP	62
abstract_inverted_index.by	86
abstract_inverted_index.et	80, 102
abstract_inverted_index.in	116
abstract_inverted_index.is	11, 61, 72, 94
abstract_inverted_index.no	31
abstract_inverted_index.of	2, 26, 34, 56
abstract_inverted_index.we	109
abstract_inverted_index.All	135
abstract_inverted_index.DAG	18
abstract_inverted_index.The	0
abstract_inverted_index.al.	81, 103
abstract_inverted_index.and	23, 50, 64, 75, 113, 129
abstract_inverted_index.for	9, 15, 96, 126
abstract_inverted_index.has	19
abstract_inverted_index.its	27
abstract_inverted_index.our	121
abstract_inverted_index.the	12, 17, 35, 44, 54, 117
abstract_inverted_index.two	32
abstract_inverted_index.2023	132
abstract_inverted_index.B.V.	134
abstract_inverted_index.DAG,	8
abstract_inverted_index.DAGs	57, 68, 90
abstract_inverted_index.even	125
abstract_inverted_index.have	40
abstract_inverted_index.same	36
abstract_inverted_index.such	29
abstract_inverted_index.that	30, 53, 66, 88
abstract_inverted_index.this	84, 107
abstract_inverted_index.with	58, 69, 91
abstract_inverted_index.>=	99
abstract_inverted_index.1999,	48
abstract_inverted_index.Heath	49, 112
abstract_inverted_index.[6]).	105
abstract_inverted_index.along	43
abstract_inverted_index.color	37
abstract_inverted_index.edges	28, 33
abstract_inverted_index.every	97
abstract_inverted_index.graph	6
abstract_inverted_index.holds	124
abstract_inverted_index.i.e.,	39
abstract_inverted_index.order	22
abstract_inverted_index.which	16
abstract_inverted_index.(1999)	77
abstract_inverted_index.(2019)	104
abstract_inverted_index.(Heath	74
abstract_inverted_index.[15]).	78
abstract_inverted_index.cross,	38
abstract_inverted_index.graphs	128
abstract_inverted_index.order.	46
abstract_inverted_index.paper,	108
abstract_inverted_index.planar	130
abstract_inverted_index.proved	65
abstract_inverted_index.result	85, 123
abstract_inverted_index.rights	136
abstract_inverted_index.short)	10
abstract_inverted_index.Binucci	79
abstract_inverted_index.acyclic	5
abstract_inverted_index.finally	110
abstract_inverted_index.minimum	13
abstract_inverted_index.proving	87
abstract_inverted_index.resolve	111
abstract_inverted_index.(Binucci	101
abstract_inverted_index.Elsevier	133
abstract_inverted_index.directed	4
abstract_inverted_index.recently	82
abstract_inverted_index.-complete	63
abstract_inverted_index.Pemmaraju	51, 76
abstract_inverted_index.endpoints	42
abstract_inverted_index.reserved.	137
abstract_inverted_index.st-planar	127
abstract_inverted_index.conjecture	115
abstract_inverted_index.k-coloring	25
abstract_inverted_index.posets.(c)	131
abstract_inverted_index.NP-complete	73
abstract_inverted_index.Pemmaraju's	114
abstract_inverted_index.alternating	41
abstract_inverted_index.conjectured	52
abstract_inverted_index.page-number	1, 59, 70, 92
abstract_inverted_index.particular,	120
abstract_inverted_index.recognition	55
abstract_inverted_index.recognizing	67, 89
abstract_inverted_index.topological	21, 45
abstract_inverted_index.NP-complete,	95
abstract_inverted_index.affirmative.	118
abstract_inverted_index.strengthened	83
abstract_inverted_index.NP-completeness	122
cited_by_percentile_year.max	97
cited_by_percentile_year.min	89
corresponding_author_ids	https://openalex.org/A5025842302
countries_distinct_count	4
institutions_distinct_count	6
corresponding_institution_ids	https://openalex.org/I119003972
sustainable_development_goals[0].id	https://metadata.un.org/sdg/15
sustainable_development_goals[0].score	0.5899999737739563
sustainable_development_goals[0].display_name	Life in Land
citation_normalized_percentile.value	0.80852601
citation_normalized_percentile.is_in_top_1_percent	False
citation_normalized_percentile.is_in_top_10_percent	False