{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:S2EB464QPBSTACRYRQPUOE2CEZ","short_pith_number":"pith:S2EB464Q","canonical_record":{"source":{"id":"1901.00342","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-01-02T12:42:39Z","cross_cats_sorted":[],"title_canon_sha256":"a35fc1ff484fa9c8bf8f23f38ce041c112bfe075c6beb9af30997548b20bb7d0","abstract_canon_sha256":"417849498cfa524a7b87cbb3c17415be1bf26336f39db36a9fe265633a93cf3b"},"schema_version":"1.0"},"canonical_sha256":"96881e7b907865300a388c1f47134226668e8ea206598e3303b7df394f48098b","source":{"kind":"arxiv","id":"1901.00342","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.00342","created_at":"2026-05-17T23:57:06Z"},{"alias_kind":"arxiv_version","alias_value":"1901.00342v1","created_at":"2026-05-17T23:57:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.00342","created_at":"2026-05-17T23:57:06Z"},{"alias_kind":"pith_short_12","alias_value":"S2EB464QPBST","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"S2EB464QPBSTACRY","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"S2EB464Q","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:S2EB464QPBSTACRYRQPUOE2CEZ","target":"record","payload":{"canonical_record":{"source":{"id":"1901.00342","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-01-02T12:42:39Z","cross_cats_sorted":[],"title_canon_sha256":"a35fc1ff484fa9c8bf8f23f38ce041c112bfe075c6beb9af30997548b20bb7d0","abstract_canon_sha256":"417849498cfa524a7b87cbb3c17415be1bf26336f39db36a9fe265633a93cf3b"},"schema_version":"1.0"},"canonical_sha256":"96881e7b907865300a388c1f47134226668e8ea206598e3303b7df394f48098b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:06.297392Z","signature_b64":"xbtCdByCSEF03b/uSobOdLNoTfR+HnRlxq0063PsZhGF5QGDfVWu8JT91MR1UdbyYtU6tuiK+ykm6A2DuED7DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96881e7b907865300a388c1f47134226668e8ea206598e3303b7df394f48098b","last_reissued_at":"2026-05-17T23:57:06.296751Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:06.296751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.00342","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-17T23:57:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"drrL6AW7xOIpfetVfNo62i0tlMt0E/tRo9YOXFowluLFiVS3OvVcDOezPB76tDNP5FZC/7iUJDrX54zTrR+1Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:58:55.778676Z"},"content_sha256":"a74a9033435fe2672514e128cec668e4f59fc50b4f33023549b6260d13858bf2","schema_version":"1.0","event_id":"sha256:a74a9033435fe2672514e128cec668e4f59fc50b4f33023549b6260d13858bf2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:S2EB464QPBSTACRYRQPUOE2CEZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Leader Election in Well-Connected Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Peter Robinson, Seth Gilbert, Suman Sourav","submitted_at":"2019-01-02T12:42:39Z","abstract_excerpt":"In this paper, we look at the problem of randomized leader election in synchronous distributed networks with a special focus on the message complexity. We provide an algorithm that solves the implicit version of leader election (where non-leader nodes need not be aware of the identity of the leader) in any general network with $O(\\sqrt{n} \\log^{7/2} n \\cdot t_{mix})$ messages and in $O(t_{mix}\\log^2 n)$ time, where $n$ is the number of nodes and $t_{mix}$ refers to the mixing time of a random walk in the network graph $G$. For several classes of well-connected networks (that have a large condu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.00342","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-17T23:57:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ntHeOYUf2WsAjTbx2uZCXckOsNFJu+UPfTlEHaNljX3nWGzgpXNaNW6D9xvjP5Y+/XIW22tPq3VR27bJ5FmSBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:58:55.779030Z"},"content_sha256":"6dec97968f3f0bb0be18b3740f30d1237063550299c677c44f2d1d5381693c30","schema_version":"1.0","event_id":"sha256:6dec97968f3f0bb0be18b3740f30d1237063550299c677c44f2d1d5381693c30"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S2EB464QPBSTACRYRQPUOE2CEZ/bundle.json","state_url":"https://pith.science/pith/S2EB464QPBSTACRYRQPUOE2CEZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S2EB464QPBSTACRYRQPUOE2CEZ/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-11T10:58:55Z","links":{"resolver":"https://pith.science/pith/S2EB464QPBSTACRYRQPUOE2CEZ","bundle":"https://pith.science/pith/S2EB464QPBSTACRYRQPUOE2CEZ/bundle.json","state":"https://pith.science/pith/S2EB464QPBSTACRYRQPUOE2CEZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S2EB464QPBSTACRYRQPUOE2CEZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:S2EB464QPBSTACRYRQPUOE2CEZ","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":"417849498cfa524a7b87cbb3c17415be1bf26336f39db36a9fe265633a93cf3b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-01-02T12:42:39Z","title_canon_sha256":"a35fc1ff484fa9c8bf8f23f38ce041c112bfe075c6beb9af30997548b20bb7d0"},"schema_version":"1.0","source":{"id":"1901.00342","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.00342","created_at":"2026-05-17T23:57:06Z"},{"alias_kind":"arxiv_version","alias_value":"1901.00342v1","created_at":"2026-05-17T23:57:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.00342","created_at":"2026-05-17T23:57:06Z"},{"alias_kind":"pith_short_12","alias_value":"S2EB464QPBST","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"S2EB464QPBSTACRY","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"S2EB464Q","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:6dec97968f3f0bb0be18b3740f30d1237063550299c677c44f2d1d5381693c30","target":"graph","created_at":"2026-05-17T23:57:06Z","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 this paper, we look at the problem of randomized leader election in synchronous distributed networks with a special focus on the message complexity. We provide an algorithm that solves the implicit version of leader election (where non-leader nodes need not be aware of the identity of the leader) in any general network with $O(\\sqrt{n} \\log^{7/2} n \\cdot t_{mix})$ messages and in $O(t_{mix}\\log^2 n)$ time, where $n$ is the number of nodes and $t_{mix}$ refers to the mixing time of a random walk in the network graph $G$. For several classes of well-connected networks (that have a large condu","authors_text":"Peter Robinson, Seth Gilbert, Suman Sourav","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-01-02T12:42:39Z","title":"Leader Election in Well-Connected Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.00342","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:a74a9033435fe2672514e128cec668e4f59fc50b4f33023549b6260d13858bf2","target":"record","created_at":"2026-05-17T23:57:06Z","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":"417849498cfa524a7b87cbb3c17415be1bf26336f39db36a9fe265633a93cf3b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-01-02T12:42:39Z","title_canon_sha256":"a35fc1ff484fa9c8bf8f23f38ce041c112bfe075c6beb9af30997548b20bb7d0"},"schema_version":"1.0","source":{"id":"1901.00342","kind":"arxiv","version":1}},"canonical_sha256":"96881e7b907865300a388c1f47134226668e8ea206598e3303b7df394f48098b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"96881e7b907865300a388c1f47134226668e8ea206598e3303b7df394f48098b","first_computed_at":"2026-05-17T23:57:06.296751Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:06.296751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xbtCdByCSEF03b/uSobOdLNoTfR+HnRlxq0063PsZhGF5QGDfVWu8JT91MR1UdbyYtU6tuiK+ykm6A2DuED7DQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:06.297392Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.00342","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a74a9033435fe2672514e128cec668e4f59fc50b4f33023549b6260d13858bf2","sha256:6dec97968f3f0bb0be18b3740f30d1237063550299c677c44f2d1d5381693c30"],"state_sha256":"4595ecad5bf128e019cc3e54bbd323585a0bc821712dd63844b2be82326028cc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"41Sw3+ALxw6KVdtZmVLY+UOVKN8wDfSrB08qXO6sLhUU5DBy24KjP/PjPiEQJDrICKzXEOJr8gDaoQL6zVLWDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T10:58:55.781273Z","bundle_sha256":"c553c6321d836939df5d71ec57a0f551221f7f66471c984c4b419e8206c4f46f"}}