{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:F375AICXCQTGPBWX2GM6JTJI5T","short_pith_number":"pith:F375AICX","schema_version":"1.0","canonical_sha256":"2effd0205714266786d7d199e4cd28ecdbf2f5a0361c5eec133437d10fb0d113","source":{"kind":"arxiv","id":"1609.07402","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1609.07402","created_at":"2026-05-18T00:44:09.431609+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.07402v2","created_at":"2026-05-18T00:44:09.431609+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.07402","created_at":"2026-05-18T00:44:09.431609+00:00"},{"alias_kind":"pith_short_12","alias_value":"F375AICXCQTG","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"F375AICXCQTGPBWX","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"F375AICX","created_at":"2026-05-18T12:30:15.759754+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F375AICXCQTGPBWX2GM6JTJI5T","json":"https://pith.science/pith/F375AICXCQTGPBWX2GM6JTJI5T.json","graph_json":"https://pith.science/api/pith-number/F375AICXCQTGPBWX2GM6JTJI5T/graph.json","events_json":"https://pith.science/api/pith-number/F375AICXCQTGPBWX2GM6JTJI5T/events.json","paper":"https://pith.science/paper/F375AICX"},"agent_actions":{"view_html":"https://pith.science/pith/F375AICXCQTGPBWX2GM6JTJI5T","download_json":"https://pith.science/pith/F375AICXCQTGPBWX2GM6JTJI5T.json","view_paper":"https://pith.science/paper/F375AICX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.07402&json=true","fetch_graph":"https://pith.science/api/pith-number/F375AICXCQTGPBWX2GM6JTJI5T/graph.json","fetch_events":"https://pith.science/api/pith-number/F375AICXCQTGPBWX2GM6JTJI5T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F375AICXCQTGPBWX2GM6JTJI5T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F375AICXCQTGPBWX2GM6JTJI5T/action/storage_attestation","attest_author":"https://pith.science/pith/F375AICXCQTGPBWX2GM6JTJI5T/action/author_attestation","sign_citation":"https://pith.science/pith/F375AICXCQTGPBWX2GM6JTJI5T/action/citation_signature","submit_replication":"https://pith.science/pith/F375AICXCQTGPBWX2GM6JTJI5T/action/replication_record"}},"created_at":"2026-05-18T00:44:09.431609+00:00","updated_at":"2026-05-18T00:44:09.431609+00:00"}