{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:BTNVGUS2QBBSLQZ7ALHY7R74WL","short_pith_number":"pith:BTNVGUS2","schema_version":"1.0","canonical_sha256":"0cdb53525a804325c33f02cf8fc7fcb2eef48abff442e2f5977fec7ec9ab36f0","source":{"kind":"arxiv","id":"2606.00245","version":1},"attestation_state":"computed","paper":{"title":"Towards fast computation of higher discrete homology","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AT","math.CO"],"primary_cat":"cs.CG","authors_text":"Chris Kapulkin, Jacob Ender","submitted_at":"2026-05-29T18:22:44Z","abstract_excerpt":"We develop a new algorithm for computing the second discrete homology group of a graph which is much faster when compared to existing algorithms. To do so, we identify five basic shapes, which are quotient graphs of the 3-cube with the property that the injective maps from them detect all possible 2-boundaries in the singular chain complex computing discrete homology."},"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":"2606.00245","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2026-05-29T18:22:44Z","cross_cats_sorted":["math.AT","math.CO"],"title_canon_sha256":"86466dbf0aec2f6d7f8d42419a49eea36eb8a809ba75018466b8425477d6639a","abstract_canon_sha256":"19037b9ad2f8ca48d5237ee73b4fa6c5abd25f687ea56adaa23b81738d88c36e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T01:03:22.635876Z","signature_b64":"NhVA8GPxUC+e94Nv2AR/MDwppxI7QFP6+WKaOkkeJ1fnKJmymRumREYASu3ZOI7QRgnrj6007ryEB4s+gYCiDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0cdb53525a804325c33f02cf8fc7fcb2eef48abff442e2f5977fec7ec9ab36f0","last_reissued_at":"2026-06-02T01:03:22.635514Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T01:03:22.635514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards fast computation of higher discrete homology","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AT","math.CO"],"primary_cat":"cs.CG","authors_text":"Chris Kapulkin, Jacob Ender","submitted_at":"2026-05-29T18:22:44Z","abstract_excerpt":"We develop a new algorithm for computing the second discrete homology group of a graph which is much faster when compared to existing algorithms. To do so, we identify five basic shapes, which are quotient graphs of the 3-cube with the property that the injective maps from them detect all possible 2-boundaries in the singular chain complex computing discrete homology."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.00245","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/2606.00245/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":"2606.00245","created_at":"2026-06-02T01:03:22.635576+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.00245v1","created_at":"2026-06-02T01:03:22.635576+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.00245","created_at":"2026-06-02T01:03:22.635576+00:00"},{"alias_kind":"pith_short_12","alias_value":"BTNVGUS2QBBS","created_at":"2026-06-02T01:03:22.635576+00:00"},{"alias_kind":"pith_short_16","alias_value":"BTNVGUS2QBBSLQZ7","created_at":"2026-06-02T01:03:22.635576+00:00"},{"alias_kind":"pith_short_8","alias_value":"BTNVGUS2","created_at":"2026-06-02T01:03:22.635576+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/BTNVGUS2QBBSLQZ7ALHY7R74WL","json":"https://pith.science/pith/BTNVGUS2QBBSLQZ7ALHY7R74WL.json","graph_json":"https://pith.science/api/pith-number/BTNVGUS2QBBSLQZ7ALHY7R74WL/graph.json","events_json":"https://pith.science/api/pith-number/BTNVGUS2QBBSLQZ7ALHY7R74WL/events.json","paper":"https://pith.science/paper/BTNVGUS2"},"agent_actions":{"view_html":"https://pith.science/pith/BTNVGUS2QBBSLQZ7ALHY7R74WL","download_json":"https://pith.science/pith/BTNVGUS2QBBSLQZ7ALHY7R74WL.json","view_paper":"https://pith.science/paper/BTNVGUS2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.00245&json=true","fetch_graph":"https://pith.science/api/pith-number/BTNVGUS2QBBSLQZ7ALHY7R74WL/graph.json","fetch_events":"https://pith.science/api/pith-number/BTNVGUS2QBBSLQZ7ALHY7R74WL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BTNVGUS2QBBSLQZ7ALHY7R74WL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BTNVGUS2QBBSLQZ7ALHY7R74WL/action/storage_attestation","attest_author":"https://pith.science/pith/BTNVGUS2QBBSLQZ7ALHY7R74WL/action/author_attestation","sign_citation":"https://pith.science/pith/BTNVGUS2QBBSLQZ7ALHY7R74WL/action/citation_signature","submit_replication":"https://pith.science/pith/BTNVGUS2QBBSLQZ7ALHY7R74WL/action/replication_record"}},"created_at":"2026-06-02T01:03:22.635576+00:00","updated_at":"2026-06-02T01:03:22.635576+00:00"}