{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:3SR7UNBKAKO6IYU2GOJLOFVLJA","short_pith_number":"pith:3SR7UNBK","schema_version":"1.0","canonical_sha256":"dca3fa342a029de4629a3392b716ab4822cc320fc4882a19907d4313d729d5df","source":{"kind":"arxiv","id":"1404.7479","version":1},"attestation_state":"computed","paper":{"title":"The Power of Two Choices in Distributed Voting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Colin Cooper, Robert Els\\\"asser, Tomasz Radzik","submitted_at":"2014-04-29T19:46:19Z","abstract_excerpt":"Distributed voting is a fundamental topic in distributed computing. In pull voting, in each step every vertex chooses a neighbour uniformly at random, and adopts its opinion. The voting is completed when all vertices hold the same opinion. On many graph classes including regular graphs, pull voting requires $\\Theta(n)$ expected steps to complete, even if initially there are only two distinct opinions.\n  In this paper we consider a related process which we call two-sample voting: every vertex chooses two random neighbours in each step. If the opinions of these neighbours coincide, then the vert"},"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":"1404.7479","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-29T19:46:19Z","cross_cats_sorted":[],"title_canon_sha256":"094d881d59248693061319de82c16dfe34ef778ab1e46908fd4dffdf86847096","abstract_canon_sha256":"48e3a4a0fb029abd8c4be74e7081a94f1e0497c1cd68aaa2fa5ba0b3b48daa88"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:46.402404Z","signature_b64":"oZvDY3k2KiXAW+o9ic0LmjyzmU6n8gKI6bUFDraCUlpi4rYZT4INf/iysAF2J4WAxmTCgPmoe4BOVoHOf0ENDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dca3fa342a029de4629a3392b716ab4822cc320fc4882a19907d4313d729d5df","last_reissued_at":"2026-05-18T01:00:46.401939Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:46.401939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Power of Two Choices in Distributed Voting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Colin Cooper, Robert Els\\\"asser, Tomasz Radzik","submitted_at":"2014-04-29T19:46:19Z","abstract_excerpt":"Distributed voting is a fundamental topic in distributed computing. In pull voting, in each step every vertex chooses a neighbour uniformly at random, and adopts its opinion. The voting is completed when all vertices hold the same opinion. On many graph classes including regular graphs, pull voting requires $\\Theta(n)$ expected steps to complete, even if initially there are only two distinct opinions.\n  In this paper we consider a related process which we call two-sample voting: every vertex chooses two random neighbours in each step. If the opinions of these neighbours coincide, then the vert"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.7479","kind":"arxiv","version":1},"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":"1404.7479","created_at":"2026-05-18T01:00:46.402005+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.7479v1","created_at":"2026-05-18T01:00:46.402005+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.7479","created_at":"2026-05-18T01:00:46.402005+00:00"},{"alias_kind":"pith_short_12","alias_value":"3SR7UNBKAKO6","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"3SR7UNBKAKO6IYU2","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"3SR7UNBK","created_at":"2026-05-18T12:28:11.866339+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/3SR7UNBKAKO6IYU2GOJLOFVLJA","json":"https://pith.science/pith/3SR7UNBKAKO6IYU2GOJLOFVLJA.json","graph_json":"https://pith.science/api/pith-number/3SR7UNBKAKO6IYU2GOJLOFVLJA/graph.json","events_json":"https://pith.science/api/pith-number/3SR7UNBKAKO6IYU2GOJLOFVLJA/events.json","paper":"https://pith.science/paper/3SR7UNBK"},"agent_actions":{"view_html":"https://pith.science/pith/3SR7UNBKAKO6IYU2GOJLOFVLJA","download_json":"https://pith.science/pith/3SR7UNBKAKO6IYU2GOJLOFVLJA.json","view_paper":"https://pith.science/paper/3SR7UNBK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.7479&json=true","fetch_graph":"https://pith.science/api/pith-number/3SR7UNBKAKO6IYU2GOJLOFVLJA/graph.json","fetch_events":"https://pith.science/api/pith-number/3SR7UNBKAKO6IYU2GOJLOFVLJA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3SR7UNBKAKO6IYU2GOJLOFVLJA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3SR7UNBKAKO6IYU2GOJLOFVLJA/action/storage_attestation","attest_author":"https://pith.science/pith/3SR7UNBKAKO6IYU2GOJLOFVLJA/action/author_attestation","sign_citation":"https://pith.science/pith/3SR7UNBKAKO6IYU2GOJLOFVLJA/action/citation_signature","submit_replication":"https://pith.science/pith/3SR7UNBKAKO6IYU2GOJLOFVLJA/action/replication_record"}},"created_at":"2026-05-18T01:00:46.402005+00:00","updated_at":"2026-05-18T01:00:46.402005+00:00"}