{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:IXTDZS2N5J2FUQ6V5M4UGIHM5N","short_pith_number":"pith:IXTDZS2N","schema_version":"1.0","canonical_sha256":"45e63ccb4dea745a43d5eb394320eceb508b738eb16428f60d401dc1323e3449","source":{"kind":"arxiv","id":"2503.07447","version":1},"attestation_state":"computed","paper":{"title":"A new density limit for unanimity in majority dynamics on random graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","math-ph","math.MP"],"primary_cat":"math.CO","authors_text":"BaoLinh Tran, Jeong Han Kim","submitted_at":"2025-03-10T15:27:26Z","abstract_excerpt":"Majority dynamics is a process on a simple, undirected graph $G$ with an initial Red/Blue color for every vertex of $G$. Each day, each vertex updates its color following the majority among its neighbors, using its previous color for tie-breaking. The dynamics achieves \\textit{unanimity} if every vertex has the same color after finitely many days, and such color is said to \\textit{win}.\n  When $G$ is a $G(n,p)$ random graph, L. Tran and Vu (2019) found a codition in terms of $p$ and the initial difference $2\\Delta$ beteween the sizes of the Red and Blue camps, such that unanimity is achieved 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":"2503.07447","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-03-10T15:27:26Z","cross_cats_sorted":["cs.DM","math-ph","math.MP"],"title_canon_sha256":"877b7f49924e3bd17b8d8d1d5fb5583267aac84fded6e9c1d775a1e70bba8c7d","abstract_canon_sha256":"a97b1eb26d725dc06ca01b0fe6ed12f0feeb236db65d3baefd1efde6485a0547"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:27:56.464843Z","signature_b64":"fupO1TdM1G7T79lhl9PwnmMwpQ3Znp6XSIoFZ/s9/PJuYsWyUp6Li2I3ZSjyz1EKtQibKu/O7zMhNh+yhuMFCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45e63ccb4dea745a43d5eb394320eceb508b738eb16428f60d401dc1323e3449","last_reissued_at":"2026-07-05T10:27:56.464091Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:27:56.464091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A new density limit for unanimity in majority dynamics on random graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","math-ph","math.MP"],"primary_cat":"math.CO","authors_text":"BaoLinh Tran, Jeong Han Kim","submitted_at":"2025-03-10T15:27:26Z","abstract_excerpt":"Majority dynamics is a process on a simple, undirected graph $G$ with an initial Red/Blue color for every vertex of $G$. Each day, each vertex updates its color following the majority among its neighbors, using its previous color for tie-breaking. The dynamics achieves \\textit{unanimity} if every vertex has the same color after finitely many days, and such color is said to \\textit{win}.\n  When $G$ is a $G(n,p)$ random graph, L. Tran and Vu (2019) found a codition in terms of $p$ and the initial difference $2\\Delta$ beteween the sizes of the Red and Blue camps, such that unanimity is achieved w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.07447","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/2503.07447/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.07447","created_at":"2026-07-05T10:27:56.464167+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.07447v1","created_at":"2026-07-05T10:27:56.464167+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.07447","created_at":"2026-07-05T10:27:56.464167+00:00"},{"alias_kind":"pith_short_12","alias_value":"IXTDZS2N5J2F","created_at":"2026-07-05T10:27:56.464167+00:00"},{"alias_kind":"pith_short_16","alias_value":"IXTDZS2N5J2FUQ6V","created_at":"2026-07-05T10:27:56.464167+00:00"},{"alias_kind":"pith_short_8","alias_value":"IXTDZS2N","created_at":"2026-07-05T10:27:56.464167+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":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IXTDZS2N5J2FUQ6V5M4UGIHM5N","json":"https://pith.science/pith/IXTDZS2N5J2FUQ6V5M4UGIHM5N.json","graph_json":"https://pith.science/api/pith-number/IXTDZS2N5J2FUQ6V5M4UGIHM5N/graph.json","events_json":"https://pith.science/api/pith-number/IXTDZS2N5J2FUQ6V5M4UGIHM5N/events.json","paper":"https://pith.science/paper/IXTDZS2N"},"agent_actions":{"view_html":"https://pith.science/pith/IXTDZS2N5J2FUQ6V5M4UGIHM5N","download_json":"https://pith.science/pith/IXTDZS2N5J2FUQ6V5M4UGIHM5N.json","view_paper":"https://pith.science/paper/IXTDZS2N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.07447&json=true","fetch_graph":"https://pith.science/api/pith-number/IXTDZS2N5J2FUQ6V5M4UGIHM5N/graph.json","fetch_events":"https://pith.science/api/pith-number/IXTDZS2N5J2FUQ6V5M4UGIHM5N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IXTDZS2N5J2FUQ6V5M4UGIHM5N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IXTDZS2N5J2FUQ6V5M4UGIHM5N/action/storage_attestation","attest_author":"https://pith.science/pith/IXTDZS2N5J2FUQ6V5M4UGIHM5N/action/author_attestation","sign_citation":"https://pith.science/pith/IXTDZS2N5J2FUQ6V5M4UGIHM5N/action/citation_signature","submit_replication":"https://pith.science/pith/IXTDZS2N5J2FUQ6V5M4UGIHM5N/action/replication_record"}},"created_at":"2026-07-05T10:27:56.464167+00:00","updated_at":"2026-07-05T10:27:56.464167+00:00"}