A Facial Reduction Approach for the Single Source Localization Problem Article Swipe
The single source localization problem (SSLP) appears in several fields such as signal processing and global positioning systems. The optimization problem of SSLP is nonconvex and difficult to find its globally optima solution. It can be reformulated as a rank constrained Euclidean distance matrix (EDM) completion problem with a number of equality constraints. In this paper, we propose a facial reduction approach to solve such an EDM completion problem. For the constraints of fixed distances between sensors, we reduce them to a face of the EDM cone and derive the closed formulation of the face. We prove constraint nondegeneracy for each feasible point of the resulting EDM optimization problem without a rank constraint, which guarantees the quadratic convergence of semismooth Newton's method. To tackle the nonconvex rank constraint, we apply the majorized penalty approach developed by Zhou et al. (IEEE Trans Signal Process 66(3):4331-4346, 2018). Numerical results verify the fast speed of the proposed approach while giving comparable quality of solutions as other methods.
Related Topics
Concepts
Reduction (mathematics)
Constraint (computer-aided design)
Mathematical optimization
Face (sociological concept)
Optimization problem
Rank (graph theory)
Convergence (economics)
Euclidean distance
Computer science
Constrained optimization problem
Constrained optimization
Mathematics
Artificial intelligence
Economic growth
Combinatorics
Geometry
Sociology
Social science
Economics
Metadata
- Type
- preprint
- Language
- en
- Landing Page
- http://arxiv.org/abs/2110.00757
- https://arxiv.org/pdf/2110.00757
- OA Status
- green
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W4307770636
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4307770636Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.48550/arxiv.2110.00757Digital Object Identifier
- Title
-
A Facial Reduction Approach for the Single Source Localization ProblemWork title
- Type
-
preprintOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2021Year of publication
- Publication date
-
2021-10-02Full publication date if available
- Authors
-
S. He, Qingna LiList of authors in order
- Landing page
-
https://arxiv.org/abs/2110.00757Publisher landing page
- PDF URL
-
https://arxiv.org/pdf/2110.00757Direct link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
greenOpen access status per OpenAlex
- OA URL
-
https://arxiv.org/pdf/2110.00757Direct OA link when available
- Concepts
-
Reduction (mathematics), Constraint (computer-aided design), Mathematical optimization, Face (sociological concept), Optimization problem, Rank (graph theory), Convergence (economics), Euclidean distance, Computer science, Constrained optimization problem, Constrained optimization, Mathematics, Artificial intelligence, Economic growth, Combinatorics, Geometry, Sociology, Social science, EconomicsTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
0Total citation count in OpenAlex
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W4307770636 |
|---|---|
| doi | https://doi.org/10.48550/arxiv.2110.00757 |
| ids.doi | https://doi.org/10.48550/arxiv.2110.00757 |
| ids.openalex | https://openalex.org/W4307770636 |
| fwci | |
| type | preprint |
| title | A Facial Reduction Approach for the Single Source Localization Problem |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | |
| biblio.first_page | |
| topics[0].id | https://openalex.org/T10500 |
| topics[0].field.id | https://openalex.org/fields/22 |
| topics[0].field.display_name | Engineering |
| topics[0].score | 0.9995999932289124 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/2206 |
| topics[0].subfield.display_name | Computational Mechanics |
| topics[0].display_name | Sparse and Compressive Sensing Techniques |
| topics[1].id | https://openalex.org/T10326 |
| topics[1].field.id | https://openalex.org/fields/22 |
| topics[1].field.display_name | Engineering |
| topics[1].score | 0.9991000294685364 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/2208 |
| topics[1].subfield.display_name | Electrical and Electronic Engineering |
| topics[1].display_name | Indoor and Outdoor Localization Technologies |
| topics[2].id | https://openalex.org/T12879 |
| topics[2].field.id | https://openalex.org/fields/17 |
| topics[2].field.display_name | Computer Science |
| topics[2].score | 0.991100013256073 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/1705 |
| topics[2].subfield.display_name | Computer Networks and Communications |
| topics[2].display_name | Distributed Sensor Networks and Detection Algorithms |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C111335779 |
| concepts[0].level | 2 |
| concepts[0].score | 0.702384352684021 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q3454686 |
| concepts[0].display_name | Reduction (mathematics) |
| concepts[1].id | https://openalex.org/C2776036281 |
| concepts[1].level | 2 |
| concepts[1].score | 0.6654289960861206 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q48769818 |
| concepts[1].display_name | Constraint (computer-aided design) |
| concepts[2].id | https://openalex.org/C126255220 |
| concepts[2].level | 1 |
| concepts[2].score | 0.6504408121109009 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q141495 |
| concepts[2].display_name | Mathematical optimization |
| concepts[3].id | https://openalex.org/C2779304628 |
| concepts[3].level | 2 |
| concepts[3].score | 0.5960568189620972 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q3503480 |
| concepts[3].display_name | Face (sociological concept) |
| concepts[4].id | https://openalex.org/C137836250 |
| concepts[4].level | 2 |
| concepts[4].score | 0.546881377696991 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q984063 |
| concepts[4].display_name | Optimization problem |
| concepts[5].id | https://openalex.org/C164226766 |
| concepts[5].level | 2 |
| concepts[5].score | 0.5451814532279968 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q7293202 |
| concepts[5].display_name | Rank (graph theory) |
| concepts[6].id | https://openalex.org/C2777303404 |
| concepts[6].level | 2 |
| concepts[6].score | 0.5422611236572266 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q759757 |
| concepts[6].display_name | Convergence (economics) |
| concepts[7].id | https://openalex.org/C120174047 |
| concepts[7].level | 2 |
| concepts[7].score | 0.5329360365867615 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q847073 |
| concepts[7].display_name | Euclidean distance |
| concepts[8].id | https://openalex.org/C41008148 |
| concepts[8].level | 0 |
| concepts[8].score | 0.4466778635978699 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[8].display_name | Computer science |
| concepts[9].id | https://openalex.org/C2989514635 |
| concepts[9].level | 3 |
| concepts[9].score | 0.41898036003112793 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q5164377 |
| concepts[9].display_name | Constrained optimization problem |
| concepts[10].id | https://openalex.org/C55660270 |
| concepts[10].level | 2 |
| concepts[10].score | 0.41849127411842346 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q5164377 |
| concepts[10].display_name | Constrained optimization |
| concepts[11].id | https://openalex.org/C33923547 |
| concepts[11].level | 0 |
| concepts[11].score | 0.40865352749824524 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[11].display_name | Mathematics |
| concepts[12].id | https://openalex.org/C154945302 |
| concepts[12].level | 1 |
| concepts[12].score | 0.15670284628868103 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q11660 |
| concepts[12].display_name | Artificial intelligence |
| concepts[13].id | https://openalex.org/C50522688 |
| concepts[13].level | 1 |
| concepts[13].score | 0.0 |
| concepts[13].wikidata | https://www.wikidata.org/wiki/Q189833 |
| concepts[13].display_name | Economic growth |
| concepts[14].id | https://openalex.org/C114614502 |
| concepts[14].level | 1 |
| concepts[14].score | 0.0 |
| concepts[14].wikidata | https://www.wikidata.org/wiki/Q76592 |
| concepts[14].display_name | Combinatorics |
| concepts[15].id | https://openalex.org/C2524010 |
| concepts[15].level | 1 |
| concepts[15].score | 0.0 |
| concepts[15].wikidata | https://www.wikidata.org/wiki/Q8087 |
| concepts[15].display_name | Geometry |
| concepts[16].id | https://openalex.org/C144024400 |
| concepts[16].level | 0 |
| concepts[16].score | 0.0 |
| concepts[16].wikidata | https://www.wikidata.org/wiki/Q21201 |
| concepts[16].display_name | Sociology |
| concepts[17].id | https://openalex.org/C36289849 |
| concepts[17].level | 1 |
| concepts[17].score | 0.0 |
| concepts[17].wikidata | https://www.wikidata.org/wiki/Q34749 |
| concepts[17].display_name | Social science |
| concepts[18].id | https://openalex.org/C162324750 |
| concepts[18].level | 0 |
| concepts[18].score | 0.0 |
| concepts[18].wikidata | https://www.wikidata.org/wiki/Q8134 |
| concepts[18].display_name | Economics |
| keywords[0].id | https://openalex.org/keywords/reduction |
| keywords[0].score | 0.702384352684021 |
| keywords[0].display_name | Reduction (mathematics) |
| keywords[1].id | https://openalex.org/keywords/constraint |
| keywords[1].score | 0.6654289960861206 |
| keywords[1].display_name | Constraint (computer-aided design) |
| keywords[2].id | https://openalex.org/keywords/mathematical-optimization |
| keywords[2].score | 0.6504408121109009 |
| keywords[2].display_name | Mathematical optimization |
| keywords[3].id | https://openalex.org/keywords/face |
| keywords[3].score | 0.5960568189620972 |
| keywords[3].display_name | Face (sociological concept) |
| keywords[4].id | https://openalex.org/keywords/optimization-problem |
| keywords[4].score | 0.546881377696991 |
| keywords[4].display_name | Optimization problem |
| keywords[5].id | https://openalex.org/keywords/rank |
| keywords[5].score | 0.5451814532279968 |
| keywords[5].display_name | Rank (graph theory) |
| keywords[6].id | https://openalex.org/keywords/convergence |
| keywords[6].score | 0.5422611236572266 |
| keywords[6].display_name | Convergence (economics) |
| keywords[7].id | https://openalex.org/keywords/euclidean-distance |
| keywords[7].score | 0.5329360365867615 |
| keywords[7].display_name | Euclidean distance |
| keywords[8].id | https://openalex.org/keywords/computer-science |
| keywords[8].score | 0.4466778635978699 |
| keywords[8].display_name | Computer science |
| keywords[9].id | https://openalex.org/keywords/constrained-optimization-problem |
| keywords[9].score | 0.41898036003112793 |
| keywords[9].display_name | Constrained optimization problem |
| keywords[10].id | https://openalex.org/keywords/constrained-optimization |
| keywords[10].score | 0.41849127411842346 |
| keywords[10].display_name | Constrained optimization |
| keywords[11].id | https://openalex.org/keywords/mathematics |
| keywords[11].score | 0.40865352749824524 |
| keywords[11].display_name | Mathematics |
| keywords[12].id | https://openalex.org/keywords/artificial-intelligence |
| keywords[12].score | 0.15670284628868103 |
| keywords[12].display_name | Artificial intelligence |
| language | en |
| locations[0].id | pmh:oai:arXiv.org:2110.00757 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4306400194 |
| locations[0].source.issn | |
| locations[0].source.type | repository |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | |
| locations[0].source.is_core | False |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | arXiv (Cornell University) |
| locations[0].source.host_organization | https://openalex.org/I205783295 |
| locations[0].source.host_organization_name | Cornell University |
| locations[0].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[0].license | |
| locations[0].pdf_url | https://arxiv.org/pdf/2110.00757 |
| locations[0].version | submittedVersion |
| locations[0].raw_type | text |
| locations[0].license_id | |
| locations[0].is_accepted | False |
| locations[0].is_published | False |
| locations[0].raw_source_name | |
| locations[0].landing_page_url | http://arxiv.org/abs/2110.00757 |
| locations[1].id | doi:10.48550/arxiv.2110.00757 |
| locations[1].is_oa | True |
| locations[1].source.id | https://openalex.org/S4306400194 |
| locations[1].source.issn | |
| locations[1].source.type | repository |
| locations[1].source.is_oa | True |
| locations[1].source.issn_l | |
| locations[1].source.is_core | False |
| locations[1].source.is_in_doaj | False |
| locations[1].source.display_name | arXiv (Cornell University) |
| locations[1].source.host_organization | https://openalex.org/I205783295 |
| locations[1].source.host_organization_name | Cornell University |
| locations[1].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[1].license | |
| locations[1].pdf_url | |
| locations[1].version | |
| locations[1].raw_type | article |
| locations[1].license_id | |
| locations[1].is_accepted | False |
| locations[1].is_published | |
| locations[1].raw_source_name | |
| locations[1].landing_page_url | https://doi.org/10.48550/arxiv.2110.00757 |
| indexed_in | arxiv, datacite |
| authorships[0].author.id | https://openalex.org/A5076721719 |
| authorships[0].author.orcid | https://orcid.org/0000-0002-2747-9264 |
| authorships[0].author.display_name | S. He |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Shi, He |
| authorships[0].is_corresponding | False |
| authorships[1].author.id | https://openalex.org/A5077587421 |
| authorships[1].author.orcid | https://orcid.org/0000-0002-1397-6200 |
| authorships[1].author.display_name | Qingna Li |
| authorships[1].author_position | last |
| authorships[1].raw_author_name | Li, Qingna |
| authorships[1].is_corresponding | False |
| has_content.pdf | True |
| has_content.grobid_xml | True |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://arxiv.org/pdf/2110.00757 |
| open_access.oa_status | green |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | A Facial Reduction Approach for the Single Source Localization Problem |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-06T06:51:31.235846 |
| primary_topic.id | https://openalex.org/T10500 |
| primary_topic.field.id | https://openalex.org/fields/22 |
| primary_topic.field.display_name | Engineering |
| primary_topic.score | 0.9995999932289124 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/2206 |
| primary_topic.subfield.display_name | Computational Mechanics |
| primary_topic.display_name | Sparse and Compressive Sensing Techniques |
| related_works | https://openalex.org/W2355999325, https://openalex.org/W3123416417, https://openalex.org/W2357354566, https://openalex.org/W2000609527, https://openalex.org/W2170850735, https://openalex.org/W23263483, https://openalex.org/W4392186863, https://openalex.org/W2013387628, https://openalex.org/W2387917237, https://openalex.org/W2112661711 |
| cited_by_count | 0 |
| locations_count | 2 |
| best_oa_location.id | pmh:oai:arXiv.org:2110.00757 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4306400194 |
| best_oa_location.source.issn | |
| best_oa_location.source.type | repository |
| best_oa_location.source.is_oa | True |
| 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 | arXiv (Cornell University) |
| best_oa_location.source.host_organization | https://openalex.org/I205783295 |
| best_oa_location.source.host_organization_name | Cornell University |
| best_oa_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| best_oa_location.license | |
| best_oa_location.pdf_url | https://arxiv.org/pdf/2110.00757 |
| best_oa_location.version | submittedVersion |
| best_oa_location.raw_type | text |
| best_oa_location.license_id | |
| best_oa_location.is_accepted | False |
| best_oa_location.is_published | False |
| best_oa_location.raw_source_name | |
| best_oa_location.landing_page_url | http://arxiv.org/abs/2110.00757 |
| primary_location.id | pmh:oai:arXiv.org:2110.00757 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4306400194 |
| primary_location.source.issn | |
| primary_location.source.type | repository |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | |
| primary_location.source.is_core | False |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | arXiv (Cornell University) |
| primary_location.source.host_organization | https://openalex.org/I205783295 |
| primary_location.source.host_organization_name | Cornell University |
| primary_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| primary_location.license | |
| primary_location.pdf_url | https://arxiv.org/pdf/2110.00757 |
| primary_location.version | submittedVersion |
| primary_location.raw_type | text |
| primary_location.license_id | |
| primary_location.is_accepted | False |
| primary_location.is_published | False |
| primary_location.raw_source_name | |
| primary_location.landing_page_url | http://arxiv.org/abs/2110.00757 |
| publication_date | 2021-10-02 |
| publication_year | 2021 |
| referenced_works_count | 0 |
| abstract_inverted_index.a | 38, 48, 58, 81, 110 |
| abstract_inverted_index.In | 53 |
| abstract_inverted_index.It | 33 |
| abstract_inverted_index.To | 122 |
| abstract_inverted_index.We | 95 |
| abstract_inverted_index.an | 65 |
| abstract_inverted_index.as | 11, 37, 161 |
| abstract_inverted_index.be | 35 |
| abstract_inverted_index.by | 135 |
| abstract_inverted_index.et | 137 |
| abstract_inverted_index.in | 7 |
| abstract_inverted_index.is | 23 |
| abstract_inverted_index.of | 21, 50, 72, 83, 92, 103, 118, 151, 159 |
| abstract_inverted_index.to | 27, 62, 80 |
| abstract_inverted_index.we | 56, 77, 128 |
| abstract_inverted_index.EDM | 66, 85, 106 |
| abstract_inverted_index.For | 69 |
| abstract_inverted_index.The | 0, 18 |
| abstract_inverted_index.al. | 138 |
| abstract_inverted_index.and | 14, 25, 87 |
| abstract_inverted_index.can | 34 |
| abstract_inverted_index.for | 99 |
| abstract_inverted_index.its | 29 |
| abstract_inverted_index.the | 70, 84, 89, 93, 104, 115, 124, 130, 148, 152 |
| abstract_inverted_index.SSLP | 22 |
| abstract_inverted_index.Zhou | 136 |
| abstract_inverted_index.cone | 86 |
| abstract_inverted_index.each | 100 |
| abstract_inverted_index.face | 82 |
| abstract_inverted_index.fast | 149 |
| abstract_inverted_index.find | 28 |
| abstract_inverted_index.rank | 39, 111, 126 |
| abstract_inverted_index.such | 10, 64 |
| abstract_inverted_index.them | 79 |
| abstract_inverted_index.this | 54 |
| abstract_inverted_index.with | 47 |
| abstract_inverted_index.(EDM) | 44 |
| abstract_inverted_index.(IEEE | 139 |
| abstract_inverted_index.Trans | 140 |
| abstract_inverted_index.apply | 129 |
| abstract_inverted_index.face. | 94 |
| abstract_inverted_index.fixed | 73 |
| abstract_inverted_index.other | 162 |
| abstract_inverted_index.point | 102 |
| abstract_inverted_index.prove | 96 |
| abstract_inverted_index.solve | 63 |
| abstract_inverted_index.speed | 150 |
| abstract_inverted_index.which | 113 |
| abstract_inverted_index.while | 155 |
| abstract_inverted_index.(SSLP) | 5 |
| abstract_inverted_index.2018). | 144 |
| abstract_inverted_index.Signal | 141 |
| abstract_inverted_index.closed | 90 |
| abstract_inverted_index.derive | 88 |
| abstract_inverted_index.facial | 59 |
| abstract_inverted_index.fields | 9 |
| abstract_inverted_index.giving | 156 |
| abstract_inverted_index.global | 15 |
| abstract_inverted_index.matrix | 43 |
| abstract_inverted_index.number | 49 |
| abstract_inverted_index.optima | 31 |
| abstract_inverted_index.paper, | 55 |
| abstract_inverted_index.reduce | 78 |
| abstract_inverted_index.signal | 12 |
| abstract_inverted_index.single | 1 |
| abstract_inverted_index.source | 2 |
| abstract_inverted_index.tackle | 123 |
| abstract_inverted_index.verify | 147 |
| abstract_inverted_index.Process | 142 |
| abstract_inverted_index.appears | 6 |
| abstract_inverted_index.between | 75 |
| abstract_inverted_index.method. | 121 |
| abstract_inverted_index.penalty | 132 |
| abstract_inverted_index.problem | 4, 20, 46, 108 |
| abstract_inverted_index.propose | 57 |
| abstract_inverted_index.quality | 158 |
| abstract_inverted_index.results | 146 |
| abstract_inverted_index.several | 8 |
| abstract_inverted_index.without | 109 |
| abstract_inverted_index.Newton's | 120 |
| abstract_inverted_index.approach | 61, 133, 154 |
| abstract_inverted_index.distance | 42 |
| abstract_inverted_index.equality | 51 |
| abstract_inverted_index.feasible | 101 |
| abstract_inverted_index.globally | 30 |
| abstract_inverted_index.methods. | 163 |
| abstract_inverted_index.problem. | 68 |
| abstract_inverted_index.proposed | 153 |
| abstract_inverted_index.sensors, | 76 |
| abstract_inverted_index.systems. | 17 |
| abstract_inverted_index.Euclidean | 41 |
| abstract_inverted_index.Numerical | 145 |
| abstract_inverted_index.developed | 134 |
| abstract_inverted_index.difficult | 26 |
| abstract_inverted_index.distances | 74 |
| abstract_inverted_index.majorized | 131 |
| abstract_inverted_index.nonconvex | 24, 125 |
| abstract_inverted_index.quadratic | 116 |
| abstract_inverted_index.reduction | 60 |
| abstract_inverted_index.resulting | 105 |
| abstract_inverted_index.solution. | 32 |
| abstract_inverted_index.solutions | 160 |
| abstract_inverted_index.comparable | 157 |
| abstract_inverted_index.completion | 45, 67 |
| abstract_inverted_index.constraint | 97 |
| abstract_inverted_index.guarantees | 114 |
| abstract_inverted_index.processing | 13 |
| abstract_inverted_index.semismooth | 119 |
| abstract_inverted_index.constrained | 40 |
| abstract_inverted_index.constraint, | 112, 127 |
| abstract_inverted_index.constraints | 71 |
| abstract_inverted_index.convergence | 117 |
| abstract_inverted_index.formulation | 91 |
| abstract_inverted_index.positioning | 16 |
| abstract_inverted_index.constraints. | 52 |
| abstract_inverted_index.localization | 3 |
| abstract_inverted_index.optimization | 19, 107 |
| abstract_inverted_index.reformulated | 36 |
| abstract_inverted_index.nondegeneracy | 98 |
| abstract_inverted_index.66(3):4331-4346, | 143 |
| cited_by_percentile_year | |
| countries_distinct_count | 0 |
| institutions_distinct_count | 2 |
| sustainable_development_goals[0].id | https://metadata.un.org/sdg/16 |
| sustainable_development_goals[0].score | 0.7400000095367432 |
| sustainable_development_goals[0].display_name | Peace, Justice and strong institutions |
| citation_normalized_percentile |