{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DXIU2V7RFOL74PKEMOTHMQZQWO","short_pith_number":"pith:DXIU2V7R","schema_version":"1.0","canonical_sha256":"1dd14d57f12b97fe3d4463a6764330b3a66c57690c03e846a3633525365dd3a8","source":{"kind":"arxiv","id":"1510.06054","version":1},"attestation_state":"computed","paper":{"title":"When is a network epidemic hard to eliminate?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Asuman Ozdaglar, John N. Tsitsiklis, Kimon Drakopoulos","submitted_at":"2015-10-20T20:46:30Z","abstract_excerpt":"We consider the propagation of a contagion process (epidemic) on a network and study the problem of dynamically allocating a fixed curing budget to the nodes of the graph, at each time instant. For bounded degree graphs, we provide a lower bound on the expected time to extinction under any such dynamic allocation policy, in terms of a combinatorial quantity that we call the resistance of the set of initially infected nodes, the available budget, and the number of nodes n. Specifically, we consider the case of bounded degree graphs, with the resistance growing linearly in n. We show that if 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":"1510.06054","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-10-20T20:46:30Z","cross_cats_sorted":[],"title_canon_sha256":"34c44c5a9193d055940ff3a886578b84cde3f38c105eb9668862fc9e6acee10a","abstract_canon_sha256":"93a1166fceb0f6b54a47073f2c1264955577785f11d7cf64d4c2736d9e75cf1c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:38.816584Z","signature_b64":"TmVMfhQ9Frc2n/wEhfYrkzNmwUZk3EnU9ghijfD0JcisK4EoRGQCosSIN391ddw3v8KeOpymEC/UYn+d0FXCDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1dd14d57f12b97fe3d4463a6764330b3a66c57690c03e846a3633525365dd3a8","last_reissued_at":"2026-05-18T01:29:38.816032Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:38.816032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"When is a network epidemic hard to eliminate?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Asuman Ozdaglar, John N. Tsitsiklis, Kimon Drakopoulos","submitted_at":"2015-10-20T20:46:30Z","abstract_excerpt":"We consider the propagation of a contagion process (epidemic) on a network and study the problem of dynamically allocating a fixed curing budget to the nodes of the graph, at each time instant. For bounded degree graphs, we provide a lower bound on the expected time to extinction under any such dynamic allocation policy, in terms of a combinatorial quantity that we call the resistance of the set of initially infected nodes, the available budget, and the number of nodes n. Specifically, we consider the case of bounded degree graphs, with the resistance growing linearly in n. We show that if the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.06054","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":"1510.06054","created_at":"2026-05-18T01:29:38.816129+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.06054v1","created_at":"2026-05-18T01:29:38.816129+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.06054","created_at":"2026-05-18T01:29:38.816129+00:00"},{"alias_kind":"pith_short_12","alias_value":"DXIU2V7RFOL7","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DXIU2V7RFOL74PKE","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DXIU2V7R","created_at":"2026-05-18T12:29:17.054201+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/DXIU2V7RFOL74PKEMOTHMQZQWO","json":"https://pith.science/pith/DXIU2V7RFOL74PKEMOTHMQZQWO.json","graph_json":"https://pith.science/api/pith-number/DXIU2V7RFOL74PKEMOTHMQZQWO/graph.json","events_json":"https://pith.science/api/pith-number/DXIU2V7RFOL74PKEMOTHMQZQWO/events.json","paper":"https://pith.science/paper/DXIU2V7R"},"agent_actions":{"view_html":"https://pith.science/pith/DXIU2V7RFOL74PKEMOTHMQZQWO","download_json":"https://pith.science/pith/DXIU2V7RFOL74PKEMOTHMQZQWO.json","view_paper":"https://pith.science/paper/DXIU2V7R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.06054&json=true","fetch_graph":"https://pith.science/api/pith-number/DXIU2V7RFOL74PKEMOTHMQZQWO/graph.json","fetch_events":"https://pith.science/api/pith-number/DXIU2V7RFOL74PKEMOTHMQZQWO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DXIU2V7RFOL74PKEMOTHMQZQWO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DXIU2V7RFOL74PKEMOTHMQZQWO/action/storage_attestation","attest_author":"https://pith.science/pith/DXIU2V7RFOL74PKEMOTHMQZQWO/action/author_attestation","sign_citation":"https://pith.science/pith/DXIU2V7RFOL74PKEMOTHMQZQWO/action/citation_signature","submit_replication":"https://pith.science/pith/DXIU2V7RFOL74PKEMOTHMQZQWO/action/replication_record"}},"created_at":"2026-05-18T01:29:38.816129+00:00","updated_at":"2026-05-18T01:29:38.816129+00:00"}