{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:L6ZD52RXKFL6O6L6KAFWP7IVFL","short_pith_number":"pith:L6ZD52RX","schema_version":"1.0","canonical_sha256":"5fb23eea375157e7797e500b67fd152aee9dc63085cc6677adb949da912cf8da","source":{"kind":"arxiv","id":"1903.09524","version":1},"attestation_state":"computed","paper":{"title":"Best-of-Three Voting on Dense Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.PR"],"primary_cat":"cs.DM","authors_text":"Nan Kang, Nicolas Rivera","submitted_at":"2019-03-22T14:22:31Z","abstract_excerpt":"Given a graph $G$ of $n$ vertices, where each vertex is initially attached an opinion of either red or blue. We investigate a random process known as the Best-of-three voting. In this process, at each time step, every vertex chooses three neighbours at random and adopts the majority colour. We study this process for a class of graphs with minimum degree $d = n^{\\alpha}$\\,, where $\\alpha = \\Omega\\left( (\\log \\log n)^{-1} \\right)$. We prove that if initially each vertex is red with probability greater than $1/2+\\delta$, and blue otherwise, where $\\delta \\geq (\\log d)^{-C}$ for some $C>0$, then w"},"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":"1903.09524","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-03-22T14:22:31Z","cross_cats_sorted":["cs.DC","math.PR"],"title_canon_sha256":"2ae86220ddcec95935ab364be19b45032e64fc78f4f02836f361236b376bcc05","abstract_canon_sha256":"3a954eefad04d1d5cb3df5b2d406a6956ea17a699b936fda066abffd96738cc3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:39.384970Z","signature_b64":"9+RK+vjBBnbHaTRtgWHPLukuMIqCn/v14jid0NjYPqjVEE2t+DsEj2VZi1Wl/XPPKxpMgIpvzqKAw/073DIbDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5fb23eea375157e7797e500b67fd152aee9dc63085cc6677adb949da912cf8da","last_reissued_at":"2026-05-17T23:50:39.384439Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:39.384439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Best-of-Three Voting on Dense Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.PR"],"primary_cat":"cs.DM","authors_text":"Nan Kang, Nicolas Rivera","submitted_at":"2019-03-22T14:22:31Z","abstract_excerpt":"Given a graph $G$ of $n$ vertices, where each vertex is initially attached an opinion of either red or blue. We investigate a random process known as the Best-of-three voting. In this process, at each time step, every vertex chooses three neighbours at random and adopts the majority colour. We study this process for a class of graphs with minimum degree $d = n^{\\alpha}$\\,, where $\\alpha = \\Omega\\left( (\\log \\log n)^{-1} \\right)$. We prove that if initially each vertex is red with probability greater than $1/2+\\delta$, and blue otherwise, where $\\delta \\geq (\\log d)^{-C}$ for some $C>0$, then w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.09524","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":"1903.09524","created_at":"2026-05-17T23:50:39.384516+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.09524v1","created_at":"2026-05-17T23:50:39.384516+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.09524","created_at":"2026-05-17T23:50:39.384516+00:00"},{"alias_kind":"pith_short_12","alias_value":"L6ZD52RXKFL6","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"L6ZD52RXKFL6O6L6","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"L6ZD52RX","created_at":"2026-05-18T12:33:21.387695+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/L6ZD52RXKFL6O6L6KAFWP7IVFL","json":"https://pith.science/pith/L6ZD52RXKFL6O6L6KAFWP7IVFL.json","graph_json":"https://pith.science/api/pith-number/L6ZD52RXKFL6O6L6KAFWP7IVFL/graph.json","events_json":"https://pith.science/api/pith-number/L6ZD52RXKFL6O6L6KAFWP7IVFL/events.json","paper":"https://pith.science/paper/L6ZD52RX"},"agent_actions":{"view_html":"https://pith.science/pith/L6ZD52RXKFL6O6L6KAFWP7IVFL","download_json":"https://pith.science/pith/L6ZD52RXKFL6O6L6KAFWP7IVFL.json","view_paper":"https://pith.science/paper/L6ZD52RX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.09524&json=true","fetch_graph":"https://pith.science/api/pith-number/L6ZD52RXKFL6O6L6KAFWP7IVFL/graph.json","fetch_events":"https://pith.science/api/pith-number/L6ZD52RXKFL6O6L6KAFWP7IVFL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L6ZD52RXKFL6O6L6KAFWP7IVFL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L6ZD52RXKFL6O6L6KAFWP7IVFL/action/storage_attestation","attest_author":"https://pith.science/pith/L6ZD52RXKFL6O6L6KAFWP7IVFL/action/author_attestation","sign_citation":"https://pith.science/pith/L6ZD52RXKFL6O6L6KAFWP7IVFL/action/citation_signature","submit_replication":"https://pith.science/pith/L6ZD52RXKFL6O6L6KAFWP7IVFL/action/replication_record"}},"created_at":"2026-05-17T23:50:39.384516+00:00","updated_at":"2026-05-17T23:50:39.384516+00:00"}