{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:V65JA53UBIIXYOTX3Y7DZ5HSJA","short_pith_number":"pith:V65JA53U","schema_version":"1.0","canonical_sha256":"afba9077740a117c3a77de3e3cf4f2482304b5aa269fdf26e00eb4f540f6d097","source":{"kind":"arxiv","id":"1704.07649","version":3},"attestation_state":"computed","paper":{"title":"Fast 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 Gasieniec","submitted_at":"2017-04-25T11:57:01Z","abstract_excerpt":"The model of population protocols refers to the growing in popularity theoretical framework suitable for studying pairwise interactions within a large collection of simple indistinguishable entities, frequently called agents. In this paper the emphasis is on the space complexity in fast leader election via population protocols governed by the random scheduler, which uniformly at random selects pairwise interactions within the population of n agents.\n  The main result of this paper is a new fast and space optimal leader election protocol. The new protocol utilises O(log^2 n) parallel time (whic"},"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":"1704.07649","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-04-25T11:57:01Z","cross_cats_sorted":[],"title_canon_sha256":"19063937b681fcca1799a9d601694f011c0ef5492049808fc8f1128f5ed129d4","abstract_canon_sha256":"c7dba9dd01b98ac93f13ab98ed3d5eb778346e8bf0b525f1bb2265597c3e0644"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:06.998013Z","signature_b64":"NMcjs5MazkK9x0gWQ0bSHZ9T3E6L8+vjQef7z6gloudORlJJtUOlmRXl5rUcZN9DKjltXvk5qHHCHt7APCk3CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"afba9077740a117c3a77de3e3cf4f2482304b5aa269fdf26e00eb4f540f6d097","last_reissued_at":"2026-05-18T00:20:06.997364Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:06.997364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast 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 Gasieniec","submitted_at":"2017-04-25T11:57:01Z","abstract_excerpt":"The model of population protocols refers to the growing in popularity theoretical framework suitable for studying pairwise interactions within a large collection of simple indistinguishable entities, frequently called agents. In this paper the emphasis is on the space complexity in fast leader election via population protocols governed by the random scheduler, which uniformly at random selects pairwise interactions within the population of n agents.\n  The main result of this paper is a new fast and space optimal leader election protocol. The new protocol utilises O(log^2 n) parallel time (whic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.07649","kind":"arxiv","version":3},"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":"1704.07649","created_at":"2026-05-18T00:20:06.997460+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.07649v3","created_at":"2026-05-18T00:20:06.997460+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.07649","created_at":"2026-05-18T00:20:06.997460+00:00"},{"alias_kind":"pith_short_12","alias_value":"V65JA53UBIIX","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"V65JA53UBIIXYOTX","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"V65JA53U","created_at":"2026-05-18T12:31:49.984773+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/V65JA53UBIIXYOTX3Y7DZ5HSJA","json":"https://pith.science/pith/V65JA53UBIIXYOTX3Y7DZ5HSJA.json","graph_json":"https://pith.science/api/pith-number/V65JA53UBIIXYOTX3Y7DZ5HSJA/graph.json","events_json":"https://pith.science/api/pith-number/V65JA53UBIIXYOTX3Y7DZ5HSJA/events.json","paper":"https://pith.science/paper/V65JA53U"},"agent_actions":{"view_html":"https://pith.science/pith/V65JA53UBIIXYOTX3Y7DZ5HSJA","download_json":"https://pith.science/pith/V65JA53UBIIXYOTX3Y7DZ5HSJA.json","view_paper":"https://pith.science/paper/V65JA53U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.07649&json=true","fetch_graph":"https://pith.science/api/pith-number/V65JA53UBIIXYOTX3Y7DZ5HSJA/graph.json","fetch_events":"https://pith.science/api/pith-number/V65JA53UBIIXYOTX3Y7DZ5HSJA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V65JA53UBIIXYOTX3Y7DZ5HSJA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V65JA53UBIIXYOTX3Y7DZ5HSJA/action/storage_attestation","attest_author":"https://pith.science/pith/V65JA53UBIIXYOTX3Y7DZ5HSJA/action/author_attestation","sign_citation":"https://pith.science/pith/V65JA53UBIIXYOTX3Y7DZ5HSJA/action/citation_signature","submit_replication":"https://pith.science/pith/V65JA53UBIIXYOTX3Y7DZ5HSJA/action/replication_record"}},"created_at":"2026-05-18T00:20:06.997460+00:00","updated_at":"2026-05-18T00:20:06.997460+00:00"}