{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:S3OUCLPH4LDSBVIK4SHQQPHARJ","short_pith_number":"pith:S3OUCLPH","canonical_record":{"source":{"id":"1801.06751","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-21T02:09:08Z","cross_cats_sorted":[],"title_canon_sha256":"5d9cc344151126ea449224c5b960e5bd365fb777a9b1bce28e3d0ca938c6b387","abstract_canon_sha256":"efb25c31c7d926e59771e8b28343ba791efb7f32ef1fda816c14d9376fd9cb26"},"schema_version":"1.0"},"canonical_sha256":"96dd412de7e2c720d50ae48f083ce08a7caaa21c44b6bcf11b6b181eddb586c6","source":{"kind":"arxiv","id":"1801.06751","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.06751","created_at":"2026-05-18T00:25:27Z"},{"alias_kind":"arxiv_version","alias_value":"1801.06751v1","created_at":"2026-05-18T00:25:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.06751","created_at":"2026-05-18T00:25:27Z"},{"alias_kind":"pith_short_12","alias_value":"S3OUCLPH4LDS","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"S3OUCLPH4LDSBVIK","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"S3OUCLPH","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:S3OUCLPH4LDSBVIK4SHQQPHARJ","target":"record","payload":{"canonical_record":{"source":{"id":"1801.06751","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-21T02:09:08Z","cross_cats_sorted":[],"title_canon_sha256":"5d9cc344151126ea449224c5b960e5bd365fb777a9b1bce28e3d0ca938c6b387","abstract_canon_sha256":"efb25c31c7d926e59771e8b28343ba791efb7f32ef1fda816c14d9376fd9cb26"},"schema_version":"1.0"},"canonical_sha256":"96dd412de7e2c720d50ae48f083ce08a7caaa21c44b6bcf11b6b181eddb586c6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:27.850179Z","signature_b64":"Sb3wTMHVoVv4FK5G9Olc0IfpBSDvt6Pi7X3nin3w5/hl4IVthZwXXpIVifJMvGygVfd6HKs72f50m31i2kNuAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96dd412de7e2c720d50ae48f083ce08a7caaa21c44b6bcf11b6b181eddb586c6","last_reissued_at":"2026-05-18T00:25:27.849492Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:27.849492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.06751","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-18T00:25:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J46yt0EBP6/yEO/TzHR1LINFW5rnTLna/a9vpCigZnNv6GSW36FJN7e0QCOnYvsQqzK+k2GyeszlKvN4jE7dAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:21:33.155163Z"},"content_sha256":"f9e438456160fb5e3be0cbf71e05a26f24c145495adefbd61de0e729043fb68d","schema_version":"1.0","event_id":"sha256:f9e438456160fb5e3be0cbf71e05a26f24c145495adefbd61de0e729043fb68d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:S3OUCLPH4LDSBVIK4SHQQPHARJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Tractable Approach for designing Piecewise Affine Policies in Two-stage Adjustable Robust Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Aharon Ben-Tal, Omar El Housni, Vineet Goyal","submitted_at":"2018-01-21T02:09:08Z","abstract_excerpt":"We consider the problem of designing piecewise affine policies for two-stage adjustable robust linear optimization problems under right-hand side uncertainty. It is well known that a piecewise affine policy is optimal although the number of pieces can be exponentially large. A significant challenge in designing a practical piecewise affine policy is constructing good pieces of the uncertainty set. Here we address this challenge by introducing a new framework in which the uncertainty set is \"approximated\" by a \"dominating\" simplex. The corresponding policy is then based on a mapping from the un"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.06751","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-18T00:25:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kkv2bt2uuvIIhUxf7shfSnNT+fFeOQ4mEutSqe9RM4JOSYBL64fcsAMAvOaF2IHUffhuZN+pbgQ13ki9sc8hCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:21:33.155835Z"},"content_sha256":"e612b664239e6415d07a77c536df2aa25df5fb68c26468d0db52d7916a7424e8","schema_version":"1.0","event_id":"sha256:e612b664239e6415d07a77c536df2aa25df5fb68c26468d0db52d7916a7424e8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S3OUCLPH4LDSBVIK4SHQQPHARJ/bundle.json","state_url":"https://pith.science/pith/S3OUCLPH4LDSBVIK4SHQQPHARJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S3OUCLPH4LDSBVIK4SHQQPHARJ/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-31T09:21:33Z","links":{"resolver":"https://pith.science/pith/S3OUCLPH4LDSBVIK4SHQQPHARJ","bundle":"https://pith.science/pith/S3OUCLPH4LDSBVIK4SHQQPHARJ/bundle.json","state":"https://pith.science/pith/S3OUCLPH4LDSBVIK4SHQQPHARJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S3OUCLPH4LDSBVIK4SHQQPHARJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:S3OUCLPH4LDSBVIK4SHQQPHARJ","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":"efb25c31c7d926e59771e8b28343ba791efb7f32ef1fda816c14d9376fd9cb26","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-21T02:09:08Z","title_canon_sha256":"5d9cc344151126ea449224c5b960e5bd365fb777a9b1bce28e3d0ca938c6b387"},"schema_version":"1.0","source":{"id":"1801.06751","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.06751","created_at":"2026-05-18T00:25:27Z"},{"alias_kind":"arxiv_version","alias_value":"1801.06751v1","created_at":"2026-05-18T00:25:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.06751","created_at":"2026-05-18T00:25:27Z"},{"alias_kind":"pith_short_12","alias_value":"S3OUCLPH4LDS","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"S3OUCLPH4LDSBVIK","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"S3OUCLPH","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:e612b664239e6415d07a77c536df2aa25df5fb68c26468d0db52d7916a7424e8","target":"graph","created_at":"2026-05-18T00:25:27Z","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":"We consider the problem of designing piecewise affine policies for two-stage adjustable robust linear optimization problems under right-hand side uncertainty. It is well known that a piecewise affine policy is optimal although the number of pieces can be exponentially large. A significant challenge in designing a practical piecewise affine policy is constructing good pieces of the uncertainty set. Here we address this challenge by introducing a new framework in which the uncertainty set is \"approximated\" by a \"dominating\" simplex. The corresponding policy is then based on a mapping from the un","authors_text":"Aharon Ben-Tal, Omar El Housni, Vineet Goyal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-21T02:09:08Z","title":"A Tractable Approach for designing Piecewise Affine Policies in Two-stage Adjustable Robust Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.06751","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:f9e438456160fb5e3be0cbf71e05a26f24c145495adefbd61de0e729043fb68d","target":"record","created_at":"2026-05-18T00:25:27Z","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":"efb25c31c7d926e59771e8b28343ba791efb7f32ef1fda816c14d9376fd9cb26","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-21T02:09:08Z","title_canon_sha256":"5d9cc344151126ea449224c5b960e5bd365fb777a9b1bce28e3d0ca938c6b387"},"schema_version":"1.0","source":{"id":"1801.06751","kind":"arxiv","version":1}},"canonical_sha256":"96dd412de7e2c720d50ae48f083ce08a7caaa21c44b6bcf11b6b181eddb586c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"96dd412de7e2c720d50ae48f083ce08a7caaa21c44b6bcf11b6b181eddb586c6","first_computed_at":"2026-05-18T00:25:27.849492Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:27.849492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Sb3wTMHVoVv4FK5G9Olc0IfpBSDvt6Pi7X3nin3w5/hl4IVthZwXXpIVifJMvGygVfd6HKs72f50m31i2kNuAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:27.850179Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.06751","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f9e438456160fb5e3be0cbf71e05a26f24c145495adefbd61de0e729043fb68d","sha256:e612b664239e6415d07a77c536df2aa25df5fb68c26468d0db52d7916a7424e8"],"state_sha256":"4d00d5d80dda7095b30b67fc73a48776987ffa8ebe5d74421293ff8ced771534"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kuqHTwEwlcDyiL8DC4QtjSN9VJEUVwdZlvXapBndUVAsI94ItG6/I0H+TR5pfVeTcw835SM6/EULY7855zvlBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T09:21:33.159235Z","bundle_sha256":"82d547e22d525b977d22efe60a7917f19687e8b8f08108ca7069ccad3208811f"}}