{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:QKEJDAHKHPFWTCBAI27L4IKZGH","short_pith_number":"pith:QKEJDAHK","schema_version":"1.0","canonical_sha256":"82889180ea3bcb69882046bebe215931ed2ef88c91224ddd3ce62eaf70539d54","source":{"kind":"arxiv","id":"2412.07805","version":1},"attestation_state":"computed","paper":{"title":"The distilled Vietoris Rips filtration for persistent homology and a new memory efficient algorithm","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.AT","authors_text":"Katharine Turner, Musashi Ayrton Koyama, Vanessa Robins","submitted_at":"2024-12-09T17:54:50Z","abstract_excerpt":"The long computational time and large memory requirements for computing Vietoris Rips persistent homology from point clouds remains a significant deterrent to its application to big data. This paper aims to reduce the memory footprint of these computations. It presents a new construction, the distilled Vietoris Rips filtration, and proves that its persistent homology is isomorphic to that of standard Vietoris Rips. The distilled complex is constructed using a discrete Morse vector field defined on the reduced Vietoris Rips complex. The algorithm for building and reducing the distilled filtrati"},"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":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2412.07805","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.AT","submitted_at":"2024-12-09T17:54:50Z","cross_cats_sorted":[],"title_canon_sha256":"93e789b62a115aa192dcbf429390d81d2ed674b9ab39815065299562e53b0419","abstract_canon_sha256":"88dbe506c582db3335646fb27f130499b64401085242c946507c35773d146d62"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:47:39.562059Z","signature_b64":"KrUXGN4/slr0+E0mKAhW/AQsrFTnUAXAdMNM4nrL31Zf5c7FIzWaC4HSzq8YjKtcmNmZqJoW2ayM1xVd42i7DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82889180ea3bcb69882046bebe215931ed2ef88c91224ddd3ce62eaf70539d54","last_reissued_at":"2026-07-05T09:47:39.561618Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:47:39.561618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The distilled Vietoris Rips filtration for persistent homology and a new memory efficient algorithm","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.AT","authors_text":"Katharine Turner, Musashi Ayrton Koyama, Vanessa Robins","submitted_at":"2024-12-09T17:54:50Z","abstract_excerpt":"The long computational time and large memory requirements for computing Vietoris Rips persistent homology from point clouds remains a significant deterrent to its application to big data. This paper aims to reduce the memory footprint of these computations. It presents a new construction, the distilled Vietoris Rips filtration, and proves that its persistent homology is isomorphic to that of standard Vietoris Rips. The distilled complex is constructed using a discrete Morse vector field defined on the reduced Vietoris Rips complex. The algorithm for building and reducing the distilled filtrati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.07805","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.07805/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"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":"2412.07805","created_at":"2026-07-05T09:47:39.561676+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.07805v1","created_at":"2026-07-05T09:47:39.561676+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.07805","created_at":"2026-07-05T09:47:39.561676+00:00"},{"alias_kind":"pith_short_12","alias_value":"QKEJDAHKHPFW","created_at":"2026-07-05T09:47:39.561676+00:00"},{"alias_kind":"pith_short_16","alias_value":"QKEJDAHKHPFWTCBA","created_at":"2026-07-05T09:47:39.561676+00:00"},{"alias_kind":"pith_short_8","alias_value":"QKEJDAHK","created_at":"2026-07-05T09:47:39.561676+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2602.22784","citing_title":"It's All About Covers: Persistent Homology of Cover Refinements","ref_index":42,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QKEJDAHKHPFWTCBAI27L4IKZGH","json":"https://pith.science/pith/QKEJDAHKHPFWTCBAI27L4IKZGH.json","graph_json":"https://pith.science/api/pith-number/QKEJDAHKHPFWTCBAI27L4IKZGH/graph.json","events_json":"https://pith.science/api/pith-number/QKEJDAHKHPFWTCBAI27L4IKZGH/events.json","paper":"https://pith.science/paper/QKEJDAHK"},"agent_actions":{"view_html":"https://pith.science/pith/QKEJDAHKHPFWTCBAI27L4IKZGH","download_json":"https://pith.science/pith/QKEJDAHKHPFWTCBAI27L4IKZGH.json","view_paper":"https://pith.science/paper/QKEJDAHK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.07805&json=true","fetch_graph":"https://pith.science/api/pith-number/QKEJDAHKHPFWTCBAI27L4IKZGH/graph.json","fetch_events":"https://pith.science/api/pith-number/QKEJDAHKHPFWTCBAI27L4IKZGH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QKEJDAHKHPFWTCBAI27L4IKZGH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QKEJDAHKHPFWTCBAI27L4IKZGH/action/storage_attestation","attest_author":"https://pith.science/pith/QKEJDAHKHPFWTCBAI27L4IKZGH/action/author_attestation","sign_citation":"https://pith.science/pith/QKEJDAHKHPFWTCBAI27L4IKZGH/action/citation_signature","submit_replication":"https://pith.science/pith/QKEJDAHKHPFWTCBAI27L4IKZGH/action/replication_record"}},"created_at":"2026-07-05T09:47:39.561676+00:00","updated_at":"2026-07-05T09:47:39.561676+00:00"}