{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:CTRDYSHPUVKTVCI5QVCLVMO2N7","short_pith_number":"pith:CTRDYSHP","schema_version":"1.0","canonical_sha256":"14e23c48efa5553a891d8544bab1da6fec9742eefad5d090df6d3b8c7a3af2b3","source":{"kind":"arxiv","id":"2010.08172","version":1},"attestation_state":"computed","paper":{"title":"Central Limit Theorem for Majority Dynamics: Bribing Three Voters Suffices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Pat Devlin, Ross Berkowitz","submitted_at":"2020-10-16T05:24:41Z","abstract_excerpt":"Given a graph $G$ and some initial labelling $\\sigma : V(G) \\to \\{Red, Blue\\}$ of its vertices, the \\textit{majority dynamics model} is the deterministic process where at each stage, every vertex simultaneously replaces its label with the majority label among its neighbors (remaining unchanged in the case of a tie). We prove---for a wide range of parameters---that if an initial assignment is fixed and we independently sample an Erd\\H{o}s--R\\'enyi random graph, $G_{n,p}$, then after one step of majority dynamics, the number of vertices of each label follows a central limit law. As a corollary, "},"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":"2010.08172","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2020-10-16T05:24:41Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"54372a09ec3cfe6b71c5090a9d0dc3718fa513ad8a945d27ab2bfb08cbc1bfa9","abstract_canon_sha256":"3d854b2575c9f528efb5d2b380b7cdf03ca8fafa94892abbd48f0c3bbef726d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:43:32.224585Z","signature_b64":"+ogzTYRUBoUNyYtd5+c7N38xPNQzYVqZaYm3tJOsg9/2CwuooAvuPH8Tp517Ad85OvI9BHFzG72L7oKeyPFSAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14e23c48efa5553a891d8544bab1da6fec9742eefad5d090df6d3b8c7a3af2b3","last_reissued_at":"2026-07-05T01:43:32.224211Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:43:32.224211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Central Limit Theorem for Majority Dynamics: Bribing Three Voters Suffices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Pat Devlin, Ross Berkowitz","submitted_at":"2020-10-16T05:24:41Z","abstract_excerpt":"Given a graph $G$ and some initial labelling $\\sigma : V(G) \\to \\{Red, Blue\\}$ of its vertices, the \\textit{majority dynamics model} is the deterministic process where at each stage, every vertex simultaneously replaces its label with the majority label among its neighbors (remaining unchanged in the case of a tie). We prove---for a wide range of parameters---that if an initial assignment is fixed and we independently sample an Erd\\H{o}s--R\\'enyi random graph, $G_{n,p}$, then after one step of majority dynamics, the number of vertices of each label follows a central limit law. As a corollary, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.08172","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2010.08172/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2010.08172","created_at":"2026-07-05T01:43:32.224275+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.08172v1","created_at":"2026-07-05T01:43:32.224275+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.08172","created_at":"2026-07-05T01:43:32.224275+00:00"},{"alias_kind":"pith_short_12","alias_value":"CTRDYSHPUVKT","created_at":"2026-07-05T01:43:32.224275+00:00"},{"alias_kind":"pith_short_16","alias_value":"CTRDYSHPUVKTVCI5","created_at":"2026-07-05T01:43:32.224275+00:00"},{"alias_kind":"pith_short_8","alias_value":"CTRDYSHP","created_at":"2026-07-05T01:43:32.224275+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.06159","citing_title":"Majority Dynamics on Resampled Sparse Erd\\H{o}s--R\\'enyi Graphs: Gaussian Winner Selection and Pace to Unanimity","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CTRDYSHPUVKTVCI5QVCLVMO2N7","json":"https://pith.science/pith/CTRDYSHPUVKTVCI5QVCLVMO2N7.json","graph_json":"https://pith.science/api/pith-number/CTRDYSHPUVKTVCI5QVCLVMO2N7/graph.json","events_json":"https://pith.science/api/pith-number/CTRDYSHPUVKTVCI5QVCLVMO2N7/events.json","paper":"https://pith.science/paper/CTRDYSHP"},"agent_actions":{"view_html":"https://pith.science/pith/CTRDYSHPUVKTVCI5QVCLVMO2N7","download_json":"https://pith.science/pith/CTRDYSHPUVKTVCI5QVCLVMO2N7.json","view_paper":"https://pith.science/paper/CTRDYSHP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.08172&json=true","fetch_graph":"https://pith.science/api/pith-number/CTRDYSHPUVKTVCI5QVCLVMO2N7/graph.json","fetch_events":"https://pith.science/api/pith-number/CTRDYSHPUVKTVCI5QVCLVMO2N7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CTRDYSHPUVKTVCI5QVCLVMO2N7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CTRDYSHPUVKTVCI5QVCLVMO2N7/action/storage_attestation","attest_author":"https://pith.science/pith/CTRDYSHPUVKTVCI5QVCLVMO2N7/action/author_attestation","sign_citation":"https://pith.science/pith/CTRDYSHPUVKTVCI5QVCLVMO2N7/action/citation_signature","submit_replication":"https://pith.science/pith/CTRDYSHPUVKTVCI5QVCLVMO2N7/action/replication_record"}},"created_at":"2026-07-05T01:43:32.224275+00:00","updated_at":"2026-07-05T01:43:32.224275+00:00"}