{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:VDQSRDRCDR6TSWH66OKQC3TFKH","short_pith_number":"pith:VDQSRDRC","schema_version":"1.0","canonical_sha256":"a8e1288e221c7d3958fef395016e6551ef081adf21689a83b2cae0664936006b","source":{"kind":"arxiv","id":"2303.11193","version":2},"attestation_state":"computed","paper":{"title":"Efficient two-parameter persistence computation via cohomology","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.AT","authors_text":"Fabian Lenzen, Michael Lesnick, Ulrich Bauer","submitted_at":"2023-03-20T15:22:58Z","abstract_excerpt":"Clearing is a simple but effective optimization for the standard algorithm of persistent homology (PH), which dramatically improves the speed and scalability of PH computations for Vietoris--Rips filtrations. Due to the quick growth of the boundary matrices of a Vietoris--Rips filtration with increasing dimension, clearing is only effective when used in conjunction with a dual (cohomological) variant of the standard algorithm. This approach has not previously been applied successfully to the computation of two-parameter PH.\n  We introduce a cohomological algorithm for computing minimal free re"},"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":"2303.11193","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.AT","submitted_at":"2023-03-20T15:22:58Z","cross_cats_sorted":[],"title_canon_sha256":"baa14a9a833f385ca1b1c5ae77558b3545a08fc5dfeba969ea1af38f61a082bb","abstract_canon_sha256":"2d2c86fad78eeb69e06b784bbea88d420403a29209f90a72bc66e87beac3c32e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:37:13.200866Z","signature_b64":"VuXsVB3094Tr3fpXjMFXGvmHhyILpZXWd02o5ljXeRuFcUg9E+uS/v6p5CcKAN8C78Y6iAl91q7Zr6fzTpWeCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8e1288e221c7d3958fef395016e6551ef081adf21689a83b2cae0664936006b","last_reissued_at":"2026-07-05T06:37:13.200406Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:37:13.200406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient two-parameter persistence computation via cohomology","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.AT","authors_text":"Fabian Lenzen, Michael Lesnick, Ulrich Bauer","submitted_at":"2023-03-20T15:22:58Z","abstract_excerpt":"Clearing is a simple but effective optimization for the standard algorithm of persistent homology (PH), which dramatically improves the speed and scalability of PH computations for Vietoris--Rips filtrations. Due to the quick growth of the boundary matrices of a Vietoris--Rips filtration with increasing dimension, clearing is only effective when used in conjunction with a dual (cohomological) variant of the standard algorithm. This approach has not previously been applied successfully to the computation of two-parameter PH.\n  We introduce a cohomological algorithm for computing minimal free re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.11193","kind":"arxiv","version":2},"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/2303.11193/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":"2303.11193","created_at":"2026-07-05T06:37:13.200462+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.11193v2","created_at":"2026-07-05T06:37:13.200462+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.11193","created_at":"2026-07-05T06:37:13.200462+00:00"},{"alias_kind":"pith_short_12","alias_value":"VDQSRDRCDR6T","created_at":"2026-07-05T06:37:13.200462+00:00"},{"alias_kind":"pith_short_16","alias_value":"VDQSRDRCDR6TSWH6","created_at":"2026-07-05T06:37:13.200462+00:00"},{"alias_kind":"pith_short_8","alias_value":"VDQSRDRC","created_at":"2026-07-05T06:37:13.200462+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VDQSRDRCDR6TSWH66OKQC3TFKH","json":"https://pith.science/pith/VDQSRDRCDR6TSWH66OKQC3TFKH.json","graph_json":"https://pith.science/api/pith-number/VDQSRDRCDR6TSWH66OKQC3TFKH/graph.json","events_json":"https://pith.science/api/pith-number/VDQSRDRCDR6TSWH66OKQC3TFKH/events.json","paper":"https://pith.science/paper/VDQSRDRC"},"agent_actions":{"view_html":"https://pith.science/pith/VDQSRDRCDR6TSWH66OKQC3TFKH","download_json":"https://pith.science/pith/VDQSRDRCDR6TSWH66OKQC3TFKH.json","view_paper":"https://pith.science/paper/VDQSRDRC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.11193&json=true","fetch_graph":"https://pith.science/api/pith-number/VDQSRDRCDR6TSWH66OKQC3TFKH/graph.json","fetch_events":"https://pith.science/api/pith-number/VDQSRDRCDR6TSWH66OKQC3TFKH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VDQSRDRCDR6TSWH66OKQC3TFKH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VDQSRDRCDR6TSWH66OKQC3TFKH/action/storage_attestation","attest_author":"https://pith.science/pith/VDQSRDRCDR6TSWH66OKQC3TFKH/action/author_attestation","sign_citation":"https://pith.science/pith/VDQSRDRCDR6TSWH66OKQC3TFKH/action/citation_signature","submit_replication":"https://pith.science/pith/VDQSRDRCDR6TSWH66OKQC3TFKH/action/replication_record"}},"created_at":"2026-07-05T06:37:13.200462+00:00","updated_at":"2026-07-05T06:37:13.200462+00:00"}