{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:4DE7G6QUEUWXBIRHJP7G3NVY5V","short_pith_number":"pith:4DE7G6QU","schema_version":"1.0","canonical_sha256":"e0c9f37a14252d70a2274bfe6db6b8ed617c19dfe9066427233aefb317e1345f","source":{"kind":"arxiv","id":"1407.2241","version":1},"attestation_state":"computed","paper":{"title":"An efficient curing policy for epidemics on graphs","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":"2014-07-07T22:23:54Z","abstract_excerpt":"We provide a dynamic policy for the rapid containment of a contagion process modeled as an SIS epidemic on a bounded degree undirected graph with n nodes. We show that if the budget $r$ of curing resources available at each time is ${\\Omega}(W)$, where $W$ is the CutWidth of the graph, and also of order ${\\Omega}(\\log n)$, then the expected time until the extinction of the epidemic is of order $O(n/r)$, which is within a constant factor from optimal, as well as sublinear in the number of nodes. Furthermore, if the CutWidth increases only sublinearly with n, a sublinear expected time to extinct"},"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":"1407.2241","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-07-07T22:23:54Z","cross_cats_sorted":[],"title_canon_sha256":"242fc47d289bd72d594ac2c31976873703fa6029a1bcf84335fcd125a07801fd","abstract_canon_sha256":"38dd490655960611c6e70bb567918363f8d5f6f553b0836ce2c2070a41fbd13b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:02.724462Z","signature_b64":"APx/4AJNcgVbB6bVeQxUTsj1X+okUFwcqyQZzxpsYuPUZMfpYQ2vec/LT8Dgv4EFLN9YwK/SA5mwc5A3KVq+Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0c9f37a14252d70a2274bfe6db6b8ed617c19dfe9066427233aefb317e1345f","last_reissued_at":"2026-05-18T02:48:02.723959Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:02.723959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An efficient curing policy for epidemics on graphs","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":"2014-07-07T22:23:54Z","abstract_excerpt":"We provide a dynamic policy for the rapid containment of a contagion process modeled as an SIS epidemic on a bounded degree undirected graph with n nodes. We show that if the budget $r$ of curing resources available at each time is ${\\Omega}(W)$, where $W$ is the CutWidth of the graph, and also of order ${\\Omega}(\\log n)$, then the expected time until the extinction of the epidemic is of order $O(n/r)$, which is within a constant factor from optimal, as well as sublinear in the number of nodes. Furthermore, if the CutWidth increases only sublinearly with n, a sublinear expected time to extinct"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.2241","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":"1407.2241","created_at":"2026-05-18T02:48:02.724042+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.2241v1","created_at":"2026-05-18T02:48:02.724042+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.2241","created_at":"2026-05-18T02:48:02.724042+00:00"},{"alias_kind":"pith_short_12","alias_value":"4DE7G6QUEUWX","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"4DE7G6QUEUWXBIRH","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"4DE7G6QU","created_at":"2026-05-18T12:28:14.216126+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/4DE7G6QUEUWXBIRHJP7G3NVY5V","json":"https://pith.science/pith/4DE7G6QUEUWXBIRHJP7G3NVY5V.json","graph_json":"https://pith.science/api/pith-number/4DE7G6QUEUWXBIRHJP7G3NVY5V/graph.json","events_json":"https://pith.science/api/pith-number/4DE7G6QUEUWXBIRHJP7G3NVY5V/events.json","paper":"https://pith.science/paper/4DE7G6QU"},"agent_actions":{"view_html":"https://pith.science/pith/4DE7G6QUEUWXBIRHJP7G3NVY5V","download_json":"https://pith.science/pith/4DE7G6QUEUWXBIRHJP7G3NVY5V.json","view_paper":"https://pith.science/paper/4DE7G6QU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.2241&json=true","fetch_graph":"https://pith.science/api/pith-number/4DE7G6QUEUWXBIRHJP7G3NVY5V/graph.json","fetch_events":"https://pith.science/api/pith-number/4DE7G6QUEUWXBIRHJP7G3NVY5V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4DE7G6QUEUWXBIRHJP7G3NVY5V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4DE7G6QUEUWXBIRHJP7G3NVY5V/action/storage_attestation","attest_author":"https://pith.science/pith/4DE7G6QUEUWXBIRHJP7G3NVY5V/action/author_attestation","sign_citation":"https://pith.science/pith/4DE7G6QUEUWXBIRHJP7G3NVY5V/action/citation_signature","submit_replication":"https://pith.science/pith/4DE7G6QUEUWXBIRHJP7G3NVY5V/action/replication_record"}},"created_at":"2026-05-18T02:48:02.724042+00:00","updated_at":"2026-05-18T02:48:02.724042+00:00"}