{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:XUHB4FTHICZED4RTFDFQTP34ZB","short_pith_number":"pith:XUHB4FTH","schema_version":"1.0","canonical_sha256":"bd0e1e166740b241f23328cb09bf7cc846db46a574839d88fa5c25c2bf944ba4","source":{"kind":"arxiv","id":"1903.00643","version":1},"attestation_state":"computed","paper":{"title":"An analytical safe approximation to joint chance-constrained programming with additive Gaussian noises","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anouck Girard, Ilya Kolmanovsky, Nan Li","submitted_at":"2019-03-02T07:19:04Z","abstract_excerpt":"We propose a safe approximation to joint chance-constrained programming where the constraint functions are additively dependent on a normally-distributed random vector. The approximation is analytical, meaning that it requires neither numerical integrations nor sampling-based probability approximations. Under mild assumptions, the approximation is a standard nonlinear program. We compare this new safe approximation to another analytical safe approximation for joint chance-constrained programming based on Boole's inequality through two examples representing the constrained control of linear Gau"},"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":"1903.00643","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-02T07:19:04Z","cross_cats_sorted":[],"title_canon_sha256":"9d66f263a0f986ec630a081737c596070944fb562b0dc0546d01497687b1c6c6","abstract_canon_sha256":"6252b33174a705ab48f1cf594042927f25e5c9d1333b8f739da0d1a89a783a23"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:13.904632Z","signature_b64":"k3m1bOImEhHJw5+IjqpA0A6kKLVSFNgKRzqHJZPcpd2A8zijDmYWvNuqUDmZqVg9lHL5QM1Y5478ppvwYlOgBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd0e1e166740b241f23328cb09bf7cc846db46a574839d88fa5c25c2bf944ba4","last_reissued_at":"2026-05-17T23:52:13.903848Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:13.903848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An analytical safe approximation to joint chance-constrained programming with additive Gaussian noises","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anouck Girard, Ilya Kolmanovsky, Nan Li","submitted_at":"2019-03-02T07:19:04Z","abstract_excerpt":"We propose a safe approximation to joint chance-constrained programming where the constraint functions are additively dependent on a normally-distributed random vector. The approximation is analytical, meaning that it requires neither numerical integrations nor sampling-based probability approximations. Under mild assumptions, the approximation is a standard nonlinear program. We compare this new safe approximation to another analytical safe approximation for joint chance-constrained programming based on Boole's inequality through two examples representing the constrained control of linear Gau"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.00643","kind":"arxiv","version":1},"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":"1903.00643","created_at":"2026-05-17T23:52:13.903963+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.00643v1","created_at":"2026-05-17T23:52:13.903963+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.00643","created_at":"2026-05-17T23:52:13.903963+00:00"},{"alias_kind":"pith_short_12","alias_value":"XUHB4FTHICZE","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"XUHB4FTHICZED4RT","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"XUHB4FTH","created_at":"2026-05-18T12:33:33.725879+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/XUHB4FTHICZED4RTFDFQTP34ZB","json":"https://pith.science/pith/XUHB4FTHICZED4RTFDFQTP34ZB.json","graph_json":"https://pith.science/api/pith-number/XUHB4FTHICZED4RTFDFQTP34ZB/graph.json","events_json":"https://pith.science/api/pith-number/XUHB4FTHICZED4RTFDFQTP34ZB/events.json","paper":"https://pith.science/paper/XUHB4FTH"},"agent_actions":{"view_html":"https://pith.science/pith/XUHB4FTHICZED4RTFDFQTP34ZB","download_json":"https://pith.science/pith/XUHB4FTHICZED4RTFDFQTP34ZB.json","view_paper":"https://pith.science/paper/XUHB4FTH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.00643&json=true","fetch_graph":"https://pith.science/api/pith-number/XUHB4FTHICZED4RTFDFQTP34ZB/graph.json","fetch_events":"https://pith.science/api/pith-number/XUHB4FTHICZED4RTFDFQTP34ZB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XUHB4FTHICZED4RTFDFQTP34ZB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XUHB4FTHICZED4RTFDFQTP34ZB/action/storage_attestation","attest_author":"https://pith.science/pith/XUHB4FTHICZED4RTFDFQTP34ZB/action/author_attestation","sign_citation":"https://pith.science/pith/XUHB4FTHICZED4RTFDFQTP34ZB/action/citation_signature","submit_replication":"https://pith.science/pith/XUHB4FTHICZED4RTFDFQTP34ZB/action/replication_record"}},"created_at":"2026-05-17T23:52:13.903963+00:00","updated_at":"2026-05-17T23:52:13.903963+00:00"}