{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:JR4HHYREIXSCD5WQIQGXPEQ6IW","short_pith_number":"pith:JR4HHYRE","schema_version":"1.0","canonical_sha256":"4c7873e22445e421f6d0440d77921e45a76ede0076ec01f055d91fc0a93d33c0","source":{"kind":"arxiv","id":"1707.05135","version":3},"attestation_state":"computed","paper":{"title":"A Tight Analysis of the Parallel Undecided-State Dynamics with Two Colors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrea E. F. Clementi, Emanuele Natale, Francesco Pasquale, Giacomo Scornavacca, Luciano Gual\\`a, Mohsen Ghaffari","submitted_at":"2017-07-17T13:10:52Z","abstract_excerpt":"The \\emph{Undecided-State Dynamics} is a well-known protocol for distributed consensus. We analyze it in the parallel \\pull\\ communication model on the complete graph for the \\emph{binary} case (every node can either support one of \\emph{two} possible colors, or be in the undecided state).\n  An interesting open question is whether this dynamics \\emph{always} (i.e., starting from an arbitrary initial configuration) reaches consensus \\emph{quickly} (i.e., within a polylogarithmic number of rounds) in a complete graph with $n$ nodes. Previous work in this setting only considers initial color conf"},"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":"1707.05135","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-17T13:10:52Z","cross_cats_sorted":[],"title_canon_sha256":"a8b8b91a410cc0afa856c172a0d24e2eab4bc2e97b4e3b9d81e8ffbb0cd40e17","abstract_canon_sha256":"3cfd27acdb7d928d3f1585f3edf6839e2f3e0f8a9f39b2aec34906e5a3bee979"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:04.092058Z","signature_b64":"8R75GF+tWBSUsE+LzUtXWtnVTskLFbl8rlujdREB6MwaxsDuEVyUf5IBJuYVFQy+y63wzu28ZItJo7FPDr94CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c7873e22445e421f6d0440d77921e45a76ede0076ec01f055d91fc0a93d33c0","last_reissued_at":"2026-05-18T00:18:04.091585Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:04.091585Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Tight Analysis of the Parallel Undecided-State Dynamics with Two Colors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrea E. F. Clementi, Emanuele Natale, Francesco Pasquale, Giacomo Scornavacca, Luciano Gual\\`a, Mohsen Ghaffari","submitted_at":"2017-07-17T13:10:52Z","abstract_excerpt":"The \\emph{Undecided-State Dynamics} is a well-known protocol for distributed consensus. We analyze it in the parallel \\pull\\ communication model on the complete graph for the \\emph{binary} case (every node can either support one of \\emph{two} possible colors, or be in the undecided state).\n  An interesting open question is whether this dynamics \\emph{always} (i.e., starting from an arbitrary initial configuration) reaches consensus \\emph{quickly} (i.e., within a polylogarithmic number of rounds) in a complete graph with $n$ nodes. Previous work in this setting only considers initial color conf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05135","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":"1707.05135","created_at":"2026-05-18T00:18:04.091655+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.05135v3","created_at":"2026-05-18T00:18:04.091655+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05135","created_at":"2026-05-18T00:18:04.091655+00:00"},{"alias_kind":"pith_short_12","alias_value":"JR4HHYREIXSC","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"JR4HHYREIXSCD5WQ","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"JR4HHYRE","created_at":"2026-05-18T12:31:24.725408+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/JR4HHYREIXSCD5WQIQGXPEQ6IW","json":"https://pith.science/pith/JR4HHYREIXSCD5WQIQGXPEQ6IW.json","graph_json":"https://pith.science/api/pith-number/JR4HHYREIXSCD5WQIQGXPEQ6IW/graph.json","events_json":"https://pith.science/api/pith-number/JR4HHYREIXSCD5WQIQGXPEQ6IW/events.json","paper":"https://pith.science/paper/JR4HHYRE"},"agent_actions":{"view_html":"https://pith.science/pith/JR4HHYREIXSCD5WQIQGXPEQ6IW","download_json":"https://pith.science/pith/JR4HHYREIXSCD5WQIQGXPEQ6IW.json","view_paper":"https://pith.science/paper/JR4HHYRE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.05135&json=true","fetch_graph":"https://pith.science/api/pith-number/JR4HHYREIXSCD5WQIQGXPEQ6IW/graph.json","fetch_events":"https://pith.science/api/pith-number/JR4HHYREIXSCD5WQIQGXPEQ6IW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JR4HHYREIXSCD5WQIQGXPEQ6IW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JR4HHYREIXSCD5WQIQGXPEQ6IW/action/storage_attestation","attest_author":"https://pith.science/pith/JR4HHYREIXSCD5WQIQGXPEQ6IW/action/author_attestation","sign_citation":"https://pith.science/pith/JR4HHYREIXSCD5WQIQGXPEQ6IW/action/citation_signature","submit_replication":"https://pith.science/pith/JR4HHYREIXSCD5WQIQGXPEQ6IW/action/replication_record"}},"created_at":"2026-05-18T00:18:04.091655+00:00","updated_at":"2026-05-18T00:18:04.091655+00:00"}