{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:HP2K6XE5IBEG35UL4764KXRMQT","short_pith_number":"pith:HP2K6XE5","schema_version":"1.0","canonical_sha256":"3bf4af5c9d40486df68be7fdc55e2c84fb64721063515ff6bb5559ece9a7a889","source":{"kind":"arxiv","id":"1210.4822","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1210.4822","created_at":"2026-05-18T03:25:43.636584+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.4822v2","created_at":"2026-05-18T03:25:43.636584+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4822","created_at":"2026-05-18T03:25:43.636584+00:00"},{"alias_kind":"pith_short_12","alias_value":"HP2K6XE5IBEG","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"HP2K6XE5IBEG35UL","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"HP2K6XE5","created_at":"2026-05-18T12:27:09.501522+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HP2K6XE5IBEG35UL4764KXRMQT","json":"https://pith.science/pith/HP2K6XE5IBEG35UL4764KXRMQT.json","graph_json":"https://pith.science/api/pith-number/HP2K6XE5IBEG35UL4764KXRMQT/graph.json","events_json":"https://pith.science/api/pith-number/HP2K6XE5IBEG35UL4764KXRMQT/events.json","paper":"https://pith.science/paper/HP2K6XE5"},"agent_actions":{"view_html":"https://pith.science/pith/HP2K6XE5IBEG35UL4764KXRMQT","download_json":"https://pith.science/pith/HP2K6XE5IBEG35UL4764KXRMQT.json","view_paper":"https://pith.science/paper/HP2K6XE5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.4822&json=true","fetch_graph":"https://pith.science/api/pith-number/HP2K6XE5IBEG35UL4764KXRMQT/graph.json","fetch_events":"https://pith.science/api/pith-number/HP2K6XE5IBEG35UL4764KXRMQT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HP2K6XE5IBEG35UL4764KXRMQT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HP2K6XE5IBEG35UL4764KXRMQT/action/storage_attestation","attest_author":"https://pith.science/pith/HP2K6XE5IBEG35UL4764KXRMQT/action/author_attestation","sign_citation":"https://pith.science/pith/HP2K6XE5IBEG35UL4764KXRMQT/action/citation_signature","submit_replication":"https://pith.science/pith/HP2K6XE5IBEG35UL4764KXRMQT/action/replication_record"}},"created_at":"2026-05-18T03:25:43.636584+00:00","updated_at":"2026-05-18T03:25:43.636584+00:00"}