{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:7MAYVCUWRPWQLUCJXXKCI2OG47","short_pith_number":"pith:7MAYVCUW","schema_version":"1.0","canonical_sha256":"fb018a8a968bed05d049bdd42469c6e7f111f6153762ca8af3fe43b9d399984e","source":{"kind":"arxiv","id":"1802.06872","version":2},"attestation_state":"computed","paper":{"title":"Population Protocols Are Fast","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Adrian Kosowski, Przemys{\\l}aw Uzna\\'nski","submitted_at":"2018-02-19T21:49:01Z","abstract_excerpt":"A population protocol describes a set of state change rules for a population of $n$ indistinguishable finite-state agents (automata), undergoing random pairwise interactions. Within this very basic framework, it is possible to resolve a number of fundamental tasks in distributed computing, including: leader election, aggregate and threshold functions on the population, such as majority computation, and plurality consensus. For the first time, we show that solutions to all of these problems can be obtained \\emph{quickly} using finite-state protocols. For any input, the designed finite-state pro"},"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.06872","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-02-19T21:49:01Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"f074c80553c946ca967a96bc782fc4623003f151a9d042bbc60e6d1609dde320","abstract_canon_sha256":"c2584c5280ca5aa3041c8afb8dc1af58098d097a59b7272d53cb645eea9a0e80"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:09.077412Z","signature_b64":"71FaJOFdgHHf+WBXHWUS6M9lNn0aLWdnyGk3Az5LxM1vb4QHDYBFq2urDFP3thmebQVZYkuPY9WnPm5br5LFCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb018a8a968bed05d049bdd42469c6e7f111f6153762ca8af3fe43b9d399984e","last_reissued_at":"2026-05-18T00:18:09.076850Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:09.076850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Population Protocols Are Fast","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Adrian Kosowski, Przemys{\\l}aw Uzna\\'nski","submitted_at":"2018-02-19T21:49:01Z","abstract_excerpt":"A population protocol describes a set of state change rules for a population of $n$ indistinguishable finite-state agents (automata), undergoing random pairwise interactions. Within this very basic framework, it is possible to resolve a number of fundamental tasks in distributed computing, including: leader election, aggregate and threshold functions on the population, such as majority computation, and plurality consensus. For the first time, we show that solutions to all of these problems can be obtained \\emph{quickly} using finite-state protocols. For any input, the designed finite-state pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06872","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.06872","created_at":"2026-05-18T00:18:09.076943+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.06872v2","created_at":"2026-05-18T00:18:09.076943+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06872","created_at":"2026-05-18T00:18:09.076943+00:00"},{"alias_kind":"pith_short_12","alias_value":"7MAYVCUWRPWQ","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"7MAYVCUWRPWQLUCJ","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"7MAYVCUW","created_at":"2026-05-18T12:32:11.075285+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/7MAYVCUWRPWQLUCJXXKCI2OG47","json":"https://pith.science/pith/7MAYVCUWRPWQLUCJXXKCI2OG47.json","graph_json":"https://pith.science/api/pith-number/7MAYVCUWRPWQLUCJXXKCI2OG47/graph.json","events_json":"https://pith.science/api/pith-number/7MAYVCUWRPWQLUCJXXKCI2OG47/events.json","paper":"https://pith.science/paper/7MAYVCUW"},"agent_actions":{"view_html":"https://pith.science/pith/7MAYVCUWRPWQLUCJXXKCI2OG47","download_json":"https://pith.science/pith/7MAYVCUWRPWQLUCJXXKCI2OG47.json","view_paper":"https://pith.science/paper/7MAYVCUW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.06872&json=true","fetch_graph":"https://pith.science/api/pith-number/7MAYVCUWRPWQLUCJXXKCI2OG47/graph.json","fetch_events":"https://pith.science/api/pith-number/7MAYVCUWRPWQLUCJXXKCI2OG47/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7MAYVCUWRPWQLUCJXXKCI2OG47/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7MAYVCUWRPWQLUCJXXKCI2OG47/action/storage_attestation","attest_author":"https://pith.science/pith/7MAYVCUWRPWQLUCJXXKCI2OG47/action/author_attestation","sign_citation":"https://pith.science/pith/7MAYVCUWRPWQLUCJXXKCI2OG47/action/citation_signature","submit_replication":"https://pith.science/pith/7MAYVCUWRPWQLUCJXXKCI2OG47/action/replication_record"}},"created_at":"2026-05-18T00:18:09.076943+00:00","updated_at":"2026-05-18T00:18:09.076943+00:00"}