{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BDHLYVZ3TVWUQINJUKOPA37QSY","short_pith_number":"pith:BDHLYVZ3","schema_version":"1.0","canonical_sha256":"08cebc573b9d6d4821a9a29cf06ff096094a8e5683839b60e130113a01d9ad4f","source":{"kind":"arxiv","id":"1711.03747","version":3},"attestation_state":"computed","paper":{"title":"Chance-constrained optimization with tight confidence bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Mark Cannon","submitted_at":"2017-11-10T09:53:50Z","abstract_excerpt":"Convex sample approximations of chance-constrained optimization problems are considered, in which chance constraints are replaced by sets of sampled constraints. We propose a randomized sample selection strategy that allows tight bounds to be derived on the probability that the solution of the sample approximation is feasible for the original chance constraints when a subset of the sampled constraints is discarded. These confidence bounds are shown to be tighter than the bounds that apply if constraints are discarded according to optimal or greedy discarding strategies. We further show that th"},"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":"1711.03747","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-10T09:53:50Z","cross_cats_sorted":[],"title_canon_sha256":"0d44166bbd6939e766c581d8f6b083f9fff2a39f27ce0bfd866d45603dfabcc8","abstract_canon_sha256":"9c5b52262ba0bc87da79a94310bfb14f93159c17123740a0746e64e56477e9e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:37.059654Z","signature_b64":"WRnlDFmUPi5fKk+Z72Wopcnymg/uc3Yh1PVTDzO6CJIc9zlPg9LWqHspLm7F614q8/DyJmWe9FIXzJZ8B0Y0Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08cebc573b9d6d4821a9a29cf06ff096094a8e5683839b60e130113a01d9ad4f","last_reissued_at":"2026-05-18T00:15:37.059119Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:37.059119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Chance-constrained optimization with tight confidence bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Mark Cannon","submitted_at":"2017-11-10T09:53:50Z","abstract_excerpt":"Convex sample approximations of chance-constrained optimization problems are considered, in which chance constraints are replaced by sets of sampled constraints. We propose a randomized sample selection strategy that allows tight bounds to be derived on the probability that the solution of the sample approximation is feasible for the original chance constraints when a subset of the sampled constraints is discarded. These confidence bounds are shown to be tighter than the bounds that apply if constraints are discarded according to optimal or greedy discarding strategies. We further show that th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03747","kind":"arxiv","version":3},"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":"1711.03747","created_at":"2026-05-18T00:15:37.059205+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.03747v3","created_at":"2026-05-18T00:15:37.059205+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03747","created_at":"2026-05-18T00:15:37.059205+00:00"},{"alias_kind":"pith_short_12","alias_value":"BDHLYVZ3TVWU","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BDHLYVZ3TVWUQINJ","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BDHLYVZ3","created_at":"2026-05-18T12:31:08.081275+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/BDHLYVZ3TVWUQINJUKOPA37QSY","json":"https://pith.science/pith/BDHLYVZ3TVWUQINJUKOPA37QSY.json","graph_json":"https://pith.science/api/pith-number/BDHLYVZ3TVWUQINJUKOPA37QSY/graph.json","events_json":"https://pith.science/api/pith-number/BDHLYVZ3TVWUQINJUKOPA37QSY/events.json","paper":"https://pith.science/paper/BDHLYVZ3"},"agent_actions":{"view_html":"https://pith.science/pith/BDHLYVZ3TVWUQINJUKOPA37QSY","download_json":"https://pith.science/pith/BDHLYVZ3TVWUQINJUKOPA37QSY.json","view_paper":"https://pith.science/paper/BDHLYVZ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.03747&json=true","fetch_graph":"https://pith.science/api/pith-number/BDHLYVZ3TVWUQINJUKOPA37QSY/graph.json","fetch_events":"https://pith.science/api/pith-number/BDHLYVZ3TVWUQINJUKOPA37QSY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BDHLYVZ3TVWUQINJUKOPA37QSY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BDHLYVZ3TVWUQINJUKOPA37QSY/action/storage_attestation","attest_author":"https://pith.science/pith/BDHLYVZ3TVWUQINJUKOPA37QSY/action/author_attestation","sign_citation":"https://pith.science/pith/BDHLYVZ3TVWUQINJUKOPA37QSY/action/citation_signature","submit_replication":"https://pith.science/pith/BDHLYVZ3TVWUQINJUKOPA37QSY/action/replication_record"}},"created_at":"2026-05-18T00:15:37.059205+00:00","updated_at":"2026-05-18T00:15:37.059205+00:00"}