{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:HP2K6XE5IBEG35UL4764KXRMQT","short_pith_number":"pith:HP2K6XE5","canonical_record":{"source":{"id":"1210.4822","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-17T19:03:21Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"50c67e74f2ef1d0085231a4b7bc1b5aeb9ef6a18c424138fb484c2484bad135f","abstract_canon_sha256":"bc7d494c32ff1f2f415cf3d3c350e59315dce74da84df37e79c5a47516d460ba"},"schema_version":"1.0"},"canonical_sha256":"3bf4af5c9d40486df68be7fdc55e2c84fb64721063515ff6bb5559ece9a7a889","source":{"kind":"arxiv","id":"1210.4822","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.4822","created_at":"2026-05-18T03:25:43Z"},{"alias_kind":"arxiv_version","alias_value":"1210.4822v2","created_at":"2026-05-18T03:25:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4822","created_at":"2026-05-18T03:25:43Z"},{"alias_kind":"pith_short_12","alias_value":"HP2K6XE5IBEG","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"HP2K6XE5IBEG35UL","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"HP2K6XE5","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:HP2K6XE5IBEG35UL4764KXRMQT","target":"record","payload":{"canonical_record":{"source":{"id":"1210.4822","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-17T19:03:21Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"50c67e74f2ef1d0085231a4b7bc1b5aeb9ef6a18c424138fb484c2484bad135f","abstract_canon_sha256":"bc7d494c32ff1f2f415cf3d3c350e59315dce74da84df37e79c5a47516d460ba"},"schema_version":"1.0"},"canonical_sha256":"3bf4af5c9d40486df68be7fdc55e2c84fb64721063515ff6bb5559ece9a7a889","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:43.637252Z","signature_b64":"yjp06KVFYq5GUi3llnd9f2btEP6OYwMDutMBQ8EQ+8VJQAp7c0dkN2IM+1hUXpLsD96URvaLhEPFiXwl/dz0Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3bf4af5c9d40486df68be7fdc55e2c84fb64721063515ff6bb5559ece9a7a889","last_reissued_at":"2026-05-18T03:25:43.636446Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:43.636446Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.4822","source_version":2,"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-18T03:25:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vdYhNFT8EOEo5HNGvQeg5QcMkuR7m57zdwJLL3Sau0vEf0wSm0BMP0W9pyMQBnnJgzKr/5P98afv0dWNmGJ0CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:53:43.809922Z"},"content_sha256":"2984707b3763af791800d68cbac91dcde3518d18449d523bac2405a15c3d5f7a","schema_version":"1.0","event_id":"sha256:2984707b3763af791800d68cbac91dcde3518d18449d523bac2405a15c3d5f7a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:HP2K6XE5IBEG35UL4764KXRMQT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sublinear Bounds for Randomized Leader Election","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Amitabh Trehan, David Peleg, Gopal Pandurangan, Peter Robinson, Shay Kutten","submitted_at":"2012-10-17T19:03:21Z","abstract_excerpt":"This paper concerns {\\em randomized} leader election in synchronous distributed networks. A distributed leader election algorithm is presented for complete $n$-node networks that runs in O(1) rounds and (with high probability) uses only $O(\\sqrt{n}\\log^{3/2} n)$ messages to elect a unique leader (with high probability). When considering the \"explicit\" variant of leader election where eventually every node knows the identity of the leader, our algorithm yields the asymptotically optimal bounds of O(1) rounds and O(n) messages. This algorithm is then extended to one solving leader election on an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4822","kind":"arxiv","version":2},"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-18T03:25:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ocv6eq+dr52pMFglDgNH5QRq+u4Aj698tMd4y0MFFecq93YSwkiv10ofWfeQagCbpnJSrB3LrtvToomTm6zMCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:53:43.810569Z"},"content_sha256":"29974a56e4ce80011e9be651175d6529f207d5f3289dcf8e5bed26e6c717d303","schema_version":"1.0","event_id":"sha256:29974a56e4ce80011e9be651175d6529f207d5f3289dcf8e5bed26e6c717d303"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HP2K6XE5IBEG35UL4764KXRMQT/bundle.json","state_url":"https://pith.science/pith/HP2K6XE5IBEG35UL4764KXRMQT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HP2K6XE5IBEG35UL4764KXRMQT/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-27T20:53:43Z","links":{"resolver":"https://pith.science/pith/HP2K6XE5IBEG35UL4764KXRMQT","bundle":"https://pith.science/pith/HP2K6XE5IBEG35UL4764KXRMQT/bundle.json","state":"https://pith.science/pith/HP2K6XE5IBEG35UL4764KXRMQT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HP2K6XE5IBEG35UL4764KXRMQT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:HP2K6XE5IBEG35UL4764KXRMQT","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":"bc7d494c32ff1f2f415cf3d3c350e59315dce74da84df37e79c5a47516d460ba","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-17T19:03:21Z","title_canon_sha256":"50c67e74f2ef1d0085231a4b7bc1b5aeb9ef6a18c424138fb484c2484bad135f"},"schema_version":"1.0","source":{"id":"1210.4822","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.4822","created_at":"2026-05-18T03:25:43Z"},{"alias_kind":"arxiv_version","alias_value":"1210.4822v2","created_at":"2026-05-18T03:25:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4822","created_at":"2026-05-18T03:25:43Z"},{"alias_kind":"pith_short_12","alias_value":"HP2K6XE5IBEG","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"HP2K6XE5IBEG35UL","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"HP2K6XE5","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:29974a56e4ce80011e9be651175d6529f207d5f3289dcf8e5bed26e6c717d303","target":"graph","created_at":"2026-05-18T03:25: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":"This paper concerns {\\em randomized} leader election in synchronous distributed networks. A distributed leader election algorithm is presented for complete $n$-node networks that runs in O(1) rounds and (with high probability) uses only $O(\\sqrt{n}\\log^{3/2} n)$ messages to elect a unique leader (with high probability). When considering the \"explicit\" variant of leader election where eventually every node knows the identity of the leader, our algorithm yields the asymptotically optimal bounds of O(1) rounds and O(n) messages. This algorithm is then extended to one solving leader election on an","authors_text":"Amitabh Trehan, David Peleg, Gopal Pandurangan, Peter Robinson, Shay Kutten","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-17T19:03:21Z","title":"Sublinear Bounds for Randomized Leader Election"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4822","kind":"arxiv","version":2},"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:2984707b3763af791800d68cbac91dcde3518d18449d523bac2405a15c3d5f7a","target":"record","created_at":"2026-05-18T03:25: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":"bc7d494c32ff1f2f415cf3d3c350e59315dce74da84df37e79c5a47516d460ba","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-17T19:03:21Z","title_canon_sha256":"50c67e74f2ef1d0085231a4b7bc1b5aeb9ef6a18c424138fb484c2484bad135f"},"schema_version":"1.0","source":{"id":"1210.4822","kind":"arxiv","version":2}},"canonical_sha256":"3bf4af5c9d40486df68be7fdc55e2c84fb64721063515ff6bb5559ece9a7a889","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3bf4af5c9d40486df68be7fdc55e2c84fb64721063515ff6bb5559ece9a7a889","first_computed_at":"2026-05-18T03:25:43.636446Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:43.636446Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yjp06KVFYq5GUi3llnd9f2btEP6OYwMDutMBQ8EQ+8VJQAp7c0dkN2IM+1hUXpLsD96URvaLhEPFiXwl/dz0Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:43.637252Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.4822","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2984707b3763af791800d68cbac91dcde3518d18449d523bac2405a15c3d5f7a","sha256:29974a56e4ce80011e9be651175d6529f207d5f3289dcf8e5bed26e6c717d303"],"state_sha256":"9cd6d2943983fab206e358213d2dc8df233ed2fa65bec6f64ce5ae3613d2bfe2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OgAsfqIt9ZyQ41c5pbXx1ZYYy/eTCLeoFtNX4/RMEoXAlcknHLFs/vOvdSFCz1VUPIxmEfHv/gPBHz0GeykJDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T20:53:43.813769Z","bundle_sha256":"1a77448235124957c373e32b86463e4e30b1bf638835d7cca55a02b7afe9f44b"}}