Pilot corpus: NIH-funded biomedical datasets. Any DOI can be scored on demand — network effects sharpen as coverage grows.

The Reeb Graph Edit Distance is Universal

Foundations of Computational Mathematics(2020)10.1007/s10208-020-09488-3Source: DataRank Database

The Reeb Graph Edit Distance is Universal is a research paper published in Foundations of Computational Mathematics (2020). On theSindex it has a DataRank of 0. It has been cited 15 times.

N/A

0DataRank · unranked

Scored on demand from live citation data

Open Access15 citations

Download PDF

Cite:

Linked data & code

DataRank reads this dataset's downstream impact straight off the citation graph — no black box, no proprietary weighting. How is this computed?

›Methodology & internals

datarank_citation_only_1hop_v6· scope data_onlyMethodology

Pipeline:MetadataData-paper checkEnrichmentCitation networkScoring

Enrichment:Funding (4 grants)Impact (FWCI 0.51)OA: hybridTopics (30)Linked Datasets (3)DataCite Reuse (3)IDs (PubMed, OpenAlex)

FAIR Checklist

Context only (not used in score)

Findable (2/2)

Has DOI
Indexed in repositories

Accessible (1/2)

Open Access

Interoperable (2/2)

DataCite relations
Linked datasets

Reusable (0/3)

FAIR checklist signals are shown for context only and do not affect DataRank scoring.

Run a calibrated FAIR evaluation for this paper →

We only score data papers we can read in full — never from an abstract alone.

Authors (3)

Claudia Landi,Facundo Mémoli,Ulrich Bauer

Live enrichment

PubMed:21097893 OpenAlex:https://openalex.org/W2781831736

National Science Foundation

Grant: 1740761

TRIPODS: Topology, Geometry, and Data Analysis (TGDA@OSU):Discovering Structure, Shape, and Dynamics in Data

National Science Foundation

Grant: 1723003

Collaborative Research: The Topology of Functional Data on Random Metric Spaces, Graphs, and Graphons

National Science Foundation

Grant: 1901360

RI: Medium:Collaborative Research: Through synapses to spatial learning: a topological approach

Deutsche Forschungsgemeinschaft

Grant: 195170736/TRR 109

Discretization in Geometry and Dynamics

FWCI

0.51

Citation Percentile

0.7%

Citation Trend

2021

2022

2023

2024

2025

hybridLicense: cc-by

journalhttps://link.springer.com/content/pdf/10.1007/s10208-020-09488-3.pdf

publisherhttps://link.springer.com/content/pdf/10.1007/s10208-020-09488-3.pdf

publisherhttps://link.springer.com/article/10.1007/s10208-020-09488-3/fulltext.html

journalhttps://doi.org/10.1007/s10208-020-09488-3

repositoryhttp://arxiv.org/abs/1801.01866

Fields of Study

Topological and Geometric Data AnalysisAdvanced Graph Neural NetworksGraph Theory and Algorithms0102 computer and information sciences01 natural sciences

Keywords

Infimum and supremumPiecewise linear functionUpper and lower boundsGraphPiecewiseNorm (philosophy)Computational Geometry (cs.CG)FOS: Computer and information sciencesquotient metricGeometric Topology (math.GT)edit distancestabilityReeb graphs, Stability, Quotient metric, Edit distancePersistent homology and applications, topological data analysisReeb graphs004Planar graphs; geometric and topological aspects of graph theoryMathematics - Geometric TopologyMetric spaces, metrizabilityFOS: MathematicsComputer Science - Computational GeometryAlgebraic Topology (math.AT)Mathematics - Algebraic Topologyinterleaving distancetopological descriptors

The Universal 𝓁^p-Metric on Merge Trees

10.4230/lipics.socg.2022.24Schloss Dagstuhl – Leibniz-Zentrum für Informatik

Quasi-Universality of Reeb Graph Distances

10.4230/lipics.socg.2022.14Schloss Dagstuhl – Leibniz-Zentrum für Informatik

The Reeb Graph Edit Distance is Universal

10.48550/arxiv.1801.01866arXiv