{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:CCUD3UNR3I24WGBX5AUSPRAC6J","short_pith_number":"pith:CCUD3UNR","schema_version":"1.0","canonical_sha256":"10a83dd1b1da35cb1837e82927c402f242f48afbb03587d2af28e50797cba51b","source":{"kind":"arxiv","id":"2411.18590","version":1},"attestation_state":"computed","paper":{"title":"On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.OC"],"primary_cat":"cs.CC","authors_text":"Christoph Gr\\\"une, Lasse Wulf","submitted_at":"2024-11-27T18:32:56Z","abstract_excerpt":"Recoverable robust optimization is a popular multi-stage approach, in which it is possible to adjust a first-stage solution after the uncertain cost scenario is revealed. We consider recoverable robust optimization in combination with discrete budgeted uncertainty. In this setting, it seems plausible that many problems become $\\Sigma^p_3$-complete and therefore it is impossible to find compact IP formulations of them (unless the unlikely conjecture NP $= \\Sigma^p_3$ holds). Even though this seems plausible, few concrete results of this kind are known. In this paper, we fill that gap of knowled"},"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":"2411.18590","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-11-27T18:32:56Z","cross_cats_sorted":["cs.DM","math.OC"],"title_canon_sha256":"d795a7f10ec1d45839ea3b63b80a1c12c094698f4be3885541705fec4003ffc5","abstract_canon_sha256":"f25f274cd98b56640136c0c986ee736a22a49c85bdb93e5467774f906d4d757b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:41:23.930667Z","signature_b64":"3GJRlnEBIXfj9ev2ciw6VAhryLjEwl6W7yInQhPXMWpXf7Fnf4HEzaXulR08K+qbOtIZZW08kyvI3CNPtMv7Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"10a83dd1b1da35cb1837e82927c402f242f48afbb03587d2af28e50797cba51b","last_reissued_at":"2026-07-05T09:41:23.930131Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:41:23.930131Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.OC"],"primary_cat":"cs.CC","authors_text":"Christoph Gr\\\"une, Lasse Wulf","submitted_at":"2024-11-27T18:32:56Z","abstract_excerpt":"Recoverable robust optimization is a popular multi-stage approach, in which it is possible to adjust a first-stage solution after the uncertain cost scenario is revealed. We consider recoverable robust optimization in combination with discrete budgeted uncertainty. In this setting, it seems plausible that many problems become $\\Sigma^p_3$-complete and therefore it is impossible to find compact IP formulations of them (unless the unlikely conjecture NP $= \\Sigma^p_3$ holds). Even though this seems plausible, few concrete results of this kind are known. In this paper, we fill that gap of knowled"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.18590","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.18590/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":"2411.18590","created_at":"2026-07-05T09:41:23.930205+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.18590v1","created_at":"2026-07-05T09:41:23.930205+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.18590","created_at":"2026-07-05T09:41:23.930205+00:00"},{"alias_kind":"pith_short_12","alias_value":"CCUD3UNR3I24","created_at":"2026-07-05T09:41:23.930205+00:00"},{"alias_kind":"pith_short_16","alias_value":"CCUD3UNR3I24WGBX","created_at":"2026-07-05T09:41:23.930205+00:00"},{"alias_kind":"pith_short_8","alias_value":"CCUD3UNR","created_at":"2026-07-05T09:41:23.930205+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/CCUD3UNR3I24WGBX5AUSPRAC6J","json":"https://pith.science/pith/CCUD3UNR3I24WGBX5AUSPRAC6J.json","graph_json":"https://pith.science/api/pith-number/CCUD3UNR3I24WGBX5AUSPRAC6J/graph.json","events_json":"https://pith.science/api/pith-number/CCUD3UNR3I24WGBX5AUSPRAC6J/events.json","paper":"https://pith.science/paper/CCUD3UNR"},"agent_actions":{"view_html":"https://pith.science/pith/CCUD3UNR3I24WGBX5AUSPRAC6J","download_json":"https://pith.science/pith/CCUD3UNR3I24WGBX5AUSPRAC6J.json","view_paper":"https://pith.science/paper/CCUD3UNR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.18590&json=true","fetch_graph":"https://pith.science/api/pith-number/CCUD3UNR3I24WGBX5AUSPRAC6J/graph.json","fetch_events":"https://pith.science/api/pith-number/CCUD3UNR3I24WGBX5AUSPRAC6J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CCUD3UNR3I24WGBX5AUSPRAC6J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CCUD3UNR3I24WGBX5AUSPRAC6J/action/storage_attestation","attest_author":"https://pith.science/pith/CCUD3UNR3I24WGBX5AUSPRAC6J/action/author_attestation","sign_citation":"https://pith.science/pith/CCUD3UNR3I24WGBX5AUSPRAC6J/action/citation_signature","submit_replication":"https://pith.science/pith/CCUD3UNR3I24WGBX5AUSPRAC6J/action/replication_record"}},"created_at":"2026-07-05T09:41:23.930205+00:00","updated_at":"2026-07-05T09:41:23.930205+00:00"}