The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Ripser: efficient computation of Vietoris–Rips persistence barcodes
Open accessAbstract
We present an algorithm for the computation of Vietoris–Rips persistence barcodes and describe its implementation in the software Ripser. The method relies on implicit representations of the coboundary operator and the filtration order of the simplices, avoiding the explicit construction and storage of the filtration coboundary matrix. Moreover, it makes use of apparent pairs, a simple but powerful method for constructing a discrete gradient field from a total order on the simplices of a simplicial complex, which is also of independent interest. Our implementation shows substantial improvements over previous software both in time and memory usage.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
On the shortest spanning subtree of a graph and the traveling salesman problem
Kruskal, J. B. (1956) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1956-0078686-7 · Cited by 5,088
Gromov, M. (1987) · Mathematical Sciences Research Institute Publications · doi:10.1007/978-1-4613-9586-7_3 · Cited by 1,817
Topological Persistence and Simplification
Edelsbrunner, Letscher, & Zomorodian (2002) · Discrete & Computational Geometry · doi:10.1007/s00454-002-2885-2 · Cited by 1,779
Zomorodian, A., & Carlsson, G. (2005) · Discrete & Computational Geometry · doi:10.1007/s00454-004-1146-y · Cited by 1,591
Morse Theory for Cell Complexes
Forman, R. (1998) · Advances in Mathematics · doi:10.1006/aima.1997.1650 · Cited by 943
Edelsbrunner, H., & Harer, J. (2009) · American Mathematical Society eBooks · doi:10.1090/mbk/069 · Cited by 820
A roadmap for the computation of persistent homology
Otter, N., Porter, M. A., Tillmann, U., Grindrod, P., & Harrington, H. A. (2017) · EPJ Data Science · doi:10.1140/epjds/s13688-017-0109-5 · Cited by 760
The Structure and Stability of Persistence Modules
Chazal, F., de Silva, V., Glisse, M., & Oudot, S. (2016) · SpringerBriefs in Mathematics · doi:10.1007/978-3-319-42545-0 · Cited by 393
�ber den h�heren Zusammenhang kompakter R�ume und eine Klasse von zusammenhangstreuen Abbildungen
Vietoris, L. (1927) · Mathematische Annalen · doi:10.1007/bf01447877 · Cited by 311
A class of algorithms which require nonlinear time to maintain disjoint sets
Tarjan, R. E. (1979) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(79)90042-4 · Cited by 263
Cited by
Qi, Y., He, Y., Qi, X., Zhang, Y., & Yang, G. (2023) · 2023 IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv51070.2023.00558 · Cited by 617
Toroidal topology of population activity in grid cells
Gardner, R. J., Hermansen, E., Pachitariu, M., Burak, Y., Baas, N. A., Dunn, B. A., Moser, M.-B., & Moser, E. I. (2022) · Nature · doi:10.1038/s41586-021-04268-7 · Cited by 428
The topological properties of the protein universe
Madsen, C. D., Barbensi, A., Zhang, S. Y., Ham, L., David, A., Pires, D. E. V., & Stumpf, M. P. H. (2025) · Nature Communications · doi:10.1038/s41467-025-61108-2 · Cited by 7
(2025) · doi:10.1371/journal.pcbi.1013216 · Cited by 4
Metadata
- Authors
- Bauer, U.
- Venue
- Journal of Applied and Computational Topology
- Published
- 2021-06-17
- Volume
- 5
- Issue
- 3
- Pages
- 391-423
- ISSN
- 2367-1726 (ISSN-L)
- 2367-1734
- OpenAlex
- W2964534207
- Cited by
- 280
- References
- 24
- FWCI
- 17.37
- Type
- journal article
- Language
- en
- Open access
- hybrid
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Ripser: efficient computation of Vietoris–Rips persistence barcodes. https://app.cochat.ai/papers/10.1007/s41468-021-00071-5
- The paper
- Bauer, U. (2021). Ripser: efficient computation of Vietoris–Rips persistence barcodes. Journal of Applied and Computational Topology. https://doi.org/10.1007/s41468-021-00071-5
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.