{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6YAGK2EMER3RJIDUYQ3M6OZ7LA","short_pith_number":"pith:6YAGK2EM","canonical_record":{"source":{"id":"1711.07432","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-11-20T17:40:34Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"4d01bbc6d05d59944d85a798645fca013b2c71d5f7dd7ea30a20647ec365c88f","abstract_canon_sha256":"202d8ccba2e5503edc1e6c511e9ae15a5a7b82deae84f4857121c95dddfd9f27"},"schema_version":"1.0"},"canonical_sha256":"f60065688c247714a074c436cf3b3f58132b3d44ae5b1e01602e7714673de6e5","source":{"kind":"arxiv","id":"1711.07432","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.07432","created_at":"2026-05-18T00:30:10Z"},{"alias_kind":"arxiv_version","alias_value":"1711.07432v1","created_at":"2026-05-18T00:30:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07432","created_at":"2026-05-18T00:30:10Z"},{"alias_kind":"pith_short_12","alias_value":"6YAGK2EMER3R","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6YAGK2EMER3RJIDU","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6YAGK2EM","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6YAGK2EMER3RJIDUYQ3M6OZ7LA","target":"record","payload":{"canonical_record":{"source":{"id":"1711.07432","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-11-20T17:40:34Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"4d01bbc6d05d59944d85a798645fca013b2c71d5f7dd7ea30a20647ec365c88f","abstract_canon_sha256":"202d8ccba2e5503edc1e6c511e9ae15a5a7b82deae84f4857121c95dddfd9f27"},"schema_version":"1.0"},"canonical_sha256":"f60065688c247714a074c436cf3b3f58132b3d44ae5b1e01602e7714673de6e5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:10.192274Z","signature_b64":"V5Yd14K8ncarOIvD3XBPaqCgp1vUCETcxizi5nL73oRiGHjSP2+KO9hYY2GJPa/Xhd7o11JBT/ABrrJW5H3hCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f60065688c247714a074c436cf3b3f58132b3d44ae5b1e01602e7714673de6e5","last_reissued_at":"2026-05-18T00:30:10.191596Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:10.191596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.07432","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:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MKw7wZ6gBWDSjTEMPEgDm8z+1OiZlvNQNlxWPIJ2Y88BZOT8iQGoJMaFrppG3dlcLqXrZ1wMy9Y+CSfNkfLhDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T12:58:10.086477Z"},"content_sha256":"b4558a553c46247851334e29a714b22d2d0c7854f0b0840324d6c40993ecf2ff","schema_version":"1.0","event_id":"sha256:b4558a553c46247851334e29a714b22d2d0c7854f0b0840324d6c40993ecf2ff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6YAGK2EMER3RJIDUYQ3M6OZ7LA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A local graph rewiring algorithm for sampling spanning trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.DM","authors_text":"John Bulava, Neal McBride","submitted_at":"2017-11-20T17:40:34Z","abstract_excerpt":"We introduce a Markov Chain Monte Carlo algorithm which samples from the space of spanning trees of complete graphs using local rewiring operations only. The probability distribution of graphs of this kind is shown to depend on the symmetries of these graphs, which are reflected in the equilibrium distribution of the Markov chain. We prove that the algorithm is ergodic and proceed to estimate the probability distribution for small graph ensembles with exactly known probabilities. The autocorrelation time of the graph diameter demonstrates that the algorithm generates independent configurations"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07432","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:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QkV+hD02gfOObCPM7HG/FzESQQc/4Lkv6zi1gp3bK23LATnUktMeKt3CSZnvavvYf/kwRhEkLOvkTX7x4ZivAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T12:58:10.086826Z"},"content_sha256":"0d9b34392e7c1aa42ca587cb377eaa66477a7fefa3df302ca7c08642c89b2f69","schema_version":"1.0","event_id":"sha256:0d9b34392e7c1aa42ca587cb377eaa66477a7fefa3df302ca7c08642c89b2f69"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6YAGK2EMER3RJIDUYQ3M6OZ7LA/bundle.json","state_url":"https://pith.science/pith/6YAGK2EMER3RJIDUYQ3M6OZ7LA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6YAGK2EMER3RJIDUYQ3M6OZ7LA/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-23T12:58:10Z","links":{"resolver":"https://pith.science/pith/6YAGK2EMER3RJIDUYQ3M6OZ7LA","bundle":"https://pith.science/pith/6YAGK2EMER3RJIDUYQ3M6OZ7LA/bundle.json","state":"https://pith.science/pith/6YAGK2EMER3RJIDUYQ3M6OZ7LA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6YAGK2EMER3RJIDUYQ3M6OZ7LA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6YAGK2EMER3RJIDUYQ3M6OZ7LA","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":"202d8ccba2e5503edc1e6c511e9ae15a5a7b82deae84f4857121c95dddfd9f27","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-11-20T17:40:34Z","title_canon_sha256":"4d01bbc6d05d59944d85a798645fca013b2c71d5f7dd7ea30a20647ec365c88f"},"schema_version":"1.0","source":{"id":"1711.07432","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.07432","created_at":"2026-05-18T00:30:10Z"},{"alias_kind":"arxiv_version","alias_value":"1711.07432v1","created_at":"2026-05-18T00:30:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07432","created_at":"2026-05-18T00:30:10Z"},{"alias_kind":"pith_short_12","alias_value":"6YAGK2EMER3R","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6YAGK2EMER3RJIDU","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6YAGK2EM","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:0d9b34392e7c1aa42ca587cb377eaa66477a7fefa3df302ca7c08642c89b2f69","target":"graph","created_at":"2026-05-18T00:30:10Z","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 introduce a Markov Chain Monte Carlo algorithm which samples from the space of spanning trees of complete graphs using local rewiring operations only. The probability distribution of graphs of this kind is shown to depend on the symmetries of these graphs, which are reflected in the equilibrium distribution of the Markov chain. We prove that the algorithm is ergodic and proceed to estimate the probability distribution for small graph ensembles with exactly known probabilities. The autocorrelation time of the graph diameter demonstrates that the algorithm generates independent configurations","authors_text":"John Bulava, Neal McBride","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-11-20T17:40:34Z","title":"A local graph rewiring algorithm for sampling spanning trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07432","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:b4558a553c46247851334e29a714b22d2d0c7854f0b0840324d6c40993ecf2ff","target":"record","created_at":"2026-05-18T00:30:10Z","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":"202d8ccba2e5503edc1e6c511e9ae15a5a7b82deae84f4857121c95dddfd9f27","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-11-20T17:40:34Z","title_canon_sha256":"4d01bbc6d05d59944d85a798645fca013b2c71d5f7dd7ea30a20647ec365c88f"},"schema_version":"1.0","source":{"id":"1711.07432","kind":"arxiv","version":1}},"canonical_sha256":"f60065688c247714a074c436cf3b3f58132b3d44ae5b1e01602e7714673de6e5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f60065688c247714a074c436cf3b3f58132b3d44ae5b1e01602e7714673de6e5","first_computed_at":"2026-05-18T00:30:10.191596Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:10.191596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V5Yd14K8ncarOIvD3XBPaqCgp1vUCETcxizi5nL73oRiGHjSP2+KO9hYY2GJPa/Xhd7o11JBT/ABrrJW5H3hCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:10.192274Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.07432","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b4558a553c46247851334e29a714b22d2d0c7854f0b0840324d6c40993ecf2ff","sha256:0d9b34392e7c1aa42ca587cb377eaa66477a7fefa3df302ca7c08642c89b2f69"],"state_sha256":"0be9e79459adbe2e491a5e817cbdbe93ea2e98707e5ba1abe1dd3919806d2a5e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jd8HZyAbJxajsMPpG9nz/dOMScl0IwBGN+FaFAxUC0fc/83F7hZPJggInNgL2I5YO2L6pQDDaWk0VlpO1PRHCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T12:58:10.088684Z","bundle_sha256":"73b3520be26b8d49c21b27803bea2941662d49755b0a13b3f4e346522782b07c"}}