{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:U23SARMLO6JCWJGHUUIM73Z6SO","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":"f3fd1861083aa277fa4f18c1a704bba208f00fabc03b7e2430c2d6624f958740","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-08-08T13:19:05Z","title_canon_sha256":"bb1fcc9e892d80924543fef3e2afd807a10766aa44539dd9fb7e7ef47ef86df8"},"schema_version":"1.0","source":{"id":"2208.04115","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.04115","created_at":"2026-07-05T04:46:47Z"},{"alias_kind":"arxiv_version","alias_value":"2208.04115v1","created_at":"2026-07-05T04:46:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.04115","created_at":"2026-07-05T04:46:47Z"},{"alias_kind":"pith_short_12","alias_value":"U23SARMLO6JC","created_at":"2026-07-05T04:46:47Z"},{"alias_kind":"pith_short_16","alias_value":"U23SARMLO6JCWJGH","created_at":"2026-07-05T04:46:47Z"},{"alias_kind":"pith_short_8","alias_value":"U23SARML","created_at":"2026-07-05T04:46:47Z"}],"graph_snapshots":[{"event_id":"sha256:b31c92b4bf44e3deab76ce3385fffe6955fac5d5a0417d21ef571b7c0fcd0374","target":"graph","created_at":"2026-07-05T04:46:47Z","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/2208.04115/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Uncertain optimization problems with decision dependent information discovery allow the decision maker to control the timing of information discovery, in contrast to the classic multistage setting where uncertain parameters are revealed sequentially based on a prescribed filtration. This problem class is useful in a wide range of applications, however, its assimilation is partly limited by the lack of efficient solution schemes. In this paper we study two-stage robust optimization problems with decision dependent information discovery where uncertainty appears in the objective function. The co","authors_text":"Angelos Georghiou, Denise T\\\"onissen, Rosario Paradiso, Said Dabia","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-08-08T13:19:05Z","title":"Exact and Approximate Schemes for Robust Optimization Problems with Decision Dependent Information Discovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.04115","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:dc95142c6048666e2d8767707193c9296b69ea8996abf45d5b30bdf92e98e91a","target":"record","created_at":"2026-07-05T04:46:47Z","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":"f3fd1861083aa277fa4f18c1a704bba208f00fabc03b7e2430c2d6624f958740","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-08-08T13:19:05Z","title_canon_sha256":"bb1fcc9e892d80924543fef3e2afd807a10766aa44539dd9fb7e7ef47ef86df8"},"schema_version":"1.0","source":{"id":"2208.04115","kind":"arxiv","version":1}},"canonical_sha256":"a6b720458b77922b24c7a510cfef3e9397a64cff50f07a0b07dfbadbe06a89f7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a6b720458b77922b24c7a510cfef3e9397a64cff50f07a0b07dfbadbe06a89f7","first_computed_at":"2026-07-05T04:46:47.888952Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:46:47.888952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"llzm2LtdYugqZr3sd9Pyf45jPZ8U/bbDCDVWBH5Qy/H0vt9jX0q/6EPR2ezkzEkxuWQVg162NhZG80OKUfDICQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:46:47.889437Z","signed_message":"canonical_sha256_bytes"},"source_id":"2208.04115","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc95142c6048666e2d8767707193c9296b69ea8996abf45d5b30bdf92e98e91a","sha256:b31c92b4bf44e3deab76ce3385fffe6955fac5d5a0417d21ef571b7c0fcd0374"],"state_sha256":"cfaaa37b40e3c50f185909944d5aca67e6d924f9ea97da51a5e941f8488348fa"}