{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:T5TKHVNCE5W2QWF4RC7TDKQWHJ","short_pith_number":"pith:T5TKHVNC","schema_version":"1.0","canonical_sha256":"9f66a3d5a2276da858bc88bf31aa163a422960aa3fdf920b1d200548399908a6","source":{"kind":"arxiv","id":"2403.04670","version":1},"attestation_state":"computed","paper":{"title":"End-to-end Conditional Robust Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Abhilash Chenreddy, Erick Delage","submitted_at":"2024-03-07T17:16:59Z","abstract_excerpt":"The field of Contextual Optimization (CO) integrates machine learning and optimization to solve decision making problems under uncertainty. Recently, a risk sensitive variant of CO, known as Conditional Robust Optimization (CRO), combines uncertainty quantification with robust optimization in order to promote safety and reliability in high stake applications. Exploiting modern differentiable optimization methods, we propose a novel end-to-end approach to train a CRO model in a way that accounts for both the empirical risk of the prescribed decisions and the quality of conditional coverage of t"},"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":"2403.04670","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-03-07T17:16:59Z","cross_cats_sorted":[],"title_canon_sha256":"3e9d51b321c1e4549df1f296235b51c5c5ee43dd2893cc8511e0fca14ef10c22","abstract_canon_sha256":"58f827b28ad53906b560255f2095a20b4adcbbfc495e9041447fc8d207878949"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:53:26.687740Z","signature_b64":"x7ozfPWhA/o1UerDfUz9IfEqdLsZ5baZLoDPLFxBmQiT6Ptym+hffqd08cCpBljhkR/YwAPR9A2c2Drmn10DCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f66a3d5a2276da858bc88bf31aa163a422960aa3fdf920b1d200548399908a6","last_reissued_at":"2026-07-05T07:53:26.687218Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:53:26.687218Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"End-to-end Conditional Robust Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Abhilash Chenreddy, Erick Delage","submitted_at":"2024-03-07T17:16:59Z","abstract_excerpt":"The field of Contextual Optimization (CO) integrates machine learning and optimization to solve decision making problems under uncertainty. Recently, a risk sensitive variant of CO, known as Conditional Robust Optimization (CRO), combines uncertainty quantification with robust optimization in order to promote safety and reliability in high stake applications. Exploiting modern differentiable optimization methods, we propose a novel end-to-end approach to train a CRO model in a way that accounts for both the empirical risk of the prescribed decisions and the quality of conditional coverage of t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.04670","kind":"arxiv","version":1},"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/2403.04670/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2403.04670","created_at":"2026-07-05T07:53:26.687281+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.04670v1","created_at":"2026-07-05T07:53:26.687281+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.04670","created_at":"2026-07-05T07:53:26.687281+00:00"},{"alias_kind":"pith_short_12","alias_value":"T5TKHVNCE5W2","created_at":"2026-07-05T07:53:26.687281+00:00"},{"alias_kind":"pith_short_16","alias_value":"T5TKHVNCE5W2QWF4","created_at":"2026-07-05T07:53:26.687281+00:00"},{"alias_kind":"pith_short_8","alias_value":"T5TKHVNC","created_at":"2026-07-05T07:53:26.687281+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2502.16607","citing_title":"Risk-averse Decision Making with Contextual Information: Model, Sample Average Approximation, and Kernelization","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06479","citing_title":"Risk-Controlled Post-Processing of Decision Policies","ref_index":54,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/T5TKHVNCE5W2QWF4RC7TDKQWHJ","json":"https://pith.science/pith/T5TKHVNCE5W2QWF4RC7TDKQWHJ.json","graph_json":"https://pith.science/api/pith-number/T5TKHVNCE5W2QWF4RC7TDKQWHJ/graph.json","events_json":"https://pith.science/api/pith-number/T5TKHVNCE5W2QWF4RC7TDKQWHJ/events.json","paper":"https://pith.science/paper/T5TKHVNC"},"agent_actions":{"view_html":"https://pith.science/pith/T5TKHVNCE5W2QWF4RC7TDKQWHJ","download_json":"https://pith.science/pith/T5TKHVNCE5W2QWF4RC7TDKQWHJ.json","view_paper":"https://pith.science/paper/T5TKHVNC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.04670&json=true","fetch_graph":"https://pith.science/api/pith-number/T5TKHVNCE5W2QWF4RC7TDKQWHJ/graph.json","fetch_events":"https://pith.science/api/pith-number/T5TKHVNCE5W2QWF4RC7TDKQWHJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T5TKHVNCE5W2QWF4RC7TDKQWHJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T5TKHVNCE5W2QWF4RC7TDKQWHJ/action/storage_attestation","attest_author":"https://pith.science/pith/T5TKHVNCE5W2QWF4RC7TDKQWHJ/action/author_attestation","sign_citation":"https://pith.science/pith/T5TKHVNCE5W2QWF4RC7TDKQWHJ/action/citation_signature","submit_replication":"https://pith.science/pith/T5TKHVNCE5W2QWF4RC7TDKQWHJ/action/replication_record"}},"created_at":"2026-07-05T07:53:26.687281+00:00","updated_at":"2026-07-05T07:53:26.687281+00:00"}