{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:CCUD3UNR3I24WGBX5AUSPRAC6J","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":"f25f274cd98b56640136c0c986ee736a22a49c85bdb93e5467774f906d4d757b","cross_cats_sorted":["cs.DM","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-11-27T18:32:56Z","title_canon_sha256":"d795a7f10ec1d45839ea3b63b80a1c12c094698f4be3885541705fec4003ffc5"},"schema_version":"1.0","source":{"id":"2411.18590","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.18590","created_at":"2026-07-05T09:41:23Z"},{"alias_kind":"arxiv_version","alias_value":"2411.18590v1","created_at":"2026-07-05T09:41:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.18590","created_at":"2026-07-05T09:41:23Z"},{"alias_kind":"pith_short_12","alias_value":"CCUD3UNR3I24","created_at":"2026-07-05T09:41:23Z"},{"alias_kind":"pith_short_16","alias_value":"CCUD3UNR3I24WGBX","created_at":"2026-07-05T09:41:23Z"},{"alias_kind":"pith_short_8","alias_value":"CCUD3UNR","created_at":"2026-07-05T09:41:23Z"}],"graph_snapshots":[{"event_id":"sha256:29248028355cc9b859bbfa1db72f849736b96eb680ae2dc6c8908c3f6b887375","target":"graph","created_at":"2026-07-05T09:41:23Z","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/2411.18590/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Christoph Gr\\\"une, Lasse Wulf","cross_cats":["cs.DM","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-11-27T18:32:56Z","title":"On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.18590","kind":"arxiv","version":1},"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:c3347b697a87857aa4e479d15d0ce2c14c39634b07a848b578c8c0e1ff748976","target":"record","created_at":"2026-07-05T09:41:23Z","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":"f25f274cd98b56640136c0c986ee736a22a49c85bdb93e5467774f906d4d757b","cross_cats_sorted":["cs.DM","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-11-27T18:32:56Z","title_canon_sha256":"d795a7f10ec1d45839ea3b63b80a1c12c094698f4be3885541705fec4003ffc5"},"schema_version":"1.0","source":{"id":"2411.18590","kind":"arxiv","version":1}},"canonical_sha256":"10a83dd1b1da35cb1837e82927c402f242f48afbb03587d2af28e50797cba51b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"10a83dd1b1da35cb1837e82927c402f242f48afbb03587d2af28e50797cba51b","first_computed_at":"2026-07-05T09:41:23.930131Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:41:23.930131Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3GJRlnEBIXfj9ev2ciw6VAhryLjEwl6W7yInQhPXMWpXf7Fnf4HEzaXulR08K+qbOtIZZW08kyvI3CNPtMv7Ag==","signature_status":"signed_v1","signed_at":"2026-07-05T09:41:23.930667Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.18590","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c3347b697a87857aa4e479d15d0ce2c14c39634b07a848b578c8c0e1ff748976","sha256:29248028355cc9b859bbfa1db72f849736b96eb680ae2dc6c8908c3f6b887375"],"state_sha256":"03c026733b2bad03cee7d069f16a26a2040c8968e76f89e660d9673cecc56a5a"}