{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:5WVJYHJ6IA6ODCCSC4MM4VJSWB","short_pith_number":"pith:5WVJYHJ6","schema_version":"1.0","canonical_sha256":"edaa9c1d3e403ce188521718ce5532b06c32c520933374f19a8035ad05035ae7","source":{"kind":"arxiv","id":"1611.09754","version":1},"attestation_state":"computed","paper":{"title":"On Scenario Aggregation to Approximate Robust Optimization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Andr\\'e Chassein, Marc Goerigk","submitted_at":"2016-11-29T17:55:38Z","abstract_excerpt":"As most robust combinatorial min-max and min-max regret problems with discrete uncertainty sets are NP-hard, research into approximation algorithm and approximability bounds has been a fruitful area of recent work. A simple and well-known approximation algorithm is the midpoint method, where one takes the average over all scenarios, and solves a problem of nominal type. Despite its simplicity, this method still gives the best-known bound on a wide range of problems, such as robust shortest path, or robust assignment problems.\n  In this paper we present a simple extension of the midpoint method"},"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":"1611.09754","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-29T17:55:38Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"917397e89241fafe71f8cabdf11c26975b65b22b76ce0539bb2bf68b27b09d52","abstract_canon_sha256":"517d420b3b4d931f37d1f628f5a79ee73cff9717ad9b61b7a4462715ba7ce0f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:13.107553Z","signature_b64":"HIyik+KrvliPlQTNKvjnDKHG0YidBR2Cyk/T/KciJqTtejyybojuBzNGjJ/9H+Gqbw1mGUMh11rfE3b2RwPtBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"edaa9c1d3e403ce188521718ce5532b06c32c520933374f19a8035ad05035ae7","last_reissued_at":"2026-05-18T00:56:13.106909Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:13.106909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Scenario Aggregation to Approximate Robust Optimization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Andr\\'e Chassein, Marc Goerigk","submitted_at":"2016-11-29T17:55:38Z","abstract_excerpt":"As most robust combinatorial min-max and min-max regret problems with discrete uncertainty sets are NP-hard, research into approximation algorithm and approximability bounds has been a fruitful area of recent work. A simple and well-known approximation algorithm is the midpoint method, where one takes the average over all scenarios, and solves a problem of nominal type. Despite its simplicity, this method still gives the best-known bound on a wide range of problems, such as robust shortest path, or robust assignment problems.\n  In this paper we present a simple extension of the midpoint method"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.09754","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":"1611.09754","created_at":"2026-05-18T00:56:13.107016+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.09754v1","created_at":"2026-05-18T00:56:13.107016+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09754","created_at":"2026-05-18T00:56:13.107016+00:00"},{"alias_kind":"pith_short_12","alias_value":"5WVJYHJ6IA6O","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"5WVJYHJ6IA6ODCCS","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"5WVJYHJ6","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/5WVJYHJ6IA6ODCCSC4MM4VJSWB","json":"https://pith.science/pith/5WVJYHJ6IA6ODCCSC4MM4VJSWB.json","graph_json":"https://pith.science/api/pith-number/5WVJYHJ6IA6ODCCSC4MM4VJSWB/graph.json","events_json":"https://pith.science/api/pith-number/5WVJYHJ6IA6ODCCSC4MM4VJSWB/events.json","paper":"https://pith.science/paper/5WVJYHJ6"},"agent_actions":{"view_html":"https://pith.science/pith/5WVJYHJ6IA6ODCCSC4MM4VJSWB","download_json":"https://pith.science/pith/5WVJYHJ6IA6ODCCSC4MM4VJSWB.json","view_paper":"https://pith.science/paper/5WVJYHJ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.09754&json=true","fetch_graph":"https://pith.science/api/pith-number/5WVJYHJ6IA6ODCCSC4MM4VJSWB/graph.json","fetch_events":"https://pith.science/api/pith-number/5WVJYHJ6IA6ODCCSC4MM4VJSWB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5WVJYHJ6IA6ODCCSC4MM4VJSWB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5WVJYHJ6IA6ODCCSC4MM4VJSWB/action/storage_attestation","attest_author":"https://pith.science/pith/5WVJYHJ6IA6ODCCSC4MM4VJSWB/action/author_attestation","sign_citation":"https://pith.science/pith/5WVJYHJ6IA6ODCCSC4MM4VJSWB/action/citation_signature","submit_replication":"https://pith.science/pith/5WVJYHJ6IA6ODCCSC4MM4VJSWB/action/replication_record"}},"created_at":"2026-05-18T00:56:13.107016+00:00","updated_at":"2026-05-18T00:56:13.107016+00:00"}