{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4FFP3DUME56YHYFEWRYKUM2BAU","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":"136287f7c8f5ac37ae861a3d3c6a91c91f7605a2df071233055937b3a01064ff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-02T14:11:59Z","title_canon_sha256":"5ac8a327c475784f16d790b923598842878538bf516a0e9ed930fab130a53bd3"},"schema_version":"1.0","source":{"id":"1705.00985","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.00985","created_at":"2026-05-18T00:45:09Z"},{"alias_kind":"arxiv_version","alias_value":"1705.00985v1","created_at":"2026-05-18T00:45:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.00985","created_at":"2026-05-18T00:45:09Z"},{"alias_kind":"pith_short_12","alias_value":"4FFP3DUME56Y","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"4FFP3DUME56YHYFE","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"4FFP3DUM","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:e8851a18d844f9d4f92a23c55e52406423d54d4cd1cab678e64a96e07fab5e09","target":"graph","created_at":"2026-05-18T00:45:09Z","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 show variants of spectral sparsification routines can preserve the total spanning tree counts of graphs, which by Kirchhoff's matrix-tree theorem, is equivalent to determinant of a graph Laplacian minor, or equivalently, of any SDDM matrix. Our analyses utilizes this combinatorial connection to bridge between statistical leverage scores / effective resistances and the analysis of random graphs by [Janson, Combinatorics, Probability and Computing `94]. This leads to a routine that in quadratic time, sparsifies a graph down to about $n^{1.5}$ edges in ways that preserve both the determinant a","authors_text":"Anup B. Rao, David Durfee, John Peebles, Richard Peng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-02T14:11:59Z","title":"Determinant-Preserving Sparsification of SDDM Matrices with Applications to Counting and Sampling Spanning Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.00985","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:3323c585cac09480946b657d47612212ab6a6223c7f5a0539aad030f6f5f86b0","target":"record","created_at":"2026-05-18T00:45:09Z","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":"136287f7c8f5ac37ae861a3d3c6a91c91f7605a2df071233055937b3a01064ff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-02T14:11:59Z","title_canon_sha256":"5ac8a327c475784f16d790b923598842878538bf516a0e9ed930fab130a53bd3"},"schema_version":"1.0","source":{"id":"1705.00985","kind":"arxiv","version":1}},"canonical_sha256":"e14afd8e8c277d83e0a4b470aa3341051f029b6bc472aef0d5bd70a9e508e40d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e14afd8e8c277d83e0a4b470aa3341051f029b6bc472aef0d5bd70a9e508e40d","first_computed_at":"2026-05-18T00:45:09.164218Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:09.164218Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h+bI1fd+hU2SrWOWbnaYORHBrD8yyDKI/ZfI4ps6wQgdbBHj+nU8Pu/tVhf9TtjF1K8qHnlTTSHnWZnWsyGcAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:09.164880Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.00985","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3323c585cac09480946b657d47612212ab6a6223c7f5a0539aad030f6f5f86b0","sha256:e8851a18d844f9d4f92a23c55e52406423d54d4cd1cab678e64a96e07fab5e09"],"state_sha256":"d2ff8bfe4e3423af82f9da1df15b89ff7ca4a78ae8172c36e10eaed9516573a0"}