{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:D7XXCNVATVJFJYYG4FFTA63EYK","short_pith_number":"pith:D7XXCNVA","canonical_record":{"source":{"id":"1711.08446","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-22T18:46:03Z","cross_cats_sorted":[],"title_canon_sha256":"c3bedbc15456a42188e25476489d95b4a4d38305e65316a54482d354591d22fa","abstract_canon_sha256":"6b18d0a7eb8b4621367ba1de30f7066e4ea5e63fabac968a795958437b031f8e"},"schema_version":"1.0"},"canonical_sha256":"1fef7136a09d5254e306e14b307b64c28e12f44907d3b608f453798bcbecb4a8","source":{"kind":"arxiv","id":"1711.08446","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.08446","created_at":"2026-05-18T00:29:49Z"},{"alias_kind":"arxiv_version","alias_value":"1711.08446v1","created_at":"2026-05-18T00:29:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08446","created_at":"2026-05-18T00:29:49Z"},{"alias_kind":"pith_short_12","alias_value":"D7XXCNVATVJF","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"D7XXCNVATVJFJYYG","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"D7XXCNVA","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:D7XXCNVATVJFJYYG4FFTA63EYK","target":"record","payload":{"canonical_record":{"source":{"id":"1711.08446","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-22T18:46:03Z","cross_cats_sorted":[],"title_canon_sha256":"c3bedbc15456a42188e25476489d95b4a4d38305e65316a54482d354591d22fa","abstract_canon_sha256":"6b18d0a7eb8b4621367ba1de30f7066e4ea5e63fabac968a795958437b031f8e"},"schema_version":"1.0"},"canonical_sha256":"1fef7136a09d5254e306e14b307b64c28e12f44907d3b608f453798bcbecb4a8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:49.770931Z","signature_b64":"cL150EAbvGgxnCaqBMnOJpoU6syvo95i6N7jFpm9s7azXha6JPG2vK2Iw4jaTH1xQotdBPu5MP8Wr31KzJBJDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1fef7136a09d5254e306e14b307b64c28e12f44907d3b608f453798bcbecb4a8","last_reissued_at":"2026-05-18T00:29:49.770390Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:49.770390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.08446","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:29:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Chx02HxtKlhrKDpq4/Bufh2c69kKXNa2sRgZWUAJ+r4eT5FrIJMR8kgaXCXMD2Up7e1Ydq5ZfcQWPN8+ttdBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T03:01:17.109886Z"},"content_sha256":"647ac4026729aac23404d99166bfbd835e79df02df18bf85cbc7c3e198ff8d0d","schema_version":"1.0","event_id":"sha256:647ac4026729aac23404d99166bfbd835e79df02df18bf85cbc7c3e198ff8d0d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:D7XXCNVATVJFJYYG4FFTA63EYK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Computing Min-Degree Elimination Orderings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gary L. Miller, Junxing Wang, Matthew Fahrbach, Richard Peng, Saurabh Sawlani, Shen Chen Xu","submitted_at":"2017-11-22T18:46:03Z","abstract_excerpt":"We study faster algorithms for producing the minimum degree ordering used to speed up Gaussian elimination. This ordering is based on viewing the non-zero elements of a symmetric positive definite matrix as edges of an undirected graph, and aims at reducing the additional non-zeros (fill) in the matrix by repeatedly removing the vertex of minimum degree. It is one of the most widely used primitives for pre-processing sparse matrices in scientific computing.\n  Our result is in part motivated by the observation that sub-quadratic time algorithms for finding min-degree orderings are unlikely, ass"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08446","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:29:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FOV3eFDcD+Tclw0bRztovyHX2JYEyIENh8b65JctHRELEla851Cb1BqbFftaYY2uH0tkjtm3qYG1ngXVylLTCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T03:01:17.110493Z"},"content_sha256":"31895c86929ac8a2bcd39300bbb1cb21a2bf86192912ee77366a0e550da472a8","schema_version":"1.0","event_id":"sha256:31895c86929ac8a2bcd39300bbb1cb21a2bf86192912ee77366a0e550da472a8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D7XXCNVATVJFJYYG4FFTA63EYK/bundle.json","state_url":"https://pith.science/pith/D7XXCNVATVJFJYYG4FFTA63EYK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D7XXCNVATVJFJYYG4FFTA63EYK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-23T03:01:17Z","links":{"resolver":"https://pith.science/pith/D7XXCNVATVJFJYYG4FFTA63EYK","bundle":"https://pith.science/pith/D7XXCNVATVJFJYYG4FFTA63EYK/bundle.json","state":"https://pith.science/pith/D7XXCNVATVJFJYYG4FFTA63EYK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D7XXCNVATVJFJYYG4FFTA63EYK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:D7XXCNVATVJFJYYG4FFTA63EYK","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6b18d0a7eb8b4621367ba1de30f7066e4ea5e63fabac968a795958437b031f8e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-22T18:46:03Z","title_canon_sha256":"c3bedbc15456a42188e25476489d95b4a4d38305e65316a54482d354591d22fa"},"schema_version":"1.0","source":{"id":"1711.08446","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.08446","created_at":"2026-05-18T00:29:49Z"},{"alias_kind":"arxiv_version","alias_value":"1711.08446v1","created_at":"2026-05-18T00:29:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08446","created_at":"2026-05-18T00:29:49Z"},{"alias_kind":"pith_short_12","alias_value":"D7XXCNVATVJF","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"D7XXCNVATVJFJYYG","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"D7XXCNVA","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:31895c86929ac8a2bcd39300bbb1cb21a2bf86192912ee77366a0e550da472a8","target":"graph","created_at":"2026-05-18T00:29:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We study faster algorithms for producing the minimum degree ordering used to speed up Gaussian elimination. This ordering is based on viewing the non-zero elements of a symmetric positive definite matrix as edges of an undirected graph, and aims at reducing the additional non-zeros (fill) in the matrix by repeatedly removing the vertex of minimum degree. It is one of the most widely used primitives for pre-processing sparse matrices in scientific computing.\n  Our result is in part motivated by the observation that sub-quadratic time algorithms for finding min-degree orderings are unlikely, ass","authors_text":"Gary L. Miller, Junxing Wang, Matthew Fahrbach, Richard Peng, Saurabh Sawlani, Shen Chen Xu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-22T18:46:03Z","title":"On Computing Min-Degree Elimination Orderings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08446","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:647ac4026729aac23404d99166bfbd835e79df02df18bf85cbc7c3e198ff8d0d","target":"record","created_at":"2026-05-18T00:29:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6b18d0a7eb8b4621367ba1de30f7066e4ea5e63fabac968a795958437b031f8e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-22T18:46:03Z","title_canon_sha256":"c3bedbc15456a42188e25476489d95b4a4d38305e65316a54482d354591d22fa"},"schema_version":"1.0","source":{"id":"1711.08446","kind":"arxiv","version":1}},"canonical_sha256":"1fef7136a09d5254e306e14b307b64c28e12f44907d3b608f453798bcbecb4a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1fef7136a09d5254e306e14b307b64c28e12f44907d3b608f453798bcbecb4a8","first_computed_at":"2026-05-18T00:29:49.770390Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:49.770390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cL150EAbvGgxnCaqBMnOJpoU6syvo95i6N7jFpm9s7azXha6JPG2vK2Iw4jaTH1xQotdBPu5MP8Wr31KzJBJDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:49.770931Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.08446","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:647ac4026729aac23404d99166bfbd835e79df02df18bf85cbc7c3e198ff8d0d","sha256:31895c86929ac8a2bcd39300bbb1cb21a2bf86192912ee77366a0e550da472a8"],"state_sha256":"777397485e22e1e8e823b1dd7db270938278109dbd277c5406ad9b75c9e17394"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bSCHB8wM4lhKwy0v3oOoyt8Z5C1WFwR9zpdgcd97nXo5Qsu9kt4QVTqZ7kAUbniPUtRWEO84EalGZqlnM3YRCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T03:01:17.113862Z","bundle_sha256":"02c2de1d49a6a8aa33fb8969afd8fdd0d3e4e287052529df0d9875f5a64975dd"}}