{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:F375AICXCQTGPBWX2GM6JTJI5T","short_pith_number":"pith:F375AICX","canonical_record":{"source":{"id":"1609.07402","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-23T15:34:14Z","cross_cats_sorted":[],"title_canon_sha256":"f786c443943409256c0c30a31b9dd2275b527902624afb3dc356cfd705d7db7c","abstract_canon_sha256":"3842376fb2ce75fb0cddc44f45f2e5327ea7c232b2c8a10ba9b4c2f03d5c05d2"},"schema_version":"1.0"},"canonical_sha256":"2effd0205714266786d7d199e4cd28ecdbf2f5a0361c5eec133437d10fb0d113","source":{"kind":"arxiv","id":"1609.07402","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.07402","created_at":"2026-05-18T00:44:09Z"},{"alias_kind":"arxiv_version","alias_value":"1609.07402v2","created_at":"2026-05-18T00:44:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.07402","created_at":"2026-05-18T00:44:09Z"},{"alias_kind":"pith_short_12","alias_value":"F375AICXCQTG","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"F375AICXCQTGPBWX","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"F375AICX","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:F375AICXCQTGPBWX2GM6JTJI5T","target":"record","payload":{"canonical_record":{"source":{"id":"1609.07402","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-23T15:34:14Z","cross_cats_sorted":[],"title_canon_sha256":"f786c443943409256c0c30a31b9dd2275b527902624afb3dc356cfd705d7db7c","abstract_canon_sha256":"3842376fb2ce75fb0cddc44f45f2e5327ea7c232b2c8a10ba9b4c2f03d5c05d2"},"schema_version":"1.0"},"canonical_sha256":"2effd0205714266786d7d199e4cd28ecdbf2f5a0361c5eec133437d10fb0d113","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:09.432008Z","signature_b64":"X/DK+mrJpXJZDQkyTyLl9PmmyjTB+UCUYqAFp5QLwOTwVGHIgF1OAxLBZfXVdO8fzl2EGcj+i4uGfyKXgSEsAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2effd0205714266786d7d199e4cd28ecdbf2f5a0361c5eec133437d10fb0d113","last_reissued_at":"2026-05-18T00:44:09.431534Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:09.431534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.07402","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-18T00:44:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fiWCkc/WUXWsyQ3Wepwhkcxu6t017RVugGHXdYMFV8y+5HVDlJulWNJUWvu0HdAFAa0PPukgA9d6H3aWoQ5dBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:41:22.681121Z"},"content_sha256":"e13a288704ea26ac534521e4b84a613cd6e608704226ec26fbe1073870a21322","schema_version":"1.0","event_id":"sha256:e13a288704ea26ac534521e4b84a613cd6e608704226ec26fbe1073870a21322"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:F375AICXCQTGPBWX2GM6JTJI5T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Copositive Approach for Two-Stage Adjustable Robust Optimization with Uncertain Right-Hand Sides","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Guanglin Xu, Samuel Burer","submitted_at":"2016-09-23T15:34:14Z","abstract_excerpt":"We study two-stage adjustable robust linear programming in which the right-hand sides are uncertain and belong to a convex, compact uncertainty set. This problem is NP-hard, and the affine policy is a popular, tractable approximation. We prove that under standard and simple conditions, the two-stage problem can be reformulated as a copositive optimization problem, which in turn leads to a class of tractable, semidefinite-based approximations that are at least as strong as the affine policy. We investigate several examples from the literature demonstrating that our tractable approximations sign"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.07402","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-18T00:44:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1ZcxJZ8jVPegUYYtiQFwdemArHfetRAuGmx26R7966puLDV6gXzh/LkgnAgMKTx1I/fY1rBzQRt3I9jDu1aBDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:41:22.681843Z"},"content_sha256":"1bfa4c0c62d4c7b91ae92f1835b01daf6ef3d341e1e50c2822846de2296369c0","schema_version":"1.0","event_id":"sha256:1bfa4c0c62d4c7b91ae92f1835b01daf6ef3d341e1e50c2822846de2296369c0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F375AICXCQTGPBWX2GM6JTJI5T/bundle.json","state_url":"https://pith.science/pith/F375AICXCQTGPBWX2GM6JTJI5T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F375AICXCQTGPBWX2GM6JTJI5T/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-31T11:41:22Z","links":{"resolver":"https://pith.science/pith/F375AICXCQTGPBWX2GM6JTJI5T","bundle":"https://pith.science/pith/F375AICXCQTGPBWX2GM6JTJI5T/bundle.json","state":"https://pith.science/pith/F375AICXCQTGPBWX2GM6JTJI5T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F375AICXCQTGPBWX2GM6JTJI5T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:F375AICXCQTGPBWX2GM6JTJI5T","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":"3842376fb2ce75fb0cddc44f45f2e5327ea7c232b2c8a10ba9b4c2f03d5c05d2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-23T15:34:14Z","title_canon_sha256":"f786c443943409256c0c30a31b9dd2275b527902624afb3dc356cfd705d7db7c"},"schema_version":"1.0","source":{"id":"1609.07402","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.07402","created_at":"2026-05-18T00:44:09Z"},{"alias_kind":"arxiv_version","alias_value":"1609.07402v2","created_at":"2026-05-18T00:44:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.07402","created_at":"2026-05-18T00:44:09Z"},{"alias_kind":"pith_short_12","alias_value":"F375AICXCQTG","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"F375AICXCQTGPBWX","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"F375AICX","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:1bfa4c0c62d4c7b91ae92f1835b01daf6ef3d341e1e50c2822846de2296369c0","target":"graph","created_at":"2026-05-18T00:44:09Z","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 study two-stage adjustable robust linear programming in which the right-hand sides are uncertain and belong to a convex, compact uncertainty set. This problem is NP-hard, and the affine policy is a popular, tractable approximation. We prove that under standard and simple conditions, the two-stage problem can be reformulated as a copositive optimization problem, which in turn leads to a class of tractable, semidefinite-based approximations that are at least as strong as the affine policy. We investigate several examples from the literature demonstrating that our tractable approximations sign","authors_text":"Guanglin Xu, Samuel Burer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-23T15:34:14Z","title":"A Copositive Approach for Two-Stage Adjustable Robust Optimization with Uncertain Right-Hand Sides"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.07402","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:e13a288704ea26ac534521e4b84a613cd6e608704226ec26fbe1073870a21322","target":"record","created_at":"2026-05-18T00:44:09Z","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":"3842376fb2ce75fb0cddc44f45f2e5327ea7c232b2c8a10ba9b4c2f03d5c05d2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-23T15:34:14Z","title_canon_sha256":"f786c443943409256c0c30a31b9dd2275b527902624afb3dc356cfd705d7db7c"},"schema_version":"1.0","source":{"id":"1609.07402","kind":"arxiv","version":2}},"canonical_sha256":"2effd0205714266786d7d199e4cd28ecdbf2f5a0361c5eec133437d10fb0d113","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2effd0205714266786d7d199e4cd28ecdbf2f5a0361c5eec133437d10fb0d113","first_computed_at":"2026-05-18T00:44:09.431534Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:09.431534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X/DK+mrJpXJZDQkyTyLl9PmmyjTB+UCUYqAFp5QLwOTwVGHIgF1OAxLBZfXVdO8fzl2EGcj+i4uGfyKXgSEsAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:09.432008Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.07402","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e13a288704ea26ac534521e4b84a613cd6e608704226ec26fbe1073870a21322","sha256:1bfa4c0c62d4c7b91ae92f1835b01daf6ef3d341e1e50c2822846de2296369c0"],"state_sha256":"78eea4442ac60b21c118e860d82206d0680d7145a1bb93b96debc9e4e673eb52"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K2o2pI7ZvKXvB7+i+Nn8dyFbrTdOn15mRSni4X5RT4TkEknU8uuh1Zswng4zKuQbSsf67glDupUxUxK1rCHSAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T11:41:22.685745Z","bundle_sha256":"abfd2bdd5af8f3cffbf9e6183da43839deef42b1f8e4a3d1269be0c595fb7d58"}}