{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:WORPQONQHR3OARBJDUEO2HKLDC","short_pith_number":"pith:WORPQONQ","canonical_record":{"source":{"id":"1511.02484","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-08T13:32:42Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"6eba88dd10d1ddefac272fe63cc423b19a706051469d2f3c35833bbd736e2ef6","abstract_canon_sha256":"c173499086974ae32d55162eff06c3729cabdf0837a4d3b012be8425b87f0cfb"},"schema_version":"1.0"},"canonical_sha256":"b3a2f839b03c76e044291d08ed1d4b18949593418b05b472e0a830f71101a307","source":{"kind":"arxiv","id":"1511.02484","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.02484","created_at":"2026-05-18T01:27:30Z"},{"alias_kind":"arxiv_version","alias_value":"1511.02484v1","created_at":"2026-05-18T01:27:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02484","created_at":"2026-05-18T01:27:30Z"},{"alias_kind":"pith_short_12","alias_value":"WORPQONQHR3O","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WORPQONQHR3OARBJ","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WORPQONQ","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:WORPQONQHR3OARBJDUEO2HKLDC","target":"record","payload":{"canonical_record":{"source":{"id":"1511.02484","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-08T13:32:42Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"6eba88dd10d1ddefac272fe63cc423b19a706051469d2f3c35833bbd736e2ef6","abstract_canon_sha256":"c173499086974ae32d55162eff06c3729cabdf0837a4d3b012be8425b87f0cfb"},"schema_version":"1.0"},"canonical_sha256":"b3a2f839b03c76e044291d08ed1d4b18949593418b05b472e0a830f71101a307","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:30.149705Z","signature_b64":"c9ZK+d8nF6P3m+8yiESw9yn1GS6U4XaxdWE0Us18XEuj6jPlYhuEN/EifRVatcrZOsYFNhF1ww17WPgJZFAXDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3a2f839b03c76e044291d08ed1d4b18949593418b05b472e0a830f71101a307","last_reissued_at":"2026-05-18T01:27:30.148917Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:30.148917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.02484","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:27:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a5CfllceZT9L0jy5a2zWkTmOCrZTZ9wYYpRJM1IL8u8rM+1gA9IgNmg3Xytrsup0HP0uVkKwdhmIQp+Scv9lDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:41:09.017688Z"},"content_sha256":"24ef226879960f47ba0b27c6e3cba11aeff177d518376e85cf76a67651ba41e4","schema_version":"1.0","event_id":"sha256:24ef226879960f47ba0b27c6e3cba11aeff177d518376e85cf76a67651ba41e4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:WORPQONQHR3OARBJDUEO2HKLDC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Interdicting Structured Combinatorial Optimization Problems with {0,1}-Objectives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Rico Zenklusen, Stephen R. Chestnut","submitted_at":"2015-11-08T13:32:42Z","abstract_excerpt":"Interdiction problems ask about the worst-case impact of a limited change to an underlying optimization problem. They are a natural way to measure the robustness of a system, or to identify its weakest spots. Interdiction problems have been studied for a wide variety of classical combinatorial optimization problems, including maximum $s$-$t$ flows, shortest $s$-$t$ paths, maximum weight matchings, minimum spanning trees, maximum stable sets, and graph connectivity. Most interdiction problems are NP-hard, and furthermore, even designing efficient approximation algorithms that allow for estimati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02484","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:27:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PzWsIT4/TqxZj2ivWkudzAjPhlHoql339H0DSCkQGII3ckqQGsmf5f4kE4/x0DEE755AJNoA4qIhS608fadCDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:41:09.018063Z"},"content_sha256":"e16069f6e142e730905aab0f5a5ffa797b4f2db434f550d15a03cc65a1f46326","schema_version":"1.0","event_id":"sha256:e16069f6e142e730905aab0f5a5ffa797b4f2db434f550d15a03cc65a1f46326"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WORPQONQHR3OARBJDUEO2HKLDC/bundle.json","state_url":"https://pith.science/pith/WORPQONQHR3OARBJDUEO2HKLDC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WORPQONQHR3OARBJDUEO2HKLDC/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-31T12:41:09Z","links":{"resolver":"https://pith.science/pith/WORPQONQHR3OARBJDUEO2HKLDC","bundle":"https://pith.science/pith/WORPQONQHR3OARBJDUEO2HKLDC/bundle.json","state":"https://pith.science/pith/WORPQONQHR3OARBJDUEO2HKLDC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WORPQONQHR3OARBJDUEO2HKLDC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:WORPQONQHR3OARBJDUEO2HKLDC","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":"c173499086974ae32d55162eff06c3729cabdf0837a4d3b012be8425b87f0cfb","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-08T13:32:42Z","title_canon_sha256":"6eba88dd10d1ddefac272fe63cc423b19a706051469d2f3c35833bbd736e2ef6"},"schema_version":"1.0","source":{"id":"1511.02484","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.02484","created_at":"2026-05-18T01:27:30Z"},{"alias_kind":"arxiv_version","alias_value":"1511.02484v1","created_at":"2026-05-18T01:27:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02484","created_at":"2026-05-18T01:27:30Z"},{"alias_kind":"pith_short_12","alias_value":"WORPQONQHR3O","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WORPQONQHR3OARBJ","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WORPQONQ","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:e16069f6e142e730905aab0f5a5ffa797b4f2db434f550d15a03cc65a1f46326","target":"graph","created_at":"2026-05-18T01:27:30Z","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":"Interdiction problems ask about the worst-case impact of a limited change to an underlying optimization problem. They are a natural way to measure the robustness of a system, or to identify its weakest spots. Interdiction problems have been studied for a wide variety of classical combinatorial optimization problems, including maximum $s$-$t$ flows, shortest $s$-$t$ paths, maximum weight matchings, minimum spanning trees, maximum stable sets, and graph connectivity. Most interdiction problems are NP-hard, and furthermore, even designing efficient approximation algorithms that allow for estimati","authors_text":"Rico Zenklusen, Stephen R. Chestnut","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-08T13:32:42Z","title":"Interdicting Structured Combinatorial Optimization Problems with {0,1}-Objectives"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02484","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:24ef226879960f47ba0b27c6e3cba11aeff177d518376e85cf76a67651ba41e4","target":"record","created_at":"2026-05-18T01:27:30Z","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":"c173499086974ae32d55162eff06c3729cabdf0837a4d3b012be8425b87f0cfb","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-08T13:32:42Z","title_canon_sha256":"6eba88dd10d1ddefac272fe63cc423b19a706051469d2f3c35833bbd736e2ef6"},"schema_version":"1.0","source":{"id":"1511.02484","kind":"arxiv","version":1}},"canonical_sha256":"b3a2f839b03c76e044291d08ed1d4b18949593418b05b472e0a830f71101a307","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b3a2f839b03c76e044291d08ed1d4b18949593418b05b472e0a830f71101a307","first_computed_at":"2026-05-18T01:27:30.148917Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:30.148917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c9ZK+d8nF6P3m+8yiESw9yn1GS6U4XaxdWE0Us18XEuj6jPlYhuEN/EifRVatcrZOsYFNhF1ww17WPgJZFAXDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:30.149705Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.02484","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:24ef226879960f47ba0b27c6e3cba11aeff177d518376e85cf76a67651ba41e4","sha256:e16069f6e142e730905aab0f5a5ffa797b4f2db434f550d15a03cc65a1f46326"],"state_sha256":"00f9142bd305119c0f85ca3d2015be0aa000a25a17def34ed81c514e36482ba9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eUNEBAFB+NshKXT5/6f8cccoebYedhLq+TLFf7v43poP7qhrYhanUiaxX07c72ooFaUkBlplnO2MXO+lCsRSDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T12:41:09.020600Z","bundle_sha256":"5010f3d70e9ee1d94efdf1f28aa0acba02cad20ddac32f6506bcf16cdb49f2e4"}}