{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VN7OFAWNJYVIIL4VS4UF4PSABO","short_pith_number":"pith:VN7OFAWN","schema_version":"1.0","canonical_sha256":"ab7ee282cd4e2a842f9597285e3e400b8c08f18be80cd6f8393385c526323cd5","source":{"kind":"arxiv","id":"1802.06867","version":2},"attestation_state":"computed","paper":{"title":"Almost logarithmic-time space optimal leader election in population protocols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Grzegorz Stachowiak, Leszek G\\k{a}sieniec, Przemys{\\l}aw Uzna\\'nski","submitted_at":"2018-02-19T21:41:51Z","abstract_excerpt":"The model of population protocols refers to a large collection of simple indistinguishable entities, frequently called {\\em agents}. The agents communicate and perform computation through pairwise interactions. We study fast and space efficient leader election in population of cardinality $n$ governed by a random scheduler, where during each time step the scheduler uniformly at random selects for interaction exactly one pair of agents.\n  We propose the first $o(\\log^2 n)$-time leader election protocol. Our solution operates in expected parallel time $O(\\log n\\log\\log n)$ which is equivalent to"},"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":"1802.06867","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-02-19T21:41:51Z","cross_cats_sorted":[],"title_canon_sha256":"0e859781a61515735fc9b1ff3d946db4a44d5c239660132eef68068f9766eb78","abstract_canon_sha256":"0c48f4a00488ac0d6b72445072e7b5cd212338ec0317e37d3cfeb857486c2ec0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:07.824951Z","signature_b64":"Y1RgReH058pFOpbhsDf2nz9VOc7/kSc9wzXbV2YErVCIHzZNc8a7TqBMh+4qbaUGZlj0GPraNpED7ZZxNR56AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab7ee282cd4e2a842f9597285e3e400b8c08f18be80cd6f8393385c526323cd5","last_reissued_at":"2026-05-18T00:16:07.824303Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:07.824303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Almost logarithmic-time space optimal leader election in population protocols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Grzegorz Stachowiak, Leszek G\\k{a}sieniec, Przemys{\\l}aw Uzna\\'nski","submitted_at":"2018-02-19T21:41:51Z","abstract_excerpt":"The model of population protocols refers to a large collection of simple indistinguishable entities, frequently called {\\em agents}. The agents communicate and perform computation through pairwise interactions. We study fast and space efficient leader election in population of cardinality $n$ governed by a random scheduler, where during each time step the scheduler uniformly at random selects for interaction exactly one pair of agents.\n  We propose the first $o(\\log^2 n)$-time leader election protocol. Our solution operates in expected parallel time $O(\\log n\\log\\log n)$ which is equivalent to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06867","kind":"arxiv","version":2},"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":"1802.06867","created_at":"2026-05-18T00:16:07.824415+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.06867v2","created_at":"2026-05-18T00:16:07.824415+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06867","created_at":"2026-05-18T00:16:07.824415+00:00"},{"alias_kind":"pith_short_12","alias_value":"VN7OFAWNJYVI","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VN7OFAWNJYVIIL4V","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VN7OFAWN","created_at":"2026-05-18T12:32:59.047623+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/VN7OFAWNJYVIIL4VS4UF4PSABO","json":"https://pith.science/pith/VN7OFAWNJYVIIL4VS4UF4PSABO.json","graph_json":"https://pith.science/api/pith-number/VN7OFAWNJYVIIL4VS4UF4PSABO/graph.json","events_json":"https://pith.science/api/pith-number/VN7OFAWNJYVIIL4VS4UF4PSABO/events.json","paper":"https://pith.science/paper/VN7OFAWN"},"agent_actions":{"view_html":"https://pith.science/pith/VN7OFAWNJYVIIL4VS4UF4PSABO","download_json":"https://pith.science/pith/VN7OFAWNJYVIIL4VS4UF4PSABO.json","view_paper":"https://pith.science/paper/VN7OFAWN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.06867&json=true","fetch_graph":"https://pith.science/api/pith-number/VN7OFAWNJYVIIL4VS4UF4PSABO/graph.json","fetch_events":"https://pith.science/api/pith-number/VN7OFAWNJYVIIL4VS4UF4PSABO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VN7OFAWNJYVIIL4VS4UF4PSABO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VN7OFAWNJYVIIL4VS4UF4PSABO/action/storage_attestation","attest_author":"https://pith.science/pith/VN7OFAWNJYVIIL4VS4UF4PSABO/action/author_attestation","sign_citation":"https://pith.science/pith/VN7OFAWNJYVIIL4VS4UF4PSABO/action/citation_signature","submit_replication":"https://pith.science/pith/VN7OFAWNJYVIIL4VS4UF4PSABO/action/replication_record"}},"created_at":"2026-05-18T00:16:07.824415+00:00","updated_at":"2026-05-18T00:16:07.824415+00:00"}