{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4FFP3DUME56YHYFEWRYKUM2BAU","short_pith_number":"pith:4FFP3DUM","schema_version":"1.0","canonical_sha256":"e14afd8e8c277d83e0a4b470aa3341051f029b6bc472aef0d5bd70a9e508e40d","source":{"kind":"arxiv","id":"1705.00985","version":1},"attestation_state":"computed","paper":{"title":"Determinant-Preserving Sparsification of SDDM Matrices with Applications to Counting and Sampling Spanning Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anup B. Rao, David Durfee, John Peebles, Richard Peng","submitted_at":"2017-05-02T14:11:59Z","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"},"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":"1705.00985","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-02T14:11:59Z","cross_cats_sorted":[],"title_canon_sha256":"5ac8a327c475784f16d790b923598842878538bf516a0e9ed930fab130a53bd3","abstract_canon_sha256":"136287f7c8f5ac37ae861a3d3c6a91c91f7605a2df071233055937b3a01064ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:09.164880Z","signature_b64":"h+bI1fd+hU2SrWOWbnaYORHBrD8yyDKI/ZfI4ps6wQgdbBHj+nU8Pu/tVhf9TtjF1K8qHnlTTSHnWZnWsyGcAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e14afd8e8c277d83e0a4b470aa3341051f029b6bc472aef0d5bd70a9e508e40d","last_reissued_at":"2026-05-18T00:45:09.164218Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:09.164218Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Determinant-Preserving Sparsification of SDDM Matrices with Applications to Counting and Sampling Spanning Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anup B. Rao, David Durfee, John Peebles, Richard Peng","submitted_at":"2017-05-02T14:11:59Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.00985","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1705.00985","created_at":"2026-05-18T00:45:09.164335+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.00985v1","created_at":"2026-05-18T00:45:09.164335+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.00985","created_at":"2026-05-18T00:45:09.164335+00:00"},{"alias_kind":"pith_short_12","alias_value":"4FFP3DUME56Y","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"4FFP3DUME56YHYFE","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"4FFP3DUM","created_at":"2026-05-18T12:30:58.224056+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.14666","citing_title":"Approximate Spanning Tree Counting from Uncorrelated Edge Sets","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4FFP3DUME56YHYFEWRYKUM2BAU","json":"https://pith.science/pith/4FFP3DUME56YHYFEWRYKUM2BAU.json","graph_json":"https://pith.science/api/pith-number/4FFP3DUME56YHYFEWRYKUM2BAU/graph.json","events_json":"https://pith.science/api/pith-number/4FFP3DUME56YHYFEWRYKUM2BAU/events.json","paper":"https://pith.science/paper/4FFP3DUM"},"agent_actions":{"view_html":"https://pith.science/pith/4FFP3DUME56YHYFEWRYKUM2BAU","download_json":"https://pith.science/pith/4FFP3DUME56YHYFEWRYKUM2BAU.json","view_paper":"https://pith.science/paper/4FFP3DUM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.00985&json=true","fetch_graph":"https://pith.science/api/pith-number/4FFP3DUME56YHYFEWRYKUM2BAU/graph.json","fetch_events":"https://pith.science/api/pith-number/4FFP3DUME56YHYFEWRYKUM2BAU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4FFP3DUME56YHYFEWRYKUM2BAU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4FFP3DUME56YHYFEWRYKUM2BAU/action/storage_attestation","attest_author":"https://pith.science/pith/4FFP3DUME56YHYFEWRYKUM2BAU/action/author_attestation","sign_citation":"https://pith.science/pith/4FFP3DUME56YHYFEWRYKUM2BAU/action/citation_signature","submit_replication":"https://pith.science/pith/4FFP3DUME56YHYFEWRYKUM2BAU/action/replication_record"}},"created_at":"2026-05-18T00:45:09.164335+00:00","updated_at":"2026-05-18T00:45:09.164335+00:00"}