{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:KDKVNUR6M5ZHJJTDITZLBESGOQ","short_pith_number":"pith:KDKVNUR6","canonical_record":{"source":{"id":"1511.02486","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-08T14:02:04Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"b8e3f9f55ce1b10f7ebef207bc604b353b2b2d1a39876a0cfea3d7337b469d26","abstract_canon_sha256":"0630b724999416653b9bb4411de4950b8090fe6e10e03c38cfbc607fecbc5c90"},"schema_version":"1.0"},"canonical_sha256":"50d556d23e677274a66344f2b092467414346326b405bd670b7f420dc15cbd9d","source":{"kind":"arxiv","id":"1511.02486","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.02486","created_at":"2026-05-18T01:27:30Z"},{"alias_kind":"arxiv_version","alias_value":"1511.02486v1","created_at":"2026-05-18T01:27:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02486","created_at":"2026-05-18T01:27:30Z"},{"alias_kind":"pith_short_12","alias_value":"KDKVNUR6M5ZH","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"KDKVNUR6M5ZHJJTD","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"KDKVNUR6","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:KDKVNUR6M5ZHJJTDITZLBESGOQ","target":"record","payload":{"canonical_record":{"source":{"id":"1511.02486","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-08T14:02:04Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"b8e3f9f55ce1b10f7ebef207bc604b353b2b2d1a39876a0cfea3d7337b469d26","abstract_canon_sha256":"0630b724999416653b9bb4411de4950b8090fe6e10e03c38cfbc607fecbc5c90"},"schema_version":"1.0"},"canonical_sha256":"50d556d23e677274a66344f2b092467414346326b405bd670b7f420dc15cbd9d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:30.140440Z","signature_b64":"a7C9+vfTDjA/p1M9KeDAlAbXyksvKpYIHvMmTOZC180SnbShN3hcvvnow4/QRNXey++VwfgMCLoTSAk245v1DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50d556d23e677274a66344f2b092467414346326b405bd670b7f420dc15cbd9d","last_reissued_at":"2026-05-18T01:27:30.139882Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:30.139882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.02486","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":"TdJ/Y5SuBFcogx6K7CLW/tnQYu27uEpmQ8qopPdhzaBic8jIcOcUorrF9UOf9mB4mjz5ge7CRQ7b/nCTOr0NDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:46:07.442851Z"},"content_sha256":"36e4cfb8132a85db3f7509883b21d33854a23dcacd61e15a4bea1bbedd97335d","schema_version":"1.0","event_id":"sha256:36e4cfb8132a85db3f7509883b21d33854a23dcacd61e15a4bea1bbedd97335d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:KDKVNUR6M5ZHJJTDITZLBESGOQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hardness and Approximation for Network Flow Interdiction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Rico Zenklusen, Stephen R. Chestnut","submitted_at":"2015-11-08T14:02:04Z","abstract_excerpt":"In the Network Flow Interdiction problem an adversary attacks a network in order to minimize the maximum s-t-flow. Very little is known about the approximatibility of this problem despite decades of interest in it. We present the first approximation hardness, showing that Network Flow Interdiction and several of its variants cannot be much easier to approximate than Densest k-Subgraph. In particular, any $n^{o(1)}$-approximation algorithm for Network Flow Interdiction would imply an $n^{o(1)}$-approximation algorithm for Densest k-Subgraph. We complement this hardness results with the first ap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02486","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":"uKyO5Q//81zQUu9K8gxluIK4khKYJ9fZ3YyBbfAfBKDjeDALKz1s7a+GSsRKwng2797wuVeNdr+GlXixC+5nCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:46:07.443540Z"},"content_sha256":"00dd9b24269a713179493a18fc9261c24971843ff18db29e6b7f8289745c3fb9","schema_version":"1.0","event_id":"sha256:00dd9b24269a713179493a18fc9261c24971843ff18db29e6b7f8289745c3fb9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KDKVNUR6M5ZHJJTDITZLBESGOQ/bundle.json","state_url":"https://pith.science/pith/KDKVNUR6M5ZHJJTDITZLBESGOQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KDKVNUR6M5ZHJJTDITZLBESGOQ/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-31T09:46:07Z","links":{"resolver":"https://pith.science/pith/KDKVNUR6M5ZHJJTDITZLBESGOQ","bundle":"https://pith.science/pith/KDKVNUR6M5ZHJJTDITZLBESGOQ/bundle.json","state":"https://pith.science/pith/KDKVNUR6M5ZHJJTDITZLBESGOQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KDKVNUR6M5ZHJJTDITZLBESGOQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KDKVNUR6M5ZHJJTDITZLBESGOQ","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":"0630b724999416653b9bb4411de4950b8090fe6e10e03c38cfbc607fecbc5c90","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-08T14:02:04Z","title_canon_sha256":"b8e3f9f55ce1b10f7ebef207bc604b353b2b2d1a39876a0cfea3d7337b469d26"},"schema_version":"1.0","source":{"id":"1511.02486","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.02486","created_at":"2026-05-18T01:27:30Z"},{"alias_kind":"arxiv_version","alias_value":"1511.02486v1","created_at":"2026-05-18T01:27:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02486","created_at":"2026-05-18T01:27:30Z"},{"alias_kind":"pith_short_12","alias_value":"KDKVNUR6M5ZH","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"KDKVNUR6M5ZHJJTD","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"KDKVNUR6","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:00dd9b24269a713179493a18fc9261c24971843ff18db29e6b7f8289745c3fb9","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":"In the Network Flow Interdiction problem an adversary attacks a network in order to minimize the maximum s-t-flow. Very little is known about the approximatibility of this problem despite decades of interest in it. We present the first approximation hardness, showing that Network Flow Interdiction and several of its variants cannot be much easier to approximate than Densest k-Subgraph. In particular, any $n^{o(1)}$-approximation algorithm for Network Flow Interdiction would imply an $n^{o(1)}$-approximation algorithm for Densest k-Subgraph. We complement this hardness results with the first ap","authors_text":"Rico Zenklusen, Stephen R. Chestnut","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-08T14:02:04Z","title":"Hardness and Approximation for Network Flow Interdiction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02486","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:36e4cfb8132a85db3f7509883b21d33854a23dcacd61e15a4bea1bbedd97335d","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":"0630b724999416653b9bb4411de4950b8090fe6e10e03c38cfbc607fecbc5c90","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-08T14:02:04Z","title_canon_sha256":"b8e3f9f55ce1b10f7ebef207bc604b353b2b2d1a39876a0cfea3d7337b469d26"},"schema_version":"1.0","source":{"id":"1511.02486","kind":"arxiv","version":1}},"canonical_sha256":"50d556d23e677274a66344f2b092467414346326b405bd670b7f420dc15cbd9d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"50d556d23e677274a66344f2b092467414346326b405bd670b7f420dc15cbd9d","first_computed_at":"2026-05-18T01:27:30.139882Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:30.139882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a7C9+vfTDjA/p1M9KeDAlAbXyksvKpYIHvMmTOZC180SnbShN3hcvvnow4/QRNXey++VwfgMCLoTSAk245v1DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:30.140440Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.02486","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:36e4cfb8132a85db3f7509883b21d33854a23dcacd61e15a4bea1bbedd97335d","sha256:00dd9b24269a713179493a18fc9261c24971843ff18db29e6b7f8289745c3fb9"],"state_sha256":"e456a8797eec1f2bd798ddac5cf44390b9aeebc0edee7c2cc58d3c3fc4b96f33"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l9nWmCv3req2Q/1n7urO/6KPCMQAvWTJtxt33a+j3rXX2gLZHBqI5vLAj+4UOL/s68JEXhBZWfrCdfjzPD+uDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T09:46:07.446081Z","bundle_sha256":"229f4a1231ea0da41833a8a74201c08ebb00b2fe9799251e332cd20b3d039353"}}