{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:4EM3OT6M4U4X6WD5BZ5Z2VZWYD","short_pith_number":"pith:4EM3OT6M","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"},"canonical_sha256":"e119b74fcce5397f587d0e7b9d5736c0e8c723450364b3aa2b283556d7175d89","source":{"kind":"arxiv","id":"1501.00267","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.00267","created_at":"2026-05-18T00:48:43Z"},{"alias_kind":"arxiv_version","alias_value":"1501.00267v1","created_at":"2026-05-18T00:48:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00267","created_at":"2026-05-18T00:48:43Z"},{"alias_kind":"pith_short_12","alias_value":"4EM3OT6M4U4X","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4EM3OT6M4U4X6WD5","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4EM3OT6M","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:4EM3OT6M4U4X6WD5BZ5Z2VZWYD","target":"record","payload":{"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"},"canonical_sha256":"e119b74fcce5397f587d0e7b9d5736c0e8c723450364b3aa2b283556d7175d89","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"},"source_kind":"arxiv","source_id":"1501.00267","source_version":1,"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:48:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BJqr5QfiOAhdQISuELlY64sND8Ye8plu2JJLSzBd+4qIF1DvHRezO+7Nc72pS1F1pjX341VyJARBh0hy46v+Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T13:52:50.627420Z"},"content_sha256":"910c1729e8438d7eb6b630e8ffca56885f13e6c6a81f93c36f1e0d7cdb46026b","schema_version":"1.0","event_id":"sha256:910c1729e8438d7eb6b630e8ffca56885f13e6c6a81f93c36f1e0d7cdb46026b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:4EM3OT6M4U4X6WD5BZ5Z2VZWYD","target":"graph","payload":{"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"},"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:48:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QYC5U7w1P6R8pBYl+D/a7ISiGMpTFP1URmAAuLXd9tMrPfnCtCSVWTgQDRcQ86doXMZshxufg6Ve71yu2MzyDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T13:52:50.627772Z"},"content_sha256":"42eb0d5e1d807afe0e9165532bf0533bea14c44e37ba2a58eadb486f570cd3c9","schema_version":"1.0","event_id":"sha256:42eb0d5e1d807afe0e9165532bf0533bea14c44e37ba2a58eadb486f570cd3c9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4EM3OT6M4U4X6WD5BZ5Z2VZWYD/bundle.json","state_url":"https://pith.science/pith/4EM3OT6M4U4X6WD5BZ5Z2VZWYD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4EM3OT6M4U4X6WD5BZ5Z2VZWYD/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-06-04T13:52:50Z","links":{"resolver":"https://pith.science/pith/4EM3OT6M4U4X6WD5BZ5Z2VZWYD","bundle":"https://pith.science/pith/4EM3OT6M4U4X6WD5BZ5Z2VZWYD/bundle.json","state":"https://pith.science/pith/4EM3OT6M4U4X6WD5BZ5Z2VZWYD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4EM3OT6M4U4X6WD5BZ5Z2VZWYD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:4EM3OT6M4U4X6WD5BZ5Z2VZWYD","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":"ce45016b5fdcd2ba9d1ddd4fc8508f0ebbdda090fa319b6dc787ac93cb2502f5","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-01T10:28:01Z","title_canon_sha256":"8b7baf74f45c3b9f7c320c8d4fc435d701cd4fb344e31972be66374b286b1090"},"schema_version":"1.0","source":{"id":"1501.00267","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.00267","created_at":"2026-05-18T00:48:43Z"},{"alias_kind":"arxiv_version","alias_value":"1501.00267v1","created_at":"2026-05-18T00:48:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00267","created_at":"2026-05-18T00:48:43Z"},{"alias_kind":"pith_short_12","alias_value":"4EM3OT6M4U4X","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4EM3OT6M4U4X6WD5","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4EM3OT6M","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:42eb0d5e1d807afe0e9165532bf0533bea14c44e37ba2a58eadb486f570cd3c9","target":"graph","created_at":"2026-05-18T00:48:43Z","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 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","authors_text":"Aleksander Madry, Damian Straszak, Jakub Tarnawski","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-01T10:28:01Z","title":"Fast Generation of Random Spanning Trees and the Effective Resistance Metric"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00267","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:910c1729e8438d7eb6b630e8ffca56885f13e6c6a81f93c36f1e0d7cdb46026b","target":"record","created_at":"2026-05-18T00:48:43Z","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":"ce45016b5fdcd2ba9d1ddd4fc8508f0ebbdda090fa319b6dc787ac93cb2502f5","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-01T10:28:01Z","title_canon_sha256":"8b7baf74f45c3b9f7c320c8d4fc435d701cd4fb344e31972be66374b286b1090"},"schema_version":"1.0","source":{"id":"1501.00267","kind":"arxiv","version":1}},"canonical_sha256":"e119b74fcce5397f587d0e7b9d5736c0e8c723450364b3aa2b283556d7175d89","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e119b74fcce5397f587d0e7b9d5736c0e8c723450364b3aa2b283556d7175d89","first_computed_at":"2026-05-18T00:48:43.373252Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:43.373252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LA1gIEzTJ/6CCI5pwzYK6q/LzvHosDKgCMqDuYwcYACM9WJMA6oabb/2TgzSTISjhTcTXMNUKMZMO+uSfTtXCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:43.373771Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.00267","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:910c1729e8438d7eb6b630e8ffca56885f13e6c6a81f93c36f1e0d7cdb46026b","sha256:42eb0d5e1d807afe0e9165532bf0533bea14c44e37ba2a58eadb486f570cd3c9"],"state_sha256":"0502082ceac5b5d6d575fe6992e1de50079f3799c596fef7393f17e87d8491a2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sADMsKT/av5yi8M/ZU+WTJqrwWERyEQX0a9j1qjiF4+ppUp+FPJr58I2ThotOX+sn+L3NRmiPOprMKc+tWuRBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T13:52:50.629741Z","bundle_sha256":"67f4e9ee0ae3b3e81420cdf92b3f59903972cefae6f1046d3705b4c7d3fbe6fc"}}