{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:E6KDQYGPVCBW5KJURZB3DBI2BH","short_pith_number":"pith:E6KDQYGP","canonical_record":{"source":{"id":"1408.4001","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-08-18T13:04:28Z","cross_cats_sorted":[],"title_canon_sha256":"bfb1b4342a7b40908ed3a302d7df45a3ca1a6ce1f790809853be1d90f1bb4cae","abstract_canon_sha256":"b032ec3c4993b5fdb61369609b6b766c92c61eab94c1d4109917ed53eaf154cc"},"schema_version":"1.0"},"canonical_sha256":"27943860cfa8836ea9348e43b1851a09dd6e8b63e4c9a676554a297b9805227b","source":{"kind":"arxiv","id":"1408.4001","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.4001","created_at":"2026-05-18T02:44:57Z"},{"alias_kind":"arxiv_version","alias_value":"1408.4001v1","created_at":"2026-05-18T02:44:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.4001","created_at":"2026-05-18T02:44:57Z"},{"alias_kind":"pith_short_12","alias_value":"E6KDQYGPVCBW","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"E6KDQYGPVCBW5KJU","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"E6KDQYGP","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:E6KDQYGPVCBW5KJURZB3DBI2BH","target":"record","payload":{"canonical_record":{"source":{"id":"1408.4001","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-08-18T13:04:28Z","cross_cats_sorted":[],"title_canon_sha256":"bfb1b4342a7b40908ed3a302d7df45a3ca1a6ce1f790809853be1d90f1bb4cae","abstract_canon_sha256":"b032ec3c4993b5fdb61369609b6b766c92c61eab94c1d4109917ed53eaf154cc"},"schema_version":"1.0"},"canonical_sha256":"27943860cfa8836ea9348e43b1851a09dd6e8b63e4c9a676554a297b9805227b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:57.442638Z","signature_b64":"XIINzt4VZ3ziCbuGb3EUDdqRUjiu+SjmvZVb3JIMftXWX3pX/1uVltsLlqILAxMuOBNW/NnKobXRTOO6OD3cBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27943860cfa8836ea9348e43b1851a09dd6e8b63e4c9a676554a297b9805227b","last_reissued_at":"2026-05-18T02:44:57.442178Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:57.442178Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.4001","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:44:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0rCzRoocSOBSBm14JYYKAj3yi1YwCK8/zQ9a5WVCBPWFGZwNYnuQlmGhVbMzS7/IR1xuUZeEDHKEHBDi5deDBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:36:45.157135Z"},"content_sha256":"df7ec139ba278399121d4f887aa85169a4e6ce10bef8469811e9b4220f862ba1","schema_version":"1.0","event_id":"sha256:df7ec139ba278399121d4f887aa85169a4e6ce10bef8469811e9b4220f862ba1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:E6KDQYGPVCBW5KJURZB3DBI2BH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Clearing Contamination in Large Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Alex Thomo, Michael Simpson, Venkatesh Srinivasan","submitted_at":"2014-08-18T13:04:28Z","abstract_excerpt":"In this work, we study the problem of clearing contamination spreading through a large network where we model the problem as a graph searching game. The problem can be summarized as constructing a search strategy that will leave the graph clear of any contamination at the end of the searching process in as few steps as possible. We show that this problem is NP-hard even on directed acyclic graphs and provide an efficient approximation algorithm. We experimentally observe the performance of our approximation algorithm in relation to the lower bound on several large online networks including Sla"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.4001","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:44:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q+XrPMAH1Kvyyh5pWCi7IgrWeTFhvMc88IgeZ2/WC7fIBKy6WCyOwbnjzzTwSW6Gk2KDw8ZdgmWy95r+zMwqBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:36:45.157559Z"},"content_sha256":"3d3854d2bc05dae5405f75db3cdfe0cdcfa4e714482c7f7ad78559c6fcf78534","schema_version":"1.0","event_id":"sha256:3d3854d2bc05dae5405f75db3cdfe0cdcfa4e714482c7f7ad78559c6fcf78534"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E6KDQYGPVCBW5KJURZB3DBI2BH/bundle.json","state_url":"https://pith.science/pith/E6KDQYGPVCBW5KJURZB3DBI2BH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E6KDQYGPVCBW5KJURZB3DBI2BH/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-27T02:36:45Z","links":{"resolver":"https://pith.science/pith/E6KDQYGPVCBW5KJURZB3DBI2BH","bundle":"https://pith.science/pith/E6KDQYGPVCBW5KJURZB3DBI2BH/bundle.json","state":"https://pith.science/pith/E6KDQYGPVCBW5KJURZB3DBI2BH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E6KDQYGPVCBW5KJURZB3DBI2BH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:E6KDQYGPVCBW5KJURZB3DBI2BH","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":"b032ec3c4993b5fdb61369609b6b766c92c61eab94c1d4109917ed53eaf154cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-08-18T13:04:28Z","title_canon_sha256":"bfb1b4342a7b40908ed3a302d7df45a3ca1a6ce1f790809853be1d90f1bb4cae"},"schema_version":"1.0","source":{"id":"1408.4001","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.4001","created_at":"2026-05-18T02:44:57Z"},{"alias_kind":"arxiv_version","alias_value":"1408.4001v1","created_at":"2026-05-18T02:44:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.4001","created_at":"2026-05-18T02:44:57Z"},{"alias_kind":"pith_short_12","alias_value":"E6KDQYGPVCBW","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"E6KDQYGPVCBW5KJU","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"E6KDQYGP","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:3d3854d2bc05dae5405f75db3cdfe0cdcfa4e714482c7f7ad78559c6fcf78534","target":"graph","created_at":"2026-05-18T02:44:57Z","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":"In this work, we study the problem of clearing contamination spreading through a large network where we model the problem as a graph searching game. The problem can be summarized as constructing a search strategy that will leave the graph clear of any contamination at the end of the searching process in as few steps as possible. We show that this problem is NP-hard even on directed acyclic graphs and provide an efficient approximation algorithm. We experimentally observe the performance of our approximation algorithm in relation to the lower bound on several large online networks including Sla","authors_text":"Alex Thomo, Michael Simpson, Venkatesh Srinivasan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-08-18T13:04:28Z","title":"Clearing Contamination in Large Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.4001","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:df7ec139ba278399121d4f887aa85169a4e6ce10bef8469811e9b4220f862ba1","target":"record","created_at":"2026-05-18T02:44:57Z","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":"b032ec3c4993b5fdb61369609b6b766c92c61eab94c1d4109917ed53eaf154cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-08-18T13:04:28Z","title_canon_sha256":"bfb1b4342a7b40908ed3a302d7df45a3ca1a6ce1f790809853be1d90f1bb4cae"},"schema_version":"1.0","source":{"id":"1408.4001","kind":"arxiv","version":1}},"canonical_sha256":"27943860cfa8836ea9348e43b1851a09dd6e8b63e4c9a676554a297b9805227b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27943860cfa8836ea9348e43b1851a09dd6e8b63e4c9a676554a297b9805227b","first_computed_at":"2026-05-18T02:44:57.442178Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:57.442178Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XIINzt4VZ3ziCbuGb3EUDdqRUjiu+SjmvZVb3JIMftXWX3pX/1uVltsLlqILAxMuOBNW/NnKobXRTOO6OD3cBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:57.442638Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.4001","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:df7ec139ba278399121d4f887aa85169a4e6ce10bef8469811e9b4220f862ba1","sha256:3d3854d2bc05dae5405f75db3cdfe0cdcfa4e714482c7f7ad78559c6fcf78534"],"state_sha256":"7476214cac6d8f96edf351948e02380e3f50101534e0a4c6bfc61842fceff68b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DCRTC4kejRD4L9eDqsD4tYcvgVqQYWJNIdYOFvhbLN4DkVBHloH5tIHSfFKZQN5cDHvmdN1BNQCObSSWpAsoCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T02:36:45.160013Z","bundle_sha256":"dbb27319ed00b1090d03ac47d7840ec1a0c7b651bed5d05ee29f6711fc24cec5"}}