{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:62NQ6L3X4N2YVFKYZUIZJLQBKG","short_pith_number":"pith:62NQ6L3X","schema_version":"1.0","canonical_sha256":"f69b0f2f77e3758a9558cd1194ae015190ef0ba1c765365e7819c3e721f5ea2c","source":{"kind":"arxiv","id":"1510.06055","version":1},"attestation_state":"computed","paper":{"title":"A lower bound on the performance of dynamic curing policies 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":"2015-10-20T20:49:00Z","abstract_excerpt":"We consider an SIS-type epidemic process that evolves on a known graph. We assume that a fixed curing budget can be allocated at each instant to the nodes of the graph, towards the objective of minimizing the expected extinction time of the epidemic. We provide a lower bound on the optimal expected extinction time as a function of the available budget, the epidemic parameters, the maximum degree, and the CutWidth of the graph. For graphs with large CutWidth (close to the largest possible), and under a budget which is sublinear in the number of nodes, our lower bound scales exponentially with t"},"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.06055","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-10-20T20:49:00Z","cross_cats_sorted":[],"title_canon_sha256":"b99731b799bdcd0864e61e415de8fed464ece8bff07755bbf9faa330f3a73ab5","abstract_canon_sha256":"130b09bb61cbf936b9177e410ac4dc95cc4b0aa3a71694b8c4aa2ce791c6dac5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:38.807442Z","signature_b64":"QZqCos8q01aHFDGZ7YSGQiCdjwuM4C5riGr1N9MbOXCD77EKzZZToWI8gescoZN6J0P3j2361CmBBteRuG4GDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f69b0f2f77e3758a9558cd1194ae015190ef0ba1c765365e7819c3e721f5ea2c","last_reissued_at":"2026-05-18T01:29:38.806713Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:38.806713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A lower bound on the performance of dynamic curing policies 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":"2015-10-20T20:49:00Z","abstract_excerpt":"We consider an SIS-type epidemic process that evolves on a known graph. We assume that a fixed curing budget can be allocated at each instant to the nodes of the graph, towards the objective of minimizing the expected extinction time of the epidemic. We provide a lower bound on the optimal expected extinction time as a function of the available budget, the epidemic parameters, the maximum degree, and the CutWidth of the graph. For graphs with large CutWidth (close to the largest possible), and under a budget which is sublinear in the number of nodes, our lower bound scales exponentially with t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.06055","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.06055","created_at":"2026-05-18T01:29:38.806836+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.06055v1","created_at":"2026-05-18T01:29:38.806836+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.06055","created_at":"2026-05-18T01:29:38.806836+00:00"},{"alias_kind":"pith_short_12","alias_value":"62NQ6L3X4N2Y","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"62NQ6L3X4N2YVFKY","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"62NQ6L3X","created_at":"2026-05-18T12:29:07.941421+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/62NQ6L3X4N2YVFKYZUIZJLQBKG","json":"https://pith.science/pith/62NQ6L3X4N2YVFKYZUIZJLQBKG.json","graph_json":"https://pith.science/api/pith-number/62NQ6L3X4N2YVFKYZUIZJLQBKG/graph.json","events_json":"https://pith.science/api/pith-number/62NQ6L3X4N2YVFKYZUIZJLQBKG/events.json","paper":"https://pith.science/paper/62NQ6L3X"},"agent_actions":{"view_html":"https://pith.science/pith/62NQ6L3X4N2YVFKYZUIZJLQBKG","download_json":"https://pith.science/pith/62NQ6L3X4N2YVFKYZUIZJLQBKG.json","view_paper":"https://pith.science/paper/62NQ6L3X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.06055&json=true","fetch_graph":"https://pith.science/api/pith-number/62NQ6L3X4N2YVFKYZUIZJLQBKG/graph.json","fetch_events":"https://pith.science/api/pith-number/62NQ6L3X4N2YVFKYZUIZJLQBKG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/62NQ6L3X4N2YVFKYZUIZJLQBKG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/62NQ6L3X4N2YVFKYZUIZJLQBKG/action/storage_attestation","attest_author":"https://pith.science/pith/62NQ6L3X4N2YVFKYZUIZJLQBKG/action/author_attestation","sign_citation":"https://pith.science/pith/62NQ6L3X4N2YVFKYZUIZJLQBKG/action/citation_signature","submit_replication":"https://pith.science/pith/62NQ6L3X4N2YVFKYZUIZJLQBKG/action/replication_record"}},"created_at":"2026-05-18T01:29:38.806836+00:00","updated_at":"2026-05-18T01:29:38.806836+00:00"}