{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:DXIU2V7RFOL74PKEMOTHMQZQWO","short_pith_number":"pith:DXIU2V7R","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"},"canonical_sha256":"1dd14d57f12b97fe3d4463a6764330b3a66c57690c03e846a3633525365dd3a8","source":{"kind":"arxiv","id":"1510.06054","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.06054","created_at":"2026-05-18T01:29:38Z"},{"alias_kind":"arxiv_version","alias_value":"1510.06054v1","created_at":"2026-05-18T01:29:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.06054","created_at":"2026-05-18T01:29:38Z"},{"alias_kind":"pith_short_12","alias_value":"DXIU2V7RFOL7","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DXIU2V7RFOL74PKE","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DXIU2V7R","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:DXIU2V7RFOL74PKEMOTHMQZQWO","target":"record","payload":{"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"},"canonical_sha256":"1dd14d57f12b97fe3d4463a6764330b3a66c57690c03e846a3633525365dd3a8","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"},"source_kind":"arxiv","source_id":"1510.06054","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-18T01:29:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K2NvaYQNdM6sp2rJkM3HvRobHk3ft219DUAUb69zXvEXduRRwxlAuXNs7AAEu8vsDl02KCmfUuS9e84I/R18Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:28:43.818861Z"},"content_sha256":"90362c6b1060793bd460ce5c50672f18ef6520990158e65b027c553ab0abfa09","schema_version":"1.0","event_id":"sha256:90362c6b1060793bd460ce5c50672f18ef6520990158e65b027c553ab0abfa09"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:DXIU2V7RFOL74PKEMOTHMQZQWO","target":"graph","payload":{"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"},"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-18T01:29:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9xErqIadCqTwpCSEVln0W4uWTeMy7mAR2rxYdbW440tOBYDinAlbZ7AQHViagnpbpAcskQQkUcqkJtpKXuFZDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:28:43.819476Z"},"content_sha256":"d2f4528f85e509688397e3a3b9d30efed76afb9db9fbf061e4eec4ceca891c06","schema_version":"1.0","event_id":"sha256:d2f4528f85e509688397e3a3b9d30efed76afb9db9fbf061e4eec4ceca891c06"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DXIU2V7RFOL74PKEMOTHMQZQWO/bundle.json","state_url":"https://pith.science/pith/DXIU2V7RFOL74PKEMOTHMQZQWO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DXIU2V7RFOL74PKEMOTHMQZQWO/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-06-02T14:28:43Z","links":{"resolver":"https://pith.science/pith/DXIU2V7RFOL74PKEMOTHMQZQWO","bundle":"https://pith.science/pith/DXIU2V7RFOL74PKEMOTHMQZQWO/bundle.json","state":"https://pith.science/pith/DXIU2V7RFOL74PKEMOTHMQZQWO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DXIU2V7RFOL74PKEMOTHMQZQWO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:DXIU2V7RFOL74PKEMOTHMQZQWO","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":"93a1166fceb0f6b54a47073f2c1264955577785f11d7cf64d4c2736d9e75cf1c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-10-20T20:46:30Z","title_canon_sha256":"34c44c5a9193d055940ff3a886578b84cde3f38c105eb9668862fc9e6acee10a"},"schema_version":"1.0","source":{"id":"1510.06054","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.06054","created_at":"2026-05-18T01:29:38Z"},{"alias_kind":"arxiv_version","alias_value":"1510.06054v1","created_at":"2026-05-18T01:29:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.06054","created_at":"2026-05-18T01:29:38Z"},{"alias_kind":"pith_short_12","alias_value":"DXIU2V7RFOL7","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DXIU2V7RFOL74PKE","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DXIU2V7R","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:d2f4528f85e509688397e3a3b9d30efed76afb9db9fbf061e4eec4ceca891c06","target":"graph","created_at":"2026-05-18T01:29:38Z","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 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","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":"2015-10-20T20:46:30Z","title":"When is a network epidemic hard to eliminate?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.06054","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:90362c6b1060793bd460ce5c50672f18ef6520990158e65b027c553ab0abfa09","target":"record","created_at":"2026-05-18T01:29:38Z","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":"93a1166fceb0f6b54a47073f2c1264955577785f11d7cf64d4c2736d9e75cf1c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-10-20T20:46:30Z","title_canon_sha256":"34c44c5a9193d055940ff3a886578b84cde3f38c105eb9668862fc9e6acee10a"},"schema_version":"1.0","source":{"id":"1510.06054","kind":"arxiv","version":1}},"canonical_sha256":"1dd14d57f12b97fe3d4463a6764330b3a66c57690c03e846a3633525365dd3a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1dd14d57f12b97fe3d4463a6764330b3a66c57690c03e846a3633525365dd3a8","first_computed_at":"2026-05-18T01:29:38.816032Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:29:38.816032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TmVMfhQ9Frc2n/wEhfYrkzNmwUZk3EnU9ghijfD0JcisK4EoRGQCosSIN391ddw3v8KeOpymEC/UYn+d0FXCDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:29:38.816584Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.06054","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:90362c6b1060793bd460ce5c50672f18ef6520990158e65b027c553ab0abfa09","sha256:d2f4528f85e509688397e3a3b9d30efed76afb9db9fbf061e4eec4ceca891c06"],"state_sha256":"89668a130f4b310beb108570161fedbe1a48f0984c3210871bd1b175c2549e7c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KrUlJ3oz183pGqxre7RTCmBXzwJHsQKSCjeoxI8lyYkgaGTy7XzXPRPQUdhx3tw+lKV3TyGEYEa44GFJQpwWDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T14:28:43.822200Z","bundle_sha256":"e275faf62ea3a3bcdebb8108c38851294583c5f20b67dc68acd09a2229adb5cd"}}