{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7AKY3YWA4FNDQ4EISVIU7Y54O3","short_pith_number":"pith:7AKY3YWA","schema_version":"1.0","canonical_sha256":"f8158de2c0e15a38708895514fe3bc76e7cc91c1b13323cb17608640c5e1a397","source":{"kind":"arxiv","id":"1703.03749","version":2},"attestation_state":"computed","paper":{"title":"Representation of chance-constraints with strong asymptotic guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"IMT), Jean-Bernard Lasserre (LAAS-MAC","submitted_at":"2017-03-10T16:26:38Z","abstract_excerpt":"Given $\\epsilon \\in (0,1)$, a probability measure $\\mu$ on $\\Omega\\subset\\mathbb{R}^p$ and a semi-algebraic set\n$K\\subset X\\times\\Omega$, we consider the feasible set $X^*_\\epsilon=\\{x\\in X:{\\rm Prob}[(x,\\omega)\\in K]\\geq 1-\\epsilon\\}$ associated with  a chance-constraint. We provide a sequence of outer approximations $X^d_\\epsilon=\\{x\\in X: h_d(x)\\geq0\\}$, $d\\in\\mathbb{N}$,  where $h_d$ is a polynomial of degree $d$ whose vector of coefficients is an optimal solution of a semidefinite program. The size of the latter increases with the degree $d$. We also obtain the strong and highly desirable"},"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":"1703.03749","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-03-10T16:26:38Z","cross_cats_sorted":[],"title_canon_sha256":"291c76b33dcbe96fe48fb111ef8ad6a5478dfd9bf8e2afe7d79084e1fc3f7eb7","abstract_canon_sha256":"8cd25b4c79b647611c52885f876f93180209e329caabd8677bcb32c871622103"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:23.309116Z","signature_b64":"XhVfHEijFrXaMldbF/eKXeNJ1w3cvEGG4kaEHXBD3nqTiV7vqgoqilX2Eroeamcs7AxC66UOYpe66uxZTU9JAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8158de2c0e15a38708895514fe3bc76e7cc91c1b13323cb17608640c5e1a397","last_reissued_at":"2026-05-18T00:44:23.308665Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:23.308665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Representation of chance-constraints with strong asymptotic guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"IMT), Jean-Bernard Lasserre (LAAS-MAC","submitted_at":"2017-03-10T16:26:38Z","abstract_excerpt":"Given $\\epsilon \\in (0,1)$, a probability measure $\\mu$ on $\\Omega\\subset\\mathbb{R}^p$ and a semi-algebraic set\n$K\\subset X\\times\\Omega$, we consider the feasible set $X^*_\\epsilon=\\{x\\in X:{\\rm Prob}[(x,\\omega)\\in K]\\geq 1-\\epsilon\\}$ associated with  a chance-constraint. We provide a sequence of outer approximations $X^d_\\epsilon=\\{x\\in X: h_d(x)\\geq0\\}$, $d\\in\\mathbb{N}$,  where $h_d$ is a polynomial of degree $d$ whose vector of coefficients is an optimal solution of a semidefinite program. The size of the latter increases with the degree $d$. We also obtain the strong and highly desirable"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.03749","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":"1703.03749","created_at":"2026-05-18T00:44:23.308742+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.03749v2","created_at":"2026-05-18T00:44:23.308742+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.03749","created_at":"2026-05-18T00:44:23.308742+00:00"},{"alias_kind":"pith_short_12","alias_value":"7AKY3YWA4FND","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"7AKY3YWA4FNDQ4EI","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"7AKY3YWA","created_at":"2026-05-18T12:31:03.183658+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/7AKY3YWA4FNDQ4EISVIU7Y54O3","json":"https://pith.science/pith/7AKY3YWA4FNDQ4EISVIU7Y54O3.json","graph_json":"https://pith.science/api/pith-number/7AKY3YWA4FNDQ4EISVIU7Y54O3/graph.json","events_json":"https://pith.science/api/pith-number/7AKY3YWA4FNDQ4EISVIU7Y54O3/events.json","paper":"https://pith.science/paper/7AKY3YWA"},"agent_actions":{"view_html":"https://pith.science/pith/7AKY3YWA4FNDQ4EISVIU7Y54O3","download_json":"https://pith.science/pith/7AKY3YWA4FNDQ4EISVIU7Y54O3.json","view_paper":"https://pith.science/paper/7AKY3YWA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.03749&json=true","fetch_graph":"https://pith.science/api/pith-number/7AKY3YWA4FNDQ4EISVIU7Y54O3/graph.json","fetch_events":"https://pith.science/api/pith-number/7AKY3YWA4FNDQ4EISVIU7Y54O3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7AKY3YWA4FNDQ4EISVIU7Y54O3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7AKY3YWA4FNDQ4EISVIU7Y54O3/action/storage_attestation","attest_author":"https://pith.science/pith/7AKY3YWA4FNDQ4EISVIU7Y54O3/action/author_attestation","sign_citation":"https://pith.science/pith/7AKY3YWA4FNDQ4EISVIU7Y54O3/action/citation_signature","submit_replication":"https://pith.science/pith/7AKY3YWA4FNDQ4EISVIU7Y54O3/action/replication_record"}},"created_at":"2026-05-18T00:44:23.308742+00:00","updated_at":"2026-05-18T00:44:23.308742+00:00"}