{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:EK67N2VPWYA4PXRTDKUU3DPL3D","short_pith_number":"pith:EK67N2VP","canonical_record":{"source":{"id":"2605.14019","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"econ.EM","submitted_at":"2026-05-13T18:32:44Z","cross_cats_sorted":["cs.LG","math.ST","stat.CO","stat.TH"],"title_canon_sha256":"c3d3c3879a5b4d5f7770135eb611cca200b9ff60cb4c5e50e31f1a1b3bd94cb8","abstract_canon_sha256":"825690936dcc15da082aff09e668154c8c7b125a4f80f7b56d0fd429ef1675df"},"schema_version":"1.0"},"canonical_sha256":"22bdf6eaafb601c7de331aa94d8debd8c18c2980753b3c6a1f32734bed764051","source":{"kind":"arxiv","id":"2605.14019","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14019","created_at":"2026-05-17T23:39:12Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14019v1","created_at":"2026-05-17T23:39:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14019","created_at":"2026-05-17T23:39:12Z"},{"alias_kind":"pith_short_12","alias_value":"EK67N2VPWYA4","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"EK67N2VPWYA4PXRT","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"EK67N2VP","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:EK67N2VPWYA4PXRTDKUU3DPL3D","target":"record","payload":{"canonical_record":{"source":{"id":"2605.14019","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"econ.EM","submitted_at":"2026-05-13T18:32:44Z","cross_cats_sorted":["cs.LG","math.ST","stat.CO","stat.TH"],"title_canon_sha256":"c3d3c3879a5b4d5f7770135eb611cca200b9ff60cb4c5e50e31f1a1b3bd94cb8","abstract_canon_sha256":"825690936dcc15da082aff09e668154c8c7b125a4f80f7b56d0fd429ef1675df"},"schema_version":"1.0"},"canonical_sha256":"22bdf6eaafb601c7de331aa94d8debd8c18c2980753b3c6a1f32734bed764051","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:12.964387Z","signature_b64":"4Tqswao432LZWf33NEvlxstt0UwZAN87f2afHEDm7Zn5dpfixsx+CCWgLuzovfa0eZYeWI+R+HgIR/yLVMeXCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22bdf6eaafb601c7de331aa94d8debd8c18c2980753b3c6a1f32734bed764051","last_reissued_at":"2026-05-17T23:39:12.963622Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:12.963622Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.14019","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-17T23:39:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nPpxPMy6Fi1kwuY01R0o9so2YsDdp8Ip9QFodSeZ9qNq9zuCj8Fgx2aHFVBgQQMGhk76vtI0oV2mldVOsAN3DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T09:14:19.582634Z"},"content_sha256":"d5af9af168d25c1746cc32f895e7bc4611bd0977aeec39ce4bfed975d6410e77","schema_version":"1.0","event_id":"sha256:d5af9af168d25c1746cc32f895e7bc4611bd0977aeec39ce4bfed975d6410e77"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:EK67N2VPWYA4PXRTDKUU3DPL3D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Regret Equals Covariance: A Closed-Form Characterization for Stochastic Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Expected regret equals the covariance between uncertain costs and optimal decisions in stochastic optimization.","cross_cats":["cs.LG","math.ST","stat.CO","stat.TH"],"primary_cat":"econ.EM","authors_text":"Irene Aldridge","submitted_at":"2026-05-13T18:32:44Z","abstract_excerpt":"Regret is the cost of uncertainty in algorithmic decision-making. Quantifying regret typically requires computationally expensive simulation via Sample Average Approximation (SAA), with complexity $\\mathcal{O}(Bn^{2}d^{3})$ in the number of scenarios $B$, variables $n$, and constraints $d$. % This paper proves that expected regret in any stochastic optimization problem admits the exact decomposition % \\begin{equation*}\n  \\mathrm{Regret}(c)\n  = \\mathrm{Cov}(c,\\,\\pi^{*}(c)) + R(c), \\end{equation*} % where $c$ is the vector of uncertain parameters, $\\pi^{*}(c)$ is the optimal decision, and $R(c)$"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We prove that expected regret in any stochastic optimization problem admits the exact decomposition Regret(c) = Cov(c, π*(c)) + R(c), and for linear programs and unconstrained quadratic programs R(c)=0 exactly.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The decomposition and exact equality for LPs and QPs rely on the problem being linear or unconstrained quadratic; the residual bound requires Lipschitz continuity, smoothness, and strong convexity of the objective.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Expected regret equals covariance between costs and optimal decisions for linear and quadratic stochastic programs, with explicit bounds on the residual.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Expected regret equals the covariance between uncertain costs and optimal decisions in stochastic optimization.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"9713cf1fff1ed15104bd082d95508f161a402188ef0f671b921201cf801e1c1c"},"source":{"id":"2605.14019","kind":"arxiv","version":1},"verdict":{"id":"9ab9cd1b-e234-484b-bcb2-01021a7e7220","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T02:30:51.911619Z","strongest_claim":"We prove that expected regret in any stochastic optimization problem admits the exact decomposition Regret(c) = Cov(c, π*(c)) + R(c), and for linear programs and unconstrained quadratic programs R(c)=0 exactly.","one_line_summary":"Expected regret equals covariance between costs and optimal decisions for linear and quadratic stochastic programs, with explicit bounds on the residual.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The decomposition and exact equality for LPs and QPs rely on the problem being linear or unconstrained quadratic; the residual bound requires Lipschitz continuity, smoothness, and strong convexity of the objective.","pith_extraction_headline":"Expected regret equals the covariance between uncertain costs and optimal decisions in stochastic optimization."},"references":{"count":24,"sample":[{"doi":"","year":2019,"title":"Differentiable convex optimization layers,","work_id":"0b8d41ab-b7be-4bfe-950b-512d01b2e317","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"Generalization bounds in the predict-then-optimize framework,","work_id":"d1c9bd2a-2684-4ad3-b2e0-a0fa5b88b29d","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2015,"title":"Separability and decomposition in SAA for stochastic mixed- integer programming,","work_id":"49b8cd66-0592-4030-bef1-e06c44a5c81e","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2021,"title":"Machine learning for combinatorial optimization: A methodological tour d’horizon,","work_id":"e1c9bf4d-732d-433d-8338-3620f3ffc46f","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"Statistical analysis of Wasserstein distributionally robust estimators,","work_id":"298cca64-22dd-4bea-bc92-8b8b9235d202","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":24,"snapshot_sha256":"39acbb6a8fd6c02781a8e1cdb4779f666f570e61954fcc02e8b7e3535fb4daa9","internal_anchors":1},"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":"9ab9cd1b-e234-484b-bcb2-01021a7e7220"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gtl1IVCnimTx6zm5EXst+cXPtsm/mdEEAOQlmNr6ey9+FGfQRKCXBfYaY/b2UVXP3A4/+p5yjd1342g6LXBiBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T09:14:19.583175Z"},"content_sha256":"ed71d7033bbf816a568a217a9d1cc19601c4f9abbea0ab958dce7e1fe94a8476","schema_version":"1.0","event_id":"sha256:ed71d7033bbf816a568a217a9d1cc19601c4f9abbea0ab958dce7e1fe94a8476"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EK67N2VPWYA4PXRTDKUU3DPL3D/bundle.json","state_url":"https://pith.science/pith/EK67N2VPWYA4PXRTDKUU3DPL3D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EK67N2VPWYA4PXRTDKUU3DPL3D/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-07-03T09:14:19Z","links":{"resolver":"https://pith.science/pith/EK67N2VPWYA4PXRTDKUU3DPL3D","bundle":"https://pith.science/pith/EK67N2VPWYA4PXRTDKUU3DPL3D/bundle.json","state":"https://pith.science/pith/EK67N2VPWYA4PXRTDKUU3DPL3D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EK67N2VPWYA4PXRTDKUU3DPL3D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:EK67N2VPWYA4PXRTDKUU3DPL3D","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":"825690936dcc15da082aff09e668154c8c7b125a4f80f7b56d0fd429ef1675df","cross_cats_sorted":["cs.LG","math.ST","stat.CO","stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"econ.EM","submitted_at":"2026-05-13T18:32:44Z","title_canon_sha256":"c3d3c3879a5b4d5f7770135eb611cca200b9ff60cb4c5e50e31f1a1b3bd94cb8"},"schema_version":"1.0","source":{"id":"2605.14019","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14019","created_at":"2026-05-17T23:39:12Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14019v1","created_at":"2026-05-17T23:39:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14019","created_at":"2026-05-17T23:39:12Z"},{"alias_kind":"pith_short_12","alias_value":"EK67N2VPWYA4","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"EK67N2VPWYA4PXRT","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"EK67N2VP","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:ed71d7033bbf816a568a217a9d1cc19601c4f9abbea0ab958dce7e1fe94a8476","target":"graph","created_at":"2026-05-17T23:39:12Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We prove that expected regret in any stochastic optimization problem admits the exact decomposition Regret(c) = Cov(c, π*(c)) + R(c), and for linear programs and unconstrained quadratic programs R(c)=0 exactly."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The decomposition and exact equality for LPs and QPs rely on the problem being linear or unconstrained quadratic; the residual bound requires Lipschitz continuity, smoothness, and strong convexity of the objective."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Expected regret equals covariance between costs and optimal decisions for linear and quadratic stochastic programs, with explicit bounds on the residual."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Expected regret equals the covariance between uncertain costs and optimal decisions in stochastic optimization."}],"snapshot_sha256":"9713cf1fff1ed15104bd082d95508f161a402188ef0f671b921201cf801e1c1c"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Regret is the cost of uncertainty in algorithmic decision-making. Quantifying regret typically requires computationally expensive simulation via Sample Average Approximation (SAA), with complexity $\\mathcal{O}(Bn^{2}d^{3})$ in the number of scenarios $B$, variables $n$, and constraints $d$. % This paper proves that expected regret in any stochastic optimization problem admits the exact decomposition % \\begin{equation*}\n  \\mathrm{Regret}(c)\n  = \\mathrm{Cov}(c,\\,\\pi^{*}(c)) + R(c), \\end{equation*} % where $c$ is the vector of uncertain parameters, $\\pi^{*}(c)$ is the optimal decision, and $R(c)$","authors_text":"Irene Aldridge","cross_cats":["cs.LG","math.ST","stat.CO","stat.TH"],"headline":"Expected regret equals the covariance between uncertain costs and optimal decisions in stochastic optimization.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"econ.EM","submitted_at":"2026-05-13T18:32:44Z","title":"Regret Equals Covariance: A Closed-Form Characterization for Stochastic Optimization"},"references":{"count":24,"internal_anchors":1,"resolved_work":24,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Differentiable convex optimization layers,","work_id":"0b8d41ab-b7be-4bfe-950b-512d01b2e317","year":2019},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Generalization bounds in the predict-then-optimize framework,","work_id":"d1c9bd2a-2684-4ad3-b2e0-a0fa5b88b29d","year":2022},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Separability and decomposition in SAA for stochastic mixed- integer programming,","work_id":"49b8cd66-0592-4030-bef1-e06c44a5c81e","year":2015},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Machine learning for combinatorial optimization: A methodological tour d’horizon,","work_id":"e1c9bf4d-732d-433d-8338-3620f3ffc46f","year":2021},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Statistical analysis of Wasserstein distributionally robust estimators,","work_id":"298cca64-22dd-4bea-bc92-8b8b9235d202","year":2023}],"snapshot_sha256":"39acbb6a8fd6c02781a8e1cdb4779f666f570e61954fcc02e8b7e3535fb4daa9"},"source":{"id":"2605.14019","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T02:30:51.911619Z","id":"9ab9cd1b-e234-484b-bcb2-01021a7e7220","model_set":{"reader":"grok-4.3"},"one_line_summary":"Expected regret equals covariance between costs and optimal decisions for linear and quadratic stochastic programs, with explicit bounds on the residual.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Expected regret equals the covariance between uncertain costs and optimal decisions in stochastic optimization.","strongest_claim":"We prove that expected regret in any stochastic optimization problem admits the exact decomposition Regret(c) = Cov(c, π*(c)) + R(c), and for linear programs and unconstrained quadratic programs R(c)=0 exactly.","weakest_assumption":"The decomposition and exact equality for LPs and QPs rely on the problem being linear or unconstrained quadratic; the residual bound requires Lipschitz continuity, smoothness, and strong convexity of the objective."}},"verdict_id":"9ab9cd1b-e234-484b-bcb2-01021a7e7220"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d5af9af168d25c1746cc32f895e7bc4611bd0977aeec39ce4bfed975d6410e77","target":"record","created_at":"2026-05-17T23:39:12Z","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":"825690936dcc15da082aff09e668154c8c7b125a4f80f7b56d0fd429ef1675df","cross_cats_sorted":["cs.LG","math.ST","stat.CO","stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"econ.EM","submitted_at":"2026-05-13T18:32:44Z","title_canon_sha256":"c3d3c3879a5b4d5f7770135eb611cca200b9ff60cb4c5e50e31f1a1b3bd94cb8"},"schema_version":"1.0","source":{"id":"2605.14019","kind":"arxiv","version":1}},"canonical_sha256":"22bdf6eaafb601c7de331aa94d8debd8c18c2980753b3c6a1f32734bed764051","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"22bdf6eaafb601c7de331aa94d8debd8c18c2980753b3c6a1f32734bed764051","first_computed_at":"2026-05-17T23:39:12.963622Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:12.963622Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4Tqswao432LZWf33NEvlxstt0UwZAN87f2afHEDm7Zn5dpfixsx+CCWgLuzovfa0eZYeWI+R+HgIR/yLVMeXCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:12.964387Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14019","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d5af9af168d25c1746cc32f895e7bc4611bd0977aeec39ce4bfed975d6410e77","sha256:ed71d7033bbf816a568a217a9d1cc19601c4f9abbea0ab958dce7e1fe94a8476"],"state_sha256":"f7f73c2afd78b9866a10be33ee7c79158e391489dd3263ce57c8f6cb359673c0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jn1FGx/oiI1GmVbMd616uyWQFd4pJJKH0q810d+5u10NYdE/ID1+ArPjKadCS0E1KhGHsTcCjwpe3lazYkQCAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T09:14:19.585526Z","bundle_sha256":"358b678ea2513a74e4c8c1bcda9b12dbe99d88031cdbb9749f5ad2653fc2c9e8"}}