{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:VG2IFM7PGH7RXGQIOMB433UQFB","short_pith_number":"pith:VG2IFM7P","schema_version":"1.0","canonical_sha256":"a9b482b3ef31ff1b9a087303cdee90284a06ad5ba462a116177fd68bbfb87e86","source":{"kind":"arxiv","id":"2501.08703","version":1},"attestation_state":"computed","paper":{"title":"The voter model on random regular graphs with random rewiring","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Frank den Hollander, Luca Avena, Matteo Quattropani, Rajat Subhra Hazra, Rangel Baldasso","submitted_at":"2025-01-15T10:39:38Z","abstract_excerpt":"We consider the voter model with binary opinions on a random regular graph with $n$ vertices of degree $d \\geq 3$, subject to a rewiring dynamics in which pairs of edges are rewired, i.e., broken into four half-edges and subsequently reconnected at random. A parameter $\\nu \\in (0,\\infty)$ regulates the frequency at which the rewirings take place, in such a way that any given edge is rewired exponentially at a rate $\\nu$ in the limit as $n\\to\\infty$. We show that, under the joint law of the random rewiring dynamics and the random opinion dynamics, the fraction of vertices with either one of the"},"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":"2501.08703","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2025-01-15T10:39:38Z","cross_cats_sorted":[],"title_canon_sha256":"ec452b514686289898a25d316d34754d124e7c637bbfb93810735f17ecf7b1ca","abstract_canon_sha256":"52376157b22f61d9750711b9d310f119726a08f83e94be44ffd8be7c10b745c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:01:24.582811Z","signature_b64":"TJdFt29sztt6yDVCBZKeWIrAZVHjoclGAuDhuK76p5JHHHzn139Dv/DreqB8plcstiZtHOyv+uJUJxaTLVbdCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9b482b3ef31ff1b9a087303cdee90284a06ad5ba462a116177fd68bbfb87e86","last_reissued_at":"2026-07-05T10:01:24.582335Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:01:24.582335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The voter model on random regular graphs with random rewiring","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Frank den Hollander, Luca Avena, Matteo Quattropani, Rajat Subhra Hazra, Rangel Baldasso","submitted_at":"2025-01-15T10:39:38Z","abstract_excerpt":"We consider the voter model with binary opinions on a random regular graph with $n$ vertices of degree $d \\geq 3$, subject to a rewiring dynamics in which pairs of edges are rewired, i.e., broken into four half-edges and subsequently reconnected at random. A parameter $\\nu \\in (0,\\infty)$ regulates the frequency at which the rewirings take place, in such a way that any given edge is rewired exponentially at a rate $\\nu$ in the limit as $n\\to\\infty$. We show that, under the joint law of the random rewiring dynamics and the random opinion dynamics, the fraction of vertices with either one of the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.08703","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/2501.08703/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":"2501.08703","created_at":"2026-07-05T10:01:24.582395+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.08703v1","created_at":"2026-07-05T10:01:24.582395+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.08703","created_at":"2026-07-05T10:01:24.582395+00:00"},{"alias_kind":"pith_short_12","alias_value":"VG2IFM7PGH7R","created_at":"2026-07-05T10:01:24.582395+00:00"},{"alias_kind":"pith_short_16","alias_value":"VG2IFM7PGH7RXGQI","created_at":"2026-07-05T10:01:24.582395+00:00"},{"alias_kind":"pith_short_8","alias_value":"VG2IFM7P","created_at":"2026-07-05T10:01:24.582395+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2502.04280","citing_title":"Mean-Field Analysis of Latent Variable Process Models on Dynamically Evolving Graphs with Feedback Effects","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2503.11541","citing_title":"Functional central limit theorem for the subgraph count of the voter model on dynamic random graphs","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2504.06493","citing_title":"Co-evolving vertex and edge dynamics in dense graphs","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06511","citing_title":"Logarithmic Mixing of Random Walks on Dynamical Random Cluster Models","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VG2IFM7PGH7RXGQIOMB433UQFB","json":"https://pith.science/pith/VG2IFM7PGH7RXGQIOMB433UQFB.json","graph_json":"https://pith.science/api/pith-number/VG2IFM7PGH7RXGQIOMB433UQFB/graph.json","events_json":"https://pith.science/api/pith-number/VG2IFM7PGH7RXGQIOMB433UQFB/events.json","paper":"https://pith.science/paper/VG2IFM7P"},"agent_actions":{"view_html":"https://pith.science/pith/VG2IFM7PGH7RXGQIOMB433UQFB","download_json":"https://pith.science/pith/VG2IFM7PGH7RXGQIOMB433UQFB.json","view_paper":"https://pith.science/paper/VG2IFM7P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.08703&json=true","fetch_graph":"https://pith.science/api/pith-number/VG2IFM7PGH7RXGQIOMB433UQFB/graph.json","fetch_events":"https://pith.science/api/pith-number/VG2IFM7PGH7RXGQIOMB433UQFB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VG2IFM7PGH7RXGQIOMB433UQFB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VG2IFM7PGH7RXGQIOMB433UQFB/action/storage_attestation","attest_author":"https://pith.science/pith/VG2IFM7PGH7RXGQIOMB433UQFB/action/author_attestation","sign_citation":"https://pith.science/pith/VG2IFM7PGH7RXGQIOMB433UQFB/action/citation_signature","submit_replication":"https://pith.science/pith/VG2IFM7PGH7RXGQIOMB433UQFB/action/replication_record"}},"created_at":"2026-07-05T10:01:24.582395+00:00","updated_at":"2026-07-05T10:01:24.582395+00:00"}