{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:4DE7G6QUEUWXBIRHJP7G3NVY5V","short_pith_number":"pith:4DE7G6QU","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"},"canonical_sha256":"e0c9f37a14252d70a2274bfe6db6b8ed617c19dfe9066427233aefb317e1345f","source":{"kind":"arxiv","id":"1407.2241","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.2241","created_at":"2026-05-18T02:48:02Z"},{"alias_kind":"arxiv_version","alias_value":"1407.2241v1","created_at":"2026-05-18T02:48:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.2241","created_at":"2026-05-18T02:48:02Z"},{"alias_kind":"pith_short_12","alias_value":"4DE7G6QUEUWX","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4DE7G6QUEUWXBIRH","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4DE7G6QU","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:4DE7G6QUEUWXBIRHJP7G3NVY5V","target":"record","payload":{"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"},"canonical_sha256":"e0c9f37a14252d70a2274bfe6db6b8ed617c19dfe9066427233aefb317e1345f","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"},"source_kind":"arxiv","source_id":"1407.2241","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:48:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DVi3xsB7nMqSZVKBKBHwcd5BP3/gFxHE/kicmNDjCrVedHTV9tP1KY7LKoeD8JyTUFta+xTQSL0vUndrbM0HAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T22:35:22.271462Z"},"content_sha256":"d614cf82e64c49d5e5c271e7abba228da16391e157567c676030053b985ee87a","schema_version":"1.0","event_id":"sha256:d614cf82e64c49d5e5c271e7abba228da16391e157567c676030053b985ee87a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:4DE7G6QUEUWXBIRHJP7G3NVY5V","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:48:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5dLFzwB8Oq/NZAtxKYWmzWkGDCxViIxQvaNuB0SPA9fv0Y2NO24dAniLu02wHCETL8K8gV2Kn+RULgdqGr+ZDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T22:35:22.271815Z"},"content_sha256":"f63b8fd0c00e5a42fe2bbe4317a11c26b0203adb155f9d20a94df1647431fead","schema_version":"1.0","event_id":"sha256:f63b8fd0c00e5a42fe2bbe4317a11c26b0203adb155f9d20a94df1647431fead"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4DE7G6QUEUWXBIRHJP7G3NVY5V/bundle.json","state_url":"https://pith.science/pith/4DE7G6QUEUWXBIRHJP7G3NVY5V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4DE7G6QUEUWXBIRHJP7G3NVY5V/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-03T22:35:22Z","links":{"resolver":"https://pith.science/pith/4DE7G6QUEUWXBIRHJP7G3NVY5V","bundle":"https://pith.science/pith/4DE7G6QUEUWXBIRHJP7G3NVY5V/bundle.json","state":"https://pith.science/pith/4DE7G6QUEUWXBIRHJP7G3NVY5V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4DE7G6QUEUWXBIRHJP7G3NVY5V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4DE7G6QUEUWXBIRHJP7G3NVY5V","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"38dd490655960611c6e70bb567918363f8d5f6f553b0836ce2c2070a41fbd13b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-07-07T22:23:54Z","title_canon_sha256":"242fc47d289bd72d594ac2c31976873703fa6029a1bcf84335fcd125a07801fd"},"schema_version":"1.0","source":{"id":"1407.2241","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.2241","created_at":"2026-05-18T02:48:02Z"},{"alias_kind":"arxiv_version","alias_value":"1407.2241v1","created_at":"2026-05-18T02:48:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.2241","created_at":"2026-05-18T02:48:02Z"},{"alias_kind":"pith_short_12","alias_value":"4DE7G6QUEUWX","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4DE7G6QUEUWXBIRH","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4DE7G6QU","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:f63b8fd0c00e5a42fe2bbe4317a11c26b0203adb155f9d20a94df1647431fead","target":"graph","created_at":"2026-05-18T02:48:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Asuman Ozdaglar, John N. Tsitsiklis, Kimon Drakopoulos","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-07-07T22:23:54Z","title":"An efficient curing policy for epidemics on graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.2241","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d614cf82e64c49d5e5c271e7abba228da16391e157567c676030053b985ee87a","target":"record","created_at":"2026-05-18T02:48:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"38dd490655960611c6e70bb567918363f8d5f6f553b0836ce2c2070a41fbd13b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-07-07T22:23:54Z","title_canon_sha256":"242fc47d289bd72d594ac2c31976873703fa6029a1bcf84335fcd125a07801fd"},"schema_version":"1.0","source":{"id":"1407.2241","kind":"arxiv","version":1}},"canonical_sha256":"e0c9f37a14252d70a2274bfe6db6b8ed617c19dfe9066427233aefb317e1345f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e0c9f37a14252d70a2274bfe6db6b8ed617c19dfe9066427233aefb317e1345f","first_computed_at":"2026-05-18T02:48:02.723959Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:02.723959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"APx/4AJNcgVbB6bVeQxUTsj1X+okUFwcqyQZzxpsYuPUZMfpYQ2vec/LT8Dgv4EFLN9YwK/SA5mwc5A3KVq+Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:02.724462Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.2241","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d614cf82e64c49d5e5c271e7abba228da16391e157567c676030053b985ee87a","sha256:f63b8fd0c00e5a42fe2bbe4317a11c26b0203adb155f9d20a94df1647431fead"],"state_sha256":"fe1c6c1dfa2cd403310e797e0e0f9509127a58bad0417f1003c3572fc12bfb1a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eVN3/inUvWTsOUZoNAZQCi6wrQW3js5TpF+tWLVeqSyYZchAUEm8Vchk341OlF7/79GoYEywy0EC9BpIIEzBDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T22:35:22.273822Z","bundle_sha256":"21438ac2424461340a252e167dd672981b12f3eb52482d5798b55d860e72ff69"}}