{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:PKUH3CC3HR635SBMYSJPY6VBPB","short_pith_number":"pith:PKUH3CC3","canonical_record":{"source":{"id":"1204.4106","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-17T18:52:27Z","cross_cats_sorted":["cs.DM","math.CO","math.PR"],"title_canon_sha256":"6a50c850bc887e0033aed6c7573e61651fe3e18eb4ea2e36373bbb2c1c4eb045","abstract_canon_sha256":"1ae86bd88226ba61c3275ef69bf5b13b836b3ad655cc83e72d6baf2266d3cce0"},"schema_version":"1.0"},"canonical_sha256":"7aa87d885b3c7dbec82cc492fc7aa1786fcb6c03a1395cf744b6da02c16eda7f","source":{"kind":"arxiv","id":"1204.4106","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.4106","created_at":"2026-05-18T00:54:04Z"},{"alias_kind":"arxiv_version","alias_value":"1204.4106v3","created_at":"2026-05-18T00:54:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.4106","created_at":"2026-05-18T00:54:04Z"},{"alias_kind":"pith_short_12","alias_value":"PKUH3CC3HR63","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"PKUH3CC3HR635SBM","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"PKUH3CC3","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:PKUH3CC3HR635SBMYSJPY6VBPB","target":"record","payload":{"canonical_record":{"source":{"id":"1204.4106","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-17T18:52:27Z","cross_cats_sorted":["cs.DM","math.CO","math.PR"],"title_canon_sha256":"6a50c850bc887e0033aed6c7573e61651fe3e18eb4ea2e36373bbb2c1c4eb045","abstract_canon_sha256":"1ae86bd88226ba61c3275ef69bf5b13b836b3ad655cc83e72d6baf2266d3cce0"},"schema_version":"1.0"},"canonical_sha256":"7aa87d885b3c7dbec82cc492fc7aa1786fcb6c03a1395cf744b6da02c16eda7f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:04.178344Z","signature_b64":"qd+5/SJa46+vc3d8Q25it6LiVH4gjAuDDUZsqappQlFV5uufl11q3EwXaNmHle7DRGO8y1INw0P8+cOE43HLAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7aa87d885b3c7dbec82cc492fc7aa1786fcb6c03a1395cf744b6da02c16eda7f","last_reissued_at":"2026-05-18T00:54:04.177954Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:04.177954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.4106","source_version":3,"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:54:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dFbBThxMTqFJ7Aqr7mszQ7He1UUH48zBR2v7suTrWh2r0AQ2UyFEBgGyZ+xpyUxieQHioYQ1cSX0fdMEVyYYAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T18:13:52.793344Z"},"content_sha256":"895499c37b5aacf7e1d5c9c1f3b7f9b8ff9859af543f66d1c70c43b70a4e7f75","schema_version":"1.0","event_id":"sha256:895499c37b5aacf7e1d5c9c1f3b7f9b8ff9859af543f66d1c70c43b70a4e7f75"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:PKUH3CC3HR635SBMYSJPY6VBPB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coalescing random walks and voting on connected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO","math.PR"],"primary_cat":"cs.DS","authors_text":"Colin Cooper, Hirotaka Ono, Robert Elsasser, Tomasz Radzik","submitted_at":"2012-04-17T18:52:27Z","abstract_excerpt":"In a coalescing random walk, a set of particles make independent random walks on a graph. Whenever one or more particles meet at a vertex, they unite to form a single particle, which then continues the random walk through the graph. Coalescing random walks can be used to achieve consensus in distributed networks, and is the basis of the self-stabilizing mutual exclusion algorithm of Israeli and Jalfon.\n  Let G=(V,E), be an undirected, connected n vertex graph with m edges. Let C(n) be the expected time for all particles to coalesce, when initially one particle is located at each vertex of an n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.4106","kind":"arxiv","version":3},"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:54:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fMG/Ij+dlHiYnISiQOBLp3HI5rkbBXJsNT4kcomx5ej6y2WzitQMNGgNymNseFodR8oWCEeTCypWrdLz72B6DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T18:13:52.794023Z"},"content_sha256":"0d89b2c7a9ce92730fc946828291e2f9da4eab2e6cd2e186b44b5a1767eb9a99","schema_version":"1.0","event_id":"sha256:0d89b2c7a9ce92730fc946828291e2f9da4eab2e6cd2e186b44b5a1767eb9a99"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PKUH3CC3HR635SBMYSJPY6VBPB/bundle.json","state_url":"https://pith.science/pith/PKUH3CC3HR635SBMYSJPY6VBPB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PKUH3CC3HR635SBMYSJPY6VBPB/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-29T18:13:52Z","links":{"resolver":"https://pith.science/pith/PKUH3CC3HR635SBMYSJPY6VBPB","bundle":"https://pith.science/pith/PKUH3CC3HR635SBMYSJPY6VBPB/bundle.json","state":"https://pith.science/pith/PKUH3CC3HR635SBMYSJPY6VBPB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PKUH3CC3HR635SBMYSJPY6VBPB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:PKUH3CC3HR635SBMYSJPY6VBPB","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":"1ae86bd88226ba61c3275ef69bf5b13b836b3ad655cc83e72d6baf2266d3cce0","cross_cats_sorted":["cs.DM","math.CO","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-17T18:52:27Z","title_canon_sha256":"6a50c850bc887e0033aed6c7573e61651fe3e18eb4ea2e36373bbb2c1c4eb045"},"schema_version":"1.0","source":{"id":"1204.4106","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.4106","created_at":"2026-05-18T00:54:04Z"},{"alias_kind":"arxiv_version","alias_value":"1204.4106v3","created_at":"2026-05-18T00:54:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.4106","created_at":"2026-05-18T00:54:04Z"},{"alias_kind":"pith_short_12","alias_value":"PKUH3CC3HR63","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"PKUH3CC3HR635SBM","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"PKUH3CC3","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:0d89b2c7a9ce92730fc946828291e2f9da4eab2e6cd2e186b44b5a1767eb9a99","target":"graph","created_at":"2026-05-18T00:54:04Z","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":"In a coalescing random walk, a set of particles make independent random walks on a graph. Whenever one or more particles meet at a vertex, they unite to form a single particle, which then continues the random walk through the graph. Coalescing random walks can be used to achieve consensus in distributed networks, and is the basis of the self-stabilizing mutual exclusion algorithm of Israeli and Jalfon.\n  Let G=(V,E), be an undirected, connected n vertex graph with m edges. Let C(n) be the expected time for all particles to coalesce, when initially one particle is located at each vertex of an n","authors_text":"Colin Cooper, Hirotaka Ono, Robert Elsasser, Tomasz Radzik","cross_cats":["cs.DM","math.CO","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-17T18:52:27Z","title":"Coalescing random walks and voting on connected graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.4106","kind":"arxiv","version":3},"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:895499c37b5aacf7e1d5c9c1f3b7f9b8ff9859af543f66d1c70c43b70a4e7f75","target":"record","created_at":"2026-05-18T00:54:04Z","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":"1ae86bd88226ba61c3275ef69bf5b13b836b3ad655cc83e72d6baf2266d3cce0","cross_cats_sorted":["cs.DM","math.CO","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-17T18:52:27Z","title_canon_sha256":"6a50c850bc887e0033aed6c7573e61651fe3e18eb4ea2e36373bbb2c1c4eb045"},"schema_version":"1.0","source":{"id":"1204.4106","kind":"arxiv","version":3}},"canonical_sha256":"7aa87d885b3c7dbec82cc492fc7aa1786fcb6c03a1395cf744b6da02c16eda7f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7aa87d885b3c7dbec82cc492fc7aa1786fcb6c03a1395cf744b6da02c16eda7f","first_computed_at":"2026-05-18T00:54:04.177954Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:04.177954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qd+5/SJa46+vc3d8Q25it6LiVH4gjAuDDUZsqappQlFV5uufl11q3EwXaNmHle7DRGO8y1INw0P8+cOE43HLAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:04.178344Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.4106","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:895499c37b5aacf7e1d5c9c1f3b7f9b8ff9859af543f66d1c70c43b70a4e7f75","sha256:0d89b2c7a9ce92730fc946828291e2f9da4eab2e6cd2e186b44b5a1767eb9a99"],"state_sha256":"0b69c21191db4da9bbfb5a2b0283f9fe8e68c9b8f5e8483d6a95ef3384371f9c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z6dB+ZfzliwxSbnEDo/DLtgjNYD6eC5dwqXkiJvGpIo05FtVz+PGFrAYCmj3IaeKfozJSLFqaUC/rfgIrRFBCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T18:13:52.797783Z","bundle_sha256":"2c1609ac70ae9779d2aa7e2531beddce21b03b40bbea236167151b7851d319ee"}}