{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:F5J5M24YZQYITFWQS7LGDAU3HC","short_pith_number":"pith:F5J5M24Y","schema_version":"1.0","canonical_sha256":"2f53d66b98cc308996d097d661829b3890fe82d7de20e6d78b2a24468cb0b8a0","source":{"kind":"arxiv","id":"1307.0345","version":2},"attestation_state":"computed","paper":{"title":"Performance Bounds for the Scenario Approach and an Extension to a Class of Non-convex Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"John Lygeros, Peyman Mohajerin Esfahani, Tobias Sutter","submitted_at":"2013-07-01T12:30:58Z","abstract_excerpt":"We consider the Scenario Convex Program (SCP) for two classes of optimization problems that are not tractable in general: Robust Convex Programs (RCPs) and Chance-Constrained Programs (CCPs). We establish a probabilistic bridge from the optimal value of SCP to the optimal values of RCP and CCP in which the uncertainty takes values in a general, possibly infinite dimensional, metric space. We then extend our results to a certain class of non-convex problems that includes, for example, binary decision variables. In the process, we also settle a measurability issue for a general class of scenario"},"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":"1307.0345","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-07-01T12:30:58Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"648e747783dd249fbbe572a6a2d75b918d3ea348c9463eab46b10df47fbe2c07","abstract_canon_sha256":"9eec82d0d34fcbf0cd5b0feda7c850e299f3feffa89d02a4a2490bb70a8517e3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:39.007121Z","signature_b64":"ev3VwQkVOeFbLNS+Vsx3XW6ddtRtdI3mwhvLomoUlLZyU1qCR/Mvj+PiJSxsrQbIvdw3UyQfeDPdNqtEec51AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f53d66b98cc308996d097d661829b3890fe82d7de20e6d78b2a24468cb0b8a0","last_reissued_at":"2026-05-18T02:49:39.006790Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:39.006790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Performance Bounds for the Scenario Approach and an Extension to a Class of Non-convex Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"John Lygeros, Peyman Mohajerin Esfahani, Tobias Sutter","submitted_at":"2013-07-01T12:30:58Z","abstract_excerpt":"We consider the Scenario Convex Program (SCP) for two classes of optimization problems that are not tractable in general: Robust Convex Programs (RCPs) and Chance-Constrained Programs (CCPs). We establish a probabilistic bridge from the optimal value of SCP to the optimal values of RCP and CCP in which the uncertainty takes values in a general, possibly infinite dimensional, metric space. We then extend our results to a certain class of non-convex problems that includes, for example, binary decision variables. In the process, we also settle a measurability issue for a general class of scenario"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.0345","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":""},"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":"1307.0345","created_at":"2026-05-18T02:49:39.006841+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.0345v2","created_at":"2026-05-18T02:49:39.006841+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.0345","created_at":"2026-05-18T02:49:39.006841+00:00"},{"alias_kind":"pith_short_12","alias_value":"F5J5M24YZQYI","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"F5J5M24YZQYITFWQ","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"F5J5M24Y","created_at":"2026-05-18T12:27:43.054852+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F5J5M24YZQYITFWQS7LGDAU3HC","json":"https://pith.science/pith/F5J5M24YZQYITFWQS7LGDAU3HC.json","graph_json":"https://pith.science/api/pith-number/F5J5M24YZQYITFWQS7LGDAU3HC/graph.json","events_json":"https://pith.science/api/pith-number/F5J5M24YZQYITFWQS7LGDAU3HC/events.json","paper":"https://pith.science/paper/F5J5M24Y"},"agent_actions":{"view_html":"https://pith.science/pith/F5J5M24YZQYITFWQS7LGDAU3HC","download_json":"https://pith.science/pith/F5J5M24YZQYITFWQS7LGDAU3HC.json","view_paper":"https://pith.science/paper/F5J5M24Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.0345&json=true","fetch_graph":"https://pith.science/api/pith-number/F5J5M24YZQYITFWQS7LGDAU3HC/graph.json","fetch_events":"https://pith.science/api/pith-number/F5J5M24YZQYITFWQS7LGDAU3HC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F5J5M24YZQYITFWQS7LGDAU3HC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F5J5M24YZQYITFWQS7LGDAU3HC/action/storage_attestation","attest_author":"https://pith.science/pith/F5J5M24YZQYITFWQS7LGDAU3HC/action/author_attestation","sign_citation":"https://pith.science/pith/F5J5M24YZQYITFWQS7LGDAU3HC/action/citation_signature","submit_replication":"https://pith.science/pith/F5J5M24YZQYITFWQS7LGDAU3HC/action/replication_record"}},"created_at":"2026-05-18T02:49:39.006841+00:00","updated_at":"2026-05-18T02:49:39.006841+00:00"}