{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:E3DMHLUR4MNPE6MSOW3XN4OSCY","short_pith_number":"pith:E3DMHLUR","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"},"canonical_sha256":"26c6c3ae91e31af2799275b776f1d21628b1d461476534fa76aafdc4ef049c09","source":{"kind":"arxiv","id":"1611.07451","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.07451","created_at":"2026-05-18T00:41:58Z"},{"alias_kind":"arxiv_version","alias_value":"1611.07451v2","created_at":"2026-05-18T00:41:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07451","created_at":"2026-05-18T00:41:58Z"},{"alias_kind":"pith_short_12","alias_value":"E3DMHLUR4MNP","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"E3DMHLUR4MNPE6MS","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"E3DMHLUR","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:E3DMHLUR4MNPE6MSOW3XN4OSCY","target":"record","payload":{"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"},"canonical_sha256":"26c6c3ae91e31af2799275b776f1d21628b1d461476534fa76aafdc4ef049c09","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"},"source_kind":"arxiv","source_id":"1611.07451","source_version":2,"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:41:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A34XFeeq8knsT3pVt/4HJtOUYx/hdEfoZT5wE1MWkh15xBEcneEFF0dasZI0djELsOaCsnJjrMfw7TuQppOLDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:52:07.949405Z"},"content_sha256":"fe8ed280563c4740a393bc6ab0db11799cfe0671585334c45c3dbf949b42416b","schema_version":"1.0","event_id":"sha256:fe8ed280563c4740a393bc6ab0db11799cfe0671585334c45c3dbf949b42416b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:E3DMHLUR4MNPE6MSOW3XN4OSCY","target":"graph","payload":{"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"},"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:41:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4cTNOYqCYAp9HNlkEGYQDPunyDnH39Oa08IBIL15Ps3XfzmU6yE9ikvqAstJK382Y4Y9n72vqZ1h84XKpXZ4Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:52:07.950153Z"},"content_sha256":"10319c800476b830d76f22c1e63e8532ea009a16648d7284f29ea4ff70788cde","schema_version":"1.0","event_id":"sha256:10319c800476b830d76f22c1e63e8532ea009a16648d7284f29ea4ff70788cde"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E3DMHLUR4MNPE6MSOW3XN4OSCY/bundle.json","state_url":"https://pith.science/pith/E3DMHLUR4MNPE6MSOW3XN4OSCY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E3DMHLUR4MNPE6MSOW3XN4OSCY/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-26T07:52:07Z","links":{"resolver":"https://pith.science/pith/E3DMHLUR4MNPE6MSOW3XN4OSCY","bundle":"https://pith.science/pith/E3DMHLUR4MNPE6MSOW3XN4OSCY/bundle.json","state":"https://pith.science/pith/E3DMHLUR4MNPE6MSOW3XN4OSCY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E3DMHLUR4MNPE6MSOW3XN4OSCY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:E3DMHLUR4MNPE6MSOW3XN4OSCY","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":"e8d6bf475086bb7141f57cd4ca4046b79815ccd598a78a1faae50c0e62c101b8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-22T18:35:03Z","title_canon_sha256":"6c8ad1e580f0321843d7391114325b9f016afb0655a86f9b5abbbfef572de965"},"schema_version":"1.0","source":{"id":"1611.07451","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.07451","created_at":"2026-05-18T00:41:58Z"},{"alias_kind":"arxiv_version","alias_value":"1611.07451v2","created_at":"2026-05-18T00:41:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07451","created_at":"2026-05-18T00:41:58Z"},{"alias_kind":"pith_short_12","alias_value":"E3DMHLUR4MNP","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"E3DMHLUR4MNPE6MS","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"E3DMHLUR","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:10319c800476b830d76f22c1e63e8532ea009a16648d7284f29ea4ff70788cde","target":"graph","created_at":"2026-05-18T00:41:58Z","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 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","authors_text":"Anup B. Rao, David Durfee, John Peebles, Rasmus Kyng, Sushant Sachdeva","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-22T18:35:03Z","title":"Sampling Random Spanning Trees Faster than Matrix Multiplication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07451","kind":"arxiv","version":2},"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:fe8ed280563c4740a393bc6ab0db11799cfe0671585334c45c3dbf949b42416b","target":"record","created_at":"2026-05-18T00:41:58Z","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":"e8d6bf475086bb7141f57cd4ca4046b79815ccd598a78a1faae50c0e62c101b8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-22T18:35:03Z","title_canon_sha256":"6c8ad1e580f0321843d7391114325b9f016afb0655a86f9b5abbbfef572de965"},"schema_version":"1.0","source":{"id":"1611.07451","kind":"arxiv","version":2}},"canonical_sha256":"26c6c3ae91e31af2799275b776f1d21628b1d461476534fa76aafdc4ef049c09","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"26c6c3ae91e31af2799275b776f1d21628b1d461476534fa76aafdc4ef049c09","first_computed_at":"2026-05-18T00:41:58.090747Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:58.090747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+3v5e10k2ZtPRCi1m0xPCNh2KaFP7Dp2TfbUKOcJPQ3AHMl/YzAYlwAdv3wgAAnX4Vtdtqxc6oC3JrPfeJAkBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:58.091620Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.07451","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fe8ed280563c4740a393bc6ab0db11799cfe0671585334c45c3dbf949b42416b","sha256:10319c800476b830d76f22c1e63e8532ea009a16648d7284f29ea4ff70788cde"],"state_sha256":"d92e41e8ce68fdd65e8747eef3a839f59c8292407a68c1fe4c397505a0175892"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n6NpwxvTFRPdZOhZjgFQ7UzzimEP4P79BI3corOEqNE0BTjwwQHBLIb8duOh65lKyLPPndqA8tubVuhPs8DRDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T07:52:07.954609Z","bundle_sha256":"888e95cbffddb7eeb8be6ebbef30c7db014a3e6fb321246a9e36b13bc9005727"}}