{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:WQJJ55INO7NOTT3WMNDQUBH7WG","short_pith_number":"pith:WQJJ55IN","schema_version":"1.0","canonical_sha256":"b4129ef50d77dae9cf7663470a04ffb1b41b3f1f0f88354b66aea923371ba04e","source":{"kind":"arxiv","id":"1504.00076","version":2},"attestation_state":"computed","paper":{"title":"Beyond Chance-Constrained Convex Mixed-Integer Optimization: A Generalized Calafiore-Campi Algorithm and the notion of $S$-optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.OC"],"primary_cat":"math.MG","authors_text":"D. Oliveros, E. Rold\\'an-Pensado, J. A. De Loera, R. N. La Haye","submitted_at":"2015-04-01T01:15:19Z","abstract_excerpt":"The scenario approach developed by Calafiore and Campi to attack chance-constrained convex programs utilizes random sampling on the uncertainty parameter to substitute the original problem with a representative continuous convex optimization with $N$ convex constraints which is a relaxation of the original. Calafiore and Campi provided an explicit estimate on the size $N$ of the sampling relaxation to yield high-likelihood feasible solutions of the chance-constrained problem. They measured the probability of the original constraints to be violated by the random optimal solution from the relaxa"},"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":"1504.00076","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2015-04-01T01:15:19Z","cross_cats_sorted":["math.CO","math.OC"],"title_canon_sha256":"5d118a6196698505d4735fff2fa6861d1d4c5fe7e62be296124bced20860d0a7","abstract_canon_sha256":"48f37a22ba7dd8ab002dc78860ea9209729721673022cd9ed355e1162367ee2e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:54.832372Z","signature_b64":"T1V2Ts4ZxYkpQ3h7FEyxkx57Eh699AoLvVoWpxCq2jmsh8h/v2fE3su4o4Yn5s6CTHZZiAhwuwI9Q7Ry8fHyAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4129ef50d77dae9cf7663470a04ffb1b41b3f1f0f88354b66aea923371ba04e","last_reissued_at":"2026-05-18T01:34:54.831723Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:54.831723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Beyond Chance-Constrained Convex Mixed-Integer Optimization: A Generalized Calafiore-Campi Algorithm and the notion of $S$-optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.OC"],"primary_cat":"math.MG","authors_text":"D. Oliveros, E. Rold\\'an-Pensado, J. A. De Loera, R. N. La Haye","submitted_at":"2015-04-01T01:15:19Z","abstract_excerpt":"The scenario approach developed by Calafiore and Campi to attack chance-constrained convex programs utilizes random sampling on the uncertainty parameter to substitute the original problem with a representative continuous convex optimization with $N$ convex constraints which is a relaxation of the original. Calafiore and Campi provided an explicit estimate on the size $N$ of the sampling relaxation to yield high-likelihood feasible solutions of the chance-constrained problem. They measured the probability of the original constraints to be violated by the random optimal solution from the relaxa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.00076","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":"1504.00076","created_at":"2026-05-18T01:34:54.831822+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.00076v2","created_at":"2026-05-18T01:34:54.831822+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00076","created_at":"2026-05-18T01:34:54.831822+00:00"},{"alias_kind":"pith_short_12","alias_value":"WQJJ55INO7NO","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"WQJJ55INO7NOTT3W","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"WQJJ55IN","created_at":"2026-05-18T12:29:47.479230+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/WQJJ55INO7NOTT3WMNDQUBH7WG","json":"https://pith.science/pith/WQJJ55INO7NOTT3WMNDQUBH7WG.json","graph_json":"https://pith.science/api/pith-number/WQJJ55INO7NOTT3WMNDQUBH7WG/graph.json","events_json":"https://pith.science/api/pith-number/WQJJ55INO7NOTT3WMNDQUBH7WG/events.json","paper":"https://pith.science/paper/WQJJ55IN"},"agent_actions":{"view_html":"https://pith.science/pith/WQJJ55INO7NOTT3WMNDQUBH7WG","download_json":"https://pith.science/pith/WQJJ55INO7NOTT3WMNDQUBH7WG.json","view_paper":"https://pith.science/paper/WQJJ55IN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.00076&json=true","fetch_graph":"https://pith.science/api/pith-number/WQJJ55INO7NOTT3WMNDQUBH7WG/graph.json","fetch_events":"https://pith.science/api/pith-number/WQJJ55INO7NOTT3WMNDQUBH7WG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WQJJ55INO7NOTT3WMNDQUBH7WG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WQJJ55INO7NOTT3WMNDQUBH7WG/action/storage_attestation","attest_author":"https://pith.science/pith/WQJJ55INO7NOTT3WMNDQUBH7WG/action/author_attestation","sign_citation":"https://pith.science/pith/WQJJ55INO7NOTT3WMNDQUBH7WG/action/citation_signature","submit_replication":"https://pith.science/pith/WQJJ55INO7NOTT3WMNDQUBH7WG/action/replication_record"}},"created_at":"2026-05-18T01:34:54.831822+00:00","updated_at":"2026-05-18T01:34:54.831822+00:00"}