{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4EM3OT6M4U4X6WD5BZ5Z2VZWYD","short_pith_number":"pith:4EM3OT6M","schema_version":"1.0","canonical_sha256":"e119b74fcce5397f587d0e7b9d5736c0e8c723450364b3aa2b283556d7175d89","source":{"kind":"arxiv","id":"1501.00267","version":1},"attestation_state":"computed","paper":{"title":"Fast Generation of Random Spanning Trees and the Effective Resistance Metric","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Aleksander Madry, Damian Straszak, Jakub Tarnawski","submitted_at":"2015-01-01T10:28:01Z","abstract_excerpt":"We present a new algorithm for generating a uniformly random spanning tree in an undirected graph. Our algorithm samples such a tree in expected $\\tilde{O}(m^{4/3})$ time. This improves over the best previously known bound of $\\min(\\tilde{O}(m\\sqrt{n}),O(n^{\\omega}))$ -- that follows from the work of Kelner and M\\k{a}dry [FOCS'09] and of Colbourn et al. [J. Algorithms'96] -- whenever the input graph is sufficiently sparse.\n  At a high level, our result stems from carefully exploiting the interplay of random spanning trees, random walks, and the notion of effective resistance, as well as from d"},"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":"1501.00267","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-01T10:28:01Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"8b7baf74f45c3b9f7c320c8d4fc435d701cd4fb344e31972be66374b286b1090","abstract_canon_sha256":"ce45016b5fdcd2ba9d1ddd4fc8508f0ebbdda090fa319b6dc787ac93cb2502f5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:43.373771Z","signature_b64":"LA1gIEzTJ/6CCI5pwzYK6q/LzvHosDKgCMqDuYwcYACM9WJMA6oabb/2TgzSTISjhTcTXMNUKMZMO+uSfTtXCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e119b74fcce5397f587d0e7b9d5736c0e8c723450364b3aa2b283556d7175d89","last_reissued_at":"2026-05-18T00:48:43.373252Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:43.373252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Generation of Random Spanning Trees and the Effective Resistance Metric","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Aleksander Madry, Damian Straszak, Jakub Tarnawski","submitted_at":"2015-01-01T10:28:01Z","abstract_excerpt":"We present a new algorithm for generating a uniformly random spanning tree in an undirected graph. Our algorithm samples such a tree in expected $\\tilde{O}(m^{4/3})$ time. This improves over the best previously known bound of $\\min(\\tilde{O}(m\\sqrt{n}),O(n^{\\omega}))$ -- that follows from the work of Kelner and M\\k{a}dry [FOCS'09] and of Colbourn et al. [J. Algorithms'96] -- whenever the input graph is sufficiently sparse.\n  At a high level, our result stems from carefully exploiting the interplay of random spanning trees, random walks, and the notion of effective resistance, as well as from d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00267","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":"1501.00267","created_at":"2026-05-18T00:48:43.373343+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.00267v1","created_at":"2026-05-18T00:48:43.373343+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00267","created_at":"2026-05-18T00:48:43.373343+00:00"},{"alias_kind":"pith_short_12","alias_value":"4EM3OT6M4U4X","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4EM3OT6M4U4X6WD5","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4EM3OT6M","created_at":"2026-05-18T12:29:05.191682+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/4EM3OT6M4U4X6WD5BZ5Z2VZWYD","json":"https://pith.science/pith/4EM3OT6M4U4X6WD5BZ5Z2VZWYD.json","graph_json":"https://pith.science/api/pith-number/4EM3OT6M4U4X6WD5BZ5Z2VZWYD/graph.json","events_json":"https://pith.science/api/pith-number/4EM3OT6M4U4X6WD5BZ5Z2VZWYD/events.json","paper":"https://pith.science/paper/4EM3OT6M"},"agent_actions":{"view_html":"https://pith.science/pith/4EM3OT6M4U4X6WD5BZ5Z2VZWYD","download_json":"https://pith.science/pith/4EM3OT6M4U4X6WD5BZ5Z2VZWYD.json","view_paper":"https://pith.science/paper/4EM3OT6M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.00267&json=true","fetch_graph":"https://pith.science/api/pith-number/4EM3OT6M4U4X6WD5BZ5Z2VZWYD/graph.json","fetch_events":"https://pith.science/api/pith-number/4EM3OT6M4U4X6WD5BZ5Z2VZWYD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4EM3OT6M4U4X6WD5BZ5Z2VZWYD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4EM3OT6M4U4X6WD5BZ5Z2VZWYD/action/storage_attestation","attest_author":"https://pith.science/pith/4EM3OT6M4U4X6WD5BZ5Z2VZWYD/action/author_attestation","sign_citation":"https://pith.science/pith/4EM3OT6M4U4X6WD5BZ5Z2VZWYD/action/citation_signature","submit_replication":"https://pith.science/pith/4EM3OT6M4U4X6WD5BZ5Z2VZWYD/action/replication_record"}},"created_at":"2026-05-18T00:48:43.373343+00:00","updated_at":"2026-05-18T00:48:43.373343+00:00"}