{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:HZIVHBLAH4OK4MZKCCAB3FQLVV","short_pith_number":"pith:HZIVHBLA","canonical_record":{"source":{"id":"1401.2532","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-01-11T14:24:12Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"1eed0953720f2d35fa18db14eaf0d0928252f3301bc63f52306d0f451bcfe6bb","abstract_canon_sha256":"77ec25f739b891ce58f13eecf09adbc1bae2d9130850ae89a60532fdbcde070a"},"schema_version":"1.0"},"canonical_sha256":"3e515385603f1cae332a10801d960bad4d73b84fd3dd83b11d21936c80e327ee","source":{"kind":"arxiv","id":"1401.2532","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.2532","created_at":"2026-05-18T03:02:33Z"},{"alias_kind":"arxiv_version","alias_value":"1401.2532v1","created_at":"2026-05-18T03:02:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2532","created_at":"2026-05-18T03:02:33Z"},{"alias_kind":"pith_short_12","alias_value":"HZIVHBLAH4OK","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"HZIVHBLAH4OK4MZK","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"HZIVHBLA","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:HZIVHBLAH4OK4MZKCCAB3FQLVV","target":"record","payload":{"canonical_record":{"source":{"id":"1401.2532","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-01-11T14:24:12Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"1eed0953720f2d35fa18db14eaf0d0928252f3301bc63f52306d0f451bcfe6bb","abstract_canon_sha256":"77ec25f739b891ce58f13eecf09adbc1bae2d9130850ae89a60532fdbcde070a"},"schema_version":"1.0"},"canonical_sha256":"3e515385603f1cae332a10801d960bad4d73b84fd3dd83b11d21936c80e327ee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:33.137293Z","signature_b64":"+hfS7Z4mEpGgV9lSqnl2kMBbVLl5P9p98vWfWiR10aUms6Uujxnt5mfcw0TiPSXrtm8WIjODSVuoRHBL1tJdCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e515385603f1cae332a10801d960bad4d73b84fd3dd83b11d21936c80e327ee","last_reissued_at":"2026-05-18T03:02:33.136643Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:33.136643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.2532","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:02:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d79APhXMCADDBSw0TCOvAw9QmiKUj2P8BKcWgj+Io1Lo79tHkC0Qw4mptlpj+f0O2CyHx1glwmXIzvYUFZ1oBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T02:45:07.310584Z"},"content_sha256":"55b2d93739ecd271e67e54eb9dfbc53e527ea7ad67ba9dffc57379624651bbf0","schema_version":"1.0","event_id":"sha256:55b2d93739ecd271e67e54eb9dfbc53e527ea7ad67ba9dffc57379624651bbf0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:HZIVHBLAH4OK4MZKCCAB3FQLVV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameterized Complexity of Edge Interdiction Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Jiong Guo, Yash Raj Shrestha","submitted_at":"2014-01-11T14:24:12Z","abstract_excerpt":"We study the parameterized complexity of interdiction problems in graphs. For an optimization problem on graphs, one can formulate an interdiction problem as a game consisting of two players, namely, an interdictor and an evader, who compete on an objective with opposing interests. In edge interdiction problems, every edge of the input graph has an interdiction cost associated with it and the interdictor interdicts the graph by modifying the edges in the graph, and the number of such modifications is constrained by the interdictor's budget. The evader then solves the given optimization problem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2532","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:02:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OoVzLJo0mMHurkiyCNh7Rzb7hIz0SwoqdDa2QQIoSVP8kcS17jtmrP+TeBazVqB2Lkiu8L/dt3BmsZBUcgBLBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T02:45:07.310926Z"},"content_sha256":"431ecc8d912b5b5541dcde844cdf193a4ba38b0d09f5ce3f44a530b9b52dbb8b","schema_version":"1.0","event_id":"sha256:431ecc8d912b5b5541dcde844cdf193a4ba38b0d09f5ce3f44a530b9b52dbb8b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HZIVHBLAH4OK4MZKCCAB3FQLVV/bundle.json","state_url":"https://pith.science/pith/HZIVHBLAH4OK4MZKCCAB3FQLVV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HZIVHBLAH4OK4MZKCCAB3FQLVV/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-06T02:45:07Z","links":{"resolver":"https://pith.science/pith/HZIVHBLAH4OK4MZKCCAB3FQLVV","bundle":"https://pith.science/pith/HZIVHBLAH4OK4MZKCCAB3FQLVV/bundle.json","state":"https://pith.science/pith/HZIVHBLAH4OK4MZKCCAB3FQLVV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HZIVHBLAH4OK4MZKCCAB3FQLVV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:HZIVHBLAH4OK4MZKCCAB3FQLVV","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":"77ec25f739b891ce58f13eecf09adbc1bae2d9130850ae89a60532fdbcde070a","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-01-11T14:24:12Z","title_canon_sha256":"1eed0953720f2d35fa18db14eaf0d0928252f3301bc63f52306d0f451bcfe6bb"},"schema_version":"1.0","source":{"id":"1401.2532","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.2532","created_at":"2026-05-18T03:02:33Z"},{"alias_kind":"arxiv_version","alias_value":"1401.2532v1","created_at":"2026-05-18T03:02:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2532","created_at":"2026-05-18T03:02:33Z"},{"alias_kind":"pith_short_12","alias_value":"HZIVHBLAH4OK","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"HZIVHBLAH4OK4MZK","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"HZIVHBLA","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:431ecc8d912b5b5541dcde844cdf193a4ba38b0d09f5ce3f44a530b9b52dbb8b","target":"graph","created_at":"2026-05-18T03:02:33Z","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 study the parameterized complexity of interdiction problems in graphs. For an optimization problem on graphs, one can formulate an interdiction problem as a game consisting of two players, namely, an interdictor and an evader, who compete on an objective with opposing interests. In edge interdiction problems, every edge of the input graph has an interdiction cost associated with it and the interdictor interdicts the graph by modifying the edges in the graph, and the number of such modifications is constrained by the interdictor's budget. The evader then solves the given optimization problem","authors_text":"Jiong Guo, Yash Raj Shrestha","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-01-11T14:24:12Z","title":"Parameterized Complexity of Edge Interdiction Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2532","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:55b2d93739ecd271e67e54eb9dfbc53e527ea7ad67ba9dffc57379624651bbf0","target":"record","created_at":"2026-05-18T03:02:33Z","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":"77ec25f739b891ce58f13eecf09adbc1bae2d9130850ae89a60532fdbcde070a","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-01-11T14:24:12Z","title_canon_sha256":"1eed0953720f2d35fa18db14eaf0d0928252f3301bc63f52306d0f451bcfe6bb"},"schema_version":"1.0","source":{"id":"1401.2532","kind":"arxiv","version":1}},"canonical_sha256":"3e515385603f1cae332a10801d960bad4d73b84fd3dd83b11d21936c80e327ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3e515385603f1cae332a10801d960bad4d73b84fd3dd83b11d21936c80e327ee","first_computed_at":"2026-05-18T03:02:33.136643Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:33.136643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+hfS7Z4mEpGgV9lSqnl2kMBbVLl5P9p98vWfWiR10aUms6Uujxnt5mfcw0TiPSXrtm8WIjODSVuoRHBL1tJdCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:33.137293Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.2532","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:55b2d93739ecd271e67e54eb9dfbc53e527ea7ad67ba9dffc57379624651bbf0","sha256:431ecc8d912b5b5541dcde844cdf193a4ba38b0d09f5ce3f44a530b9b52dbb8b"],"state_sha256":"1dd71fe36ba1d72ec584782624d518032f2b441ffc06cdd15b1535c2c84ffaac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/MvXhzCrlDMDmbmzBMlpBh1jM8DPNPaX70c+AbWPst/ok/kwxniNTMZvStnZ/bNSETbz+cUAtR41FXrE9QXhBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T02:45:07.312864Z","bundle_sha256":"7fbb2dd7efcfe236cd2640dd5eb1c3a6f00074f053d747a5edae6534210e33fa"}}