{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RXY6VTPDQP6RD466DH4AY6RNDE","short_pith_number":"pith:RXY6VTPD","schema_version":"1.0","canonical_sha256":"8df1eacde383fd11f3de19f80c7a2d19071b04db0a8b3bf07b2ad4562ad6cccd","source":{"kind":"arxiv","id":"1805.05157","version":2},"attestation_state":"computed","paper":{"title":"A population protocol for exact majority with $O(\\log^{5/3} n)$ stabilization time and asymptotically optimal number of states","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Dominik Kaaser, Peter Kling, Petra Berenbrink, Robert Els\\\"asser, Tomasz Radzik, Tom Friedetzky","submitted_at":"2018-05-14T13:16:51Z","abstract_excerpt":"A population protocol can be viewed as a sequence of pairwise interactions of $n$ agents (nodes). During one interaction, two agents selected uniformly at random update their states by applying a specified deterministic transition function. In a long run, the whole system should stabilize at the correct output property. The main performance objectives in designing population protocols are small number of states per agent and fast stabilization time.\n  We present a fast population protocol for the exact-majority problem which uses $\\Theta(\\log n)$ states (per agent) and stabilizes in $O(\\log^{5"},"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":"1805.05157","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-14T13:16:51Z","cross_cats_sorted":[],"title_canon_sha256":"6b77eeba9e61e215b6913259256d870679b52eaa5cc4d5f12da9cdfe6fd797b0","abstract_canon_sha256":"0f746127e6f181225bc0967145ad42c2c15c1b87fb9946ecc2393f1b44378135"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:44.258616Z","signature_b64":"+HowTx9TaWZyvJKfxBYAwadtZCSzx87WCMTp5Bcx+HJyrNv4cAoZuRU+qTrUtxIzo+YEy9fBaTt4sDQepkBUBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8df1eacde383fd11f3de19f80c7a2d19071b04db0a8b3bf07b2ad4562ad6cccd","last_reissued_at":"2026-05-18T00:13:44.257955Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:44.257955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A population protocol for exact majority with $O(\\log^{5/3} n)$ stabilization time and asymptotically optimal number of states","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Dominik Kaaser, Peter Kling, Petra Berenbrink, Robert Els\\\"asser, Tomasz Radzik, Tom Friedetzky","submitted_at":"2018-05-14T13:16:51Z","abstract_excerpt":"A population protocol can be viewed as a sequence of pairwise interactions of $n$ agents (nodes). During one interaction, two agents selected uniformly at random update their states by applying a specified deterministic transition function. In a long run, the whole system should stabilize at the correct output property. The main performance objectives in designing population protocols are small number of states per agent and fast stabilization time.\n  We present a fast population protocol for the exact-majority problem which uses $\\Theta(\\log n)$ states (per agent) and stabilizes in $O(\\log^{5"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.05157","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":"1805.05157","created_at":"2026-05-18T00:13:44.258043+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.05157v2","created_at":"2026-05-18T00:13:44.258043+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.05157","created_at":"2026-05-18T00:13:44.258043+00:00"},{"alias_kind":"pith_short_12","alias_value":"RXY6VTPDQP6R","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RXY6VTPDQP6RD466","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RXY6VTPD","created_at":"2026-05-18T12:32:50.500415+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/RXY6VTPDQP6RD466DH4AY6RNDE","json":"https://pith.science/pith/RXY6VTPDQP6RD466DH4AY6RNDE.json","graph_json":"https://pith.science/api/pith-number/RXY6VTPDQP6RD466DH4AY6RNDE/graph.json","events_json":"https://pith.science/api/pith-number/RXY6VTPDQP6RD466DH4AY6RNDE/events.json","paper":"https://pith.science/paper/RXY6VTPD"},"agent_actions":{"view_html":"https://pith.science/pith/RXY6VTPDQP6RD466DH4AY6RNDE","download_json":"https://pith.science/pith/RXY6VTPDQP6RD466DH4AY6RNDE.json","view_paper":"https://pith.science/paper/RXY6VTPD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.05157&json=true","fetch_graph":"https://pith.science/api/pith-number/RXY6VTPDQP6RD466DH4AY6RNDE/graph.json","fetch_events":"https://pith.science/api/pith-number/RXY6VTPDQP6RD466DH4AY6RNDE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RXY6VTPDQP6RD466DH4AY6RNDE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RXY6VTPDQP6RD466DH4AY6RNDE/action/storage_attestation","attest_author":"https://pith.science/pith/RXY6VTPDQP6RD466DH4AY6RNDE/action/author_attestation","sign_citation":"https://pith.science/pith/RXY6VTPDQP6RD466DH4AY6RNDE/action/citation_signature","submit_replication":"https://pith.science/pith/RXY6VTPDQP6RD466DH4AY6RNDE/action/replication_record"}},"created_at":"2026-05-18T00:13:44.258043+00:00","updated_at":"2026-05-18T00:13:44.258043+00:00"}