{"paper":{"title":"Compact Self-Stabilizing Leader Election for Arbitrary Networks","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"L\\'elia Blin, S\\'ebastien Tixeuil","submitted_at":"2017-02-24T14:35:57Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07605","kind":"arxiv","version":1},"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"}