{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:7IXN5X5ZTR6AV6C3ZBTL4JVTOW","short_pith_number":"pith:7IXN5X5Z","canonical_record":{"source":{"id":"1604.01813","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-06T21:31:18Z","cross_cats_sorted":[],"title_canon_sha256":"70cd488917494af0c9792cad2a9bcff89963f7aad6f02bc0fa9dc434f7eb970f","abstract_canon_sha256":"0b710e3c61cc54da9cb2176e6334ecfeff374223019d64364f4af5b528f9d9e9"},"schema_version":"1.0"},"canonical_sha256":"fa2ededfb99c7c0af85bc866be26b375a170f23476d2fc32f22328394662411e","source":{"kind":"arxiv","id":"1604.01813","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.01813","created_at":"2026-05-18T01:17:22Z"},{"alias_kind":"arxiv_version","alias_value":"1604.01813v2","created_at":"2026-05-18T01:17:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.01813","created_at":"2026-05-18T01:17:22Z"},{"alias_kind":"pith_short_12","alias_value":"7IXN5X5ZTR6A","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7IXN5X5ZTR6AV6C3","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7IXN5X5Z","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:7IXN5X5ZTR6AV6C3ZBTL4JVTOW","target":"record","payload":{"canonical_record":{"source":{"id":"1604.01813","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-06T21:31:18Z","cross_cats_sorted":[],"title_canon_sha256":"70cd488917494af0c9792cad2a9bcff89963f7aad6f02bc0fa9dc434f7eb970f","abstract_canon_sha256":"0b710e3c61cc54da9cb2176e6334ecfeff374223019d64364f4af5b528f9d9e9"},"schema_version":"1.0"},"canonical_sha256":"fa2ededfb99c7c0af85bc866be26b375a170f23476d2fc32f22328394662411e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:22.851407Z","signature_b64":"F82CHPUauRRYDlpJhLhHbla+a/stUcSWIsgGxQQrqbg2zCZJWowmggcrHsUz0f9DTf4RVp8DoVEMgO9K44KuAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa2ededfb99c7c0af85bc866be26b375a170f23476d2fc32f22328394662411e","last_reissued_at":"2026-05-18T01:17:22.850873Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:22.850873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.01813","source_version":2,"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:17:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PxA0ty9G/7uQJRbteCj3Z2n+oGV9XLb2TLDOvJb4biQZBSXnNYtxz+TneyjIOUhYeq98yV3X9YbLG7VK3OieBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:02:57.809855Z"},"content_sha256":"d4be66b1f0eb260f8bf537fc81d38d2a08055061dfb581c28915e3160a48e737","schema_version":"1.0","event_id":"sha256:d4be66b1f0eb260f8bf537fc81d38d2a08055061dfb581c28915e3160a48e737"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:7IXN5X5ZTR6AV6C3ZBTL4JVTOW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multipolar robust optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Adam Ouorou, Guanglei Wang, Mateusz \\.Zotkiewicz, Walid Ben-Ameur","submitted_at":"2016-04-06T21:31:18Z","abstract_excerpt":"We consider linear programs involving uncertain parameters and propose a new tractable robust counterpart which contains and generalizes several other models including the existing Affinely Adjustable Robust Counterpart and the Fully Adjustable Robust Counterpart. It consists in selecting a set of poles whose convex hull contains some projection of the uncertainty set, and computing a recourse strategy for each data scenario as a convex combination of some optimized recourses (one for each pole). We show that the proposed multipolar robust counterpart is tractable and its complexity is control"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.01813","kind":"arxiv","version":2},"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:17:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DIWnY7UQThAUBBL2qaZRQI6tDxFLIKIUgaXG6AEKE/6ASwqWTXWnQHJQFG5I8tEOpsuHbMQxdoIgIccxgn2NAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:02:57.810540Z"},"content_sha256":"43457e85868de0e54a5293000ae8f727345c9517a17b7dbe8b762ccdae9403ba","schema_version":"1.0","event_id":"sha256:43457e85868de0e54a5293000ae8f727345c9517a17b7dbe8b762ccdae9403ba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7IXN5X5ZTR6AV6C3ZBTL4JVTOW/bundle.json","state_url":"https://pith.science/pith/7IXN5X5ZTR6AV6C3ZBTL4JVTOW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7IXN5X5ZTR6AV6C3ZBTL4JVTOW/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-27T14:02:57Z","links":{"resolver":"https://pith.science/pith/7IXN5X5ZTR6AV6C3ZBTL4JVTOW","bundle":"https://pith.science/pith/7IXN5X5ZTR6AV6C3ZBTL4JVTOW/bundle.json","state":"https://pith.science/pith/7IXN5X5ZTR6AV6C3ZBTL4JVTOW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7IXN5X5ZTR6AV6C3ZBTL4JVTOW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:7IXN5X5ZTR6AV6C3ZBTL4JVTOW","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":"0b710e3c61cc54da9cb2176e6334ecfeff374223019d64364f4af5b528f9d9e9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-06T21:31:18Z","title_canon_sha256":"70cd488917494af0c9792cad2a9bcff89963f7aad6f02bc0fa9dc434f7eb970f"},"schema_version":"1.0","source":{"id":"1604.01813","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.01813","created_at":"2026-05-18T01:17:22Z"},{"alias_kind":"arxiv_version","alias_value":"1604.01813v2","created_at":"2026-05-18T01:17:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.01813","created_at":"2026-05-18T01:17:22Z"},{"alias_kind":"pith_short_12","alias_value":"7IXN5X5ZTR6A","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7IXN5X5ZTR6AV6C3","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7IXN5X5Z","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:43457e85868de0e54a5293000ae8f727345c9517a17b7dbe8b762ccdae9403ba","target":"graph","created_at":"2026-05-18T01:17:22Z","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 linear programs involving uncertain parameters and propose a new tractable robust counterpart which contains and generalizes several other models including the existing Affinely Adjustable Robust Counterpart and the Fully Adjustable Robust Counterpart. It consists in selecting a set of poles whose convex hull contains some projection of the uncertainty set, and computing a recourse strategy for each data scenario as a convex combination of some optimized recourses (one for each pole). We show that the proposed multipolar robust counterpart is tractable and its complexity is control","authors_text":"Adam Ouorou, Guanglei Wang, Mateusz \\.Zotkiewicz, Walid Ben-Ameur","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-06T21:31:18Z","title":"Multipolar robust optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.01813","kind":"arxiv","version":2},"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:d4be66b1f0eb260f8bf537fc81d38d2a08055061dfb581c28915e3160a48e737","target":"record","created_at":"2026-05-18T01:17:22Z","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":"0b710e3c61cc54da9cb2176e6334ecfeff374223019d64364f4af5b528f9d9e9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-06T21:31:18Z","title_canon_sha256":"70cd488917494af0c9792cad2a9bcff89963f7aad6f02bc0fa9dc434f7eb970f"},"schema_version":"1.0","source":{"id":"1604.01813","kind":"arxiv","version":2}},"canonical_sha256":"fa2ededfb99c7c0af85bc866be26b375a170f23476d2fc32f22328394662411e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fa2ededfb99c7c0af85bc866be26b375a170f23476d2fc32f22328394662411e","first_computed_at":"2026-05-18T01:17:22.850873Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:22.850873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F82CHPUauRRYDlpJhLhHbla+a/stUcSWIsgGxQQrqbg2zCZJWowmggcrHsUz0f9DTf4RVp8DoVEMgO9K44KuAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:22.851407Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.01813","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d4be66b1f0eb260f8bf537fc81d38d2a08055061dfb581c28915e3160a48e737","sha256:43457e85868de0e54a5293000ae8f727345c9517a17b7dbe8b762ccdae9403ba"],"state_sha256":"c6cde0f8f0e0429d74f243fa9252f28b1da8ba134efa34937932d465dc319579"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZEqFnVA37RWH7KUXkcYFs0lDjxwvXY0h1qYkg511TWIB30ROw4S47wu95FerjXMShCvD42ITwguk1JAYLiz0Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T14:02:57.814492Z","bundle_sha256":"686031a97aae0887c58616104f3aad92677a321807a65cd4363e315d4bcca1b4"}}