On the public citation graph

Basic metric geometry of the bottleneck distance

0 signed · 24 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01895833openalex-snapshot
On asymptotic cones and quasi-isometry classes of fundamental groups of 3-manifolds
inferredcites →https://doi.org/10.1007/s00454-004-1146-yopenalex-snapshot
Computing Persistent Homology
inferredcites →https://doi.org/10.1007/s00454-006-1276-5openalex-snapshot
Stability of Persistence Diagrams
inferredcites →https://doi.org/10.1007/s00454-014-9604-7openalex-snapshot
Fréchet Means for Distributions of Persistence Diagrams
inferredcites →https://doi.org/10.1007/s00454-021-00298-0openalex-snapshot
On the Stability of Interval Decomposable Persistence Modules
inferredcites →https://doi.org/10.1007/s00454-022-00383-yopenalex-snapshot
On Rectangle-Decomposable 2-Parameter Persistence Modules
inferredcites →https://doi.org/10.1007/s10208-010-9060-6openalex-snapshot
Lipschitz Functions Have L p -Stable Persistence
inferredcites →https://doi.org/10.1007/s41468-017-0003-zopenalex-snapshot
Numeric invariants from multidimensional persistence
inferredcites →https://doi.org/10.1007/s41468-018-0022-4openalex-snapshot
Topological spaces of persistence modules and their properties
inferredcites →https://doi.org/10.1007/s41468-020-00061-zopenalex-snapshot
Understanding the Topology and the Geometry of the Space of Persistence Diagrams via Optimal Partial Transport
inferredcites →https://doi.org/10.1007/s41468-022-00091-9openalex-snapshot
Virtual persistence diagrams, signed measures, Wasserstein distances, and Banach spaces
inferredcites →https://doi.org/10.1016/j.comgeo.2022.101879openalex-snapshot
On interval decomposability of 2D persistence modules
inferredcites →https://doi.org/10.1016/j.comgeo.2022.101882openalex-snapshot
Universality of persistence diagrams and the bottleneck and Wasserstein distances
inferredcites →https://doi.org/10.1017/9781108975704openalex-snapshot
Topological Data Analysis with Applications
inferredcites →https://doi.org/10.1088/0266-5611/27/12/124007openalex-snapshot
Probability measures on the space of persistence diagrams
inferredcites →https://doi.org/10.1090/gsm/033openalex-snapshot
A Course in Metric Geometry
inferredcites →https://doi.org/10.1090/gsm/220openalex-snapshot
Ultrafilters Throughout Mathematics
inferredcites →https://doi.org/10.1090/surv/209openalex-snapshot
Persistence Theory: From Quiver Representations to Data Analysis

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4683585openalex-extracted
inferred← citeshttps://doi.org/10.1007/s10208-024-09679-2openalex-snapshot
Grounded Persistent Path Homology: A Stable, Topological Descriptor for Weighted Digraphs
inferred← citeshttps://doi.org/10.1007/s12220-024-01821-4openalex-snapshot
On the Reach of Isometric Embeddings into Wasserstein Type Spaces
inferred← citeshttps://doi.org/10.1007/s41468-024-00189-2openalex-snapshot
Metric geometry of spaces of persistence diagrams
inferred← citeshttps://doi.org/10.1016/j.patcog.2024.111048openalex-snapshot
Federated Incremental Learning algorithm based on Topological Data Analysis
inferred← citeshttps://doi.org/10.1109/tfuzz.2025.3633781openalex-snapshot
Clustering Based on Transitive Closure of Distance Functions
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.