{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:L6ZD52RXKFL6O6L6KAFWP7IVFL","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3a954eefad04d1d5cb3df5b2d406a6956ea17a699b936fda066abffd96738cc3","cross_cats_sorted":["cs.DC","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-03-22T14:22:31Z","title_canon_sha256":"2ae86220ddcec95935ab364be19b45032e64fc78f4f02836f361236b376bcc05"},"schema_version":"1.0","source":{"id":"1903.09524","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.09524","created_at":"2026-05-17T23:50:39Z"},{"alias_kind":"arxiv_version","alias_value":"1903.09524v1","created_at":"2026-05-17T23:50:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.09524","created_at":"2026-05-17T23:50:39Z"},{"alias_kind":"pith_short_12","alias_value":"L6ZD52RXKFL6","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"L6ZD52RXKFL6O6L6","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"L6ZD52RX","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:c7724e984b51c4c5908aaabd0636c60c238b239315c66f16e7d73873cae93c2a","target":"graph","created_at":"2026-05-17T23:50:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Nan Kang, Nicolas Rivera","cross_cats":["cs.DC","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-03-22T14:22:31Z","title":"Best-of-Three Voting on Dense Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.09524","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a9440cddfb0bdb999cf6f4340ec81b4f41389d3bec97b3d498fe94cfe5159d5f","target":"record","created_at":"2026-05-17T23:50:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3a954eefad04d1d5cb3df5b2d406a6956ea17a699b936fda066abffd96738cc3","cross_cats_sorted":["cs.DC","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-03-22T14:22:31Z","title_canon_sha256":"2ae86220ddcec95935ab364be19b45032e64fc78f4f02836f361236b376bcc05"},"schema_version":"1.0","source":{"id":"1903.09524","kind":"arxiv","version":1}},"canonical_sha256":"5fb23eea375157e7797e500b67fd152aee9dc63085cc6677adb949da912cf8da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5fb23eea375157e7797e500b67fd152aee9dc63085cc6677adb949da912cf8da","first_computed_at":"2026-05-17T23:50:39.384439Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:39.384439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9+RK+vjBBnbHaTRtgWHPLukuMIqCn/v14jid0NjYPqjVEE2t+DsEj2VZi1Wl/XPPKxpMgIpvzqKAw/073DIbDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:39.384970Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.09524","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a9440cddfb0bdb999cf6f4340ec81b4f41389d3bec97b3d498fe94cfe5159d5f","sha256:c7724e984b51c4c5908aaabd0636c60c238b239315c66f16e7d73873cae93c2a"],"state_sha256":"90c28b892f83fb7e28aef3d1bf77e6586e380fbad36ab7362a7fdf697f53ec9d"}