{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:2JGIWXPUHFWTC7TXLRER5PDM2V","short_pith_number":"pith:2JGIWXPU","schema_version":"1.0","canonical_sha256":"d24c8b5df4396d317e775c491ebc6cd54d63e3c75bc92f88e6fcb110e207cef0","source":{"kind":"arxiv","id":"2607.24652","version":1},"attestation_state":"computed","paper":{"title":"Majority Dynamics on Assortative Sparse Stochastic Block Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","cs.IT","math.CO","math.IT"],"primary_cat":"math.PR","authors_text":"Hai-Xiao Wang, Ioana Dumitriu, Muchen Ju","submitted_at":"2026-07-27T16:49:49Z","abstract_excerpt":"Majority dynamics is a two-opinion process in which each vertex repeatedly updates to the majority opinion among its neighbors. We study this process on a resampled sparse binary stochastic block model in the assortative regime. At each time step, a graph is sampled from the current opinion partition: vertices with the same opinion are joined with probability $\\alpha=a\\log N/N$, while vertices with differing opinions are joined with probability $\\beta=b\\log N/N$, where $a>b>1$. Let $B_t$ and $R_t$ denote the blue and red camps at time $t$. We show that the weighted advantage $\\widetilde{\\Delta"},"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":"2607.24652","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2026-07-27T16:49:49Z","cross_cats_sorted":["cs.DM","cs.IT","math.CO","math.IT"],"title_canon_sha256":"0a6d0106f21d75649d95111610e788a07136340e39066c9e40f24ff02567244a","abstract_canon_sha256":"cbe4d7ba98ae0850feacb05ee1ab2eacf4d020cc1d18d5eef4b0216f6f20fd8f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-28T02:24:20.801806Z","signature_b64":"FmpoB06SQ6BkkcDf3FUb7JRaMZURa+5SAnYVDBHcyfpGqqMNUoEkWL+lHiR1GxdmDpu/GGMp2EiCLaqBXAruCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d24c8b5df4396d317e775c491ebc6cd54d63e3c75bc92f88e6fcb110e207cef0","last_reissued_at":"2026-07-28T02:24:20.800902Z","signature_status":"signed_v1","first_computed_at":"2026-07-28T02:24:20.800902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Majority Dynamics on Assortative Sparse Stochastic Block Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","cs.IT","math.CO","math.IT"],"primary_cat":"math.PR","authors_text":"Hai-Xiao Wang, Ioana Dumitriu, Muchen Ju","submitted_at":"2026-07-27T16:49:49Z","abstract_excerpt":"Majority dynamics is a two-opinion process in which each vertex repeatedly updates to the majority opinion among its neighbors. We study this process on a resampled sparse binary stochastic block model in the assortative regime. At each time step, a graph is sampled from the current opinion partition: vertices with the same opinion are joined with probability $\\alpha=a\\log N/N$, while vertices with differing opinions are joined with probability $\\beta=b\\log N/N$, where $a>b>1$. Let $B_t$ and $R_t$ denote the blue and red camps at time $t$. We show that the weighted advantage $\\widetilde{\\Delta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.24652","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/2607.24652/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":"2607.24652","created_at":"2026-07-28T02:24:20.801374+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.24652v1","created_at":"2026-07-28T02:24:20.801374+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.24652","created_at":"2026-07-28T02:24:20.801374+00:00"},{"alias_kind":"pith_short_12","alias_value":"2JGIWXPUHFWT","created_at":"2026-07-28T02:24:20.801374+00:00"},{"alias_kind":"pith_short_16","alias_value":"2JGIWXPUHFWTC7TX","created_at":"2026-07-28T02:24:20.801374+00:00"},{"alias_kind":"pith_short_8","alias_value":"2JGIWXPU","created_at":"2026-07-28T02:24:20.801374+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":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2JGIWXPUHFWTC7TXLRER5PDM2V","json":"https://pith.science/pith/2JGIWXPUHFWTC7TXLRER5PDM2V.json","graph_json":"https://pith.science/api/pith-number/2JGIWXPUHFWTC7TXLRER5PDM2V/graph.json","events_json":"https://pith.science/api/pith-number/2JGIWXPUHFWTC7TXLRER5PDM2V/events.json","paper":"https://pith.science/paper/2JGIWXPU"},"agent_actions":{"view_html":"https://pith.science/pith/2JGIWXPUHFWTC7TXLRER5PDM2V","download_json":"https://pith.science/pith/2JGIWXPUHFWTC7TXLRER5PDM2V.json","view_paper":"https://pith.science/paper/2JGIWXPU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.24652&json=true","fetch_graph":"https://pith.science/api/pith-number/2JGIWXPUHFWTC7TXLRER5PDM2V/graph.json","fetch_events":"https://pith.science/api/pith-number/2JGIWXPUHFWTC7TXLRER5PDM2V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2JGIWXPUHFWTC7TXLRER5PDM2V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2JGIWXPUHFWTC7TXLRER5PDM2V/action/storage_attestation","attest_author":"https://pith.science/pith/2JGIWXPUHFWTC7TXLRER5PDM2V/action/author_attestation","sign_citation":"https://pith.science/pith/2JGIWXPUHFWTC7TXLRER5PDM2V/action/citation_signature","submit_replication":"https://pith.science/pith/2JGIWXPUHFWTC7TXLRER5PDM2V/action/replication_record"}},"created_at":"2026-07-28T02:24:20.801374+00:00","updated_at":"2026-07-28T02:24:20.801374+00:00"}