{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:EDNAXJLORR7SJPJXPROR42ZRIY","short_pith_number":"pith:EDNAXJLO","schema_version":"1.0","canonical_sha256":"20da0ba56e8c7f24bd377c5d1e6b3146182d0cee3cf760a9bdc26aaa21caca25","source":{"kind":"arxiv","id":"2106.03107","version":4},"attestation_state":"computed","paper":{"title":"Approximation Algorithms for Min-max-min Robust Optimization and K-Adaptability under Objective Uncertainty","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.OC","authors_text":"Jannis Kurtz","submitted_at":"2021-06-06T12:39:43Z","abstract_excerpt":"In this work we investigate the min-max-min robust optimization problem and the k-adaptability robust optimization problem for binary problems with uncertain costs. The idea of the first approach is to calculate a set of k feasible solutions which are worst-case optimal if in each possible scenario the best of the k solutions is implemented. It is known that the min-max-min robust problem can be solved efficiently if k is at least the dimension of the problem, while it is theoretically and computationally hard if k is small. However, nothing is known about the intermediate case, i.e. k lies be"},"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":"2106.03107","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-06-06T12:39:43Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"d35a834a6e64967a83582c1a9bc33fe8e1cfd1611de4bdec5bea592b82e5bb81","abstract_canon_sha256":"279fe58d8d10fe753dd981a8797bc3f76a737e98c698d4890aefd8618ac6abf2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:41:00.363052Z","signature_b64":"kA86UyXyB1VoLnFz7tjxHAr7E2C0nPC7WHjBiwHkqIBCv4uhEF++QkKJ1liNwo5rmIsV3Eyp984tjBIRqCHqDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20da0ba56e8c7f24bd377c5d1e6b3146182d0cee3cf760a9bdc26aaa21caca25","last_reissued_at":"2026-07-05T06:41:00.362648Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:41:00.362648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation Algorithms for Min-max-min Robust Optimization and K-Adaptability under Objective Uncertainty","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.OC","authors_text":"Jannis Kurtz","submitted_at":"2021-06-06T12:39:43Z","abstract_excerpt":"In this work we investigate the min-max-min robust optimization problem and the k-adaptability robust optimization problem for binary problems with uncertain costs. The idea of the first approach is to calculate a set of k feasible solutions which are worst-case optimal if in each possible scenario the best of the k solutions is implemented. It is known that the min-max-min robust problem can be solved efficiently if k is at least the dimension of the problem, while it is theoretically and computationally hard if k is small. However, nothing is known about the intermediate case, i.e. k lies be"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.03107","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2106.03107/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2106.03107","created_at":"2026-07-05T06:41:00.362707+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.03107v4","created_at":"2026-07-05T06:41:00.362707+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.03107","created_at":"2026-07-05T06:41:00.362707+00:00"},{"alias_kind":"pith_short_12","alias_value":"EDNAXJLORR7S","created_at":"2026-07-05T06:41:00.362707+00:00"},{"alias_kind":"pith_short_16","alias_value":"EDNAXJLORR7SJPJX","created_at":"2026-07-05T06:41:00.362707+00:00"},{"alias_kind":"pith_short_8","alias_value":"EDNAXJLO","created_at":"2026-07-05T06:41:00.362707+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.07368","citing_title":"A K-adaptability Approach to Proton Radiation Therapy Robust Treatment Planning","ref_index":31,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EDNAXJLORR7SJPJXPROR42ZRIY","json":"https://pith.science/pith/EDNAXJLORR7SJPJXPROR42ZRIY.json","graph_json":"https://pith.science/api/pith-number/EDNAXJLORR7SJPJXPROR42ZRIY/graph.json","events_json":"https://pith.science/api/pith-number/EDNAXJLORR7SJPJXPROR42ZRIY/events.json","paper":"https://pith.science/paper/EDNAXJLO"},"agent_actions":{"view_html":"https://pith.science/pith/EDNAXJLORR7SJPJXPROR42ZRIY","download_json":"https://pith.science/pith/EDNAXJLORR7SJPJXPROR42ZRIY.json","view_paper":"https://pith.science/paper/EDNAXJLO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.03107&json=true","fetch_graph":"https://pith.science/api/pith-number/EDNAXJLORR7SJPJXPROR42ZRIY/graph.json","fetch_events":"https://pith.science/api/pith-number/EDNAXJLORR7SJPJXPROR42ZRIY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EDNAXJLORR7SJPJXPROR42ZRIY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EDNAXJLORR7SJPJXPROR42ZRIY/action/storage_attestation","attest_author":"https://pith.science/pith/EDNAXJLORR7SJPJXPROR42ZRIY/action/author_attestation","sign_citation":"https://pith.science/pith/EDNAXJLORR7SJPJXPROR42ZRIY/action/citation_signature","submit_replication":"https://pith.science/pith/EDNAXJLORR7SJPJXPROR42ZRIY/action/replication_record"}},"created_at":"2026-07-05T06:41:00.362707+00:00","updated_at":"2026-07-05T06:41:00.362707+00:00"}