{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:CT47IDHSYIOO6T4YKGMZ3PWLTY","short_pith_number":"pith:CT47IDHS","schema_version":"1.0","canonical_sha256":"14f9f40cf2c21cef4f9851999dbecb9e283dd42a4989ec80ca5e012f3fde06d2","source":{"kind":"arxiv","id":"1605.01903","version":4},"attestation_state":"computed","paper":{"title":"Deterministic Leader Election Takes $\\Theta(D + \\log n)$ Bit Rounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Akka Zemmari, Arnaud Casteigts, John Michael Robson, Yves M\\'etivier","submitted_at":"2016-05-06T12:01:40Z","abstract_excerpt":"Leader election is, together with consensus, one of the most central problems in distributed computing. This paper presents a distributed algorithm, called \\STT, for electing deterministically a leader in an arbitrary network, assuming processors have unique identifiers of size $O(\\log n)$, where $n$ is the number of processors. It elects a leader in $O(D +\\log n)$ rounds, where $D$ is the diameter of the network, with messages of size $O(1)$. Thus it has a bit round complexity of $O(D +\\log n)$. This substantially improves upon the best known algorithm whose bit round complexity is $O(D\\log n"},"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":"1605.01903","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-05-06T12:01:40Z","cross_cats_sorted":[],"title_canon_sha256":"1f4a76ac33b26a081d01759010f074d0c836d55512125d286afbda3ea754c791","abstract_canon_sha256":"288816c3564ed863e358fca9b8d66aef7ed087115288b581a12ed88e54f8bb28"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:21.069785Z","signature_b64":"hbmgm37D6IvIXiZ2/MFmahmgUQR7/8oh8QS82NPxwUgbEozT5ARLU0Ii9zGCET2F55qUgHTUgXcaOJg1Yp3KDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14f9f40cf2c21cef4f9851999dbecb9e283dd42a4989ec80ca5e012f3fde06d2","last_reissued_at":"2026-05-18T00:06:21.069293Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:21.069293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deterministic Leader Election Takes $\\Theta(D + \\log n)$ Bit Rounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Akka Zemmari, Arnaud Casteigts, John Michael Robson, Yves M\\'etivier","submitted_at":"2016-05-06T12:01:40Z","abstract_excerpt":"Leader election is, together with consensus, one of the most central problems in distributed computing. This paper presents a distributed algorithm, called \\STT, for electing deterministically a leader in an arbitrary network, assuming processors have unique identifiers of size $O(\\log n)$, where $n$ is the number of processors. It elects a leader in $O(D +\\log n)$ rounds, where $D$ is the diameter of the network, with messages of size $O(1)$. Thus it has a bit round complexity of $O(D +\\log n)$. This substantially improves upon the best known algorithm whose bit round complexity is $O(D\\log n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01903","kind":"arxiv","version":4},"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":"1605.01903","created_at":"2026-05-18T00:06:21.069369+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.01903v4","created_at":"2026-05-18T00:06:21.069369+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01903","created_at":"2026-05-18T00:06:21.069369+00:00"},{"alias_kind":"pith_short_12","alias_value":"CT47IDHSYIOO","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"CT47IDHSYIOO6T4Y","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"CT47IDHS","created_at":"2026-05-18T12:30:09.641336+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/CT47IDHSYIOO6T4YKGMZ3PWLTY","json":"https://pith.science/pith/CT47IDHSYIOO6T4YKGMZ3PWLTY.json","graph_json":"https://pith.science/api/pith-number/CT47IDHSYIOO6T4YKGMZ3PWLTY/graph.json","events_json":"https://pith.science/api/pith-number/CT47IDHSYIOO6T4YKGMZ3PWLTY/events.json","paper":"https://pith.science/paper/CT47IDHS"},"agent_actions":{"view_html":"https://pith.science/pith/CT47IDHSYIOO6T4YKGMZ3PWLTY","download_json":"https://pith.science/pith/CT47IDHSYIOO6T4YKGMZ3PWLTY.json","view_paper":"https://pith.science/paper/CT47IDHS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.01903&json=true","fetch_graph":"https://pith.science/api/pith-number/CT47IDHSYIOO6T4YKGMZ3PWLTY/graph.json","fetch_events":"https://pith.science/api/pith-number/CT47IDHSYIOO6T4YKGMZ3PWLTY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CT47IDHSYIOO6T4YKGMZ3PWLTY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CT47IDHSYIOO6T4YKGMZ3PWLTY/action/storage_attestation","attest_author":"https://pith.science/pith/CT47IDHSYIOO6T4YKGMZ3PWLTY/action/author_attestation","sign_citation":"https://pith.science/pith/CT47IDHSYIOO6T4YKGMZ3PWLTY/action/citation_signature","submit_replication":"https://pith.science/pith/CT47IDHSYIOO6T4YKGMZ3PWLTY/action/replication_record"}},"created_at":"2026-05-18T00:06:21.069369+00:00","updated_at":"2026-05-18T00:06:21.069369+00:00"}