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
41 Own interpretation · 29 No basis given · 10 Own result · 4 Sources not found · 4 No full text of the sources
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.
plainSingle case- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a 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
“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.
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a 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
“Then Z ℓ k ∩ B ℓ+ p-1 k = Z ℓ k ∩ B ℓ+ p k , and hence β ℓ, p k = β ℓ, p-1 k”
§ Discrete & Computational Geometry > Abstract Algorithm.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
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
“After accelerating with union-find, the slowest portion of the algorithm is adding 1-cycles.”
§ Discrete & Computational Geometry > Timings.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a 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
“In other words, increasing p by one shortens the persistence of all nonbounding cycles by one.”
§ Discrete & Computational Geometry > Algebraic Formulation.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a 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
“k-Triangle Lemma.The number of k-triangles containing (ℓ, p) in the index-persistence plane is β ℓ, p k .”
§ Discrete & Computational Geometry > Abstract Algorithm.
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: unclear — It is unclear why the paper says it holds.
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
“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.
plaindirectSingle case- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- 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.
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: unclear — It is unclear why the paper says 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
“If follows that β ℓ, p k = β ℓ, p-1 k -1.”
§ Discrete & Computational Geometry > Abstract Algorithm.
plaindirectn = 2- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a 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
“Monotonicity Lemma.β ℓ, p k ≤ β ℓ , p k whenever p ≤ p and ℓ ≤ ℓ ≤ ℓ + ( pp ).”
§ Discrete & Computational Geometry > Abstract Algorithm.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- 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.
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably 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.
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably 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.
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably 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.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
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 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.
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It 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).
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
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
“For each simplex σ ∈ D, there is a unique birth time α(σ ) defined such that σ ∈ K (α) iff α ≥ α(σ ).”
§ Discrete & Computational Geometry > Age Filters.
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably 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.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It 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.
hedgedcorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It 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.
hedged- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It 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.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably 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.
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably 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.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably 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.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably 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.
boosteddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It 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.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It 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.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It 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.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably 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.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably 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.
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably 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.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It 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).
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It 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.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It 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.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It 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.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It 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.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably 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.
hedged- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably 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.
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: unclear — It is unclear why the paper says it holds.
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
“Specifically, simplices in a filter correspond to critical points of a density function.”
§ Discrete & Computational Geometry > Approach and Results.
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably 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.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It 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.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It 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.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: unclear — It is unclear why the paper says it holds.
It 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
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably 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.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It 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.
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It 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
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably 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.
hedgedconditional- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It 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
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It 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.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It 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.
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ Discrete & Computational Geometry > Algebraic Formulation.
“The p-persistent homology groups can also be defined using injective homomorphisms between ordinary homology groups.”
§ Discrete & Computational Geometry > Algebraic Formulation.
“Note that as we increase p, negative simplices cancel positive simplices earlier in the filtration.”
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ Discrete & Computational Geometry > Statistics.
“Table 5 shows that the average persistence is considerably larger than the average number of collisions and list length.”
§ Discrete & Computational Geometry > 7. Future Directions
“| 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
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,601–1,700 of 1,811
Boissonnat, J., Chazal, F., & Yvinec, M. (2018) · Cambridge University Press eBooks · doi:10.1017/9781108297806.004
Distance to Probability Measures
Boissonnat, J., Chazal, F., & Yvinec, M. (2018) · Cambridge University Press eBooks · doi:10.1017/9781108297806.011
Comment on egusphere-2023-1855
Fuchs, M., Suzuki, A., Hasumi, T., et al. (2023) · doi:10.5194/egusphere-2023-1855-rc2
Misclassification Loss for Segmentation of the Aortic Vessel Tree
Khan, A., Asad, M., Zolotarev, A. M., Roney, C. H., Mathur, A., Benning, M., & Slabaugh, G. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-53241-2_6
Poincaré duality for generalized persistence diagrams of (co)filtrations
Patel, A., & Rask, T. (2024) · Journal of Applied and Computational Topology · doi:10.1007/s41468-023-00159-0
Blockchain Energy Trade System
Ikeda, Y. (2023) · Evolutionary economics and social complexity science · doi:10.1007/978-981-99-8779-5_10
Topology-enhanced machine learning for speech signal processing
Feng, P., Qu, Q., Zhang, H., Yi, S., Yu, Z., Ding, Z., & Zhu, Y. (2026) · Nature Communications · doi:10.21203/rs.3.rs-3978261/v1
The Internal Topology of Rocks
Korvin, G. (2024) · Earth and environmental sciences library · doi:10.1007/978-3-031-46700-4_3
Forecasting Financial Crisis using Topological Data Analysis Approach
Oseko, N. N., Omondi, A. G., Onyango, H. D., et al. (2024) · African scientific annual review. · doi:10.51867/asarev.maths.1.1.1
Sparse Higher Order Čech Filtrations
Buchet, M., DORNELAS, B. B., & Kerber, M. (2024) · Journal of the ACM · doi:10.1145/3666085
Schrader, P. (2024) · SSRN Electronic Journal · doi:10.2139/ssrn.4885393
Topological regularization on numerical simulations of the advection equation
Takeda, K., Kaji, S., & Miyoshi, T. (2024) · JSIAM Letters · doi:10.14495/jsiaml.16.53
Topological Structures in the Space of Treatment-Naïve Patients with Chronic Lymphocytic Leukemia
McGee, R. L., Reed, J., Coombes, C. E., Herling, C., Keating, M. J., Abruzzo, L. V., & Coombes, K. R. (2024) · Cancers · doi:10.3390/cancers16152662
Research on Clothing Image Retrieval Combining Topology Features with Color Texture Features
Zhang, X., Sun, H., & Ma, J. (2024) · Mathematics · doi:10.3390/math12152363
Geometrical Realization for Time Series Forecasting
Bayeh, A., Mouhoub, M., & Sadaoui, S. (2024) · Communications in computer and information science · doi:10.1007/978-3-031-66705-3_1
Application of Topological Data Analysis to Elucidate the Mechanical Behavior of Powders
Ishihara, S. (2024) · Journal of the Society of Powder Technology Japan · doi:10.4164/sptj.61.359
Topo-Geometric Analysis of Variability in Point Clouds Using Persistence Landscapes
Matuk, J., Kurtek, S., & Bharath, K. (2024) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2024.3451328
Localized Evaluation for Constructing Discrete Vector Fields
Finken, T., Tierny, J., & Levine, J. A. (2024) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2024.3456355
Topological Delaunay Graph for Efficient 3D Binary Image Analysis
Yoshizawa, S., Michikawa, T., & Yokota, H. (2024) · International Journal of Automation Technology · doi:10.20965/ijat.2024.p0632
Bow echo alarm system using Topological Data Analysis
Canot, H., Durand, P., & Frénod, E. (2025) · Applied Mathematics for Modern Challenges · doi:10.3934/ammc.2025002
A Topological Comparison of the Fluorescence Imitating Brightfield Imaging and H&E Imaging
Xu, M., Anderson, N., Levenson, R. M., Prasanna, P., & Chen, C. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-73967-5_12
Machine learning from a mathematical perspective
Rajendra, P., Ravi, P. V. N. H., & Meenakshi, K. (2024) · AIP conference proceedings · doi:10.1063/5.0225046 · Cited by 1
Raith, F., Scheuermann, G., & Heine, C. (2024) · doi:10.1109/topoinvis64104.2024.00007
Taghribi, A., Canducci, M., Mastropietro, M., Rijcke, S. D., Peletier, R. F., Peter Tiňo, B., & Bunte, K. (2025) · Astronomy and Computing · doi:10.1016/j.ascom.2024.100923
Texture image classification based on persistent homology
Zhou, H. (2025) · International Conference on Computer Vision, Application, and Algorithm (CVAA) · doi:10.1117/12.3055922
A Vectorization Method Induced By Maximal Margin Classification For Persistent Diagrams
Wu, A., Pan, Y. R., Zhou, F., et al. (2024) · IEEE International Conference on Bioinformatics and Biomedicine (BIBM) · doi:10.1109/bibm62325.2024.10821901
SpecSeq++: A high parallel boundary matrix reduction to support real large-scale point clouds
Li, Q. C., Huang, Z., Chen, Y., et al. (2025) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2025.105036
Tozzi, A. (2025) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2025.02.04.636494
Persistence image from 3D medical image: superpixel and optimized Gaussian coefficient
Zhu, Y., Singh, Y. P., Younis, K. S., et al. (2025) · SPIE Medical Imaging: Computer-Aided Diagnosis · doi:10.1117/12.3047078 · Cited by 2
The Topology of Evasion: Persistent Homology of Gene Repertoires of ImmunityPreprint
Hampton, M. E., & Mamudu, I. (2025) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2025.02.27.640626
Dynamic k-Anonymity for Electronic Health Records: A Topological Framework
Swaminathan, A. D., & Akgün, M. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-82349-7_10
Moon, T. J., Park, S. M., Yoon, H. G., et al. (2025) · Scientific Reports · doi:10.1038/s41598-025-95495-9
A Study of Intuitionistic Fuzzy Graph Using Morphological Operators and Its Application
Jacob, A., & Ramkumar, P. B. (2025) · Springer proceedings in mathematics & statistics · doi:10.1007/978-981-96-1505-6_6
Öztel, A., Akgul, B., Karaca, İ., & Ege, Ö. (2025) · Applicable Algebra in Engineering Communication and Computing · doi:10.1007/s00200-025-00682-w
Classification of Some Cosmological Images Using Deep Learning and Persistent Homology
Sekuloski, P., & Ristovska, V. D. (2025) · Communications in computer and information science · doi:10.1007/978-3-031-86162-8_11
Clustering of spatial data with implicit polygonal structure based on topological approaches
Eremeev, S. (2025) · Scientific and technical journal of information technologies mechanics and optics · doi:10.17586/2226-1494-2025-25-2-261-272
Mestiri, M., Fergombé, A., & Huftier, A. (2025) · Lecture notes on data engineering and communications technologies · doi:10.1007/978-3-031-87763-6_36
Topological Data Analysis for Detecting Regular Structures in an Image
Eremeev, S. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-87663-9_11
Obayashi, I., & Ozaki, Y. (2024) · Journal of Smart Processing · doi:10.7791/jspmee.13.107
Curse of dimensionality on persistence diagrams
Hiraoka, Y., Imoto, Y., Kanazawa, S., et al. (2025) · Foundations of Data Science · doi:10.3934/fods.2025008
ParkView: Visualizing Monotone Interleavings
Beurskens, T., van den Broek, S., Simons, A., et al. (2025) · IEEE Pacific Visualization Conference (PacificVis) · doi:10.1109/pacificvis64226.2025.00018
Identification of Leading Lines in Artworks Based on Topological Analysis of Saliency Maps
Shibasaki, F., & Fujishiro, I. (2025) · IEEE Pacific Visualization Conference (PacificVis) · doi:10.1109/pacificvis64226.2025.00045
Tensor-Fused Multi-view Graph Contrastive Learning
Wu, Y., Mo, J., Chen, E., et al. (2025) · Lecture notes in computer science · doi:10.1007/978-981-96-8298-0_2
S-CPD: Topological Smoothing-Based Change Point Detection
Sugathadasa, H., Erfani, S., & Leckie, C. A. (2025) · Lecture notes in computer science · doi:10.1007/978-981-96-8295-9_10 · Cited by 1
Topological Invariants for Linear Codes and APN Functions
Zhou, Z., Li, K., & Zhou, Y. (2025) · IEEE Transactions on Information Theory · doi:10.1109/tit.2025.3583010
A Novel Fault Detection Method Using Betti Curve
Jia, R., Han, Y., Luan, W., et al. (2025) · Asia Conference on Power and Electrical Engineering (ACPEE) · doi:10.1109/acpee64358.2025.11041514
Appliance Identification by Topological Data Analysis of Phase Space
Gao, Y. X., Zhang, J., Tan, Z., et al. (2025) · Asia Conference on Power and Electrical Engineering (ACPEE) · doi:10.1109/acpee64358.2025.11040381
Analysis Method for Turing Patterns and Biological Skin Patterns Using Persistent Homology
Kanamori, T., Enomoto, K., Aoki, N., et al. (2025) · International Journal of Automation Technology · doi:10.20965/ijat.2025.p0630
“Barcodes” for Continuous Maps and a Brief Introduction to Alternative Morse Theory
Burghelea, D. (2025) · Springer eBooks · doi:10.1007/978-3-031-81414-3_14
A finitely stable edit distance for merge trees
Pegoraro, M. (2025) · AIMS Mathematics · doi:10.3934/math.2025769
A Logifold Structure for Measure Space
Jung, I., & Lau, S.-C. (2025) · Axioms · doi:10.3390/axioms14080599
Geometric bounds for persistence
Balitskiy, A., Coşkunuzer, B., & Mémoli, F. (2025) · Transactions of the American Mathematical Society · doi:10.1090/tran/9514
When Does Additional Information Improve Accuracy of RNA Secondary Structure Prediction?
Rose, L., Giraldo, L. G. S., Nguyen, D. D., Wheeler, M., & Murrugarra, D. (2025) · Journal of Chemical Information and Modeling · doi:10.1021/acs.jcim.5c01231
Interval Decomposition of Persistence Modules over a Principal Ideal Domain
Luo, J., & Henselman‐Petrusek, G. (2025) · Foundations of Computational Mathematics · doi:10.1007/s10208-025-09732-8 · Cited by 5
Wasserstein crossover for evolutionary algorithm-based topology optimizationPreprint
Kii, T., Yaji, K., Teramoto, H., & FUJITA, K. (2025) · SSRN Electronic Journal · doi:10.2139/ssrn.5562202
Peak Persistence Diagrams for Shape-Based Signal Estimation
Kim, W., Dasgupta, S., Turaga, P. K., et al. (2025) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2025.3613678
Jeong, J. C., Buman, M. P., Turaga, P. K., & Jeon, E. S. (2025) · Sensors · doi:10.3390/s25206396 · Cited by 1
He, Y., Wu, J., & Li, M. Z. (2025) · Chinese Physics B · doi:10.1088/1674-1056/ae1457
Topological decoding of grid cell activity via path lifting to covering spacesPreprint
Yao, Y., & Yoon, I. H. R. (2025) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2025.10.17.683158
A Topological Data Analysis of Stock Market Time Series Using Persistent Homology
Hou, Y., Xu, S., Yang, Z., et al. (2025) · Lecture notes on data engineering and communications technologies · doi:10.1007/978-981-95-1595-0_17
Training dynamics of GANs through the lens of persistent homology
Corradini, B. T., Cullen, B. N., Gallegati, C., Marziali, S., D’Inverno, G. A., Bianchini, M., & Scarselli, F. (2025) · Neurocomputing · doi:10.1016/j.neucom.2025.131976
Intelligent Systems for Urban Planning: Well-Being and Residents’ Perception
Габдрахманова, Н., & Pilgun, M. A. (2025) · Communications in computer and information science · doi:10.1007/978-3-032-04764-9_12
Flow-aware ellipsoidal filtration for persistent homology of recurrent signals
Eryilmaz, O. B., Katar, C., & Little, M. A. (2026) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/5.0317749
Owais, W. B., Jelinek, H. F., & Elfadel, I. M. (2025) · medRxiv · doi:10.1101/2025.11.05.25339645
Abdullahi, M. S., Piro, R. M., Suratanee, A., & Plaimas, K. (2025) · Computational and Structural Biotechnology Journal · doi:10.1016/j.csbj.2025.11.018
A Complex Topological Phase in C-Spin Active MatterPreprint
Scirè, A. (2025) · Qeios · doi:10.32388/9zdjvu
Mishra, A., & Motta, F. C. (2025) · Journal of Applied and Computational Topology · doi:10.1007/s41468-025-00225-9
TopoRN: A topology-aware reconstruction network for infrared image super-resolution
Dan, J., Jin, T., Chi, H., Luo, Z., Cao, K., Xinjing, Y., & Yang, X. (2025) · Applied Intelligence · doi:10.1007/s10489-025-06999-w · Cited by 1
A Complex Topological Phase in C-Spin Active MatterPreprint
Scirè, A. (2025) · Qeios · doi:10.32388/9zdjvu.2
Expected Complexity of Barcode Reduction
Giunti, B., Houry, G., Kerber, M., et al. (2025) · Journal of Applied and Computational Topology · doi:10.1007/s41468-025-00218-8
Zabaleta-Ortega, Á., Masoller, C., & Guzmán-Vargas, L. (2025) · Scientific Reports · doi:10.1038/s41598-025-27083-w · Cited by 1
Schrader, P., Blasch, E., Guo, H., et al. (2025) · doi:10.1109/dasc66011.2025.11257307
Clustering Problem of Stock Price Time Series Based on Topological Data Analysis
Li, X., & Zhang, H. (2025) · International Conference on Economic Management and Big Data Application (ICEMBDA) · doi:10.1145/3770177.3770248
Aste, T. (2025) · Journal of Physics Complexity · doi:10.1088/2632-072x/ae28c3 · Cited by 2
Topological Aspect of Magnetic Structures in Paramagnetic Liquid Crystal
Uchida, Y., Akita, T., Ohkochi, T., et al. (2025) · e-Journal of Surface Science and Nanotechnology · doi:10.1380/ejssnt.2025-052
BondMatcher: H-Bond Stability Analysis in Molecular Systems
Daniel, T., Olejniczak, M., & Tierny, J. (2025) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2025.3634636
Persistence Modules, Shape Description, and Completeness
Cagliari, F., Ferri, M., Gualandri, L., & Landi, C. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-30238-1_16
Diagnostics of Semantic Word Spaces
Isheden, G. (2013) · KTH Publication Database DiVA (KTH Royal Institute of Technology)
Geometric Construction of Kashiwara Crystals on Multiparameter Persistence
Hiraoka, Y., & Yahiro, K. (2026) · Algebras and Representation Theory · doi:10.1007/s10468-026-10418-0 · Cited by 1
Klaila, G., Vutov, V., & Stefanou, A. (2024) · Figshare · doi:10.6084/m9.figshare.26603416
Klaila, G., Vutov, V., & Stefanou, A. (2024) · Figshare · doi:10.6084/m9.figshare.26603419
Topological potentials guiding protein self-assembly
Spirandelli, I., Nigmetov, A., Morozov, D., & Evans, M. E. (2026) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1014709 · Cited by 1
On the support of betti tables of multiparameter persistent homology modules
Guidolin, A., & Landi, C. (2025) · The Quarterly Journal of Mathematics · doi:10.1093/qmath/haaf021
Toward structure-preserving quantum encodings
Parzygnat, A. J., Bradley, T.-D., Vlasic, A., & Pham, A. (2025) · Physical Review Research · doi:10.1103/rph8-g15q · Cited by 2
Topology-Aware Volume Fusion for Spectral Computed Tomography via Histograms and Extremum Graph
Sharma, M., Nilsson, E., Falk, M., et al. (2025) · doi:10.1109/topoinvis68599.2025.00010
Robust Geometric Predicates for Bivariate Computational Topology
Hristov, P., Hotz, I., & Masood, T. B. (2025) · doi:10.1109/topoinvis68599.2025.00011
Wasserstein crossover for evolutionary algorithm-based topology optimization
Kii, T., Yaji, K., Teramoto, H., & FUJITA, K. (2026) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2025.118713 · Cited by 2
Topological Deep Learning for Coral Reefs
Aguilar-Ortíz, J., Díaz-Parra, O., Ruíz-Vanoye, J. A., et al. (2026) · IGI Global eBooks · doi:10.4018/979-8-3373-5881-9.ch008
Ocean Digital Twins, Hybrid Architectures, and Reproducible Frameworks for Marine Ecosystems
Aguilar-Ortíz, J., Díaz-Parra, O., Ruíz-Vanoye, J. A., Vera-Jiménez, M. A., Zamudio-García, V. M., & Domínguez-Mayorga, C. R. (2026) · IGI Global eBooks · doi:10.4018/979-8-3373-5881-9.ch007
Persistent homology via curvature-adaptive wing complexes
Weng, Z., & Minghui, Z. (2026) · AIMS Mathematics · doi:10.3934/math.2026034
Persistence Module and Schubert Calculus
Hiraoka, Y., Yahiro, K., & Xu, C. (2026) · Springer eBooks · doi:10.1007/978-981-95-1446-5_12
Persistent Homology Superweights for Neural Networks Compression
Oleksandr, Y. (2025) · International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications · doi:10.1109/idaacs68557.2025.11322297
Configuration spaces of circles in the plane
Curry, J. M., Gelnett, R., & Zaremsky, M. C. B. (2026) · Journal of Homotopy and Related Structures · doi:10.1007/s40062-026-00398-9
Extended persistent homology of filtration of graded subgroups
Xie, S., Zhao, X., & Sun, F. (2026) · Electronic Research Archive · doi:10.3934/era.2026041
Unitary similarity comparison of persistent homology groups
He, J., Hou, B., Wu, T., & Cao, Y. (2026) · Japan Journal of Industrial and Applied Mathematics · doi:10.1007/s13160-025-00753-y
Paul, A., Rana, A., Chattopadhaya, I., et al. (2025) · International Conference on Research in Computational Intelligence and Communication Networks (ICRCICN) · doi:10.1109/icrcicn68210.2025.11364933
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
