{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:YGNRGRVVAFKRPH64NPGZINVLO3","short_pith_number":"pith:YGNRGRVV","schema_version":"1.0","canonical_sha256":"c19b1346b50155179fdc6bcd9436ab76fda9903cda0a3a4657d6def99087518b","source":{"kind":"arxiv","id":"2402.07407","version":2},"attestation_state":"computed","paper":{"title":"Conformal Predictive Programming for Chance Constrained Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.SY","math.OC","stat.ML"],"primary_cat":"eess.SY","authors_text":"Jyotirmoy V. Deshmukh, Lars Lindemann, Matteo Sesia, Xinyi Yu, Yiqi Zhao","submitted_at":"2024-02-12T04:59:34Z","abstract_excerpt":"We propose conformal predictive programming (CPP), a framework to solve chance constrained optimization problems, i.e., optimization problems with constraints that are functions of random variables. CPP utilizes samples from these random variables along with the quantile lemma - central to conformal prediction - to transform the chance constrained optimization problem into a deterministic problem with a quantile reformulation. CPP inherits a priori guarantees on constraint satisfaction from existing sample average approximation approaches for a class of chance constrained optimization problems"},"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":"2402.07407","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2024-02-12T04:59:34Z","cross_cats_sorted":["cs.LG","cs.SY","math.OC","stat.ML"],"title_canon_sha256":"8e085c547105f3e5ec1f1469bb5b81c8f13e421003a58a7f11e2a13a0f3bb89f","abstract_canon_sha256":"43dd068daccbacc0694c1e5bae3690cfe1c809f15fdf07c8e1d6b6f133e7eef5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:58:14.629941Z","signature_b64":"4qyHUDrJJUL16Uo0OC+oJvxsGo+d0YrMpVcnKUB4/kSOWJaiOFItO/6fXz/QIrmy4MreIgUwwl5BaQCZCSK7Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c19b1346b50155179fdc6bcd9436ab76fda9903cda0a3a4657d6def99087518b","last_reissued_at":"2026-07-05T10:58:14.629423Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:58:14.629423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Conformal Predictive Programming for Chance Constrained Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.SY","math.OC","stat.ML"],"primary_cat":"eess.SY","authors_text":"Jyotirmoy V. Deshmukh, Lars Lindemann, Matteo Sesia, Xinyi Yu, Yiqi Zhao","submitted_at":"2024-02-12T04:59:34Z","abstract_excerpt":"We propose conformal predictive programming (CPP), a framework to solve chance constrained optimization problems, i.e., optimization problems with constraints that are functions of random variables. CPP utilizes samples from these random variables along with the quantile lemma - central to conformal prediction - to transform the chance constrained optimization problem into a deterministic problem with a quantile reformulation. CPP inherits a priori guarantees on constraint satisfaction from existing sample average approximation approaches for a class of chance constrained optimization problems"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.07407","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/2402.07407/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":"2402.07407","created_at":"2026-07-05T10:58:14.629488+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.07407v2","created_at":"2026-07-05T10:58:14.629488+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.07407","created_at":"2026-07-05T10:58:14.629488+00:00"},{"alias_kind":"pith_short_12","alias_value":"YGNRGRVVAFKR","created_at":"2026-07-05T10:58:14.629488+00:00"},{"alias_kind":"pith_short_16","alias_value":"YGNRGRVVAFKRPH64","created_at":"2026-07-05T10:58:14.629488+00:00"},{"alias_kind":"pith_short_8","alias_value":"YGNRGRVV","created_at":"2026-07-05T10:58:14.629488+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":4,"sample":[{"citing_arxiv_id":"2606.05551","citing_title":"Conformal Risk-Averse Decision Making with Action Conditional Guarantee","ref_index":41,"is_internal_anchor":true},{"citing_arxiv_id":"2512.06600","citing_title":"Learning Reachability of Energy Storage Arbitrage","ref_index":36,"is_internal_anchor":true},{"citing_arxiv_id":"2605.06479","citing_title":"Risk-Controlled Post-Processing of Decision Policies","ref_index":43,"is_internal_anchor":true},{"citing_arxiv_id":"2604.08831","citing_title":"Probabilistic Control Barrier Functions for Systems with State Estimation Uncertainty using Sub-Gaussian Concentration","ref_index":24,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YGNRGRVVAFKRPH64NPGZINVLO3","json":"https://pith.science/pith/YGNRGRVVAFKRPH64NPGZINVLO3.json","graph_json":"https://pith.science/api/pith-number/YGNRGRVVAFKRPH64NPGZINVLO3/graph.json","events_json":"https://pith.science/api/pith-number/YGNRGRVVAFKRPH64NPGZINVLO3/events.json","paper":"https://pith.science/paper/YGNRGRVV"},"agent_actions":{"view_html":"https://pith.science/pith/YGNRGRVVAFKRPH64NPGZINVLO3","download_json":"https://pith.science/pith/YGNRGRVVAFKRPH64NPGZINVLO3.json","view_paper":"https://pith.science/paper/YGNRGRVV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.07407&json=true","fetch_graph":"https://pith.science/api/pith-number/YGNRGRVVAFKRPH64NPGZINVLO3/graph.json","fetch_events":"https://pith.science/api/pith-number/YGNRGRVVAFKRPH64NPGZINVLO3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YGNRGRVVAFKRPH64NPGZINVLO3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YGNRGRVVAFKRPH64NPGZINVLO3/action/storage_attestation","attest_author":"https://pith.science/pith/YGNRGRVVAFKRPH64NPGZINVLO3/action/author_attestation","sign_citation":"https://pith.science/pith/YGNRGRVVAFKRPH64NPGZINVLO3/action/citation_signature","submit_replication":"https://pith.science/pith/YGNRGRVVAFKRPH64NPGZINVLO3/action/replication_record"}},"created_at":"2026-07-05T10:58:14.629488+00:00","updated_at":"2026-07-05T10:58:14.629488+00:00"}