{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:6CYUWMYGBPJOENFYP3D4M2DQCQ","short_pith_number":"pith:6CYUWMYG","schema_version":"1.0","canonical_sha256":"f0b14b33060bd2e234b87ec7c66870141fd3c85da964e902a3741e703ec35fd2","source":{"kind":"arxiv","id":"1601.03603","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1601.03603","created_at":"2026-05-18T01:22:53.047635+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.03603v1","created_at":"2026-05-18T01:22:53.047635+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.03603","created_at":"2026-05-18T01:22:53.047635+00:00"},{"alias_kind":"pith_short_12","alias_value":"6CYUWMYGBPJO","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"6CYUWMYGBPJOENFY","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"6CYUWMYG","created_at":"2026-05-18T12:30:01.593930+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6CYUWMYGBPJOENFYP3D4M2DQCQ","json":"https://pith.science/pith/6CYUWMYGBPJOENFYP3D4M2DQCQ.json","graph_json":"https://pith.science/api/pith-number/6CYUWMYGBPJOENFYP3D4M2DQCQ/graph.json","events_json":"https://pith.science/api/pith-number/6CYUWMYGBPJOENFYP3D4M2DQCQ/events.json","paper":"https://pith.science/paper/6CYUWMYG"},"agent_actions":{"view_html":"https://pith.science/pith/6CYUWMYGBPJOENFYP3D4M2DQCQ","download_json":"https://pith.science/pith/6CYUWMYGBPJOENFYP3D4M2DQCQ.json","view_paper":"https://pith.science/paper/6CYUWMYG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.03603&json=true","fetch_graph":"https://pith.science/api/pith-number/6CYUWMYGBPJOENFYP3D4M2DQCQ/graph.json","fetch_events":"https://pith.science/api/pith-number/6CYUWMYGBPJOENFYP3D4M2DQCQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6CYUWMYGBPJOENFYP3D4M2DQCQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6CYUWMYGBPJOENFYP3D4M2DQCQ/action/storage_attestation","attest_author":"https://pith.science/pith/6CYUWMYGBPJOENFYP3D4M2DQCQ/action/author_attestation","sign_citation":"https://pith.science/pith/6CYUWMYGBPJOENFYP3D4M2DQCQ/action/citation_signature","submit_replication":"https://pith.science/pith/6CYUWMYGBPJOENFYP3D4M2DQCQ/action/replication_record"}},"created_at":"2026-05-18T01:22:53.047635+00:00","updated_at":"2026-05-18T01:22:53.047635+00:00"}