{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:VQV5Y2HCTYLTIBYEYJ2F7IMUWX","short_pith_number":"pith:VQV5Y2HC","canonical_record":{"source":{"id":"1711.06455","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-17T08:30:28Z","cross_cats_sorted":["cs.DM","math.PR"],"title_canon_sha256":"4f4d014f80427597fa2eb52ccea13f55a71a783d8250296db95012db0c731b63","abstract_canon_sha256":"c78896aaca2d6e3d56d504c6dfc2eb48152ac1a01aa26f117eb716aa8b24ed2e"},"schema_version":"1.0"},"canonical_sha256":"ac2bdc68e29e17340704c2745fa194b5cb41d65a48d8df8c9064da32bb222b92","source":{"kind":"arxiv","id":"1711.06455","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.06455","created_at":"2026-05-18T00:30:21Z"},{"alias_kind":"arxiv_version","alias_value":"1711.06455v1","created_at":"2026-05-18T00:30:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06455","created_at":"2026-05-18T00:30:21Z"},{"alias_kind":"pith_short_12","alias_value":"VQV5Y2HCTYLT","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VQV5Y2HCTYLTIBYE","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VQV5Y2HC","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:VQV5Y2HCTYLTIBYEYJ2F7IMUWX","target":"record","payload":{"canonical_record":{"source":{"id":"1711.06455","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-17T08:30:28Z","cross_cats_sorted":["cs.DM","math.PR"],"title_canon_sha256":"4f4d014f80427597fa2eb52ccea13f55a71a783d8250296db95012db0c731b63","abstract_canon_sha256":"c78896aaca2d6e3d56d504c6dfc2eb48152ac1a01aa26f117eb716aa8b24ed2e"},"schema_version":"1.0"},"canonical_sha256":"ac2bdc68e29e17340704c2745fa194b5cb41d65a48d8df8c9064da32bb222b92","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:21.035148Z","signature_b64":"RcdXM62esAIKAzvxxoGcIhml9krkhlrRb4wbWt/q1MBvY+/jYZ8yTLSJhNE5SwxadIQEZ7Unf/MwBOncNAagAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac2bdc68e29e17340704c2745fa194b5cb41d65a48d8df8c9064da32bb222b92","last_reissued_at":"2026-05-18T00:30:21.034629Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:21.034629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.06455","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:30:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SLZfpGeWnR+/5xERCUP1/EeuaKl0YLOjEx7FDa6BEF3SIBOejf1NrR6RtVUJXtLlQhaEx+1lr2cTqf2B7HxLDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T17:42:51.159558Z"},"content_sha256":"ff1cf4d32a0291063d6b5524940ffd2d4238811d8c4a08fd1a88e812d1cb66bb","schema_version":"1.0","event_id":"sha256:ff1cf4d32a0291063d6b5524940ffd2d4238811d8c4a08fd1a88e812d1cb66bb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:VQV5Y2HCTYLTIBYEYJ2F7IMUWX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An almost-linear time algorithm for uniform random spanning tree generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.PR"],"primary_cat":"cs.DS","authors_text":"Aaron Schild","submitted_at":"2017-11-17T08:30:28Z","abstract_excerpt":"We give an $m^{1+o(1)}\\beta^{o(1)}$-time algorithm for generating a uniformly random spanning tree in an undirected, weighted graph with max-to-min weight ratio $\\beta$. We also give an $m^{1+o(1)}\\epsilon^{-o(1)}$-time algorithm for generating a random spanning tree with total variation distance $\\epsilon$ from the true uniform distribution. Our second algorithm's runtime does not depend on the edge weights. Our $m^{1+o(1)}\\beta^{o(1)}$-time algorithm is the first almost-linear time algorithm for the problem --- even on unweighted graphs --- and is the first subquadratic time algorithm for sp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06455","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:30:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V+95v2DXKapN54fJXsMA6qLx9xKjpI+256E+vzh8whqiGJu0Xo98L4bfn7V0vvbsQmjv0TRhixNNLbQPd7atAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T17:42:51.160041Z"},"content_sha256":"f9bac9bbde83f94d6d4c6091f73d83e1426ea1e60bbac0d2463cca7b0c5b1579","schema_version":"1.0","event_id":"sha256:f9bac9bbde83f94d6d4c6091f73d83e1426ea1e60bbac0d2463cca7b0c5b1579"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VQV5Y2HCTYLTIBYEYJ2F7IMUWX/bundle.json","state_url":"https://pith.science/pith/VQV5Y2HCTYLTIBYEYJ2F7IMUWX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VQV5Y2HCTYLTIBYEYJ2F7IMUWX/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-08-18T17:42:51Z","links":{"resolver":"https://pith.science/pith/VQV5Y2HCTYLTIBYEYJ2F7IMUWX","bundle":"https://pith.science/pith/VQV5Y2HCTYLTIBYEYJ2F7IMUWX/bundle.json","state":"https://pith.science/pith/VQV5Y2HCTYLTIBYEYJ2F7IMUWX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VQV5Y2HCTYLTIBYEYJ2F7IMUWX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VQV5Y2HCTYLTIBYEYJ2F7IMUWX","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":"c78896aaca2d6e3d56d504c6dfc2eb48152ac1a01aa26f117eb716aa8b24ed2e","cross_cats_sorted":["cs.DM","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-17T08:30:28Z","title_canon_sha256":"4f4d014f80427597fa2eb52ccea13f55a71a783d8250296db95012db0c731b63"},"schema_version":"1.0","source":{"id":"1711.06455","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.06455","created_at":"2026-05-18T00:30:21Z"},{"alias_kind":"arxiv_version","alias_value":"1711.06455v1","created_at":"2026-05-18T00:30:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06455","created_at":"2026-05-18T00:30:21Z"},{"alias_kind":"pith_short_12","alias_value":"VQV5Y2HCTYLT","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VQV5Y2HCTYLTIBYE","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VQV5Y2HC","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:f9bac9bbde83f94d6d4c6091f73d83e1426ea1e60bbac0d2463cca7b0c5b1579","target":"graph","created_at":"2026-05-18T00:30:21Z","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 give an $m^{1+o(1)}\\beta^{o(1)}$-time algorithm for generating a uniformly random spanning tree in an undirected, weighted graph with max-to-min weight ratio $\\beta$. We also give an $m^{1+o(1)}\\epsilon^{-o(1)}$-time algorithm for generating a random spanning tree with total variation distance $\\epsilon$ from the true uniform distribution. Our second algorithm's runtime does not depend on the edge weights. Our $m^{1+o(1)}\\beta^{o(1)}$-time algorithm is the first almost-linear time algorithm for the problem --- even on unweighted graphs --- and is the first subquadratic time algorithm for sp","authors_text":"Aaron Schild","cross_cats":["cs.DM","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-17T08:30:28Z","title":"An almost-linear time algorithm for uniform random spanning tree generation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06455","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:ff1cf4d32a0291063d6b5524940ffd2d4238811d8c4a08fd1a88e812d1cb66bb","target":"record","created_at":"2026-05-18T00:30:21Z","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":"c78896aaca2d6e3d56d504c6dfc2eb48152ac1a01aa26f117eb716aa8b24ed2e","cross_cats_sorted":["cs.DM","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-17T08:30:28Z","title_canon_sha256":"4f4d014f80427597fa2eb52ccea13f55a71a783d8250296db95012db0c731b63"},"schema_version":"1.0","source":{"id":"1711.06455","kind":"arxiv","version":1}},"canonical_sha256":"ac2bdc68e29e17340704c2745fa194b5cb41d65a48d8df8c9064da32bb222b92","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac2bdc68e29e17340704c2745fa194b5cb41d65a48d8df8c9064da32bb222b92","first_computed_at":"2026-05-18T00:30:21.034629Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:21.034629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RcdXM62esAIKAzvxxoGcIhml9krkhlrRb4wbWt/q1MBvY+/jYZ8yTLSJhNE5SwxadIQEZ7Unf/MwBOncNAagAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:21.035148Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.06455","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff1cf4d32a0291063d6b5524940ffd2d4238811d8c4a08fd1a88e812d1cb66bb","sha256:f9bac9bbde83f94d6d4c6091f73d83e1426ea1e60bbac0d2463cca7b0c5b1579"],"state_sha256":"650dd7b4fd01ce4870b5f451fb88194195afbda4d429e2e3d16cc442f5467b04"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/WD0D91lyX3/cO0bU50YAEeHCKrKnKQAwedULB7SfVRijq3GcahWnM39zh1q3HwjdNCKRNTI1kJl8S906agkAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T17:42:51.165559Z","bundle_sha256":"e987bd460613a15df62c1751d6e19cb5b6b38aad78d8bdd8207621fa49ebb95f"}}