{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:O6WC7UO2ZKSTYVUTOHGZB5DMSC","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":"4fe1e7174705e86cbbeaeb3c2ecee42c0348bba20cc6cf3f6d5deca47520398f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2017-02-24T14:35:57Z","title_canon_sha256":"ce1a3e10cb4da9c28ba3dc34e0ee2189c4bb2bfa56a8750ea4ee0b686ae6c479"},"schema_version":"1.0","source":{"id":"1702.07605","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07605","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07605v1","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07605","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"pith_short_12","alias_value":"O6WC7UO2ZKST","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"O6WC7UO2ZKSTYVUT","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"O6WC7UO2","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:eac4ec79785c4c5189f827c8bd72581744164d9cbae2b605f0b6b2330a9830fa","target":"graph","created_at":"2026-05-18T00:50:02Z","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":"We present a self-stabilizing leader election algorithm for arbitrary networks, with space-complexity $O(\\max\\{\\log \\Delta, \\log \\log n\\})$ bits per node in $n$-node networks with maximum degree~$\\Delta$. This space complexity is sub-logarithmic in $n$ as long as $\\Delta = n^{o(1)}$. The best space-complexity known so far for arbitrary networks was $O(\\log n)$ bits per node, and algorithms with sub-logarithmic space-complexities were known for the ring only. To our knowledge, our algorithm is the first algorithm for self-stabilizing leader election to break the $\\Omega(\\log n)$ bound for silen","authors_text":"L\\'elia Blin, S\\'ebastien Tixeuil","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2017-02-24T14:35:57Z","title":"Compact Self-Stabilizing Leader Election for Arbitrary Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07605","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:df3a85679cfad3540d46227ac558ae92093a0e1cfd26f928015fd5dda0bbd11f","target":"record","created_at":"2026-05-18T00:50:02Z","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":"4fe1e7174705e86cbbeaeb3c2ecee42c0348bba20cc6cf3f6d5deca47520398f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2017-02-24T14:35:57Z","title_canon_sha256":"ce1a3e10cb4da9c28ba3dc34e0ee2189c4bb2bfa56a8750ea4ee0b686ae6c479"},"schema_version":"1.0","source":{"id":"1702.07605","kind":"arxiv","version":1}},"canonical_sha256":"77ac2fd1dacaa53c569371cd90f46c9081a7c1f59e8cd52d6054798d8299414b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"77ac2fd1dacaa53c569371cd90f46c9081a7c1f59e8cd52d6054798d8299414b","first_computed_at":"2026-05-18T00:50:02.784235Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:02.784235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j3/cw0RzEo4/BTGML1jtNjioGdj79kdK0njhfW2jEuBJ4dHbZUjh1Ur6do4aN+1TzWtMHUsZl0HskbX4OYa+Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:02.784958Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.07605","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:df3a85679cfad3540d46227ac558ae92093a0e1cfd26f928015fd5dda0bbd11f","sha256:eac4ec79785c4c5189f827c8bd72581744164d9cbae2b605f0b6b2330a9830fa"],"state_sha256":"2c5877c8e8e908835866d1f3ec3f799b6077dcc6c05578a9df7d7b59e31ff42f"}