{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZLBF5ZQ4CVHWJXOYSX4AIMDWNR","short_pith_number":"pith:ZLBF5ZQ4","canonical_record":{"source":{"id":"1704.08241","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-04-26T17:56:14Z","cross_cats_sorted":[],"title_canon_sha256":"f9fcc569221176249ba0ef68c83df6eb14f6b7291944c948c32434b151e704aa","abstract_canon_sha256":"44d81b350b463aef3c20af7bc178b581092face212618151a0d278bd3517dab5"},"schema_version":"1.0"},"canonical_sha256":"cac25ee61c154f64ddd895f80430766c59536885537562deaada22074d7c657e","source":{"kind":"arxiv","id":"1704.08241","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.08241","created_at":"2026-05-18T00:38:18Z"},{"alias_kind":"arxiv_version","alias_value":"1704.08241v2","created_at":"2026-05-18T00:38:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08241","created_at":"2026-05-18T00:38:18Z"},{"alias_kind":"pith_short_12","alias_value":"ZLBF5ZQ4CVHW","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZLBF5ZQ4CVHWJXOY","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZLBF5ZQ4","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZLBF5ZQ4CVHWJXOYSX4AIMDWNR","target":"record","payload":{"canonical_record":{"source":{"id":"1704.08241","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-04-26T17:56:14Z","cross_cats_sorted":[],"title_canon_sha256":"f9fcc569221176249ba0ef68c83df6eb14f6b7291944c948c32434b151e704aa","abstract_canon_sha256":"44d81b350b463aef3c20af7bc178b581092face212618151a0d278bd3517dab5"},"schema_version":"1.0"},"canonical_sha256":"cac25ee61c154f64ddd895f80430766c59536885537562deaada22074d7c657e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:18.137133Z","signature_b64":"QpKcE1XIQNWKIg1Z9k0vxfPbd7CdjXQupyCRi/CktZsEitrJVePxFZjnW1Gj4uHDn2+5PnjCyQRzDIUTxlxZCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cac25ee61c154f64ddd895f80430766c59536885537562deaada22074d7c657e","last_reissued_at":"2026-05-18T00:38:18.136338Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:18.136338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.08241","source_version":2,"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-18T00:38:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ijs7/vPMdPLpwWR96kTRZcVLUITlI8OVaILmV8LHD6RKV1hcThB7wsMTWhSjwNIeLlC+jxclkyg8iL+i6pWTBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T12:49:41.386200Z"},"content_sha256":"ffe4538ec29fe9a4a48fc7a5e9dfe1743221d2eee102147eca28f8abecb4bb12","schema_version":"1.0","event_id":"sha256:ffe4538ec29fe9a4a48fc7a5e9dfe1743221d2eee102147eca28f8abecb4bb12"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZLBF5ZQ4CVHWJXOYSX4AIMDWNR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Complexity of Computing a Robust Flow","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Jannik Matuschke, Yann Disser","submitted_at":"2017-04-26T17:56:14Z","abstract_excerpt":"Robust network flows are a concept for dealing with uncertainty and unforeseen failures in the network infrastructure. They and their dual counterpart, network flow interdiction, have received steady attention within the operations research community over the past years. One of the most basic models is the Maximum Robust Flow Problem: Given a network and an integer k, the task is to find a path flow of maximum robust value, i.e., the guaranteed value of surviving flow after removal of any k arcs in the network. The complexity of this problem appeared to have been settled almost a decade ago: A"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08241","kind":"arxiv","version":2},"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-18T00:38:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gxZ1uSYchBNX47uNMclCI9D5H4W1u8BUpYJSvXtTYT82gkanTJnraclE7pPTw08iy7RJrRJDWrULZgTn/jkAAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T12:49:41.386577Z"},"content_sha256":"2aacbb86dd48ba91d605dc495d57efb5650de3a4432a5df11099f3649fdc4499","schema_version":"1.0","event_id":"sha256:2aacbb86dd48ba91d605dc495d57efb5650de3a4432a5df11099f3649fdc4499"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZLBF5ZQ4CVHWJXOYSX4AIMDWNR/bundle.json","state_url":"https://pith.science/pith/ZLBF5ZQ4CVHWJXOYSX4AIMDWNR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZLBF5ZQ4CVHWJXOYSX4AIMDWNR/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-03T12:49:41Z","links":{"resolver":"https://pith.science/pith/ZLBF5ZQ4CVHWJXOYSX4AIMDWNR","bundle":"https://pith.science/pith/ZLBF5ZQ4CVHWJXOYSX4AIMDWNR/bundle.json","state":"https://pith.science/pith/ZLBF5ZQ4CVHWJXOYSX4AIMDWNR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZLBF5ZQ4CVHWJXOYSX4AIMDWNR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZLBF5ZQ4CVHWJXOYSX4AIMDWNR","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":"44d81b350b463aef3c20af7bc178b581092face212618151a0d278bd3517dab5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-04-26T17:56:14Z","title_canon_sha256":"f9fcc569221176249ba0ef68c83df6eb14f6b7291944c948c32434b151e704aa"},"schema_version":"1.0","source":{"id":"1704.08241","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.08241","created_at":"2026-05-18T00:38:18Z"},{"alias_kind":"arxiv_version","alias_value":"1704.08241v2","created_at":"2026-05-18T00:38:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08241","created_at":"2026-05-18T00:38:18Z"},{"alias_kind":"pith_short_12","alias_value":"ZLBF5ZQ4CVHW","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZLBF5ZQ4CVHWJXOY","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZLBF5ZQ4","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:2aacbb86dd48ba91d605dc495d57efb5650de3a4432a5df11099f3649fdc4499","target":"graph","created_at":"2026-05-18T00:38:18Z","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":"Robust network flows are a concept for dealing with uncertainty and unforeseen failures in the network infrastructure. They and their dual counterpart, network flow interdiction, have received steady attention within the operations research community over the past years. One of the most basic models is the Maximum Robust Flow Problem: Given a network and an integer k, the task is to find a path flow of maximum robust value, i.e., the guaranteed value of surviving flow after removal of any k arcs in the network. The complexity of this problem appeared to have been settled almost a decade ago: A","authors_text":"Jannik Matuschke, Yann Disser","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-04-26T17:56:14Z","title":"The Complexity of Computing a Robust Flow"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08241","kind":"arxiv","version":2},"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:ffe4538ec29fe9a4a48fc7a5e9dfe1743221d2eee102147eca28f8abecb4bb12","target":"record","created_at":"2026-05-18T00:38:18Z","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":"44d81b350b463aef3c20af7bc178b581092face212618151a0d278bd3517dab5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-04-26T17:56:14Z","title_canon_sha256":"f9fcc569221176249ba0ef68c83df6eb14f6b7291944c948c32434b151e704aa"},"schema_version":"1.0","source":{"id":"1704.08241","kind":"arxiv","version":2}},"canonical_sha256":"cac25ee61c154f64ddd895f80430766c59536885537562deaada22074d7c657e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cac25ee61c154f64ddd895f80430766c59536885537562deaada22074d7c657e","first_computed_at":"2026-05-18T00:38:18.136338Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:18.136338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QpKcE1XIQNWKIg1Z9k0vxfPbd7CdjXQupyCRi/CktZsEitrJVePxFZjnW1Gj4uHDn2+5PnjCyQRzDIUTxlxZCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:18.137133Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.08241","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ffe4538ec29fe9a4a48fc7a5e9dfe1743221d2eee102147eca28f8abecb4bb12","sha256:2aacbb86dd48ba91d605dc495d57efb5650de3a4432a5df11099f3649fdc4499"],"state_sha256":"af1b46e7f3d627430e015e6d903cdd428d0e9d4f1208e620d701fcac314fd75d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rhuQVmSz0h3Hm6dF2q3Xdsb6zXBYhct7Zfvvj5lRYe6GKsLVQbbt7d6Gg0L/i298lC/6Lnd2oi1OsVDUC4UCBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T12:49:41.388504Z","bundle_sha256":"d21c098074b2776b4dcb40f2d5dbe98625ce0a06691020731991a59b0def0921"}}