{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:GFEA427ZW7NIXOBJB6SBLEXHWV","short_pith_number":"pith:GFEA427Z","schema_version":"1.0","canonical_sha256":"31480e6bf9b7da8bb8290fa41592e7b57b2cbf6ffc143fad3cd293078945d863","source":{"kind":"arxiv","id":"2503.02173","version":1},"attestation_state":"computed","paper":{"title":"From Data to Uncertainty Sets: a Machine Learning Approach","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Benjamin Boucher, Dimitris Bertsimas","submitted_at":"2025-03-04T01:30:28Z","abstract_excerpt":"Existing approaches of prescriptive analytics -- where inputs of an optimization model can be predicted by leveraging covariates in a machine learning model -- often attempt to optimize the mean value of an uncertain objective. However, when applied to uncertain constraints, these methods rarely work because satisfying a crucial constraint in expectation may result in a high probability of violation. To remedy this, we leverage robust optimization to protect a constraint against the uncertainty of a machine learning model's output. To do so, we design an uncertainty set based on the model's lo"},"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":"2503.02173","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-04T01:30:28Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"6836efe9bf64861d92886c019f8e8b1bd9e93f1a9c386341ac5da9ff1876e0de","abstract_canon_sha256":"c66eed1f387960dc4a373cb4fc96fa8a7938230bca3bd930670e4cee43d20026"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:23:38.621700Z","signature_b64":"+9ueCaxsk2yjx/dPyjEs6jlkQfPFaGixb6iXounqG6NxRJAkOQV6G4KALuA6QtLwuMGBbocTV64aZ8fAOENfAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31480e6bf9b7da8bb8290fa41592e7b57b2cbf6ffc143fad3cd293078945d863","last_reissued_at":"2026-07-05T10:23:38.620826Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:23:38.620826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"From Data to Uncertainty Sets: a Machine Learning Approach","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Benjamin Boucher, Dimitris Bertsimas","submitted_at":"2025-03-04T01:30:28Z","abstract_excerpt":"Existing approaches of prescriptive analytics -- where inputs of an optimization model can be predicted by leveraging covariates in a machine learning model -- often attempt to optimize the mean value of an uncertain objective. However, when applied to uncertain constraints, these methods rarely work because satisfying a crucial constraint in expectation may result in a high probability of violation. To remedy this, we leverage robust optimization to protect a constraint against the uncertainty of a machine learning model's output. To do so, we design an uncertainty set based on the model's lo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.02173","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/2503.02173/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":"2503.02173","created_at":"2026-07-05T10:23:38.620939+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.02173v1","created_at":"2026-07-05T10:23:38.620939+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.02173","created_at":"2026-07-05T10:23:38.620939+00:00"},{"alias_kind":"pith_short_12","alias_value":"GFEA427ZW7NI","created_at":"2026-07-05T10:23:38.620939+00:00"},{"alias_kind":"pith_short_16","alias_value":"GFEA427ZW7NIXOBJ","created_at":"2026-07-05T10:23:38.620939+00:00"},{"alias_kind":"pith_short_8","alias_value":"GFEA427Z","created_at":"2026-07-05T10:23:38.620939+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.17466","citing_title":"Contextual Robust Optimization for AI Data Center Scheduling with Statistical Guarantees","ref_index":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GFEA427ZW7NIXOBJB6SBLEXHWV","json":"https://pith.science/pith/GFEA427ZW7NIXOBJB6SBLEXHWV.json","graph_json":"https://pith.science/api/pith-number/GFEA427ZW7NIXOBJB6SBLEXHWV/graph.json","events_json":"https://pith.science/api/pith-number/GFEA427ZW7NIXOBJB6SBLEXHWV/events.json","paper":"https://pith.science/paper/GFEA427Z"},"agent_actions":{"view_html":"https://pith.science/pith/GFEA427ZW7NIXOBJB6SBLEXHWV","download_json":"https://pith.science/pith/GFEA427ZW7NIXOBJB6SBLEXHWV.json","view_paper":"https://pith.science/paper/GFEA427Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.02173&json=true","fetch_graph":"https://pith.science/api/pith-number/GFEA427ZW7NIXOBJB6SBLEXHWV/graph.json","fetch_events":"https://pith.science/api/pith-number/GFEA427ZW7NIXOBJB6SBLEXHWV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GFEA427ZW7NIXOBJB6SBLEXHWV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GFEA427ZW7NIXOBJB6SBLEXHWV/action/storage_attestation","attest_author":"https://pith.science/pith/GFEA427ZW7NIXOBJB6SBLEXHWV/action/author_attestation","sign_citation":"https://pith.science/pith/GFEA427ZW7NIXOBJB6SBLEXHWV/action/citation_signature","submit_replication":"https://pith.science/pith/GFEA427ZW7NIXOBJB6SBLEXHWV/action/replication_record"}},"created_at":"2026-07-05T10:23:38.620939+00:00","updated_at":"2026-07-05T10:23:38.620939+00:00"}