{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:QUN65XO4GP5NSBFNO72MN2J3H7","short_pith_number":"pith:QUN65XO4","schema_version":"1.0","canonical_sha256":"851beedddc33fad904ad77f4c6e93b3ff849ecf394570162833d0223539dad17","source":{"kind":"arxiv","id":"2602.22784","version":2},"attestation_state":"computed","paper":{"title":"It's All About Covers: Persistent Homology of Cover Refinements","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"Reframing persistent homology around cover refinements produces smaller filtrations with unconditional log-3 interleaving to Vietoris-Rips.","cross_cats":[],"primary_cat":"math.AT","authors_text":"Ant\\'onio Leit\\~ao","submitted_at":"2026-02-26T09:19:26Z","abstract_excerpt":"The computational cost of persistent homology is often dominated by the growth of the underlying simplicial filtrations. Many different filtrations exist, each with its own assumptions and trade-offs, but all face some form of this growth which can be exponential in the worst case, as for the Vietoris-Rips. We recast this problem at the level of covers, developing a framework in which filtrations and persistence modules can be constructed, analyzed, and compared through simple relations between covers rather than at the level of simplicial complexes. The guarantees propagate through any functo"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":true,"formal_links_present":true},"canonical_record":{"source":{"id":"2602.22784","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.AT","submitted_at":"2026-02-26T09:19:26Z","cross_cats_sorted":[],"title_canon_sha256":"4e3d2b16e37d21afaa810078ab8f8c54fe2f4f388d28a2acc4cf69b6a40c380e","abstract_canon_sha256":"6a55c35c8f8f6f23589ea0870d46ef68fc23657f8c3af36adbf2910dbad85d9e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:15.936914Z","signature_b64":"nKlOOE1LXIKtgL158hR3O7E6MjQyh3G9YO3Ne0i7/VQqV90NMwCDb5vUJqwZ9WnGHcWX+p2GI/2cUXBVpAxiDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"851beedddc33fad904ad77f4c6e93b3ff849ecf394570162833d0223539dad17","last_reissued_at":"2026-05-17T23:39:15.936299Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:15.936299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"It's All About Covers: Persistent Homology of Cover Refinements","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"Reframing persistent homology around cover refinements produces smaller filtrations with unconditional log-3 interleaving to Vietoris-Rips.","cross_cats":[],"primary_cat":"math.AT","authors_text":"Ant\\'onio Leit\\~ao","submitted_at":"2026-02-26T09:19:26Z","abstract_excerpt":"The computational cost of persistent homology is often dominated by the growth of the underlying simplicial filtrations. Many different filtrations exist, each with its own assumptions and trade-offs, but all face some form of this growth which can be exponential in the worst case, as for the Vietoris-Rips. We recast this problem at the level of covers, developing a framework in which filtrations and persistence modules can be constructed, analyzed, and compared through simple relations between covers rather than at the level of simplicial complexes. The guarantees propagate through any functo"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"The resulting filtration restores near-linear scaling in the number of data points and enables efficient capture of homology at high degrees while maintaining a log-3 interleaving unconditionally for any metric space.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the chosen cover refinements and the functors (Nerve, Co-Nerve) that preserve contiguity of refinement maps are sufficient to propagate the interleaving guarantees without additional metric-dependent conditions.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Cover refinements enable a near-linear-size approximation to the Vietoris-Rips filtration with unconditional log-3 interleaving that preserves persistent homology.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Reframing persistent homology around cover refinements produces smaller filtrations with unconditional log-3 interleaving to Vietoris-Rips.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"ef777091ec0470a55434177f02689adee7084e7e16b9c35646e3804c93c4f33c"},"source":{"id":"2602.22784","kind":"arxiv","version":2},"verdict":{"id":"acc3d624-b548-4272-9db8-1ad8f6003d38","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T19:27:57.741406Z","strongest_claim":"The resulting filtration restores near-linear scaling in the number of data points and enables efficient capture of homology at high degrees while maintaining a log-3 interleaving unconditionally for any metric space.","one_line_summary":"Cover refinements enable a near-linear-size approximation to the Vietoris-Rips filtration with unconditional log-3 interleaving that preserves persistent homology.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the chosen cover refinements and the functors (Nerve, Co-Nerve) that preserve contiguity of refinement maps are sufficient to propagate the interleaving guarantees without additional metric-dependent conditions.","pith_extraction_headline":"Reframing persistent homology around cover refinements produces smaller filtrations with unconditional log-3 interleaving to Vietoris-Rips."},"references":{"count":54,"sample":[{"doi":"","year":2024,"title":"Dory: Computation of persistence diagrams up to dimension two for Vietoris–Rips filtrations of large data sets","work_id":"be0af8d3-6567-4f14-828d-c1adec547d05","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2012,"title":"Strong homotopy types, nerves and collapses","work_id":"cd9989dc-2686-48c9-a61b-6681c521a073","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1007/s41468-021-00071-5","year":2021,"title":"Nicolas Bonneel, Julien Rabin, Gabriel Peyr ´e, and Hanspeter Pfister","work_id":"197988d0-9590-4e3d-9ed7-f4c81d5d2c02","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2017,"title":"Phat–persistent homology algorithms toolbox","work_id":"5d166663-77b6-4f62-a1c3-9f0515cdb2af","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1950,"title":"The Vietoris Mapping Theorem for Bicompact Spaces","work_id":"4d5fbcfe-3ffd-453b-9d5f-ac7840d047c8","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":54,"snapshot_sha256":"247293afb6ae4fd55021de99ffff585645e2f4a7d1c4a43dc58a934bb92919fe","internal_anchors":5},"formal_canon":{"evidence_count":2,"snapshot_sha256":"1b47649eeab727edd7b922b0a83e68dd699520f4820f8f8d0fc100b218b0692d"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2602.22784","created_at":"2026-05-17T23:39:15.936418+00:00"},{"alias_kind":"arxiv_version","alias_value":"2602.22784v2","created_at":"2026-05-17T23:39:15.936418+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.22784","created_at":"2026-05-17T23:39:15.936418+00:00"},{"alias_kind":"pith_short_12","alias_value":"QUN65XO4GP5N","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"QUN65XO4GP5NSBFN","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"QUN65XO4","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.07022","citing_title":"An Algebraic Introduction to Persistence","ref_index":141,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QUN65XO4GP5NSBFNO72MN2J3H7","json":"https://pith.science/pith/QUN65XO4GP5NSBFNO72MN2J3H7.json","graph_json":"https://pith.science/api/pith-number/QUN65XO4GP5NSBFNO72MN2J3H7/graph.json","events_json":"https://pith.science/api/pith-number/QUN65XO4GP5NSBFNO72MN2J3H7/events.json","paper":"https://pith.science/paper/QUN65XO4"},"agent_actions":{"view_html":"https://pith.science/pith/QUN65XO4GP5NSBFNO72MN2J3H7","download_json":"https://pith.science/pith/QUN65XO4GP5NSBFNO72MN2J3H7.json","view_paper":"https://pith.science/paper/QUN65XO4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2602.22784&json=true","fetch_graph":"https://pith.science/api/pith-number/QUN65XO4GP5NSBFNO72MN2J3H7/graph.json","fetch_events":"https://pith.science/api/pith-number/QUN65XO4GP5NSBFNO72MN2J3H7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QUN65XO4GP5NSBFNO72MN2J3H7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QUN65XO4GP5NSBFNO72MN2J3H7/action/storage_attestation","attest_author":"https://pith.science/pith/QUN65XO4GP5NSBFNO72MN2J3H7/action/author_attestation","sign_citation":"https://pith.science/pith/QUN65XO4GP5NSBFNO72MN2J3H7/action/citation_signature","submit_replication":"https://pith.science/pith/QUN65XO4GP5NSBFNO72MN2J3H7/action/replication_record"}},"created_at":"2026-05-17T23:39:15.936418+00:00","updated_at":"2026-05-17T23:39:15.936418+00:00"}