{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:F5J5M24YZQYITFWQS7LGDAU3HC","short_pith_number":"pith:F5J5M24Y","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"},"canonical_sha256":"2f53d66b98cc308996d097d661829b3890fe82d7de20e6d78b2a24468cb0b8a0","source":{"kind":"arxiv","id":"1307.0345","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.0345","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"arxiv_version","alias_value":"1307.0345v2","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.0345","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"pith_short_12","alias_value":"F5J5M24YZQYI","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"F5J5M24YZQYITFWQ","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"F5J5M24Y","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:F5J5M24YZQYITFWQS7LGDAU3HC","target":"record","payload":{"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"},"canonical_sha256":"2f53d66b98cc308996d097d661829b3890fe82d7de20e6d78b2a24468cb0b8a0","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"},"source_kind":"arxiv","source_id":"1307.0345","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:49:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tcbi4nZMvvKhPriMbEeuRWh3PeXYsSePTYcO+AWy07FkF2GZtTTJ0NBqTZG545+uZNnUtmrQ9J54L/rXLKsJDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:45:20.902032Z"},"content_sha256":"bd1e8118dd8d465f7af161f956ae54d8c8e57c8c4cd3e9e81979fd7faf404485","schema_version":"1.0","event_id":"sha256:bd1e8118dd8d465f7af161f956ae54d8c8e57c8c4cd3e9e81979fd7faf404485"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:F5J5M24YZQYITFWQS7LGDAU3HC","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:49:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0v6viMyyIl9PUaVRRCp4dGw3TQI8hK3YL/d4fMccrpuGzGGN6AxHUnm7sT8yqmj0lcWiVFfDqTKl0xlNC4qKCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:45:20.902401Z"},"content_sha256":"5341e5490807469d37ccec31c080abdb2ec6c924ef5a12565919cdc1d580d4a6","schema_version":"1.0","event_id":"sha256:5341e5490807469d37ccec31c080abdb2ec6c924ef5a12565919cdc1d580d4a6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F5J5M24YZQYITFWQS7LGDAU3HC/bundle.json","state_url":"https://pith.science/pith/F5J5M24YZQYITFWQS7LGDAU3HC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F5J5M24YZQYITFWQS7LGDAU3HC/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T07:45:20Z","links":{"resolver":"https://pith.science/pith/F5J5M24YZQYITFWQS7LGDAU3HC","bundle":"https://pith.science/pith/F5J5M24YZQYITFWQS7LGDAU3HC/bundle.json","state":"https://pith.science/pith/F5J5M24YZQYITFWQS7LGDAU3HC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F5J5M24YZQYITFWQS7LGDAU3HC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:F5J5M24YZQYITFWQS7LGDAU3HC","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"9eec82d0d34fcbf0cd5b0feda7c850e299f3feffa89d02a4a2490bb70a8517e3","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-07-01T12:30:58Z","title_canon_sha256":"648e747783dd249fbbe572a6a2d75b918d3ea348c9463eab46b10df47fbe2c07"},"schema_version":"1.0","source":{"id":"1307.0345","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.0345","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"arxiv_version","alias_value":"1307.0345v2","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.0345","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"pith_short_12","alias_value":"F5J5M24YZQYI","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"F5J5M24YZQYITFWQ","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"F5J5M24Y","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:5341e5490807469d37ccec31c080abdb2ec6c924ef5a12565919cdc1d580d4a6","target":"graph","created_at":"2026-05-18T02:49:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"John Lygeros, Peyman Mohajerin Esfahani, Tobias Sutter","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-07-01T12:30:58Z","title":"Performance Bounds for the Scenario Approach and an Extension to a Class of Non-convex Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.0345","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:bd1e8118dd8d465f7af161f956ae54d8c8e57c8c4cd3e9e81979fd7faf404485","target":"record","created_at":"2026-05-18T02:49:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"9eec82d0d34fcbf0cd5b0feda7c850e299f3feffa89d02a4a2490bb70a8517e3","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-07-01T12:30:58Z","title_canon_sha256":"648e747783dd249fbbe572a6a2d75b918d3ea348c9463eab46b10df47fbe2c07"},"schema_version":"1.0","source":{"id":"1307.0345","kind":"arxiv","version":2}},"canonical_sha256":"2f53d66b98cc308996d097d661829b3890fe82d7de20e6d78b2a24468cb0b8a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2f53d66b98cc308996d097d661829b3890fe82d7de20e6d78b2a24468cb0b8a0","first_computed_at":"2026-05-18T02:49:39.006790Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:39.006790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ev3VwQkVOeFbLNS+Vsx3XW6ddtRtdI3mwhvLomoUlLZyU1qCR/Mvj+PiJSxsrQbIvdw3UyQfeDPdNqtEec51AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:39.007121Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.0345","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd1e8118dd8d465f7af161f956ae54d8c8e57c8c4cd3e9e81979fd7faf404485","sha256:5341e5490807469d37ccec31c080abdb2ec6c924ef5a12565919cdc1d580d4a6"],"state_sha256":"6b61c2be4f8d6d18c25755fd52428725cd770a63bdefcb8ef2bb641b81cc5a0f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QAQUMU7J4uBWTlLIdvvTAYJvhKXqaS+hij1/7KPpYZvh06uHcPp/RGgJOtMQxGC3/oYkk6ytnz7PiQVnQFGEDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:45:20.904428Z","bundle_sha256":"f936751651912b21f67fde3060a516da9da9ad26d1eb6c03c3e364a704b4bd96"}}