{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:6CYUWMYGBPJOENFYP3D4M2DQCQ","short_pith_number":"pith:6CYUWMYG","canonical_record":{"source":{"id":"1601.03603","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-01-14T14:31:10Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"b35d5e470bcc7d5087d546e941fdced891c58057385196c125693b5bbb97e48d","abstract_canon_sha256":"a0e0a81de8c9623bf7c08a7220fee2ab3f3d1152e57ed1f6038aa3d27d127cfc"},"schema_version":"1.0"},"canonical_sha256":"f0b14b33060bd2e234b87ec7c66870141fd3c85da964e902a3741e703ec35fd2","source":{"kind":"arxiv","id":"1601.03603","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.03603","created_at":"2026-05-18T01:22:53Z"},{"alias_kind":"arxiv_version","alias_value":"1601.03603v1","created_at":"2026-05-18T01:22:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.03603","created_at":"2026-05-18T01:22:53Z"},{"alias_kind":"pith_short_12","alias_value":"6CYUWMYGBPJO","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6CYUWMYGBPJOENFY","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6CYUWMYG","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:6CYUWMYGBPJOENFYP3D4M2DQCQ","target":"record","payload":{"canonical_record":{"source":{"id":"1601.03603","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-01-14T14:31:10Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"b35d5e470bcc7d5087d546e941fdced891c58057385196c125693b5bbb97e48d","abstract_canon_sha256":"a0e0a81de8c9623bf7c08a7220fee2ab3f3d1152e57ed1f6038aa3d27d127cfc"},"schema_version":"1.0"},"canonical_sha256":"f0b14b33060bd2e234b87ec7c66870141fd3c85da964e902a3741e703ec35fd2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:53.048060Z","signature_b64":"RKfYFnbXEB/ov4iCgtQ4Nn1cuC+ZRV0nO0CjDGV0JTl3hVj75CzO/XyN7XNr5IMX32ayaojWc2M4leW67eruDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0b14b33060bd2e234b87ec7c66870141fd3c85da964e902a3741e703ec35fd2","last_reissued_at":"2026-05-18T01:22:53.047558Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:53.047558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.03603","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:22:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nlcgnFk7kURCvS2YSc/aJ3JX/i6V6x/i4ixUkWOBXH+D+jEKgVs7ll+s1a+ALBhVHxxAfvtSsWUDt+lEw6RhAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T18:18:58.527179Z"},"content_sha256":"7ffda5d90dd5267db5dc229bf3d4f81e22b446e2ca7f89b9b6c2fe096ff2bb68","schema_version":"1.0","event_id":"sha256:7ffda5d90dd5267db5dc229bf3d4f81e22b446e2ca7f89b9b6c2fe096ff2bb68"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:6CYUWMYGBPJOENFYP3D4M2DQCQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Protection of flows under targeted attacks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Britta Peis, Gianpaolo Oriolo, Jannik Matuschke, Martin Skutella, S. Thomas McCormick","submitted_at":"2016-01-14T14:31:10Z","abstract_excerpt":"Due to the importance of robustness in many real-world optimization problems, the field of robust optimization has gained a lot of attention over the past decade. We concentrate on maximum flow problems and introduce a novel robust optimization model which, compared to known models from the literature, features several advantageous properties: (i) We consider a general class of path-based flow problems which can be used to model a large variety of network routing problems (and other packing problems). (ii) We aim at solutions that are robust against targeted attacks by a potent adversary who m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.03603","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:22:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RVQ1+0JByem9CmyZLPGrHTYQ06mCbGrXkMB/vX2Kd6NnU1yi1wO1i3ReLnyuvxFVxjAb1xXmJXDtsYs5mCsYDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T18:18:58.527542Z"},"content_sha256":"3423eaa18bcdaa086919f1f4100fe13516aaf56f1a390c8b3fe6d655ae8b99f8","schema_version":"1.0","event_id":"sha256:3423eaa18bcdaa086919f1f4100fe13516aaf56f1a390c8b3fe6d655ae8b99f8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6CYUWMYGBPJOENFYP3D4M2DQCQ/bundle.json","state_url":"https://pith.science/pith/6CYUWMYGBPJOENFYP3D4M2DQCQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6CYUWMYGBPJOENFYP3D4M2DQCQ/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-03T18:18:58Z","links":{"resolver":"https://pith.science/pith/6CYUWMYGBPJOENFYP3D4M2DQCQ","bundle":"https://pith.science/pith/6CYUWMYGBPJOENFYP3D4M2DQCQ/bundle.json","state":"https://pith.science/pith/6CYUWMYGBPJOENFYP3D4M2DQCQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6CYUWMYGBPJOENFYP3D4M2DQCQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:6CYUWMYGBPJOENFYP3D4M2DQCQ","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":"a0e0a81de8c9623bf7c08a7220fee2ab3f3d1152e57ed1f6038aa3d27d127cfc","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-01-14T14:31:10Z","title_canon_sha256":"b35d5e470bcc7d5087d546e941fdced891c58057385196c125693b5bbb97e48d"},"schema_version":"1.0","source":{"id":"1601.03603","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.03603","created_at":"2026-05-18T01:22:53Z"},{"alias_kind":"arxiv_version","alias_value":"1601.03603v1","created_at":"2026-05-18T01:22:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.03603","created_at":"2026-05-18T01:22:53Z"},{"alias_kind":"pith_short_12","alias_value":"6CYUWMYGBPJO","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6CYUWMYGBPJOENFY","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6CYUWMYG","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:3423eaa18bcdaa086919f1f4100fe13516aaf56f1a390c8b3fe6d655ae8b99f8","target":"graph","created_at":"2026-05-18T01:22:53Z","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":"Due to the importance of robustness in many real-world optimization problems, the field of robust optimization has gained a lot of attention over the past decade. We concentrate on maximum flow problems and introduce a novel robust optimization model which, compared to known models from the literature, features several advantageous properties: (i) We consider a general class of path-based flow problems which can be used to model a large variety of network routing problems (and other packing problems). (ii) We aim at solutions that are robust against targeted attacks by a potent adversary who m","authors_text":"Britta Peis, Gianpaolo Oriolo, Jannik Matuschke, Martin Skutella, S. Thomas McCormick","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-01-14T14:31:10Z","title":"Protection of flows under targeted attacks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.03603","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:7ffda5d90dd5267db5dc229bf3d4f81e22b446e2ca7f89b9b6c2fe096ff2bb68","target":"record","created_at":"2026-05-18T01:22:53Z","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":"a0e0a81de8c9623bf7c08a7220fee2ab3f3d1152e57ed1f6038aa3d27d127cfc","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-01-14T14:31:10Z","title_canon_sha256":"b35d5e470bcc7d5087d546e941fdced891c58057385196c125693b5bbb97e48d"},"schema_version":"1.0","source":{"id":"1601.03603","kind":"arxiv","version":1}},"canonical_sha256":"f0b14b33060bd2e234b87ec7c66870141fd3c85da964e902a3741e703ec35fd2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f0b14b33060bd2e234b87ec7c66870141fd3c85da964e902a3741e703ec35fd2","first_computed_at":"2026-05-18T01:22:53.047558Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:53.047558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RKfYFnbXEB/ov4iCgtQ4Nn1cuC+ZRV0nO0CjDGV0JTl3hVj75CzO/XyN7XNr5IMX32ayaojWc2M4leW67eruDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:53.048060Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.03603","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7ffda5d90dd5267db5dc229bf3d4f81e22b446e2ca7f89b9b6c2fe096ff2bb68","sha256:3423eaa18bcdaa086919f1f4100fe13516aaf56f1a390c8b3fe6d655ae8b99f8"],"state_sha256":"d9f7a2bb5baff4782467c42210d622a9e90bcd2d84d2143e5f8483f64631fc4d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zDfcIgFgZ7sJ43YGUDugi2D7UEOTqAgVXJqKUqTKF9m1kdtsqmt0svmnw8EEtqXyc3R8NxMQrV1TSu/YHfJFAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T18:18:58.529461Z","bundle_sha256":"b29ecec759fe7eafc4be893ef46845a8c4d618cfe2ed5ef815a5413e948a5bbe"}}