{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CT47IDHSYIOO6T4YKGMZ3PWLTY","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":"288816c3564ed863e358fca9b8d66aef7ed087115288b581a12ed88e54f8bb28","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-05-06T12:01:40Z","title_canon_sha256":"1f4a76ac33b26a081d01759010f074d0c836d55512125d286afbda3ea754c791"},"schema_version":"1.0","source":{"id":"1605.01903","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.01903","created_at":"2026-05-18T00:06:21Z"},{"alias_kind":"arxiv_version","alias_value":"1605.01903v4","created_at":"2026-05-18T00:06:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01903","created_at":"2026-05-18T00:06:21Z"},{"alias_kind":"pith_short_12","alias_value":"CT47IDHSYIOO","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CT47IDHSYIOO6T4Y","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CT47IDHS","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:9cdb15ab74eace013804734aa9649a6a008493befffafbd0ee3147d20b3e8999","target":"graph","created_at":"2026-05-18T00:06:21Z","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":"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","authors_text":"Akka Zemmari, Arnaud Casteigts, John Michael Robson, Yves M\\'etivier","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-05-06T12:01:40Z","title":"Deterministic Leader Election Takes $\\Theta(D + \\log n)$ Bit Rounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01903","kind":"arxiv","version":4},"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:6743a73e2ee1076c2b51ea6c26493bd823751e67720e5dc277f33834a10c4842","target":"record","created_at":"2026-05-18T00:06:21Z","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":"288816c3564ed863e358fca9b8d66aef7ed087115288b581a12ed88e54f8bb28","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-05-06T12:01:40Z","title_canon_sha256":"1f4a76ac33b26a081d01759010f074d0c836d55512125d286afbda3ea754c791"},"schema_version":"1.0","source":{"id":"1605.01903","kind":"arxiv","version":4}},"canonical_sha256":"14f9f40cf2c21cef4f9851999dbecb9e283dd42a4989ec80ca5e012f3fde06d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"14f9f40cf2c21cef4f9851999dbecb9e283dd42a4989ec80ca5e012f3fde06d2","first_computed_at":"2026-05-18T00:06:21.069293Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:21.069293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hbmgm37D6IvIXiZ2/MFmahmgUQR7/8oh8QS82NPxwUgbEozT5ARLU0Ii9zGCET2F55qUgHTUgXcaOJg1Yp3KDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:21.069785Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.01903","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6743a73e2ee1076c2b51ea6c26493bd823751e67720e5dc277f33834a10c4842","sha256:9cdb15ab74eace013804734aa9649a6a008493befffafbd0ee3147d20b3e8999"],"state_sha256":"98c4584a4d9ae224b522453c964f65dfb70baa9affd7de90a770ca3d1fa00666"}