{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:EDNAXJLORR7SJPJXPROR42ZRIY","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":"279fe58d8d10fe753dd981a8797bc3f76a737e98c698d4890aefd8618ac6abf2","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-06-06T12:39:43Z","title_canon_sha256":"d35a834a6e64967a83582c1a9bc33fe8e1cfd1611de4bdec5bea592b82e5bb81"},"schema_version":"1.0","source":{"id":"2106.03107","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.03107","created_at":"2026-07-05T06:41:00Z"},{"alias_kind":"arxiv_version","alias_value":"2106.03107v4","created_at":"2026-07-05T06:41:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.03107","created_at":"2026-07-05T06:41:00Z"},{"alias_kind":"pith_short_12","alias_value":"EDNAXJLORR7S","created_at":"2026-07-05T06:41:00Z"},{"alias_kind":"pith_short_16","alias_value":"EDNAXJLORR7SJPJX","created_at":"2026-07-05T06:41:00Z"},{"alias_kind":"pith_short_8","alias_value":"EDNAXJLO","created_at":"2026-07-05T06:41:00Z"}],"graph_snapshots":[{"event_id":"sha256:afed502c5193614b992f55374f901bfdf3cf35829a7e0752ec32fdd4a78f89fa","target":"graph","created_at":"2026-07-05T06:41:00Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2106.03107/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Jannis Kurtz","cross_cats":["cs.CC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-06-06T12:39:43Z","title":"Approximation Algorithms for Min-max-min Robust Optimization and K-Adaptability under Objective Uncertainty"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.03107","kind":"arxiv","version":4},"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:b3e2a3d186e1ff2a2af448c2391cadabe3e408aa6f9baac9afc5c843266559d3","target":"record","created_at":"2026-07-05T06:41:00Z","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":"279fe58d8d10fe753dd981a8797bc3f76a737e98c698d4890aefd8618ac6abf2","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-06-06T12:39:43Z","title_canon_sha256":"d35a834a6e64967a83582c1a9bc33fe8e1cfd1611de4bdec5bea592b82e5bb81"},"schema_version":"1.0","source":{"id":"2106.03107","kind":"arxiv","version":4}},"canonical_sha256":"20da0ba56e8c7f24bd377c5d1e6b3146182d0cee3cf760a9bdc26aaa21caca25","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"20da0ba56e8c7f24bd377c5d1e6b3146182d0cee3cf760a9bdc26aaa21caca25","first_computed_at":"2026-07-05T06:41:00.362648Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:41:00.362648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kA86UyXyB1VoLnFz7tjxHAr7E2C0nPC7WHjBiwHkqIBCv4uhEF++QkKJ1liNwo5rmIsV3Eyp984tjBIRqCHqDg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:41:00.363052Z","signed_message":"canonical_sha256_bytes"},"source_id":"2106.03107","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b3e2a3d186e1ff2a2af448c2391cadabe3e408aa6f9baac9afc5c843266559d3","sha256:afed502c5193614b992f55374f901bfdf3cf35829a7e0752ec32fdd4a78f89fa"],"state_sha256":"8de09c1273340e02c0e253d00ee057e4f72cf8f05fa0e46e330f0ea4524a5616"}