{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ZJ7E7MTV5J2BPLNQXYLGYXNF7Q","short_pith_number":"pith:ZJ7E7MTV","schema_version":"1.0","canonical_sha256":"ca7e4fb275ea7417adb0be166c5da5fc26f32a4a5e3e2946a93a2b114f68d3d8","source":{"kind":"arxiv","id":"2501.09623","version":1},"attestation_state":"computed","paper":{"title":"SIR on locally converging dynamic random graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Bert Zwart, Marta Milewska, Remco van der Hofstad","submitted_at":"2025-01-16T16:05:06Z","abstract_excerpt":"In this paper, we study the trajectory of a classic SIR epidemic on a family of dynamic random graphs of fixed size, whose set of edges continuously evolves over time. We set general infection and recovery times, and start the epidemic from a positive, yet small, proportion of vertices. We show that in such a case, the spread of an infectious disease around a typical individual can be approximated by the spread of the disease in a local neighbourhood of a uniformly chosen vertex. We formalize this by studying general dynamic random graphs that converge dynamically locally in probability and de"},"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.09623","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2025-01-16T16:05:06Z","cross_cats_sorted":[],"title_canon_sha256":"a9a9e94f405407083645bc4ec6f6851712cd8a8505f327b62c4cb067631c320d","abstract_canon_sha256":"f2ea67afe0262b6bd1dea9728957bfdd2712cda3ee39cb2affea91a5718d40a7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:01:49.904275Z","signature_b64":"vxIW8Ly9/OgOqjMluFa1n2f9J0FMubXD8OSTGAav8j5KRxHGcXKUcZl82IaIluUxRcwIOjcGuCgsGDD7ipByCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca7e4fb275ea7417adb0be166c5da5fc26f32a4a5e3e2946a93a2b114f68d3d8","last_reissued_at":"2026-07-05T10:01:49.903793Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:01:49.903793Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SIR on locally converging dynamic random graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Bert Zwart, Marta Milewska, Remco van der Hofstad","submitted_at":"2025-01-16T16:05:06Z","abstract_excerpt":"In this paper, we study the trajectory of a classic SIR epidemic on a family of dynamic random graphs of fixed size, whose set of edges continuously evolves over time. We set general infection and recovery times, and start the epidemic from a positive, yet small, proportion of vertices. We show that in such a case, the spread of an infectious disease around a typical individual can be approximated by the spread of the disease in a local neighbourhood of a uniformly chosen vertex. We formalize this by studying general dynamic random graphs that converge dynamically locally in probability and de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.09623","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.09623/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.09623","created_at":"2026-07-05T10:01:49.903856+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.09623v1","created_at":"2026-07-05T10:01:49.903856+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.09623","created_at":"2026-07-05T10:01:49.903856+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZJ7E7MTV5J2B","created_at":"2026-07-05T10:01:49.903856+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZJ7E7MTV5J2BPLNQ","created_at":"2026-07-05T10:01:49.903856+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZJ7E7MTV","created_at":"2026-07-05T10:01:49.903856+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.04867","citing_title":"Local limit of Prim's algorithm","ref_index":48,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZJ7E7MTV5J2BPLNQXYLGYXNF7Q","json":"https://pith.science/pith/ZJ7E7MTV5J2BPLNQXYLGYXNF7Q.json","graph_json":"https://pith.science/api/pith-number/ZJ7E7MTV5J2BPLNQXYLGYXNF7Q/graph.json","events_json":"https://pith.science/api/pith-number/ZJ7E7MTV5J2BPLNQXYLGYXNF7Q/events.json","paper":"https://pith.science/paper/ZJ7E7MTV"},"agent_actions":{"view_html":"https://pith.science/pith/ZJ7E7MTV5J2BPLNQXYLGYXNF7Q","download_json":"https://pith.science/pith/ZJ7E7MTV5J2BPLNQXYLGYXNF7Q.json","view_paper":"https://pith.science/paper/ZJ7E7MTV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.09623&json=true","fetch_graph":"https://pith.science/api/pith-number/ZJ7E7MTV5J2BPLNQXYLGYXNF7Q/graph.json","fetch_events":"https://pith.science/api/pith-number/ZJ7E7MTV5J2BPLNQXYLGYXNF7Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZJ7E7MTV5J2BPLNQXYLGYXNF7Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZJ7E7MTV5J2BPLNQXYLGYXNF7Q/action/storage_attestation","attest_author":"https://pith.science/pith/ZJ7E7MTV5J2BPLNQXYLGYXNF7Q/action/author_attestation","sign_citation":"https://pith.science/pith/ZJ7E7MTV5J2BPLNQXYLGYXNF7Q/action/citation_signature","submit_replication":"https://pith.science/pith/ZJ7E7MTV5J2BPLNQXYLGYXNF7Q/action/replication_record"}},"created_at":"2026-07-05T10:01:49.903856+00:00","updated_at":"2026-07-05T10:01:49.903856+00:00"}