{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:O6WC7UO2ZKSTYVUTOHGZB5DMSC","short_pith_number":"pith:O6WC7UO2","schema_version":"1.0","canonical_sha256":"77ac2fd1dacaa53c569371cd90f46c9081a7c1f59e8cd52d6054798d8299414b","source":{"kind":"arxiv","id":"1702.07605","version":1},"attestation_state":"computed","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"},"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":"1702.07605","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2017-02-24T14:35:57Z","cross_cats_sorted":[],"title_canon_sha256":"ce1a3e10cb4da9c28ba3dc34e0ee2189c4bb2bfa56a8750ea4ee0b686ae6c479","abstract_canon_sha256":"4fe1e7174705e86cbbeaeb3c2ecee42c0348bba20cc6cf3f6d5deca47520398f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:02.784958Z","signature_b64":"j3/cw0RzEo4/BTGML1jtNjioGdj79kdK0njhfW2jEuBJ4dHbZUjh1Ur6do4aN+1TzWtMHUsZl0HskbX4OYa+Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77ac2fd1dacaa53c569371cd90f46c9081a7c1f59e8cd52d6054798d8299414b","last_reissued_at":"2026-05-18T00:50:02.784235Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:02.784235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1702.07605","created_at":"2026-05-18T00:50:02.784382+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.07605v1","created_at":"2026-05-18T00:50:02.784382+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07605","created_at":"2026-05-18T00:50:02.784382+00:00"},{"alias_kind":"pith_short_12","alias_value":"O6WC7UO2ZKST","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"O6WC7UO2ZKSTYVUT","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"O6WC7UO2","created_at":"2026-05-18T12:31:34.259226+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/O6WC7UO2ZKSTYVUTOHGZB5DMSC","json":"https://pith.science/pith/O6WC7UO2ZKSTYVUTOHGZB5DMSC.json","graph_json":"https://pith.science/api/pith-number/O6WC7UO2ZKSTYVUTOHGZB5DMSC/graph.json","events_json":"https://pith.science/api/pith-number/O6WC7UO2ZKSTYVUTOHGZB5DMSC/events.json","paper":"https://pith.science/paper/O6WC7UO2"},"agent_actions":{"view_html":"https://pith.science/pith/O6WC7UO2ZKSTYVUTOHGZB5DMSC","download_json":"https://pith.science/pith/O6WC7UO2ZKSTYVUTOHGZB5DMSC.json","view_paper":"https://pith.science/paper/O6WC7UO2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.07605&json=true","fetch_graph":"https://pith.science/api/pith-number/O6WC7UO2ZKSTYVUTOHGZB5DMSC/graph.json","fetch_events":"https://pith.science/api/pith-number/O6WC7UO2ZKSTYVUTOHGZB5DMSC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O6WC7UO2ZKSTYVUTOHGZB5DMSC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O6WC7UO2ZKSTYVUTOHGZB5DMSC/action/storage_attestation","attest_author":"https://pith.science/pith/O6WC7UO2ZKSTYVUTOHGZB5DMSC/action/author_attestation","sign_citation":"https://pith.science/pith/O6WC7UO2ZKSTYVUTOHGZB5DMSC/action/citation_signature","submit_replication":"https://pith.science/pith/O6WC7UO2ZKSTYVUTOHGZB5DMSC/action/replication_record"}},"created_at":"2026-05-18T00:50:02.784382+00:00","updated_at":"2026-05-18T00:50:02.784382+00:00"}