{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:C4CAIALMDONMURORQGUP5G5H2N","short_pith_number":"pith:C4CAIALM","schema_version":"1.0","canonical_sha256":"170404016c1b9aca45d181a8fe9ba7d342b0991a4d951be3cecd39082d5c1fe9","source":{"kind":"arxiv","id":"1606.00199","version":2},"attestation_state":"computed","paper":{"title":"Matroid Filtrations and Computational Persistent Homology","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.AT","authors_text":"Gregory Henselman, Robert Ghrist","submitted_at":"2016-06-01T09:59:03Z","abstract_excerpt":"This technical report introduces a novel approach to efficient computation in homological algebra over fields, with particular emphasis on computing the persistent homology of a filtered topological cell complex. The algorithms here presented rely on a novel relationship between discrete Morse theory, matroid theory, and classical matrix factorizations. We provide background, detail the algorithms, and benchmark the software implementation in the Eirene package."},"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":"1606.00199","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2016-06-01T09:59:03Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"1c2c2e5d53bdc0eeed8f23c420db6c73aa0e6233b88a0e2676ab91b665f88970","abstract_canon_sha256":"c77e99fc88d6b6c7f9f01d4cd509bdd26e369979d883a618d58407cfb2c7e606"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:44.543369Z","signature_b64":"CrtWj9ktbhcCtIttizoCszoW7SncYxJY8C0CZXPbWzwPsAmH1Lf0fd7dQ8Rx8lTOpCb+31wIVDdiNsRM3YJLCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"170404016c1b9aca45d181a8fe9ba7d342b0991a4d951be3cecd39082d5c1fe9","last_reissued_at":"2026-05-18T00:32:44.542639Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:44.542639Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Matroid Filtrations and Computational Persistent Homology","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.AT","authors_text":"Gregory Henselman, Robert Ghrist","submitted_at":"2016-06-01T09:59:03Z","abstract_excerpt":"This technical report introduces a novel approach to efficient computation in homological algebra over fields, with particular emphasis on computing the persistent homology of a filtered topological cell complex. The algorithms here presented rely on a novel relationship between discrete Morse theory, matroid theory, and classical matrix factorizations. We provide background, detail the algorithms, and benchmark the software implementation in the Eirene package."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.00199","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":""},"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":"1606.00199","created_at":"2026-05-18T00:32:44.542751+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.00199v2","created_at":"2026-05-18T00:32:44.542751+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00199","created_at":"2026-05-18T00:32:44.542751+00:00"},{"alias_kind":"pith_short_12","alias_value":"C4CAIALMDONM","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"C4CAIALMDONMUROR","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"C4CAIALM","created_at":"2026-05-18T12:30:09.641336+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2312.03925","citing_title":"Pruning vineyards: updating barcodes and representative cycles by removing simplices","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/C4CAIALMDONMURORQGUP5G5H2N","json":"https://pith.science/pith/C4CAIALMDONMURORQGUP5G5H2N.json","graph_json":"https://pith.science/api/pith-number/C4CAIALMDONMURORQGUP5G5H2N/graph.json","events_json":"https://pith.science/api/pith-number/C4CAIALMDONMURORQGUP5G5H2N/events.json","paper":"https://pith.science/paper/C4CAIALM"},"agent_actions":{"view_html":"https://pith.science/pith/C4CAIALMDONMURORQGUP5G5H2N","download_json":"https://pith.science/pith/C4CAIALMDONMURORQGUP5G5H2N.json","view_paper":"https://pith.science/paper/C4CAIALM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.00199&json=true","fetch_graph":"https://pith.science/api/pith-number/C4CAIALMDONMURORQGUP5G5H2N/graph.json","fetch_events":"https://pith.science/api/pith-number/C4CAIALMDONMURORQGUP5G5H2N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C4CAIALMDONMURORQGUP5G5H2N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C4CAIALMDONMURORQGUP5G5H2N/action/storage_attestation","attest_author":"https://pith.science/pith/C4CAIALMDONMURORQGUP5G5H2N/action/author_attestation","sign_citation":"https://pith.science/pith/C4CAIALMDONMURORQGUP5G5H2N/action/citation_signature","submit_replication":"https://pith.science/pith/C4CAIALMDONMURORQGUP5G5H2N/action/replication_record"}},"created_at":"2026-05-18T00:32:44.542751+00:00","updated_at":"2026-05-18T00:32:44.542751+00:00"}