{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:E3DMHLUR4MNPE6MSOW3XN4OSCY","short_pith_number":"pith:E3DMHLUR","schema_version":"1.0","canonical_sha256":"26c6c3ae91e31af2799275b776f1d21628b1d461476534fa76aafdc4ef049c09","source":{"kind":"arxiv","id":"1611.07451","version":2},"attestation_state":"computed","paper":{"title":"Sampling Random Spanning Trees Faster than Matrix Multiplication","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, Rasmus Kyng, Sushant Sachdeva","submitted_at":"2016-11-22T18:35:03Z","abstract_excerpt":"We present an algorithm that, with high probability, generates a random spanning tree from an edge-weighted undirected graph in $\\tilde{O}(n^{4/3}m^{1/2}+n^{2})$ time (The $\\tilde{O}(\\cdot)$ notation hides $\\operatorname{polylog}(n)$ factors). The tree is sampled from a distribution where the probability of each tree is proportional to the product of its edge weights. This improves upon the previous best algorithm due to Colbourn et al. that runs in matrix multiplication time, $O(n^\\omega)$. For the special case of unweighted graphs, this improves upon the best previously known running time of"},"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":"1611.07451","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-22T18:35:03Z","cross_cats_sorted":[],"title_canon_sha256":"6c8ad1e580f0321843d7391114325b9f016afb0655a86f9b5abbbfef572de965","abstract_canon_sha256":"e8d6bf475086bb7141f57cd4ca4046b79815ccd598a78a1faae50c0e62c101b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:58.091620Z","signature_b64":"+3v5e10k2ZtPRCi1m0xPCNh2KaFP7Dp2TfbUKOcJPQ3AHMl/YzAYlwAdv3wgAAnX4Vtdtqxc6oC3JrPfeJAkBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26c6c3ae91e31af2799275b776f1d21628b1d461476534fa76aafdc4ef049c09","last_reissued_at":"2026-05-18T00:41:58.090747Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:58.090747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sampling Random Spanning Trees Faster than Matrix Multiplication","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, Rasmus Kyng, Sushant Sachdeva","submitted_at":"2016-11-22T18:35:03Z","abstract_excerpt":"We present an algorithm that, with high probability, generates a random spanning tree from an edge-weighted undirected graph in $\\tilde{O}(n^{4/3}m^{1/2}+n^{2})$ time (The $\\tilde{O}(\\cdot)$ notation hides $\\operatorname{polylog}(n)$ factors). The tree is sampled from a distribution where the probability of each tree is proportional to the product of its edge weights. This improves upon the previous best algorithm due to Colbourn et al. that runs in matrix multiplication time, $O(n^\\omega)$. For the special case of unweighted graphs, this improves upon the best previously known running time of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07451","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":""},"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":"1611.07451","created_at":"2026-05-18T00:41:58.090862+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.07451v2","created_at":"2026-05-18T00:41:58.090862+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07451","created_at":"2026-05-18T00:41:58.090862+00:00"},{"alias_kind":"pith_short_12","alias_value":"E3DMHLUR4MNP","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"E3DMHLUR4MNPE6MS","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"E3DMHLUR","created_at":"2026-05-18T12:30:12.583610+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/E3DMHLUR4MNPE6MSOW3XN4OSCY","json":"https://pith.science/pith/E3DMHLUR4MNPE6MSOW3XN4OSCY.json","graph_json":"https://pith.science/api/pith-number/E3DMHLUR4MNPE6MSOW3XN4OSCY/graph.json","events_json":"https://pith.science/api/pith-number/E3DMHLUR4MNPE6MSOW3XN4OSCY/events.json","paper":"https://pith.science/paper/E3DMHLUR"},"agent_actions":{"view_html":"https://pith.science/pith/E3DMHLUR4MNPE6MSOW3XN4OSCY","download_json":"https://pith.science/pith/E3DMHLUR4MNPE6MSOW3XN4OSCY.json","view_paper":"https://pith.science/paper/E3DMHLUR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.07451&json=true","fetch_graph":"https://pith.science/api/pith-number/E3DMHLUR4MNPE6MSOW3XN4OSCY/graph.json","fetch_events":"https://pith.science/api/pith-number/E3DMHLUR4MNPE6MSOW3XN4OSCY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E3DMHLUR4MNPE6MSOW3XN4OSCY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E3DMHLUR4MNPE6MSOW3XN4OSCY/action/storage_attestation","attest_author":"https://pith.science/pith/E3DMHLUR4MNPE6MSOW3XN4OSCY/action/author_attestation","sign_citation":"https://pith.science/pith/E3DMHLUR4MNPE6MSOW3XN4OSCY/action/citation_signature","submit_replication":"https://pith.science/pith/E3DMHLUR4MNPE6MSOW3XN4OSCY/action/replication_record"}},"created_at":"2026-05-18T00:41:58.090862+00:00","updated_at":"2026-05-18T00:41:58.090862+00:00"}