{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:MJVY64765GMCEOGSZPILFHFOM2","short_pith_number":"pith:MJVY6476","schema_version":"1.0","canonical_sha256":"626b8f73fee9982238d2cbd0b29cae66a7e21d0a9bfa94e4b17ba1b27d2a48a5","source":{"kind":"arxiv","id":"2503.14401","version":2},"attestation_state":"computed","paper":{"title":"A new bound in Majority Dynamics on Random Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Sean Jaffe","submitted_at":"2025-03-18T16:41:47Z","abstract_excerpt":"We study the evolution of majority dynamics on Erd\\H{o}s-R\\'enyi $G(n,p)$ random graphs. In this process, each vertex of a graph is assigned one of two initial states. Subsequently, on every day, each vertex simultaneously updates its state to the most common state in its neighbourhood.\n  If the difference in the numbers of vertices in each state on day $0$ is larger than $ \\max \\left\\{\\frac{1}{\\sqrt{p}} \\exp\\left[A\\sqrt{\\log \\left(\\frac{1}{p}\\right)}\\right] , Bp^{-3/2} n^{-1/2} \\right\\}$ for constants $A$ and $B$, we demonstrate that the state with the initial majority wins with overwhelmingl"},"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":"2503.14401","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2025-03-18T16:41:47Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"7bb34262fb8ed51acf86df597baf8502bec52be2cdc9310e06d50ad8b911e5ac","abstract_canon_sha256":"5ce3685a69335c237b378552c345d3a817fc0cbdcd2eafbefd53c102ccd095ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:35:48.609127Z","signature_b64":"kqpd8E/d4mf62AlaIobMNJA5c9FtrwwLol7UQhLzNXjXym6oyAGabahr0vN/PyM5dLXUbyUYHGgE4UlGyp9lDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"626b8f73fee9982238d2cbd0b29cae66a7e21d0a9bfa94e4b17ba1b27d2a48a5","last_reissued_at":"2026-07-05T10:35:48.608645Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:35:48.608645Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A new bound in Majority Dynamics on Random Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Sean Jaffe","submitted_at":"2025-03-18T16:41:47Z","abstract_excerpt":"We study the evolution of majority dynamics on Erd\\H{o}s-R\\'enyi $G(n,p)$ random graphs. In this process, each vertex of a graph is assigned one of two initial states. Subsequently, on every day, each vertex simultaneously updates its state to the most common state in its neighbourhood.\n  If the difference in the numbers of vertices in each state on day $0$ is larger than $ \\max \\left\\{\\frac{1}{\\sqrt{p}} \\exp\\left[A\\sqrt{\\log \\left(\\frac{1}{p}\\right)}\\right] , Bp^{-3/2} n^{-1/2} \\right\\}$ for constants $A$ and $B$, we demonstrate that the state with the initial majority wins with overwhelmingl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.14401","kind":"arxiv","version":2},"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/2503.14401/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":"2503.14401","created_at":"2026-07-05T10:35:48.608703+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.14401v2","created_at":"2026-07-05T10:35:48.608703+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.14401","created_at":"2026-07-05T10:35:48.608703+00:00"},{"alias_kind":"pith_short_12","alias_value":"MJVY64765GMC","created_at":"2026-07-05T10:35:48.608703+00:00"},{"alias_kind":"pith_short_16","alias_value":"MJVY64765GMCEOGS","created_at":"2026-07-05T10:35:48.608703+00:00"},{"alias_kind":"pith_short_8","alias_value":"MJVY6476","created_at":"2026-07-05T10:35:48.608703+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":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MJVY64765GMCEOGSZPILFHFOM2","json":"https://pith.science/pith/MJVY64765GMCEOGSZPILFHFOM2.json","graph_json":"https://pith.science/api/pith-number/MJVY64765GMCEOGSZPILFHFOM2/graph.json","events_json":"https://pith.science/api/pith-number/MJVY64765GMCEOGSZPILFHFOM2/events.json","paper":"https://pith.science/paper/MJVY6476"},"agent_actions":{"view_html":"https://pith.science/pith/MJVY64765GMCEOGSZPILFHFOM2","download_json":"https://pith.science/pith/MJVY64765GMCEOGSZPILFHFOM2.json","view_paper":"https://pith.science/paper/MJVY6476","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.14401&json=true","fetch_graph":"https://pith.science/api/pith-number/MJVY64765GMCEOGSZPILFHFOM2/graph.json","fetch_events":"https://pith.science/api/pith-number/MJVY64765GMCEOGSZPILFHFOM2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MJVY64765GMCEOGSZPILFHFOM2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MJVY64765GMCEOGSZPILFHFOM2/action/storage_attestation","attest_author":"https://pith.science/pith/MJVY64765GMCEOGSZPILFHFOM2/action/author_attestation","sign_citation":"https://pith.science/pith/MJVY64765GMCEOGSZPILFHFOM2/action/citation_signature","submit_replication":"https://pith.science/pith/MJVY64765GMCEOGSZPILFHFOM2/action/replication_record"}},"created_at":"2026-07-05T10:35:48.608703+00:00","updated_at":"2026-07-05T10:35:48.608703+00:00"}