{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:YJGZRCP3ICGCZDSCCXFE7CIVX2","short_pith_number":"pith:YJGZRCP3","canonical_record":{"source":{"id":"1401.5753","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-01-22T19:00:47Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"7a0040063e7b4dc4f754996bcd86a783cb6aa2a4b6ae09eb498becb4a4bc93f1","abstract_canon_sha256":"2c8f53b548d11aa4a7a3b27cc1907c47c333c3445a9ea27f46b539c585d13b33"},"schema_version":"1.0"},"canonical_sha256":"c24d9889fb408c2c8e4215ca4f8915be80f12e92a28a2d04195768043b28019d","source":{"kind":"arxiv","id":"1401.5753","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.5753","created_at":"2026-05-18T03:01:24Z"},{"alias_kind":"arxiv_version","alias_value":"1401.5753v1","created_at":"2026-05-18T03:01:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5753","created_at":"2026-05-18T03:01:24Z"},{"alias_kind":"pith_short_12","alias_value":"YJGZRCP3ICGC","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YJGZRCP3ICGCZDSC","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YJGZRCP3","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:YJGZRCP3ICGCZDSCCXFE7CIVX2","target":"record","payload":{"canonical_record":{"source":{"id":"1401.5753","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-01-22T19:00:47Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"7a0040063e7b4dc4f754996bcd86a783cb6aa2a4b6ae09eb498becb4a4bc93f1","abstract_canon_sha256":"2c8f53b548d11aa4a7a3b27cc1907c47c333c3445a9ea27f46b539c585d13b33"},"schema_version":"1.0"},"canonical_sha256":"c24d9889fb408c2c8e4215ca4f8915be80f12e92a28a2d04195768043b28019d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:24.760962Z","signature_b64":"B2mSyuL8+iS5YGNDuUi73ZZhxug6PKksisNINNjmLaOvUfCWZk+G+WgkSTF4xoijl8ELmS2DS561SISfvbI0Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c24d9889fb408c2c8e4215ca4f8915be80f12e92a28a2d04195768043b28019d","last_reissued_at":"2026-05-18T03:01:24.760374Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:24.760374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.5753","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-18T03:01:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZKEzIiRSPr/SuEkfPBsrskyCjxxNc1oIR8KQwrXS6YQ/ZsU8QXxvroMeTX2U98CBbqwqtYwRv217hrdPbgZSAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:38:36.190234Z"},"content_sha256":"0b2119b59559c6b06917bed66ef6f2f619590508cdae5c8466e135b687f8016c","schema_version":"1.0","event_id":"sha256:0b2119b59559c6b06917bed66ef6f2f619590508cdae5c8466e135b687f8016c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:YJGZRCP3ICGCZDSCCXFE7CIVX2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Worst-Case Scenarios for Greedy, Centrality-Based Network Protection Strategies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Michael Zargham, Victor M. Preciado","submitted_at":"2014-01-22T19:00:47Z","abstract_excerpt":"The task of allocating preventative resources to a computer network in order to protect against the spread of viruses is addressed. Virus spreading dynamics are described by a linearized SIS model and protection is framed by an optimization problem which maximizes the rate at which a virus in the network is contained given finite resources. One approach to problems of this type involve greedy heuristics which allocate all resources to the nodes with large centrality measures. We address the worst case performance of such greedy algorithms be constructing networks for which these greedy allocat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.5753","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-18T03:01:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8WvmcW5i9ZnTsPA1fKBzchhEzMjBiML/RyZwzhXO8XlDPNR8iRnymllJiwkqsPfPQNUuJ9E1ai3oY6ax+j+ACA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:38:36.190962Z"},"content_sha256":"e324a85657c465ebbcb8acbc75fb7dc66544a28fd9c542ef466583c720d6fc49","schema_version":"1.0","event_id":"sha256:e324a85657c465ebbcb8acbc75fb7dc66544a28fd9c542ef466583c720d6fc49"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YJGZRCP3ICGCZDSCCXFE7CIVX2/bundle.json","state_url":"https://pith.science/pith/YJGZRCP3ICGCZDSCCXFE7CIVX2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YJGZRCP3ICGCZDSCCXFE7CIVX2/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-05-26T09:38:36Z","links":{"resolver":"https://pith.science/pith/YJGZRCP3ICGCZDSCCXFE7CIVX2","bundle":"https://pith.science/pith/YJGZRCP3ICGCZDSCCXFE7CIVX2/bundle.json","state":"https://pith.science/pith/YJGZRCP3ICGCZDSCCXFE7CIVX2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YJGZRCP3ICGCZDSCCXFE7CIVX2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:YJGZRCP3ICGCZDSCCXFE7CIVX2","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":"2c8f53b548d11aa4a7a3b27cc1907c47c333c3445a9ea27f46b539c585d13b33","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-01-22T19:00:47Z","title_canon_sha256":"7a0040063e7b4dc4f754996bcd86a783cb6aa2a4b6ae09eb498becb4a4bc93f1"},"schema_version":"1.0","source":{"id":"1401.5753","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.5753","created_at":"2026-05-18T03:01:24Z"},{"alias_kind":"arxiv_version","alias_value":"1401.5753v1","created_at":"2026-05-18T03:01:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5753","created_at":"2026-05-18T03:01:24Z"},{"alias_kind":"pith_short_12","alias_value":"YJGZRCP3ICGC","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YJGZRCP3ICGCZDSC","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YJGZRCP3","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:e324a85657c465ebbcb8acbc75fb7dc66544a28fd9c542ef466583c720d6fc49","target":"graph","created_at":"2026-05-18T03:01:24Z","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":"The task of allocating preventative resources to a computer network in order to protect against the spread of viruses is addressed. Virus spreading dynamics are described by a linearized SIS model and protection is framed by an optimization problem which maximizes the rate at which a virus in the network is contained given finite resources. One approach to problems of this type involve greedy heuristics which allocate all resources to the nodes with large centrality measures. We address the worst case performance of such greedy algorithms be constructing networks for which these greedy allocat","authors_text":"Michael Zargham, Victor M. Preciado","cross_cats":["physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-01-22T19:00:47Z","title":"Worst-Case Scenarios for Greedy, Centrality-Based Network Protection Strategies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.5753","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:0b2119b59559c6b06917bed66ef6f2f619590508cdae5c8466e135b687f8016c","target":"record","created_at":"2026-05-18T03:01:24Z","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":"2c8f53b548d11aa4a7a3b27cc1907c47c333c3445a9ea27f46b539c585d13b33","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-01-22T19:00:47Z","title_canon_sha256":"7a0040063e7b4dc4f754996bcd86a783cb6aa2a4b6ae09eb498becb4a4bc93f1"},"schema_version":"1.0","source":{"id":"1401.5753","kind":"arxiv","version":1}},"canonical_sha256":"c24d9889fb408c2c8e4215ca4f8915be80f12e92a28a2d04195768043b28019d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c24d9889fb408c2c8e4215ca4f8915be80f12e92a28a2d04195768043b28019d","first_computed_at":"2026-05-18T03:01:24.760374Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:01:24.760374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B2mSyuL8+iS5YGNDuUi73ZZhxug6PKksisNINNjmLaOvUfCWZk+G+WgkSTF4xoijl8ELmS2DS561SISfvbI0Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:01:24.760962Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.5753","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b2119b59559c6b06917bed66ef6f2f619590508cdae5c8466e135b687f8016c","sha256:e324a85657c465ebbcb8acbc75fb7dc66544a28fd9c542ef466583c720d6fc49"],"state_sha256":"e4e341c7075089ab660bfb917450995cd011109e71a0eb173ed49f29f1599121"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gjSfHV4HKPEHuWXEs78+amuOs/5yTSWGI4E34QBWTqoRTa1Wk4d0yNkJaG/awCN90Sw/8AcI8079NIWz4uU9AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T09:38:36.194981Z","bundle_sha256":"15adb7bda41e5fcb6a83548f238bd4ff8c44571ba30fb3cf03280aabb2afcae3"}}