{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:J4HEXTVQ7XNPJE23EJCBZW4XYX","short_pith_number":"pith:J4HEXTVQ","schema_version":"1.0","canonical_sha256":"4f0e4bceb0fddaf4935b22441cdb97c5ec0ee7cbd5735c3d403f5185587b0475","source":{"kind":"arxiv","id":"2505.22881","version":1},"attestation_state":"computed","paper":{"title":"Smart Surrogate Losses for Contextual Stochastic Linear Optimization with Robust Constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Hyungki Im, Paul Grigas, Wyame Benslimane","submitted_at":"2025-05-28T21:29:40Z","abstract_excerpt":"We study an extension of contextual stochastic linear optimization (CSLO) that, in contrast to most of the existing literature, involves inequality constraints that depend on uncertain parameters predicted by a machine learning model. To handle the constraint uncertainty, we use contextual uncertainty sets constructed via methods like conformal prediction. Given a contextual uncertainty set method, we introduce the \"Smart Predict-then-Optimize with Robust Constraints\" (SPO-RC) loss, a feasibility-sensitive adaptation of the SPO loss that measures decision error of predicted objective parameter"},"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":"2505.22881","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-28T21:29:40Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"e3768d8af7f6984c6ff32c30571c8b97b3ef63b753d3a4ed3d74ff5cbe379449","abstract_canon_sha256":"43b2688f9a4a4f0e79f7701ae7b943ea1b83ad84f75740caa53655122cfaaf48"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:11:51.445772Z","signature_b64":"d5BQ7MRCG+Av67461YDs5FF2VmuyCFfSXNyZ/4aQnvhO52BGIpD4n5N4RB6i/z/rTBu+ESMGMac56BpN9PEfDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f0e4bceb0fddaf4935b22441cdb97c5ec0ee7cbd5735c3d403f5185587b0475","last_reissued_at":"2026-07-05T11:11:51.445270Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:11:51.445270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Smart Surrogate Losses for Contextual Stochastic Linear Optimization with Robust Constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Hyungki Im, Paul Grigas, Wyame Benslimane","submitted_at":"2025-05-28T21:29:40Z","abstract_excerpt":"We study an extension of contextual stochastic linear optimization (CSLO) that, in contrast to most of the existing literature, involves inequality constraints that depend on uncertain parameters predicted by a machine learning model. To handle the constraint uncertainty, we use contextual uncertainty sets constructed via methods like conformal prediction. Given a contextual uncertainty set method, we introduce the \"Smart Predict-then-Optimize with Robust Constraints\" (SPO-RC) loss, a feasibility-sensitive adaptation of the SPO loss that measures decision error of predicted objective parameter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.22881","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/2505.22881/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":"2505.22881","created_at":"2026-07-05T11:11:51.445337+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.22881v1","created_at":"2026-07-05T11:11:51.445337+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.22881","created_at":"2026-07-05T11:11:51.445337+00:00"},{"alias_kind":"pith_short_12","alias_value":"J4HEXTVQ7XNP","created_at":"2026-07-05T11:11:51.445337+00:00"},{"alias_kind":"pith_short_16","alias_value":"J4HEXTVQ7XNPJE23","created_at":"2026-07-05T11:11:51.445337+00:00"},{"alias_kind":"pith_short_8","alias_value":"J4HEXTVQ","created_at":"2026-07-05T11:11:51.445337+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.21773","citing_title":"Decision-Focused Learning: When and Why Traditional Prediction Models Fail","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2606.19587","citing_title":"A Solver-Free Training Method for Predict-then-Optimize","ref_index":22,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J4HEXTVQ7XNPJE23EJCBZW4XYX","json":"https://pith.science/pith/J4HEXTVQ7XNPJE23EJCBZW4XYX.json","graph_json":"https://pith.science/api/pith-number/J4HEXTVQ7XNPJE23EJCBZW4XYX/graph.json","events_json":"https://pith.science/api/pith-number/J4HEXTVQ7XNPJE23EJCBZW4XYX/events.json","paper":"https://pith.science/paper/J4HEXTVQ"},"agent_actions":{"view_html":"https://pith.science/pith/J4HEXTVQ7XNPJE23EJCBZW4XYX","download_json":"https://pith.science/pith/J4HEXTVQ7XNPJE23EJCBZW4XYX.json","view_paper":"https://pith.science/paper/J4HEXTVQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.22881&json=true","fetch_graph":"https://pith.science/api/pith-number/J4HEXTVQ7XNPJE23EJCBZW4XYX/graph.json","fetch_events":"https://pith.science/api/pith-number/J4HEXTVQ7XNPJE23EJCBZW4XYX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J4HEXTVQ7XNPJE23EJCBZW4XYX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J4HEXTVQ7XNPJE23EJCBZW4XYX/action/storage_attestation","attest_author":"https://pith.science/pith/J4HEXTVQ7XNPJE23EJCBZW4XYX/action/author_attestation","sign_citation":"https://pith.science/pith/J4HEXTVQ7XNPJE23EJCBZW4XYX/action/citation_signature","submit_replication":"https://pith.science/pith/J4HEXTVQ7XNPJE23EJCBZW4XYX/action/replication_record"}},"created_at":"2026-07-05T11:11:51.445337+00:00","updated_at":"2026-07-05T11:11:51.445337+00:00"}