{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:O6WC7UO2ZKSTYVUTOHGZB5DMSC","short_pith_number":"pith:O6WC7UO2","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"},"canonical_sha256":"77ac2fd1dacaa53c569371cd90f46c9081a7c1f59e8cd52d6054798d8299414b","source":{"kind":"arxiv","id":"1702.07605","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:O6WC7UO2ZKSTYVUTOHGZB5DMSC","target":"record","payload":{"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"},"canonical_sha256":"77ac2fd1dacaa53c569371cd90f46c9081a7c1f59e8cd52d6054798d8299414b","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"},"source_kind":"arxiv","source_id":"1702.07605","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:50:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PnsGmAe0/r3bSH+sM7aVggTVVbI+gXtFKdtx806cViOhNJDzDlc1zLD+tlktLsa28+8qX3gfxSEFgAggmX+8DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:11:56.116442Z"},"content_sha256":"df3a85679cfad3540d46227ac558ae92093a0e1cfd26f928015fd5dda0bbd11f","schema_version":"1.0","event_id":"sha256:df3a85679cfad3540d46227ac558ae92093a0e1cfd26f928015fd5dda0bbd11f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:O6WC7UO2ZKSTYVUTOHGZB5DMSC","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:50:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vT+ZBANGZVepradG5vaUOjwuJNevXL8OG1y0iqKQAzHwUx8S9nWbDmWANM67b0RlVQnSkkVX02DK+pUSMy5fCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:11:56.117053Z"},"content_sha256":"eac4ec79785c4c5189f827c8bd72581744164d9cbae2b605f0b6b2330a9830fa","schema_version":"1.0","event_id":"sha256:eac4ec79785c4c5189f827c8bd72581744164d9cbae2b605f0b6b2330a9830fa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O6WC7UO2ZKSTYVUTOHGZB5DMSC/bundle.json","state_url":"https://pith.science/pith/O6WC7UO2ZKSTYVUTOHGZB5DMSC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O6WC7UO2ZKSTYVUTOHGZB5DMSC/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-08T01:11:56Z","links":{"resolver":"https://pith.science/pith/O6WC7UO2ZKSTYVUTOHGZB5DMSC","bundle":"https://pith.science/pith/O6WC7UO2ZKSTYVUTOHGZB5DMSC/bundle.json","state":"https://pith.science/pith/O6WC7UO2ZKSTYVUTOHGZB5DMSC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O6WC7UO2ZKSTYVUTOHGZB5DMSC/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pXzDds4ZB/0iEpW4rkHssl53KMcR17ydOpgYhbdF7Sx3XVZJsZsk+KGPAXqDxGeXJHD12zXyc59z4FlUSq5UCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T01:11:56.120363Z","bundle_sha256":"4ea1032868e77056460d66c3a03b03eb9743089c9fa80965a3729ffa5f44a3fe"}}