{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ZBNLXZNM5WQLCE3NVKB26F7ZYE","short_pith_number":"pith:ZBNLXZNM","schema_version":"1.0","canonical_sha256":"c85abbe5aceda0b1136daa83af17f9c1250e5b7b68312ddeeb68a2302b6a1500","source":{"kind":"arxiv","id":"1310.1942","version":1},"attestation_state":"computed","paper":{"title":"Containing Viral Spread on Sparse Random Graphs: Bounds, Algorithms, and Experiments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.SI","math.CO"],"primary_cat":"math.PR","authors_text":"Guanhua Yan, Michael Molloy, Milan Bradonji\\'c","submitted_at":"2013-10-07T20:19:36Z","abstract_excerpt":"Viral spread on large graphs has many real-life applications such as malware propagation in computer networks and rumor (or misinformation) spread in Twitter-like online social networks. Although viral spread on large graphs has been intensively analyzed on classical models such as Susceptible-Infectious-Recovered, there still exits a deficit of effective methods in practice to contain epidemic spread once it passes a critical threshold. Against this backdrop, we explore methods of containing viral spread in large networks with the focus on sparse random networks. The viral containment strateg"},"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":"1310.1942","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-10-07T20:19:36Z","cross_cats_sorted":["cs.DM","cs.SI","math.CO"],"title_canon_sha256":"91d0bd306393d8fb34a190954827248280618a2d4842f6fa8bad003e05f94758","abstract_canon_sha256":"3fa0f8828ab864e4f9764e03e9ff9ca8234f04a54393c8cb50b2fcf74d8dd6a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:59.880802Z","signature_b64":"e1lhzByLEVgQIm0Z8y2hmwCnN5cYlmsf+V7/sL0L+3UDhBmNoXMMHC5aQJ0tvHLkHrVRlCD9/IyoRYlBU2P2Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c85abbe5aceda0b1136daa83af17f9c1250e5b7b68312ddeeb68a2302b6a1500","last_reissued_at":"2026-05-18T03:10:59.880094Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:59.880094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Containing Viral Spread on Sparse Random Graphs: Bounds, Algorithms, and Experiments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.SI","math.CO"],"primary_cat":"math.PR","authors_text":"Guanhua Yan, Michael Molloy, Milan Bradonji\\'c","submitted_at":"2013-10-07T20:19:36Z","abstract_excerpt":"Viral spread on large graphs has many real-life applications such as malware propagation in computer networks and rumor (or misinformation) spread in Twitter-like online social networks. Although viral spread on large graphs has been intensively analyzed on classical models such as Susceptible-Infectious-Recovered, there still exits a deficit of effective methods in practice to contain epidemic spread once it passes a critical threshold. Against this backdrop, we explore methods of containing viral spread in large networks with the focus on sparse random networks. The viral containment strateg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.1942","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":""},"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":"1310.1942","created_at":"2026-05-18T03:10:59.880193+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.1942v1","created_at":"2026-05-18T03:10:59.880193+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.1942","created_at":"2026-05-18T03:10:59.880193+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZBNLXZNM5WQL","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZBNLXZNM5WQLCE3N","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZBNLXZNM","created_at":"2026-05-18T12:28:09.283467+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZBNLXZNM5WQLCE3NVKB26F7ZYE","json":"https://pith.science/pith/ZBNLXZNM5WQLCE3NVKB26F7ZYE.json","graph_json":"https://pith.science/api/pith-number/ZBNLXZNM5WQLCE3NVKB26F7ZYE/graph.json","events_json":"https://pith.science/api/pith-number/ZBNLXZNM5WQLCE3NVKB26F7ZYE/events.json","paper":"https://pith.science/paper/ZBNLXZNM"},"agent_actions":{"view_html":"https://pith.science/pith/ZBNLXZNM5WQLCE3NVKB26F7ZYE","download_json":"https://pith.science/pith/ZBNLXZNM5WQLCE3NVKB26F7ZYE.json","view_paper":"https://pith.science/paper/ZBNLXZNM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.1942&json=true","fetch_graph":"https://pith.science/api/pith-number/ZBNLXZNM5WQLCE3NVKB26F7ZYE/graph.json","fetch_events":"https://pith.science/api/pith-number/ZBNLXZNM5WQLCE3NVKB26F7ZYE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZBNLXZNM5WQLCE3NVKB26F7ZYE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZBNLXZNM5WQLCE3NVKB26F7ZYE/action/storage_attestation","attest_author":"https://pith.science/pith/ZBNLXZNM5WQLCE3NVKB26F7ZYE/action/author_attestation","sign_citation":"https://pith.science/pith/ZBNLXZNM5WQLCE3NVKB26F7ZYE/action/citation_signature","submit_replication":"https://pith.science/pith/ZBNLXZNM5WQLCE3NVKB26F7ZYE/action/replication_record"}},"created_at":"2026-05-18T03:10:59.880193+00:00","updated_at":"2026-05-18T03:10:59.880193+00:00"}