{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:GJQAVZUQHMAZN4GOHO63CQHL2E","short_pith_number":"pith:GJQAVZUQ","schema_version":"1.0","canonical_sha256":"32600ae6903b0196f0ce3bbdb140ebd11b6fcd24af5e1395ceb1cffc99e347b7","source":{"kind":"arxiv","id":"1705.08161","version":1},"attestation_state":"computed","paper":{"title":"Computational Methods for Path-based Robust Flows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DM","authors_text":"Andreas Wierz, Britta Peis, Fabian Mies","submitted_at":"2017-05-23T10:12:48Z","abstract_excerpt":"Real world networks are often subject to severe uncertainties which need to be addressed by any reliable prescriptive model. In the context of the maximum flow problem subject to arc failure, robust models have gained particular attention. For a path-based model, the resulting optimization problem is assumed to be difficult in the literature, yet the complexity status is widely unknown. We present a computational approach to solve the robust flow problem to optimality by simultaneous primal and dual separation, the practical efficacy of which is shown by a computational study.\n  Furthermore, w"},"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":"1705.08161","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-23T10:12:48Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"1620cb3304fd349b220e701967f61ba65fa23de7b5635001a0dbcfc343362e0e","abstract_canon_sha256":"f9e7091486ee57eab7ccd40c43c84f227a7616d50295d7eae0ac65827a3acbdc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:49.169872Z","signature_b64":"MwvSLAxlh2bRKCsvmPMur7tugY9VYtFGJtMVAoOGTHBiLEUxjhtGdlUSAvuQECOE41jxM4K7MEIvxcJj++j9Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32600ae6903b0196f0ce3bbdb140ebd11b6fcd24af5e1395ceb1cffc99e347b7","last_reissued_at":"2026-05-18T00:43:49.169182Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:49.169182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computational Methods for Path-based Robust Flows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DM","authors_text":"Andreas Wierz, Britta Peis, Fabian Mies","submitted_at":"2017-05-23T10:12:48Z","abstract_excerpt":"Real world networks are often subject to severe uncertainties which need to be addressed by any reliable prescriptive model. In the context of the maximum flow problem subject to arc failure, robust models have gained particular attention. For a path-based model, the resulting optimization problem is assumed to be difficult in the literature, yet the complexity status is widely unknown. We present a computational approach to solve the robust flow problem to optimality by simultaneous primal and dual separation, the practical efficacy of which is shown by a computational study.\n  Furthermore, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.08161","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":"1705.08161","created_at":"2026-05-18T00:43:49.169342+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.08161v1","created_at":"2026-05-18T00:43:49.169342+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08161","created_at":"2026-05-18T00:43:49.169342+00:00"},{"alias_kind":"pith_short_12","alias_value":"GJQAVZUQHMAZ","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"GJQAVZUQHMAZN4GO","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"GJQAVZUQ","created_at":"2026-05-18T12:31:18.294218+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/GJQAVZUQHMAZN4GOHO63CQHL2E","json":"https://pith.science/pith/GJQAVZUQHMAZN4GOHO63CQHL2E.json","graph_json":"https://pith.science/api/pith-number/GJQAVZUQHMAZN4GOHO63CQHL2E/graph.json","events_json":"https://pith.science/api/pith-number/GJQAVZUQHMAZN4GOHO63CQHL2E/events.json","paper":"https://pith.science/paper/GJQAVZUQ"},"agent_actions":{"view_html":"https://pith.science/pith/GJQAVZUQHMAZN4GOHO63CQHL2E","download_json":"https://pith.science/pith/GJQAVZUQHMAZN4GOHO63CQHL2E.json","view_paper":"https://pith.science/paper/GJQAVZUQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.08161&json=true","fetch_graph":"https://pith.science/api/pith-number/GJQAVZUQHMAZN4GOHO63CQHL2E/graph.json","fetch_events":"https://pith.science/api/pith-number/GJQAVZUQHMAZN4GOHO63CQHL2E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GJQAVZUQHMAZN4GOHO63CQHL2E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GJQAVZUQHMAZN4GOHO63CQHL2E/action/storage_attestation","attest_author":"https://pith.science/pith/GJQAVZUQHMAZN4GOHO63CQHL2E/action/author_attestation","sign_citation":"https://pith.science/pith/GJQAVZUQHMAZN4GOHO63CQHL2E/action/citation_signature","submit_replication":"https://pith.science/pith/GJQAVZUQHMAZN4GOHO63CQHL2E/action/replication_record"}},"created_at":"2026-05-18T00:43:49.169342+00:00","updated_at":"2026-05-18T00:43:49.169342+00:00"}