{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:J4QVYAOOAEV7VTK4Y2CGOIUZXC","short_pith_number":"pith:J4QVYAOO","schema_version":"1.0","canonical_sha256":"4f215c01ce012bfacd5cc684672299b88f6dd0e90debf0b6e7bedcf4afe26747","source":{"kind":"arxiv","id":"1903.00783","version":2},"attestation_state":"computed","paper":{"title":"Chain complex reduction via fast digraph traversal","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AT","authors_text":"Leon Lampret","submitted_at":"2019-03-02T22:36:55Z","abstract_excerpt":"Reducing a chain complex (whilst preserving its homotopy-type) using algebraic Morse theory gives the same end-result as Gaussian elimination, but AMT does it only on certain rows/columns and with several pivots (in all matrices simultaneously). Crucially, instead of doing costly row/column operations on a sparse matrix, it computes traversals of a bipartite digraph. This significantly reduces the running time and memory load (smaller fill-in and coefficient growth of the matrices). However, computing with AMT requires the construction of a valid set of pivots (called a Morse matching).\n  We d"},"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":"1903.00783","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2019-03-02T22:36:55Z","cross_cats_sorted":[],"title_canon_sha256":"fe790383ab887401478e43fe5e697b709d677ac6e947ae142b875877bf22fbd6","abstract_canon_sha256":"e03fec714e88bf1c1da8d8f63424b90421a0dbec41249eef4a49d9975058abbd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:39:40.630261Z","signature_b64":"9WYiROLkhmaMojAKPgJC3QQPoG+7js8n+5hngm+a5BydwpWlEKQLxBHmhTdAXwSyA4/mStVrGDA5HrLEl5YMBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f215c01ce012bfacd5cc684672299b88f6dd0e90debf0b6e7bedcf4afe26747","last_reissued_at":"2026-07-05T01:39:40.629859Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:39:40.629859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Chain complex reduction via fast digraph traversal","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AT","authors_text":"Leon Lampret","submitted_at":"2019-03-02T22:36:55Z","abstract_excerpt":"Reducing a chain complex (whilst preserving its homotopy-type) using algebraic Morse theory gives the same end-result as Gaussian elimination, but AMT does it only on certain rows/columns and with several pivots (in all matrices simultaneously). Crucially, instead of doing costly row/column operations on a sparse matrix, it computes traversals of a bipartite digraph. This significantly reduces the running time and memory load (smaller fill-in and coefficient growth of the matrices). However, computing with AMT requires the construction of a valid set of pivots (called a Morse matching).\n  We d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.00783","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/1903.00783/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":"1903.00783","created_at":"2026-07-05T01:39:40.629920+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.00783v2","created_at":"2026-07-05T01:39:40.629920+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.00783","created_at":"2026-07-05T01:39:40.629920+00:00"},{"alias_kind":"pith_short_12","alias_value":"J4QVYAOOAEV7","created_at":"2026-07-05T01:39:40.629920+00:00"},{"alias_kind":"pith_short_16","alias_value":"J4QVYAOOAEV7VTK4","created_at":"2026-07-05T01:39:40.629920+00:00"},{"alias_kind":"pith_short_8","alias_value":"J4QVYAOO","created_at":"2026-07-05T01:39:40.629920+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.02518","citing_title":"Ripser: efficient computation of Vietoris-Rips persistence barcodes","ref_index":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J4QVYAOOAEV7VTK4Y2CGOIUZXC","json":"https://pith.science/pith/J4QVYAOOAEV7VTK4Y2CGOIUZXC.json","graph_json":"https://pith.science/api/pith-number/J4QVYAOOAEV7VTK4Y2CGOIUZXC/graph.json","events_json":"https://pith.science/api/pith-number/J4QVYAOOAEV7VTK4Y2CGOIUZXC/events.json","paper":"https://pith.science/paper/J4QVYAOO"},"agent_actions":{"view_html":"https://pith.science/pith/J4QVYAOOAEV7VTK4Y2CGOIUZXC","download_json":"https://pith.science/pith/J4QVYAOOAEV7VTK4Y2CGOIUZXC.json","view_paper":"https://pith.science/paper/J4QVYAOO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.00783&json=true","fetch_graph":"https://pith.science/api/pith-number/J4QVYAOOAEV7VTK4Y2CGOIUZXC/graph.json","fetch_events":"https://pith.science/api/pith-number/J4QVYAOOAEV7VTK4Y2CGOIUZXC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J4QVYAOOAEV7VTK4Y2CGOIUZXC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J4QVYAOOAEV7VTK4Y2CGOIUZXC/action/storage_attestation","attest_author":"https://pith.science/pith/J4QVYAOOAEV7VTK4Y2CGOIUZXC/action/author_attestation","sign_citation":"https://pith.science/pith/J4QVYAOOAEV7VTK4Y2CGOIUZXC/action/citation_signature","submit_replication":"https://pith.science/pith/J4QVYAOOAEV7VTK4Y2CGOIUZXC/action/replication_record"}},"created_at":"2026-07-05T01:39:40.629920+00:00","updated_at":"2026-07-05T01:39:40.629920+00:00"}