{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:62NQ6L3X4N2YVFKYZUIZJLQBKG","short_pith_number":"pith:62NQ6L3X","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"},"canonical_sha256":"f69b0f2f77e3758a9558cd1194ae015190ef0ba1c765365e7819c3e721f5ea2c","source":{"kind":"arxiv","id":"1510.06055","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.06055","created_at":"2026-05-18T01:29:38Z"},{"alias_kind":"arxiv_version","alias_value":"1510.06055v1","created_at":"2026-05-18T01:29:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.06055","created_at":"2026-05-18T01:29:38Z"},{"alias_kind":"pith_short_12","alias_value":"62NQ6L3X4N2Y","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"62NQ6L3X4N2YVFKY","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"62NQ6L3X","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:62NQ6L3X4N2YVFKYZUIZJLQBKG","target":"record","payload":{"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"},"canonical_sha256":"f69b0f2f77e3758a9558cd1194ae015190ef0ba1c765365e7819c3e721f5ea2c","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"},"source_kind":"arxiv","source_id":"1510.06055","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":"o/uI+HMOcM/LA/YDr5D+R9iKQPUoT7zesJaSy/aO6jjUD+2UXL0K1+z3H9Dun5v1rSdqZm5Goa/YzbWNloYvDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:35:02.335584Z"},"content_sha256":"21eb992adf8aed466258649609b3f84fcf4edb33ce95073ed50e0a7a6a6d2fe9","schema_version":"1.0","event_id":"sha256:21eb992adf8aed466258649609b3f84fcf4edb33ce95073ed50e0a7a6a6d2fe9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:62NQ6L3X4N2YVFKYZUIZJLQBKG","target":"graph","payload":{"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"},"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":"g/3JpU9PZ8J+I2ekyZdUWT1e/OX2Np7J9CEhi8nTPG3d3d/VAwuxmFSytm5yZjLFX/zvsWNaUlh+RYai2/6NDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:35:02.335994Z"},"content_sha256":"8e03d6e4605f445455913c65bb61e2eb68342b58411f3569e30ee4e4d3543f05","schema_version":"1.0","event_id":"sha256:8e03d6e4605f445455913c65bb61e2eb68342b58411f3569e30ee4e4d3543f05"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/62NQ6L3X4N2YVFKYZUIZJLQBKG/bundle.json","state_url":"https://pith.science/pith/62NQ6L3X4N2YVFKYZUIZJLQBKG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/62NQ6L3X4N2YVFKYZUIZJLQBKG/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:35:02Z","links":{"resolver":"https://pith.science/pith/62NQ6L3X4N2YVFKYZUIZJLQBKG","bundle":"https://pith.science/pith/62NQ6L3X4N2YVFKYZUIZJLQBKG/bundle.json","state":"https://pith.science/pith/62NQ6L3X4N2YVFKYZUIZJLQBKG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/62NQ6L3X4N2YVFKYZUIZJLQBKG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:62NQ6L3X4N2YVFKYZUIZJLQBKG","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":"130b09bb61cbf936b9177e410ac4dc95cc4b0aa3a71694b8c4aa2ce791c6dac5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-10-20T20:49:00Z","title_canon_sha256":"b99731b799bdcd0864e61e415de8fed464ece8bff07755bbf9faa330f3a73ab5"},"schema_version":"1.0","source":{"id":"1510.06055","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.06055","created_at":"2026-05-18T01:29:38Z"},{"alias_kind":"arxiv_version","alias_value":"1510.06055v1","created_at":"2026-05-18T01:29:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.06055","created_at":"2026-05-18T01:29:38Z"},{"alias_kind":"pith_short_12","alias_value":"62NQ6L3X4N2Y","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"62NQ6L3X4N2YVFKY","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"62NQ6L3X","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:8e03d6e4605f445455913c65bb61e2eb68342b58411f3569e30ee4e4d3543f05","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 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","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:49:00Z","title":"A lower bound on the performance of dynamic curing policies for epidemics on graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.06055","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:21eb992adf8aed466258649609b3f84fcf4edb33ce95073ed50e0a7a6a6d2fe9","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":"130b09bb61cbf936b9177e410ac4dc95cc4b0aa3a71694b8c4aa2ce791c6dac5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-10-20T20:49:00Z","title_canon_sha256":"b99731b799bdcd0864e61e415de8fed464ece8bff07755bbf9faa330f3a73ab5"},"schema_version":"1.0","source":{"id":"1510.06055","kind":"arxiv","version":1}},"canonical_sha256":"f69b0f2f77e3758a9558cd1194ae015190ef0ba1c765365e7819c3e721f5ea2c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f69b0f2f77e3758a9558cd1194ae015190ef0ba1c765365e7819c3e721f5ea2c","first_computed_at":"2026-05-18T01:29:38.806713Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:29:38.806713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QZqCos8q01aHFDGZ7YSGQiCdjwuM4C5riGr1N9MbOXCD77EKzZZToWI8gescoZN6J0P3j2361CmBBteRuG4GDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:29:38.807442Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.06055","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:21eb992adf8aed466258649609b3f84fcf4edb33ce95073ed50e0a7a6a6d2fe9","sha256:8e03d6e4605f445455913c65bb61e2eb68342b58411f3569e30ee4e4d3543f05"],"state_sha256":"6fca7c993f302e834f23f741fb69c5ad8122401ba420d7a9f2a9b79a241b6e60"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A8qRa+AUhKcIALAvEZQgSu81ySpuRMGiviudPCKsNNuXVUAwDweOWLQAiH0+5seHSIo+NZ0591orsvfO1zp4AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T14:35:02.338959Z","bundle_sha256":"eda415207751a2dce4e700cce498b35e113ce6632ddfa5eb53e86ee130364b94"}}