{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:IWMSUBDPJMQWBO5G5XCB2QNXBL","short_pith_number":"pith:IWMSUBDP","schema_version":"1.0","canonical_sha256":"45992a046f4b2160bba6edc41d41b70af5f62d1158c1c846f08181f63bd1ed6b","source":{"kind":"arxiv","id":"1907.12119","version":2},"attestation_state":"computed","paper":{"title":"A Fast Minimum Degree Algorithm and Matching Lower Bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.DS","authors_text":"Animesh Fatehpuria, Matthew Fahrbach, Robert Cummings","submitted_at":"2019-07-28T17:57:21Z","abstract_excerpt":"The minimum degree algorithm is one of the most widely-used heuristics for reducing the cost of solving large sparse systems of linear equations. It has been studied for nearly half a century and has a rich history of bridging techniques from data structures, graph algorithms, and scientific computing. In this paper, we present a simple but novel combinatorial algorithm for computing an exact minimum degree elimination ordering in $O(nm)$ time, which improves on the best known time complexity of $O(n^3)$ and offers practical improvements for sparse systems with small values of $m$. Our approac"},"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":"1907.12119","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-28T17:57:21Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"3380b22901818f12691ca68df45f9f8b22606947eaac4f9b86ae85a95b160550","abstract_canon_sha256":"a2b7fa16f2e478769455ee0506dab6b264106d3f05e3e65676cd465fbe262d68"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:59:00.931202Z","signature_b64":"tvU6zMavd1Sfc6sx5q7z0q1W0CFofCXLt32l7pb67yGW8PjCVxkN3vfbym4sh8lbaeK8AzRI8Y0AyU2d3tcnAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45992a046f4b2160bba6edc41d41b70af5f62d1158c1c846f08181f63bd1ed6b","last_reissued_at":"2026-07-05T05:59:00.930737Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:59:00.930737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Fast Minimum Degree Algorithm and Matching Lower Bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.DS","authors_text":"Animesh Fatehpuria, Matthew Fahrbach, Robert Cummings","submitted_at":"2019-07-28T17:57:21Z","abstract_excerpt":"The minimum degree algorithm is one of the most widely-used heuristics for reducing the cost of solving large sparse systems of linear equations. It has been studied for nearly half a century and has a rich history of bridging techniques from data structures, graph algorithms, and scientific computing. In this paper, we present a simple but novel combinatorial algorithm for computing an exact minimum degree elimination ordering in $O(nm)$ time, which improves on the best known time complexity of $O(n^3)$ and offers practical improvements for sparse systems with small values of $m$. Our approac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.12119","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/1907.12119/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":"1907.12119","created_at":"2026-07-05T05:59:00.930795+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.12119v2","created_at":"2026-07-05T05:59:00.930795+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.12119","created_at":"2026-07-05T05:59:00.930795+00:00"},{"alias_kind":"pith_short_12","alias_value":"IWMSUBDPJMQW","created_at":"2026-07-05T05:59:00.930795+00:00"},{"alias_kind":"pith_short_16","alias_value":"IWMSUBDPJMQWBO5G","created_at":"2026-07-05T05:59:00.930795+00:00"},{"alias_kind":"pith_short_8","alias_value":"IWMSUBDP","created_at":"2026-07-05T05:59:00.930795+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/IWMSUBDPJMQWBO5G5XCB2QNXBL","json":"https://pith.science/pith/IWMSUBDPJMQWBO5G5XCB2QNXBL.json","graph_json":"https://pith.science/api/pith-number/IWMSUBDPJMQWBO5G5XCB2QNXBL/graph.json","events_json":"https://pith.science/api/pith-number/IWMSUBDPJMQWBO5G5XCB2QNXBL/events.json","paper":"https://pith.science/paper/IWMSUBDP"},"agent_actions":{"view_html":"https://pith.science/pith/IWMSUBDPJMQWBO5G5XCB2QNXBL","download_json":"https://pith.science/pith/IWMSUBDPJMQWBO5G5XCB2QNXBL.json","view_paper":"https://pith.science/paper/IWMSUBDP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.12119&json=true","fetch_graph":"https://pith.science/api/pith-number/IWMSUBDPJMQWBO5G5XCB2QNXBL/graph.json","fetch_events":"https://pith.science/api/pith-number/IWMSUBDPJMQWBO5G5XCB2QNXBL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IWMSUBDPJMQWBO5G5XCB2QNXBL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IWMSUBDPJMQWBO5G5XCB2QNXBL/action/storage_attestation","attest_author":"https://pith.science/pith/IWMSUBDPJMQWBO5G5XCB2QNXBL/action/author_attestation","sign_citation":"https://pith.science/pith/IWMSUBDPJMQWBO5G5XCB2QNXBL/action/citation_signature","submit_replication":"https://pith.science/pith/IWMSUBDPJMQWBO5G5XCB2QNXBL/action/replication_record"}},"created_at":"2026-07-05T05:59:00.930795+00:00","updated_at":"2026-07-05T05:59:00.930795+00:00"}