{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:EXTETRL2UVPKMYZAU2MLZ6JUQQ","short_pith_number":"pith:EXTETRL2","canonical_record":{"source":{"id":"1606.07380","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-06-23T17:30:08Z","cross_cats_sorted":[],"title_canon_sha256":"77570df8d59a0c6752aaaed4efaa190771ac85c7812b975b6781ad6ffe67a6a9","abstract_canon_sha256":"178a7aa26207301de98e9cb8779c450c204a517b7d8c34a58bf4c14a873bb919"},"schema_version":"1.0"},"canonical_sha256":"25e649c57aa55ea66320a698bcf9348427302b994f20f84461196f770bc4326b","source":{"kind":"arxiv","id":"1606.07380","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.07380","created_at":"2026-05-18T01:11:58Z"},{"alias_kind":"arxiv_version","alias_value":"1606.07380v1","created_at":"2026-05-18T01:11:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.07380","created_at":"2026-05-18T01:11:58Z"},{"alias_kind":"pith_short_12","alias_value":"EXTETRL2UVPK","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"EXTETRL2UVPKMYZA","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"EXTETRL2","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:EXTETRL2UVPKMYZAU2MLZ6JUQQ","target":"record","payload":{"canonical_record":{"source":{"id":"1606.07380","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-06-23T17:30:08Z","cross_cats_sorted":[],"title_canon_sha256":"77570df8d59a0c6752aaaed4efaa190771ac85c7812b975b6781ad6ffe67a6a9","abstract_canon_sha256":"178a7aa26207301de98e9cb8779c450c204a517b7d8c34a58bf4c14a873bb919"},"schema_version":"1.0"},"canonical_sha256":"25e649c57aa55ea66320a698bcf9348427302b994f20f84461196f770bc4326b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:58.191220Z","signature_b64":"FvPFI1GevpuWvCf5VP5seh/QQNPV3u6gf6bhPOVLZWwZpWM0eG0MDYIofMI9a8DrA9yDojcBi7iqic7xy+4ZBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25e649c57aa55ea66320a698bcf9348427302b994f20f84461196f770bc4326b","last_reissued_at":"2026-05-18T01:11:58.190875Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:58.190875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.07380","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:11:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2qgffDRJMLDiAjyHI7NckezIEcJtG9hWhMqHINyGdNXGkAlgmuHDL17I3wYPyLL/zM5iM9UanJx7HeJuwj6FCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:33:35.759400Z"},"content_sha256":"36fcefa2539018bb127ead732bee657bdab03fee8934ae5f1e704f2b023c2c5b","schema_version":"1.0","event_id":"sha256:36fcefa2539018bb127ead732bee657bdab03fee8934ae5f1e704f2b023c2c5b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:EXTETRL2UVPKMYZAU2MLZ6JUQQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Variable-Sized Uncertainty and Inverse Problems in Robust Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andr\\'e Chassein, Marc Goerigk","submitted_at":"2016-06-23T17:30:08Z","abstract_excerpt":"In robust optimization, the general aim is to find a solution that performs well over a set of possible parameter outcomes, the so-called uncertainty set. In this paper, we assume that the uncertainty size is not fixed, and instead aim at finding a set of robust solutions that covers all possible uncertainty set outcomes. We refer to these problems as robust optimization with variable-sized uncertainty. We discuss how to construct smallest possible sets of min-max robust solutions and give bounds on their size.\n  A special case of this perspective is to analyze for which uncertainty sets a nom"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.07380","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:11:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pmXuuCBEKUjkeKZBx1t12Kpxa25vAj3pQ5fpdngggoUHGLw3u7utqZ0nuu1jXKcgiKnB0FancHevGveRZev6DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:33:35.759976Z"},"content_sha256":"db44c51566a2cce480c952e3e38d00cb5ecb7d5ec3665d7ac240871e65d2f9c3","schema_version":"1.0","event_id":"sha256:db44c51566a2cce480c952e3e38d00cb5ecb7d5ec3665d7ac240871e65d2f9c3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EXTETRL2UVPKMYZAU2MLZ6JUQQ/bundle.json","state_url":"https://pith.science/pith/EXTETRL2UVPKMYZAU2MLZ6JUQQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EXTETRL2UVPKMYZAU2MLZ6JUQQ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T16:33:35Z","links":{"resolver":"https://pith.science/pith/EXTETRL2UVPKMYZAU2MLZ6JUQQ","bundle":"https://pith.science/pith/EXTETRL2UVPKMYZAU2MLZ6JUQQ/bundle.json","state":"https://pith.science/pith/EXTETRL2UVPKMYZAU2MLZ6JUQQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EXTETRL2UVPKMYZAU2MLZ6JUQQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:EXTETRL2UVPKMYZAU2MLZ6JUQQ","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":"178a7aa26207301de98e9cb8779c450c204a517b7d8c34a58bf4c14a873bb919","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-06-23T17:30:08Z","title_canon_sha256":"77570df8d59a0c6752aaaed4efaa190771ac85c7812b975b6781ad6ffe67a6a9"},"schema_version":"1.0","source":{"id":"1606.07380","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.07380","created_at":"2026-05-18T01:11:58Z"},{"alias_kind":"arxiv_version","alias_value":"1606.07380v1","created_at":"2026-05-18T01:11:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.07380","created_at":"2026-05-18T01:11:58Z"},{"alias_kind":"pith_short_12","alias_value":"EXTETRL2UVPK","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"EXTETRL2UVPKMYZA","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"EXTETRL2","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:db44c51566a2cce480c952e3e38d00cb5ecb7d5ec3665d7ac240871e65d2f9c3","target":"graph","created_at":"2026-05-18T01:11:58Z","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"},"paper":{"abstract_excerpt":"In robust optimization, the general aim is to find a solution that performs well over a set of possible parameter outcomes, the so-called uncertainty set. In this paper, we assume that the uncertainty size is not fixed, and instead aim at finding a set of robust solutions that covers all possible uncertainty set outcomes. We refer to these problems as robust optimization with variable-sized uncertainty. We discuss how to construct smallest possible sets of min-max robust solutions and give bounds on their size.\n  A special case of this perspective is to analyze for which uncertainty sets a nom","authors_text":"Andr\\'e Chassein, Marc Goerigk","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-06-23T17:30:08Z","title":"Variable-Sized Uncertainty and Inverse Problems in Robust Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.07380","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:36fcefa2539018bb127ead732bee657bdab03fee8934ae5f1e704f2b023c2c5b","target":"record","created_at":"2026-05-18T01:11:58Z","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":"178a7aa26207301de98e9cb8779c450c204a517b7d8c34a58bf4c14a873bb919","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-06-23T17:30:08Z","title_canon_sha256":"77570df8d59a0c6752aaaed4efaa190771ac85c7812b975b6781ad6ffe67a6a9"},"schema_version":"1.0","source":{"id":"1606.07380","kind":"arxiv","version":1}},"canonical_sha256":"25e649c57aa55ea66320a698bcf9348427302b994f20f84461196f770bc4326b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"25e649c57aa55ea66320a698bcf9348427302b994f20f84461196f770bc4326b","first_computed_at":"2026-05-18T01:11:58.190875Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:58.190875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FvPFI1GevpuWvCf5VP5seh/QQNPV3u6gf6bhPOVLZWwZpWM0eG0MDYIofMI9a8DrA9yDojcBi7iqic7xy+4ZBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:58.191220Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.07380","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:36fcefa2539018bb127ead732bee657bdab03fee8934ae5f1e704f2b023c2c5b","sha256:db44c51566a2cce480c952e3e38d00cb5ecb7d5ec3665d7ac240871e65d2f9c3"],"state_sha256":"c31260f14dd8a136374bc4f0059210abbc2dc5463a4f02eeb909d5f319724667"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WiKKhN1pcmskU5InufUQJWYmOTqx3M2wHbTVxGQ1KqKN87GOtSJlw+4v4cL8E5Zh32CTWnidSoPv8DhflA/tDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T16:33:35.763038Z","bundle_sha256":"c510054b7bd7896039708ce4ded3db2090be4e349261e19b3f755007d05d3a51"}}