{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:W675PQ4CR7AWKVADSA7NGUEOAQ","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":"6fc746687e415e4cab06df31eb28d36afb1f46b447962efc0ad58a72204ce3cb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-09-01T14:38:17Z","title_canon_sha256":"9b08470711a13ec3d509c124a766272ac6ddd836ae9285b0c1e8ed9dfa192993"},"schema_version":"1.0","source":{"id":"2209.00499","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2209.00499","created_at":"2026-07-05T04:53:50Z"},{"alias_kind":"arxiv_version","alias_value":"2209.00499v1","created_at":"2026-07-05T04:53:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.00499","created_at":"2026-07-05T04:53:50Z"},{"alias_kind":"pith_short_12","alias_value":"W675PQ4CR7AW","created_at":"2026-07-05T04:53:50Z"},{"alias_kind":"pith_short_16","alias_value":"W675PQ4CR7AWKVAD","created_at":"2026-07-05T04:53:50Z"},{"alias_kind":"pith_short_8","alias_value":"W675PQ4C","created_at":"2026-07-05T04:53:50Z"}],"graph_snapshots":[{"event_id":"sha256:1b8f340ac6a94c94d7e14d0ef9805981d6847dc1ca768330ccef9973fb63f0fc","target":"graph","created_at":"2026-07-05T04:53:50Z","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/2209.00499/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Robust optimization typically follows a worst-case perspective, where a single scenario may determine the objective value of a given solution. Accordingly, it is a challenging task to reduce the size of an uncertainty set without changing the resulting objective value too much. On the other hand, robust optimization problems with many scenarios tend to be hard to solve, in particular for two-stage problems. Hence, a reduced uncertainty set may be central to find solutions in reasonable time. We propose scenario reduction methods that give guarantees on the performance of the resulting robust s","authors_text":"Marc Goerigk, Mohammad Khosravi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-09-01T14:38:17Z","title":"Optimal Scenario Reduction for One- and Two-Stage Robust Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.00499","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:e4c808a21e5bb72f6a6ce9b53ecdb62c4899d191067a5dbeee59866e4e156460","target":"record","created_at":"2026-07-05T04:53:50Z","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":"6fc746687e415e4cab06df31eb28d36afb1f46b447962efc0ad58a72204ce3cb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-09-01T14:38:17Z","title_canon_sha256":"9b08470711a13ec3d509c124a766272ac6ddd836ae9285b0c1e8ed9dfa192993"},"schema_version":"1.0","source":{"id":"2209.00499","kind":"arxiv","version":1}},"canonical_sha256":"b7bfd7c3828fc1655403903ed3508e04241ff8088b8046df78609bbb469d2242","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b7bfd7c3828fc1655403903ed3508e04241ff8088b8046df78609bbb469d2242","first_computed_at":"2026-07-05T04:53:50.742064Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:53:50.742064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EfuUXXjuqEtne2DSld8mND6LsUJ8h7tGaofK3MRzNVKHr0+ZGckT1mHi5IxP5GnIvarKaJ7xqQsBfPWvrVfBAA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:53:50.742554Z","signed_message":"canonical_sha256_bytes"},"source_id":"2209.00499","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e4c808a21e5bb72f6a6ce9b53ecdb62c4899d191067a5dbeee59866e4e156460","sha256:1b8f340ac6a94c94d7e14d0ef9805981d6847dc1ca768330ccef9973fb63f0fc"],"state_sha256":"ff8039f4fb69bc8587d572988b0e43d77b96be0f1e107b5da9ca026a5d73a7ed"}