The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index; none of the 8 sources its claims cite is checked for support yet.
Topological Persistence and Simplification
Open accessOverview
AI snapshot
Written from the paper’s full text.
TL;DR
This paper formalizes topological persistence in a filtration, using the lifetime of homology classes to distinguish features from noise, and gives algorithms to compute persistence and simplify filtrations. It demonstrates the approach on alpha-complex filtrations of molecular and surface data, including separation of a tunnel in Gramicidin A from shorter-lived cycles.
Key findings
- Persistence is defined for Betti numbers and non-bounding cycles by factoring a cycle group at one filtration stage by the boundary group at a later stage; cycles with short lifetimes are treated as topological noise, while longer-lived ones are features.
- The pairing algorithm matches positive \(k\)-simplices with negative \((k+1)\)-simplices; index-based persistence is \(j-i-1\), and the worst-case running time is \(O(m^3)\), with union-find acceleration for \(k=0\) and \(k=2\) giving amortized \(O(A^{-1}(m))\) per operation.
- On five datasets, total persistence timings ranged from 0.06 s for Gramicidin A to 19.93 s for the Buddha dataset with union-find, versus 30.52 s without it; average collision counts and list lengths were small, and conflicts were rare (basic conflicts 0–1, recursive conflicts 0–212 across datasets).
- For Gramicidin A, removing 1-cycles with persistence below 2688 isolated the molecular tunnel from other topological attributes.
Methods
- The work studies finite simplicial complexes in \(\mathbb{R}^3\), especially alpha complexes of Delaunay triangulations, ordered by an age filter induced by growing weighted balls.
- Persistence is formulated algebraically as \(H^{\ell,p}_k = Z^\ell_k / (B^{\ell+p}_k \cap Z^\ell_k)\), and an abstract pairing algorithm uses a hash table and cycle search to pair simplex births with deaths; simplification is performed by reordering simplices via migration, with conflict resolution or diminution.
- Experiments implemented the algorithms with alpha-shapes software on five datasets: three weighted molecular structures and two unweighted macroscopic surfaces; timings were collected on a 266 MHz Pentium II with 128 MB RAM under Solaris 8.
Limitations
- Stated: the detailed analysis of the 1-cycle computation is left open, and the authors ask for a different, more efficient algorithm; worst-case cubic behavior contrasts with observed near-linear timing, and conflicts, though rare, require handling.
- Stated: conflict resolution by subdivision may not correspond to the alpha-complex growth model, while conflict diminution changes when cycles affect Betti numbers.
- Evident from the text: the experimental evidence covers only five datasets and a prototype implementation; time-based persistence is not developed further, and the setting is restricted to \(\mathbb{R}^3\) complexes with \(\mathbb{Z}_2\) coefficients.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
0 of 8 cited sources checked · 0 supported · 0 flagged
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The primary topological feature of this data is a tunnel that runs through the molecule, as shown in Fig. 17.”
§ Discrete & Computational Geometry > Feature Detection.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesThe paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The image of the homomorphism is isomorphic to the p-persistent homology group of K ℓ , im η ℓ, p k H ℓ, p k .”
§ Discrete & Computational Geometry > Algebraic Formulation.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesThe paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Then Z ℓ k ∩ B ℓ+ p-1 k = Z ℓ k ∩ B ℓ+ p k , and hence β ℓ, p k = β ℓ, p-1 k”
§ Discrete & Computational Geometry > Abstract Algorithm.
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesA result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“After accelerating with union-find, the slowest portion of the algorithm is adding 1-cycles.”
§ Discrete & Computational Geometry > Timings.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesThe paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“In other words, increasing p by one shortens the persistence of all nonbounding cycles by one.”
§ Discrete & Computational Geometry > Algebraic Formulation.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesThe paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“k-Triangle Lemma.The number of k-triangles containing (ℓ, p) in the index-persistence plane is β ℓ, p k .”
§ Discrete & Computational Geometry > Abstract Algorithm.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes? Based: unclearA result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“While there is considerable topological noise at p = 0, a simplification process which eliminates 1cycles of persistence less than 2688 succeeds in separating the tunnel from the remaining topological attributes detected by measuring homology.”
§ Discrete & Computational Geometry > Feature Detection.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passes- Rests on an assumption: The Gramicidin A dataset contains the time-averaged molecular dynamics structure of Gramicidin A, a peptide that forms a channel for ion and water movement across lipid membranes.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“We will see in Section 3 that there exists a pairing between positive k-simplices and negative (k + 1)-simplices.”
§ Discrete & Computational Geometry > Incremental Algorithm.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes? Based: unclearThe paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“If follows that β ℓ, p k = β ℓ, p-1 k -1.”
§ Discrete & Computational Geometry > Abstract Algorithm.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesThe paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Monotonicity Lemma.β ℓ, p k ≤ β ℓ , p k whenever p ≤ p and ℓ ≤ ℓ ≤ ℓ + ( pp ).”
§ Discrete & Computational Geometry > Abstract Algorithm.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passes
- Probably not a substantial claim. 16
- It may state two separate claims as one. 24
- The quote only partly states this claim. 1
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The persistence of that k-cycle is one short of the difference between indices, ji -1.”
§ Discrete & Computational Geometry > Abstract Algorithm.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesProbably not a substantial claim.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“We can write each tunnel as a sum of tunnels in a basis, and β 1 is the size of the basis.”
§ Discrete & Computational Geometry > Homology Groups.
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“As before, β 2 is the size of a basis of voids, which is equal to the number of voids.”
§ Discrete & Computational Geometry > Homology Groups.
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“All Betti numbers are non-negative so pos k ≥ neg k+1 for all ℓ.”
§ Discrete & Computational Geometry > Incremental Algorithm.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“All we guarantee is that d is homologous to the sum of cycles represented by the simplices in the list, and that the list contains the youngest simplex in (d), which is σ i as above.”
§ Discrete & Computational Geometry > Data Structure.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Basic and recursive conflicts exist in practice, but are rather rare, as shown in Section 6.”
§ Discrete & Computational Geometry > Conflict Lemma. All conflicts have type (1, 2).
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“For each simplex σ ∈ D, there is a unique birth time α(σ ) defined such that σ ∈ K (α) iff α ≥ α(σ ).”
§ Discrete & Computational Geometry > Age Filters.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesProbably not a substantial claim.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The pairs (su, suv) and (tw, stu) in Fig. 6 constitute a conflict of type (1,2) and show that conflicts do occur, although our experiments in Section 6 suggest that they are rather rare.”
§ Discrete & Computational Geometry > Conflicts.
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The results suggest a possible linear dependence of the running time on the size of the data, which is substantially faster than the cubic dependence proved in Section 4.”
§ Discrete & Computational Geometry > Timings.
Strength:hedged· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Tables 3 and 4 provide evidence that this might indeed be the case.”
§ Discrete & Computational Geometry > Statistics.
Load-bearingStrength:hedged· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one. The quote only partly states this claim.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Furthermore, if σ ∈ K , then all faces of σ are simplices in K .”
§ Discrete & Computational Geometry > Figure 1 illustrates a two-dimensional example of this construction.
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
- The authors state this as an assumption: The point set is in general position, so at most four (three in R^2) Voronoi regions can have a non-empty common intersection.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The incremental algorithm in Section 2 asserts that β ℓ k is the number of k-intervals that contain index ℓ on the axis.”
§ Discrete & Computational Geometry > Abstract Algorithm.
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“We do not show statistics for 0-cycles in Table 4 as every 0-cycle is represented by a list of length 2.”
§ Discrete & Computational Geometry > Statistics.
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✗ Based: failsProbably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Any two simplices in K are either disjoint or they intersect in a common face, which is a simplex of smaller dimension.”
§ Discrete & Computational Geometry > Figure 1 illustrates a two-dimensional example of this construction.
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
- The authors state this as an assumption: The point set is in general position, so at most four (three in R^2) Voronoi regions can have a non-empty common intersection.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“As substantiated in Table 2, this improvement subsumes adding 0-and 2-cycles in the marking process, shrinking the time for these to steps to essentially nothing.”
§ Discrete & Computational Geometry > Timings.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Table 5 shows that the average persistence is considerably larger than the average number of collisions and list length.”
§ Discrete & Computational Geometry > Statistics.
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The total algorithm runs in time at most O( p 2 i ), which is at most O(m 3 ).”
§ Discrete & Computational Geometry > Collision Lemma.
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Our motivation for formulating persistent homology in (3) was to eliminate cycles with low persistence.”
§ Discrete & Computational Geometry > Lazy Migration.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesProbably not a substantial claim.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“There are 4 2 = 6 possible types of conflicts, each identified by the pair (dim σ i , dim σ h ) of the dimensions of the main participants.”
§ Discrete & Computational Geometry > Conflicts.
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The sequence of iso-surfaces obtained by increasing α represents a growth process similar to that represented by a filtration.”
§ Discrete & Computational Geometry > Approach and Results.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✗ Based: failsProbably not a substantial claim. The paper may give no reason why it holds.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“As cx is not a face of abx, we have removed the conflict and preserved the Betti numbers of a refined filtration.”
§ Discrete & Computational Geometry > Conflict Resolution.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“By complementarity and duality, there are no conflicts of types (1, 3) and (2, 3).”
§ Discrete & Computational Geometry > Conflict Lemma. All conflicts have type (1, 2).
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We can explain the apparently linear running time documented in Table 2 by showing that the average number of collisions and the average list length are both constant.”
§ Discrete & Computational Geometry > Statistics.
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The cycle search continues until it finds a collision-free cycle homologous to d, and the Collision Lemma implies that that cycle has the correct youngest positive simplex.”
§ Discrete & Computational Geometry > Collision Lemma.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“A single collision takes time at most O( p i ), and the entire search for σ i takes time at most O( p 2 i ).”
§ Discrete & Computational Geometry > Collision Lemma.
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
In the paper
“Finally, we note that Robins has independently formulated an alternate but equivalent definition of persistence [10].”
§ Discrete & Computational Geometry > Algebraic Formulation.
What the sources say
- Not matchedcites [10] 10. V. Robins. Computing topology at multiple resolutions: foundations and applications to fractals and dynamics. Ph.D. thesis, Department of Applied Mathematics, University of Colorado, June 2000.
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
- Not matched
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The ordering of the new simplices specified by subdivision in Fig. 13 might not have a corresponding set of weighted balls that would generate the filtration under the growth model.”
§ Discrete & Computational Geometry > Conflict Resolution.
Strength:hedged· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✗ Based: failsProbably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
- Rests on an assumption: In alpha complex filtrations, simplices are ordered according to a particular growth model.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Recall that the number of collisions and the length of lists is bounded from above by the persistence of cycles.”
§ Discrete & Computational Geometry > Statistics.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes? Based: unclearIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Specifically, simplices in a filter correspond to critical points of a density function.”
§ Discrete & Computational Geometry > Approach and Results.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✗ Based: failsProbably not a substantial claim. The paper may give no reason why it holds.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Hence, i contains fewer than (k + 2) p i k-simplices, and similarly g contains fewer than (k + 2) p g < (k + 2) p i k-simplices.”
§ Discrete & Computational Geometry > Collision Lemma.
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“For k = 0, each set is the vertex set of a connected component.Each set has exactly one yet unpaired vertex, namely the oldest one in the component.”
§ Discrete & Computational Geometry > Collision Lemma.
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“As a consequence of the formulation, the lifetime of every cycle is reduced regardless of its persistence, leading to the creation of k-triangles.”
§ Discrete & Computational Geometry > Lazy Migration.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes? Based: unclearIt may state two separate claims as one.
In the paper
“The problem of topological simplification was also approached by El-Sana and Varshney [5] using alpha shape inspired ideas of geometric growth.”
§ Discrete & Computational Geometry > Approach and Results.
What the sources say
- Not checked — no full text of the sourcecites [5] 5. J. El-Sana and A. Varshney. Topology simplification for polygonal virtual environments. IEEE Trans. Visual. Comput. Graphics, 4:133-144, 1998. source
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We cannot achieve the same acceleration for 1-cycles using this method, however, as there can be multiple unpaired positive edges at any time.”
§ Discrete & Computational Geometry > Collision Lemma.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The number of collisions is at most the number of positive k-simplices strictly between σ i and σ j , which is less than p i .”
§ Discrete & Computational Geometry > Collision Lemma.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We interpret these intervals as k-intervals of a simplified version of the original filtration.”
§ Discrete & Computational Geometry > 5. Simplification
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesProbably not a substantial claim.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We may resolve a conflict by subdivision.Here, we achieve the correct Betti numbers for a refined complex and its corresponding filtrations.”
§ Discrete & Computational Geometry > Conflict Resolution.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“At the time we move it, the face is already collocated with its matching negative simplex, and the two cancel each other's contributions.”
§ Discrete & Computational Geometry > 5. Simplification
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“A collision happens at T[g] only if σ g already forms a pair, which implies its k-interval [g, h) is contained inside [i, j).”
§ Discrete & Computational Geometry > Collision Lemma.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
The authors state this as an assumption.
The point set is in general position, so at most four (three in R^2) Voronoi regions can have a non-empty common intersection.
“We assume general position, where at most four (three in R 2 ) Voronoi regions can have a non-empty common intersection.”
The paper relies on this without support.
Complexes embedded in three-dimensional Euclidean space have no torsion.
“There is no torsion in complexes embedded in three-dimensional Euclidean space, so the homology groups are vector spaces.”
The paper relies on this without support.
In alpha complex filtrations, simplices are ordered according to a particular growth model.
“For example, in alpha complex filtrations, simplices are ordered according to a particular growth model.”
The paper relies on this without support.
The five data sets used in the experiments are representative of their respective classes of molecular structures and macroscopic shapes.
“We have applied the software to a variety of datasets and show the results for five representative sets in this section.”
The paper relies on this without support.
The Gramicidin A dataset contains the time-averaged molecular dynamics structure of Gramicidin A, a peptide that forms a channel for ion and water movement across lipid membranes.
“This dataset contains the time-averaged molecular dynamics structure of Gramicidin A, a peptide that forms a channel for ion and water movement across lipid membranes.”
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“In other words, the authors prove constructively that persistent homology groups of subcomplexes of S 3 , if computed over Z 2 coefficients, have a simple description in terms of a set of intervals.”
From Computing Persistent Homology (2005) · cites this paper as [11]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Surprisingly, the authors show that these intervals allowed the correct computation of the rank of persistent homology groups.”
From Computing Persistent Homology (2005) · cites this paper as [11]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“The authors also provide an algorithm that worked only for spaces that were subcomplexes of S 3 over Z 2 coefficients.”
From Computing Persistent Homology (2005) · cites this paper as [11]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“Therefore, the P -intervals discussed here are precisely the so-called k -intervals utilized in [11] to describe persistent Z 2-homology.”
From Computing Persistent Homology (2005) · cites this paper as [11]
The cited source says what the claim attributes to it.
In the citing paper
“Lemma 3.1. Let T be the set of triangles defined by P -intervals for the k-dimensional persistence module . The rank β l , p k of H l , p k is the number of triangles in T containing the point ( l , p ) .”
From Computing Persistent Homology (2005) · cites this paper as [11]
The cited source says what the claim attributes to it.
In the citing paper
“This algorithm is a generalized version of the pairing algorithm shown in [11].”
From Computing Persistent Homology (2005) · cites this paper as [11]
The cited source says what the claim attributes to it.
In the citing paper
“Then im η i , p k ≃ H i , p k [11], [18].”
From Computing Persistent Homology (2005) · cites this paper as [11]
In the citing paper
“As a result, persistent homology can capture topological structures continuously over a range of spatial scales.”
From Quantitative Toxicity Prediction Using Topology Based Multitask Deep Neural Networks (2018) · cites this paper as [17]
In the citing paper
“Unlike commonly used computational homology which results in truly metric free representations, persistent homology embeds geometric information in topological invariants, e.g., Betti numbers, so that 'birth' and 'death' of isolated components, rings, and cavities can be monitored at all geometric scales by topological measurements.”
From Quantitative Toxicity Prediction Using Topology Based Multitask Deep Neural Networks (2018) · cites this paper as [17]
In the citing paper
“Persistent homology22–25—a new branch of algebraic topology—is able to bridge geometry and topology, leading to a new efficient approach for the simplification of biological structural complexity26–31; however, it neglects critical chemical/biological information when it is directly applied to complex biomolecular structures.”
From A topology-based network tree for the prediction of protein–protein binding affinity changes following mutation (2020) · cites this paper as [23]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
Each contradiction between two passages listed here was confirmed by an independent check.
Induced homology maps are described as injective despite cycle deaths
MinorAn injective map from an earlier homology group cannot send one of its nonzero classes to zero. The paper also says that later negative simplices cancel classes created earlier, so the homology maps it describes cannot generally be injective.
“The p-persistent homology groups can also be defined using injective homomorphisms between ordinary homology groups.”
“Note that as we increase p, negative simplices cancel positive simplices earlier in the filtration.”
One reported average list length exceeds average persistence
MinorFor G's 2-cycles, Table 4 gives an average list length of 4.86, while Table 5 gives an average persistence of 4.47. Thus the stated comparison does not hold for that dataset and cycle dimension.
“Table 5 shows that the average persistence is considerably larger than the average number of collisions and list length.”
“| G | 10 | 2.47 | 2.22 | 111 | 4.86 | 2.08 |”
Citations
Cites
Rayward-Smith, V. J., Cormen, T. H., Leiserson, C. E., & Rivest, R. L. (1991) · Journal of the Operational Research Society · doi:10.2307/2583667 · Cited by 16,958
Three-dimensional alpha shapes
Edelsbrunner, H., & Mücke, E. P. (1994) · ACM Transactions on Graphics · doi:10.1145/174462.156635 · Cited by 2,488
Level Set Methods: An Overview and Some Recent Results
Osher, S., & Fedkiw, R. P. (2001) · Journal of Computational Physics · doi:10.1006/jcph.2000.6636 · Cited by 2,327
Elements of Algebraic Topology
Munkres, J. R. (2018) · CRC Press eBooks · doi:10.1201/9780429493911 · Cited by 2,113
ELEMENTS OF ALGEBRAIC TOPOLOGY
Kuratowski, K. (1972) · Elsevier eBooks · doi:10.1016/b978-0-08-016160-0.50028-2 · Cited by 1,290
A User's Guide to Spectral Sequences
McCleary, J. (2000) · Cambridge University Press eBooks · doi:10.1017/cbo9780511626289 · Cited by 838
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
Edelsbrunner, H., & Mücke, E. P. (1990) · ACM Transactions on Graphics · doi:10.1145/77635.77639 · Cited by 711
Grossman, P. A. (1995) · doi:10.1007/978-1-349-13908-8_1 · Cited by 676
An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere
Delfinado, C. J. A., & Edelsbrunner, H. (1995) · Computer Aided Geometric Design · doi:10.1016/0167-8396(95)00016-y · Cited by 183
Topology simplification for polygonal virtual environments
El-Sana, J., & Varshney, A. (1998) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/2945.694955 · Cited by 58
Flagged first, then by citations
Research works printed but not linked: 2
- [8]8. J. Milnor. Morse Theory. Princeton University Press, Princeton, New Jersey, 1963.
- [11]11. J. A. Sethian. Level Set Methods. Cambridge University Press, Cambridge, 1996. Received March 19, 2001, and in revised form October 4, 2001. Online publication October 29, 2002.
Cited by
Sorted by citations
Items 1,701–1,800 of 1,811
Schmitt, K., Titschack, J., & Baum, D. (2026) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2026.3656066
Masuzawa, K., Foggiatto, A. L., Kunii, S., et al. (2026) · Scientific Reports · doi:10.1038/s41598-026-39617-x
Topological Learning for Unsupervised Anomaly Detection and Customer Segmentation in Banking DataPreprint
Barberi, L. A. A., & Cave, L. M. D. (2026) · SSRN Electronic Journal · doi:10.2139/ssrn.6228818
Algorithms and Complexity Results for K-Theoretic Persistent Homology
Maruyama, Y. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-17801-5_5
Malczewski, K., Kozera, R., Gajewski, Z., et al. (2026) · Diagnostics · doi:10.3390/diagnostics16040615
Topological Analysis of Multi-Network Threading in the PancreasPreprint
Raichenko, V., Maaruf, R., Nyeng, P., et al. (2026) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.64898/2026.03.02.708973
Mapping Higher-Order Topology in OCD Brain Networks with Hodge LaplacianPreprint
Ruan, H., Chung, M. K., Bruin, W. B., Džinalija, N., Abe, Y., Alonso, P., Anticevic, A., Balachander, S., Batistuzzo, M. C., Benedetti, F., et al. (2026) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.64898/2026.03.04.709586 · Cited by 1
Topological Robust Reinforcement Learning
Goel, J., Jacob, R. A., Zhang, J., & Gel, Y. R. (2025) · IEEE International Conference on Big Data (BigData) · doi:10.1109/bigdata66926.2025.11401746
Uncovering Treatment Response Patterns with Topological Clustering of Brain Networks
Yi, J., Yin, J., Ghosal, R., et al. (2025) · IEEE International Conference on Big Data (BigData) · doi:10.1109/bigdata66926.2025.11401042
Topological feature guided knowledge distillation for improved wearable sensor data analysis
Kim, J. S., Jeong, J. C., Buman, M. P., Turaga, P. K., & Jeon, E. S. (2026) · Neurocomputing · doi:10.1016/j.neucom.2026.133309
Glavchev, M., Hlavcheva, Y., Lipchanskyi, M., et al. (2026) · Системи управління навігації та зв’язку Збірник наукових праць · doi:10.26906/sunz.2026.1.051
Ayariga, S. A. (2026) · Research Square · doi:10.21203/rs.3.rs-9125450/v1
Surface-Aware Weighted Partial Matching for Segmented 3D Shape Retrieval
Arhid, K., Ghazi, Y., Kachbal, I., et al. (2025) · IEEE International Conference on Advances in Data-Driven Analytics and Intelligent Systems (ADACIS) · doi:10.1109/adacis65663.2025.11436237
Mapper-enhanced persistent homology classification algorithm
Lara, M. L. D. D., & Garcia, Z. M. R. (2026) · AIP conference proceedings · doi:10.1063/5.0312716
ISUMsite: Identification of sumoylation sites based on Smote-ENN resampling technique
Xiong, B., Wan, M., Zuo, Y., & Tan, Y. (2026) · Analytical Biochemistry · doi:10.1016/j.ab.2026.116118
Persistent homology-based segmentation tool for membrane images
Oda, H., & Imoto, Y. (2026) · Cell Reports Methods · doi:10.1016/j.crmeth.2026.101366
Connected Components on Lie Groups and Applications to Multi-Orientation Image Analysis
van den Berg, N. J., Mula, O., Vis, L., & Duits, R. (2026) · Journal of Mathematical Imaging and Vision · doi:10.1007/s10851-026-01287-9
A survey of simplicial, relative, and chain complex homology theories for hypergraphs
Gasparovic, E., Purvine, E., Sazdanović, R., Wang, B., Wang, Y., & Ziegelmeier, L. (2026) · Journal of Applied and Computational Topology · doi:10.1007/s41468-025-00227-7 · Cited by 3
Dynamical and topological tools for (modern) music analysis
Bergomi, M. G. (2015) · theses.fr (ABES) · doi:10.70675/7f9d64bezcdc1z4ecbza15fzf3aac6e60bfe · Cited by 12
Computational homology applied to discrete objects
Gonzalez-Lorenzo, A. (2016) · theses.fr (ABES) · doi:10.70675/a95fcb81ze808z4eafz9f6dz26764b15c6b2
Approche topologique de la métrologie du mouvement pour des applications en réalité virtuelle
Bensekka, C. A. (2018) · theses.fr (ABES) · doi:10.70675/db7e889ezda81z473bz87c4z72e64e934169
Collapses and persistent homology
Pritam, S. (2020) · theses.fr (ABES) · doi:10.70675/98823732ze3cbz4b88zad47z3ba662334cac
Beaufils, B. (2020) · theses.fr (ABES) · doi:10.70675/803ee8dbzbb85z4d09za979z798c923c9cb9
Resilience, Tipping Points, and Hysteresis
Grindrod, P. (2026) · Complexities · doi:10.3390/complexities2020010
Bonnaire, T. (2021) · theses.fr (ABES) · doi:10.70675/553b007dz2008z47fez9d3az684a68a11cb4
Martin, C. B. (2023) · theses.fr (ABES) · doi:10.70675/8eea9293zdaadz4766z9baez15cec27b3b07
Annotation-efficient learning for object discovery and detection
Vo, H. V. (2022) · theses.fr (ABES) · doi:10.70675/aae8cd95z8e92z4d35z9384zafe56efdad87
Optimal transport for transfer learning across spaces
Tran, Q. H. (2024) · theses.fr (ABES) · doi:10.70675/c924af75zce59z40c4z8c98z85e06505f70e
Development of trustworthy intelligent avatars in virtual immersion
Hadadi, A. (2024) · theses.fr (ABES) · doi:10.70675/8d13bedfz1589z4486zbc0bzdf696c7a3007
Topology enhances classical figure detection
Oda, H. (2025) · International Conference on Electrical, Computer and Energy Technologies (ICECET) · doi:10.1109/icecet63943.2025.11472121
Analyse biogéométrique de l'évolution des protéines et des traits d'histoire de vie
Dagher, L. B. (2024) · theses.fr (ABES) · doi:10.70675/3a39f4f2zb57dz4fb3z8990zbd5d3fe1a6bf
Topological Data Analysis for Breast Pathology Classification
Pakhomov, A., & Khamukhin, A. (2026) · 2026 28th International Conference on Digital Signal Processing and its Applications (DSPA) · doi:10.1109/dspa69176.2026.11476738
Choi, Y. J., Bharath, K., & Kurtek, S. (2026) · ICSA book series in statistics · doi:10.1007/978-3-032-06649-7_13
Gao, X., Wang, X., Liu, Y., et al. (2026) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp55912.2026.11462478
Topological Data Analysis for Neural Time Series: Persistent Homology and Brain Dynamics
Bush, J. (2026) · Springer eBooks · doi:10.1007/978-3-030-93954-0_90-1
Molecular Dynamics Simulation of Direct Bonding Between Cu–Cu in Hybrid Bonding
Tomiyoshi, Y., Oyamada, T., Sasajima, Y., et al. (2026) · Journal of Electronic Materials · doi:10.1007/s11664-026-12874-2
Topological biomarkers for seizure state transitions
Fernández, X., & Mateos, D. (2026) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/5.0326217
On stable bifiltrations induced by measures on metric space
Janes, F., Mwanzalima, M., & Mpimbo, M. (2026) · Research in Mathematics · doi:10.1080/27684830.2026.2667044
Lin, Z., Zulkepli, N. F. S., Kasihmuddin, M. S. M., et al. (2026) · Complex & Intelligent Systems · doi:10.1007/s40747-026-02315-2
Lee, R., O’Boyle, M., & Garrett, A. S. (2026) · NeuroImage · doi:10.1016/j.neuroimage.2026.122008
Klos, K. H. M., Disselhoff, J., Wand, M., et al. (2026) · The Journal of Chemical Physics · doi:10.1063/5.0323442
A Topology-Preserving Coreset for Kernel Regression in Scientific Visualization
Lyu, W., Gorski, N., Phillips, J. M., & Wang, B. (2026) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2026.3694452
Atom probe informed persistent homology analysis of precipitation topology and hardening
Zhu, S., & Zhou, T. (2026) · Materials & Design · doi:10.1016/j.matdes.2026.116278
Fixation Sequences as Time Series: A Topological Approach to Dyslexia Detection
Huber, M., Reich, D. R., & Jäger, L. A. (2026) · ACM Symposium on Eye Tracking Research and Applications (ETRA) · doi:10.1145/3797246.3803045
Contact-dependent Communication Shapes the Mesoscale Spatial Organization of Bacterial SwarmsPreprint
Garling, E. E., Byers, M., Bradley, E., Meiss, J. D., & Gibbs, K. A. (2026) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.64898/2026.05.31.726327
A hybrid deep learning architecture for breast cancer classification
Dalyan, E., Altundağ, H., & Yalçınkaya, M. (2026) · The European Physical Journal Plus · doi:10.1140/epjp/s13360-026-07852-w
Topological Analysis of Composite Ageing via Dual Anisotropic Filtrations and Persistent Homology
Canot, H., Durand, P., Frénod, E., et al. (2026) · International Journal of Topology · doi:10.3390/ijt3020011
Mechanisms and Machines: On the Continued Relevance of Mathematical Modeling in BiologicalSciences
Eidi, Z., & Eidi, M. (2026) · BiotechIntellect · doi:10.66224/biotechintellect.2.1.32
Geometry‐Aware Alignment and Comparison of Hierarchical Morse Complexes with Applications
Venkat, A., Gyulassy, A., Bremer, P., et al. (2026) · Computer Graphics Forum · doi:10.1111/cgf.70449
Scalable Computation of Topological Abstractions for Scalar Data
Will, M., Lukasczyk, J., Tierny, J., Gyulassy, A. G., Weber, G. H., Carr, H. A., & Garth, C. (2026) · Computer Graphics Forum · doi:10.1111/cgf.70497
Persistent homology as efficient phase descriptor for 2D skyrmion lattices
Taniwaki, M., Winkler, T., Rothörl, J., et al. (2026) · APL Machine Learning · doi:10.1063/5.0331214
Persistent homology filtration grounded on higher-order complex networks centrality measures
Raj, U., Maletić, S., & Bhattacharya, S. (2026) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/5.0331377 · Cited by 1
Furuya, K., Umeno, Y., Ikura, M., Ikura, Y., Nishikawa, S., & Ikura, T. (2026) · Genes to Cells · doi:10.1111/gtc.70127
Toribe, Y., & Miyazaki, S. (2026) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.95.074004
Layer-Wise Persistent Entropy of CT Scan Point Clouds for Lung Tumor Classification
Jose, C. J., Baiju, A. P., Roy, R., Harikrishnan, A., Sanju, R., Kumar, P., Sherly, K. K., Jacob, R., & Sreekumar, G. (2026) · AppliedMath · doi:10.3390/appliedmath6060095
Topological characterization of ecological dynamics via persistent homology
ariman, M. K. (2026) · AIMS Mathematics · doi:10.3934/math.2026737
Topology‐based Visual Analysis of Hydrothermal Plumes
Kamakshidasan, A., Jain, T., Bemis, K. G., et al. (2026) · Computer Graphics Forum · doi:10.1111/cgf.70442
Moradiya, M., Nakaranee, A., & Garg, V. (2026) · Diamond and Related Materials · doi:10.1016/j.diamond.2026.113883
Feged-Rivadeneira, A., González-Casabianca, F., Cárdenas, P., Ángel, A., & Corredor, V. (2026) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.64898/2026.06.18.733071
Topological inference on brain networks with application to lesion symptom mapping
Wang, Y., Yin, J., Riccardi, N., den Ouden, D., Fridriksson, J., & Desai, R. H. (2026) · The Annals of Applied Statistics · doi:10.1214/26-aoas2169
Explainable anomaly detection and localization for ADHD in MRI using topological features
Wang, P., Duan, J., Xing, Y., Xu, R., Xu, A., Chen, H., Hu, S., Wang, T., & Liu, S. (2026) · Pattern Recognition · doi:10.1016/j.patcog.2026.114347
Persistent Homology for Parameter-free Radio Spectral Line Decomposition
Vera-Ciro, C. A. (2026) · The Astronomical Journal · doi:10.3847/1538-3881/ae7435
Distributed Topological Data Analysis of Tetrahedral Meshes With Apache Spark
Qian, Y., Liu, G., Iuricich, F., et al. (2026) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2026.3713289
Topological Data Analysis for Neural Time Series: Persistent Homology and Brain Dynamics
Bush, J. (2026) · Springer eBooks · doi:10.1007/978-3-032-16368-4_90
Algebraic Topology and Topological Data Analysis: A New Frontier for Actuarial Claim Reserving
Zimbidis, A. Α. (2026) · Mathematics · doi:10.3390/math14142587
Brown, S. R., Anderson, N., Orozco, J., et al. (2026) · Journal of Pathology Informatics · doi:10.1016/j.jpi.2026.100697
Deneko, E., Hysenlliu, M., Dhoska, K., & Annuk, A. (2026) · Buildings · doi:10.3390/buildings16152963
Li, Y., Fu, X., Liu, L., Ding, J., & Peng, W. (2026) · Neurocomputing · doi:10.1016/j.neucom.2026.134639
Bisht, Y., Chitransh, S., & Sahoo, S. K. (2026) · SSRN Electronic Journal · doi:10.2139/ssrn.7133498
Geng, B., Wang, H., Shen, X., et al. (2026) · Chaos Solitons & Fractals · doi:10.1016/j.chaos.2026.118867
Improving topological detection of weather regimes in climate dynamical systems
Anbouhi, S. (2026) · Climate Dynamics · doi:10.1007/s00382-026-08296-9
Complete, Compact and Topological Trees of Shapes
Forte, J. M., Passat, N., & Kenmochi⋆, Y. (2026) · Journal of Mathematical Imaging and Vision · doi:10.1007/s10851-026-01344-3
Rojas, L., Moraga, P., Peña, Á., et al. (2026) · Coatings · doi:10.3390/coatings16080921
Topology-Preserving Deep Joint Source-Channel Coding for Semantic Communication
Erak, O., Alhussein, O., Fang, F., et al. (2026) · IEEE Communications Letters · doi:10.1109/lcomm.2026.3717806
Alsaadawi, R., & Mukhopadhyay, N. D. (2026) · Statistical Analysis and Data Mining The ASA Data Science Journal · doi:10.1002/sam.70105
Li, Z., Wan, M., Gao, M., Tai, X., Chen, Z., Wang, X., & Zhang, F. (2026) · Science China Materials · doi:10.1007/s40843-025-4104-4
Persistent Homology in Topological Data Analysis: Theory and Applications
Julie, E. (2026) · International Journal of Pure Science Research Studies (IJPSRS) · doi:10.63090/ijpsrs/3139.8995.0020
Wang, X., Liu, W., & Huang, L.-C. (2026) · Symmetry · doi:10.3390/sym18081402
Du, H., Meng, C., & Huang, S. (2026) · SSRN Electronic Journal · doi:10.2139/ssrn.7322619
Delepine, D., Bernal, J. D. J., & Guadarrama, C. P. (2026) · SSRN Electronic Journal · doi:10.2139/ssrn.7328958
On the supports in the Humilière completion and γ -coisotropic sets
Viterbo, C. (2026) · Compositio Mathematica · doi:10.1017/s0010437x26103212
Signatures of Massive Neutrinos in the Cosmic Web via Persistent Homology
Yu, H., Michaux, M., 김, D. 동. K., et al. (2026) · The Astrophysical Journal · doi:10.3847/1538-4357/ae975f
Remigio–Juárez, J., Cantú, M. H. A., Garibay, J. R. H., Colín, R. D., & Rodríguez-Henríquez, L. M. (2026) · Journal of basic sciences. · doi:10.19136/jobs.a12n34.6624
Meng, X., Sun, D., Li, W., & Zhao, K. (2026) · Expert Systems with Applications · doi:10.1016/j.eswa.2026.134420
TopoAgent: An Agentic Framework for Automated Topology Learning in Medical Imaging
Meng, G., Gu, P., Li, X., Shi, Y., Chambers, E. W., & Chen, D. Z. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-37032-7_17
Unraveling the PFAS Helix: A Statistical Approach
Ray, P., Cavalli, H., Bizana, G. B., Castillo, A. R., Vyas, S., Siefert, R. L., Kalidindi, S. R., & Kolel‐Veetil, M. K. (2026) · Journal of Chemical Information and Modeling · doi:10.1021/acs.jcim.6c01874 · Cited by 1
Al-Khalayleh, N., Jouini, M. S., Kirane, M., Najman, L. A., & Bouchaala, F. (2026) · Research Square · doi:10.21203/rs.3.rs-10592448/v1
Sudha, M., & Murali, S. (2026) · Frontiers in Digital Health · doi:10.3389/fdgth.2026.1927725
Bayesian Topological Analysis of Brain Networks
Zhu, X., Lutz, M. W., & Songdechakraiwut, T. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-38239-9_4
Metadata
- Authors
- Edelsbrunner, Letscher, & Zomorodian
- Affiliations
- Duke University (US)
- Oklahoma State University (US)
- University of Illinois Urbana-Champaign (US)
- Venue
- Discrete & Computational Geometry
- Published
- 2002-11
- Volume
- 28
- Issue
- 4
- Pages
- 511-533
- ISSN
- 0179-5376 (ISSN-L)
- 1432-0444
- OpenAlex
- W3013843370
- Cited by
- 1,779
- References
- 12
- Citations by year
- 2026: 130 · 2025: 152 · 2024: 125 · 2023: 94 · 2022: 91 · 2021: 139 · 2020: 106 · 2019: 131 · 2018: 101 · 2017: 72 · 2016: 89 · 2015: 70 · 2014: 74 · 2013: 47 · 2012: 63
- FWCI
- 13.65
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Discrete & Computational Geometry (publishedVersion)
- Funders
- National Science Foundation (9712088)
- Army Research Office
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Topological and Geometric Data Analysis
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Digital Image Processing Techniques
- Physical Sciences › Mathematics › Geometry and Topology › Geometric and Algebraic Topology
- Keywords
- topological persistence, topological simplification, simplicial complexes, filtration, computational topology
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.
A language model drew the claims from the paper on 2026-10-11, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-11 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
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
