{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:KA4WC3K55HYXJGUPJY4IESP6OA","short_pith_number":"pith:KA4WC3K5","canonical_record":{"source":{"id":"2002.05223","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-02-12T20:29:44Z","cross_cats_sorted":[],"title_canon_sha256":"4ad21ee4b22ed5aee15e6508e0eaab5725fca3a48ca9a8c80ec9b7c2ec40c522","abstract_canon_sha256":"e9b8728a1afdb01b204784a229b28a74e4828eb10be6a81411b6e0fa0e8c6235"},"schema_version":"1.0"},"canonical_sha256":"5039616d5de9f1749a8f4e388249fe7034a16c94ff2c1b195ff061cede97d120","source":{"kind":"arxiv","id":"2002.05223","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.05223","created_at":"2026-07-05T00:49:41Z"},{"alias_kind":"arxiv_version","alias_value":"2002.05223v2","created_at":"2026-07-05T00:49:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.05223","created_at":"2026-07-05T00:49:41Z"},{"alias_kind":"pith_short_12","alias_value":"KA4WC3K55HYX","created_at":"2026-07-05T00:49:41Z"},{"alias_kind":"pith_short_16","alias_value":"KA4WC3K55HYXJGUP","created_at":"2026-07-05T00:49:41Z"},{"alias_kind":"pith_short_8","alias_value":"KA4WC3K5","created_at":"2026-07-05T00:49:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:KA4WC3K55HYXJGUPJY4IESP6OA","target":"record","payload":{"canonical_record":{"source":{"id":"2002.05223","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-02-12T20:29:44Z","cross_cats_sorted":[],"title_canon_sha256":"4ad21ee4b22ed5aee15e6508e0eaab5725fca3a48ca9a8c80ec9b7c2ec40c522","abstract_canon_sha256":"e9b8728a1afdb01b204784a229b28a74e4828eb10be6a81411b6e0fa0e8c6235"},"schema_version":"1.0"},"canonical_sha256":"5039616d5de9f1749a8f4e388249fe7034a16c94ff2c1b195ff061cede97d120","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:49:41.961001Z","signature_b64":"j3k8wOU/cqogunLbznxseqpZ+1H9qe7glDOeMfhT9XmtjGMvNj51KPrhedgnq6jlmSPE2wh0W6eIKqNUvK1bDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5039616d5de9f1749a8f4e388249fe7034a16c94ff2c1b195ff061cede97d120","last_reissued_at":"2026-07-05T00:49:41.960611Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:49:41.960611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2002.05223","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-07-05T00:49:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xJEI+WDn08+rn9kAOvgoVhuNlL8rWs7OWoWlUhrtLo2uNX8feGXsfneDlSN69YM1rH/X1Rt/utMSIrLvMfIrDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T06:50:58.362281Z"},"content_sha256":"f3f1eac1cb21c7f3f5e6a9ca3cc84994640ad0d20f1298e1dddc62f784223597","schema_version":"1.0","event_id":"sha256:f3f1eac1cb21c7f3f5e6a9ca3cc84994640ad0d20f1298e1dddc62f784223597"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:KA4WC3K55HYXJGUPJY4IESP6OA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exact Conic Programming Reformulations of Two-Stage Adjustable Robust Linear Programs with New Quadratic Decision Rules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"D. Woolnough, G.Li, V. Jeyakumar","submitted_at":"2020-02-12T20:29:44Z","abstract_excerpt":"In this paper we introduce a new parameterized Quadratic Decision Rule (QDR), a generalisation of the commonly employed Affine Decision Rule (ADR), for two-stage linear adjustable robust optimization problems with ellipsoidal uncertainty and show that (affinely parameterized) linear adjustable robust optimization problems with QDRs are numerically tractable by presenting exact semi-definite program (SDP) and second order cone program (SOCP) reformulations. Under these QDRs, we also establish that exact conic program reformulations also hold for two-stage linear ARO problems, containing also ad"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.05223","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2002.05223/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:49:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rR7pBi0lOgzXiIvi7WigQTgCG/XcP3gifzYf0dGPxTiOJWS0vBsuh/diWzzGLoCr5/BTpIHLJj7DJe+xc6dRCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T06:50:58.362797Z"},"content_sha256":"11b0dd47d36ce3b6ffc3b3036b787f41a6fc96701c1006ba32969da6d5e180bc","schema_version":"1.0","event_id":"sha256:11b0dd47d36ce3b6ffc3b3036b787f41a6fc96701c1006ba32969da6d5e180bc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KA4WC3K55HYXJGUPJY4IESP6OA/bundle.json","state_url":"https://pith.science/pith/KA4WC3K55HYXJGUPJY4IESP6OA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KA4WC3K55HYXJGUPJY4IESP6OA/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-08-04T06:50:58Z","links":{"resolver":"https://pith.science/pith/KA4WC3K55HYXJGUPJY4IESP6OA","bundle":"https://pith.science/pith/KA4WC3K55HYXJGUPJY4IESP6OA/bundle.json","state":"https://pith.science/pith/KA4WC3K55HYXJGUPJY4IESP6OA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KA4WC3K55HYXJGUPJY4IESP6OA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:KA4WC3K55HYXJGUPJY4IESP6OA","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":"e9b8728a1afdb01b204784a229b28a74e4828eb10be6a81411b6e0fa0e8c6235","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-02-12T20:29:44Z","title_canon_sha256":"4ad21ee4b22ed5aee15e6508e0eaab5725fca3a48ca9a8c80ec9b7c2ec40c522"},"schema_version":"1.0","source":{"id":"2002.05223","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.05223","created_at":"2026-07-05T00:49:41Z"},{"alias_kind":"arxiv_version","alias_value":"2002.05223v2","created_at":"2026-07-05T00:49:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.05223","created_at":"2026-07-05T00:49:41Z"},{"alias_kind":"pith_short_12","alias_value":"KA4WC3K55HYX","created_at":"2026-07-05T00:49:41Z"},{"alias_kind":"pith_short_16","alias_value":"KA4WC3K55HYXJGUP","created_at":"2026-07-05T00:49:41Z"},{"alias_kind":"pith_short_8","alias_value":"KA4WC3K5","created_at":"2026-07-05T00:49:41Z"}],"graph_snapshots":[{"event_id":"sha256:11b0dd47d36ce3b6ffc3b3036b787f41a6fc96701c1006ba32969da6d5e180bc","target":"graph","created_at":"2026-07-05T00:49:41Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2002.05223/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper we introduce a new parameterized Quadratic Decision Rule (QDR), a generalisation of the commonly employed Affine Decision Rule (ADR), for two-stage linear adjustable robust optimization problems with ellipsoidal uncertainty and show that (affinely parameterized) linear adjustable robust optimization problems with QDRs are numerically tractable by presenting exact semi-definite program (SDP) and second order cone program (SOCP) reformulations. Under these QDRs, we also establish that exact conic program reformulations also hold for two-stage linear ARO problems, containing also ad","authors_text":"D. Woolnough, G.Li, V. Jeyakumar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-02-12T20:29:44Z","title":"Exact Conic Programming Reformulations of Two-Stage Adjustable Robust Linear Programs with New Quadratic Decision Rules"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.05223","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:f3f1eac1cb21c7f3f5e6a9ca3cc84994640ad0d20f1298e1dddc62f784223597","target":"record","created_at":"2026-07-05T00:49:41Z","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":"e9b8728a1afdb01b204784a229b28a74e4828eb10be6a81411b6e0fa0e8c6235","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-02-12T20:29:44Z","title_canon_sha256":"4ad21ee4b22ed5aee15e6508e0eaab5725fca3a48ca9a8c80ec9b7c2ec40c522"},"schema_version":"1.0","source":{"id":"2002.05223","kind":"arxiv","version":2}},"canonical_sha256":"5039616d5de9f1749a8f4e388249fe7034a16c94ff2c1b195ff061cede97d120","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5039616d5de9f1749a8f4e388249fe7034a16c94ff2c1b195ff061cede97d120","first_computed_at":"2026-07-05T00:49:41.960611Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:49:41.960611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j3k8wOU/cqogunLbznxseqpZ+1H9qe7glDOeMfhT9XmtjGMvNj51KPrhedgnq6jlmSPE2wh0W6eIKqNUvK1bDg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:49:41.961001Z","signed_message":"canonical_sha256_bytes"},"source_id":"2002.05223","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f3f1eac1cb21c7f3f5e6a9ca3cc84994640ad0d20f1298e1dddc62f784223597","sha256:11b0dd47d36ce3b6ffc3b3036b787f41a6fc96701c1006ba32969da6d5e180bc"],"state_sha256":"8f80de77db5ce5ec048594acb04291c36a553430aa51697d393649facbb2774d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uI2JrO0BoaHr6s/ggNVKrlgLhjTM+Vqnap4sGiuT4RZn6eMRmVH0dO3a0faWs5R1QJar/dKPOpE88TkPe6GZBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T06:50:58.368150Z","bundle_sha256":"5f718930fbf74db4478622c8b50cb8a525d16d6552ecb12ce8bba056dc4ed0de"}}