{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:CRYYJKDR425K7R66VFH32ATU5W","short_pith_number":"pith:CRYYJKDR","schema_version":"1.0","canonical_sha256":"147184a871e6baafc7dea94fbd0274edb32868dec59391be4b0f665b1095d5b7","source":{"kind":"arxiv","id":"1907.06068","version":5},"attestation_state":"computed","paper":{"title":"Time-optimal self-stabilizing leader election in population protocols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Chuan Xu, David Doty, Eric Severson, Ho-Lin Chen, Hsueh-Ping Chen, Janna Burman, Thomas Nowak","submitted_at":"2019-07-13T12:35:19Z","abstract_excerpt":"We consider the standard population protocol model, where (a priori) indistinguishable and anonymous agents interact in pairs according to uniformly random scheduling. The self-stabilizing leader election problem requires the protocol to converge on a single leader agent from any possible initial configuration. We initiate the study of time complexity of population protocols solving this problem in its original setting: with probability 1, in a complete communication graph. The only previously known protocol by Cai, Izumi, and Wada [Theor. Comput. Syst. 50] runs in expected parallel time $\\The"},"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":"1907.06068","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-07-13T12:35:19Z","cross_cats_sorted":[],"title_canon_sha256":"08626a40c966ce0c5b6a6e6a23e44241007648e4d12253856a3f7b9af2ca4d31","abstract_canon_sha256":"973e59e9e7897d3353c4b8f16215f015fcd5cca14f62affafc724c72bee84ff1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:35:24.799614Z","signature_b64":"VlfJD60IopO+kxYyJXxHNsVBsQfIl235/sJBZWSIwKbPNxxeQJ+7zpGlVdqYDH8asnCBSm9AqovWHAhX29O9Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"147184a871e6baafc7dea94fbd0274edb32868dec59391be4b0f665b1095d5b7","last_reissued_at":"2026-07-05T03:35:24.799095Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:35:24.799095Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Time-optimal self-stabilizing leader election in population protocols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Chuan Xu, David Doty, Eric Severson, Ho-Lin Chen, Hsueh-Ping Chen, Janna Burman, Thomas Nowak","submitted_at":"2019-07-13T12:35:19Z","abstract_excerpt":"We consider the standard population protocol model, where (a priori) indistinguishable and anonymous agents interact in pairs according to uniformly random scheduling. The self-stabilizing leader election problem requires the protocol to converge on a single leader agent from any possible initial configuration. We initiate the study of time complexity of population protocols solving this problem in its original setting: with probability 1, in a complete communication graph. The only previously known protocol by Cai, Izumi, and Wada [Theor. Comput. Syst. 50] runs in expected parallel time $\\The"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.06068","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1907.06068/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1907.06068","created_at":"2026-07-05T03:35:24.799161+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.06068v5","created_at":"2026-07-05T03:35:24.799161+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.06068","created_at":"2026-07-05T03:35:24.799161+00:00"},{"alias_kind":"pith_short_12","alias_value":"CRYYJKDR425K","created_at":"2026-07-05T03:35:24.799161+00:00"},{"alias_kind":"pith_short_16","alias_value":"CRYYJKDR425K7R66","created_at":"2026-07-05T03:35:24.799161+00:00"},{"alias_kind":"pith_short_8","alias_value":"CRYYJKDR","created_at":"2026-07-05T03:35:24.799161+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.23649","citing_title":"Complementary Time-Space Tradeoff for Self-Stabilizing Leader Election: Polynomial States Meet Sublinear Time","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CRYYJKDR425K7R66VFH32ATU5W","json":"https://pith.science/pith/CRYYJKDR425K7R66VFH32ATU5W.json","graph_json":"https://pith.science/api/pith-number/CRYYJKDR425K7R66VFH32ATU5W/graph.json","events_json":"https://pith.science/api/pith-number/CRYYJKDR425K7R66VFH32ATU5W/events.json","paper":"https://pith.science/paper/CRYYJKDR"},"agent_actions":{"view_html":"https://pith.science/pith/CRYYJKDR425K7R66VFH32ATU5W","download_json":"https://pith.science/pith/CRYYJKDR425K7R66VFH32ATU5W.json","view_paper":"https://pith.science/paper/CRYYJKDR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.06068&json=true","fetch_graph":"https://pith.science/api/pith-number/CRYYJKDR425K7R66VFH32ATU5W/graph.json","fetch_events":"https://pith.science/api/pith-number/CRYYJKDR425K7R66VFH32ATU5W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CRYYJKDR425K7R66VFH32ATU5W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CRYYJKDR425K7R66VFH32ATU5W/action/storage_attestation","attest_author":"https://pith.science/pith/CRYYJKDR425K7R66VFH32ATU5W/action/author_attestation","sign_citation":"https://pith.science/pith/CRYYJKDR425K7R66VFH32ATU5W/action/citation_signature","submit_replication":"https://pith.science/pith/CRYYJKDR425K7R66VFH32ATU5W/action/replication_record"}},"created_at":"2026-07-05T03:35:24.799161+00:00","updated_at":"2026-07-05T03:35:24.799161+00:00"}