{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:XUHB4FTHICZED4RTFDFQTP34ZB","short_pith_number":"pith:XUHB4FTH","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"},"canonical_sha256":"bd0e1e166740b241f23328cb09bf7cc846db46a574839d88fa5c25c2bf944ba4","source":{"kind":"arxiv","id":"1903.00643","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.00643","created_at":"2026-05-17T23:52:13Z"},{"alias_kind":"arxiv_version","alias_value":"1903.00643v1","created_at":"2026-05-17T23:52:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.00643","created_at":"2026-05-17T23:52:13Z"},{"alias_kind":"pith_short_12","alias_value":"XUHB4FTHICZE","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"XUHB4FTHICZED4RT","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"XUHB4FTH","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:XUHB4FTHICZED4RTFDFQTP34ZB","target":"record","payload":{"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"},"canonical_sha256":"bd0e1e166740b241f23328cb09bf7cc846db46a574839d88fa5c25c2bf944ba4","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"},"source_kind":"arxiv","source_id":"1903.00643","source_version":1,"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-17T23:52:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QLtOnsIDRV8mL27VLsfeQyjT3IZ8Nzrec3xgfCUzxflAskOwuRhOVCV+ZjzCVBC+u9C487lhhpkSn9Nr8Vz9DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T02:58:44.629115Z"},"content_sha256":"9e7dd0b7cf2f21be3f4d88eae76e27f90c19e3b811dcf1b72d1bfdb737417997","schema_version":"1.0","event_id":"sha256:9e7dd0b7cf2f21be3f4d88eae76e27f90c19e3b811dcf1b72d1bfdb737417997"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:XUHB4FTHICZED4RTFDFQTP34ZB","target":"graph","payload":{"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"},"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-17T23:52:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WgxhxgF2p4JBtuEQ8HmQNTjtZBGkv4GyR00mT1accetx5v5g8DYNA6cso0i+neb2xIkNTiJTc1wbByJqYDwUAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T02:58:44.629841Z"},"content_sha256":"741075e066c9f8846cfb015267e8d057cce792a6963a340d0bfff43bd22fa5f8","schema_version":"1.0","event_id":"sha256:741075e066c9f8846cfb015267e8d057cce792a6963a340d0bfff43bd22fa5f8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XUHB4FTHICZED4RTFDFQTP34ZB/bundle.json","state_url":"https://pith.science/pith/XUHB4FTHICZED4RTFDFQTP34ZB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XUHB4FTHICZED4RTFDFQTP34ZB/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-23T02:58:44Z","links":{"resolver":"https://pith.science/pith/XUHB4FTHICZED4RTFDFQTP34ZB","bundle":"https://pith.science/pith/XUHB4FTHICZED4RTFDFQTP34ZB/bundle.json","state":"https://pith.science/pith/XUHB4FTHICZED4RTFDFQTP34ZB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XUHB4FTHICZED4RTFDFQTP34ZB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:XUHB4FTHICZED4RTFDFQTP34ZB","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":"6252b33174a705ab48f1cf594042927f25e5c9d1333b8f739da0d1a89a783a23","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-02T07:19:04Z","title_canon_sha256":"9d66f263a0f986ec630a081737c596070944fb562b0dc0546d01497687b1c6c6"},"schema_version":"1.0","source":{"id":"1903.00643","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.00643","created_at":"2026-05-17T23:52:13Z"},{"alias_kind":"arxiv_version","alias_value":"1903.00643v1","created_at":"2026-05-17T23:52:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.00643","created_at":"2026-05-17T23:52:13Z"},{"alias_kind":"pith_short_12","alias_value":"XUHB4FTHICZE","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"XUHB4FTHICZED4RT","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"XUHB4FTH","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:741075e066c9f8846cfb015267e8d057cce792a6963a340d0bfff43bd22fa5f8","target":"graph","created_at":"2026-05-17T23:52:13Z","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 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","authors_text":"Anouck Girard, Ilya Kolmanovsky, Nan Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-02T07:19:04Z","title":"An analytical safe approximation to joint chance-constrained programming with additive Gaussian noises"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.00643","kind":"arxiv","version":1},"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:9e7dd0b7cf2f21be3f4d88eae76e27f90c19e3b811dcf1b72d1bfdb737417997","target":"record","created_at":"2026-05-17T23:52:13Z","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":"6252b33174a705ab48f1cf594042927f25e5c9d1333b8f739da0d1a89a783a23","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-02T07:19:04Z","title_canon_sha256":"9d66f263a0f986ec630a081737c596070944fb562b0dc0546d01497687b1c6c6"},"schema_version":"1.0","source":{"id":"1903.00643","kind":"arxiv","version":1}},"canonical_sha256":"bd0e1e166740b241f23328cb09bf7cc846db46a574839d88fa5c25c2bf944ba4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bd0e1e166740b241f23328cb09bf7cc846db46a574839d88fa5c25c2bf944ba4","first_computed_at":"2026-05-17T23:52:13.903848Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:13.903848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k3m1bOImEhHJw5+IjqpA0A6kKLVSFNgKRzqHJZPcpd2A8zijDmYWvNuqUDmZqVg9lHL5QM1Y5478ppvwYlOgBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:13.904632Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.00643","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9e7dd0b7cf2f21be3f4d88eae76e27f90c19e3b811dcf1b72d1bfdb737417997","sha256:741075e066c9f8846cfb015267e8d057cce792a6963a340d0bfff43bd22fa5f8"],"state_sha256":"539a6402dfa5248d99c95f6e2ff01b1bb52b7af78e10f3c9aa463b2c3aa78a34"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kQOouS9MPBVDmv741Ac+k2tVQll1AeaPxG/9CQNYdu8i0yr4f4uLRyuMIjHIN6GVA/EQqZ92SBvhM0+l51RYDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T02:58:44.633610Z","bundle_sha256":"fee7f3e86c33fd0c92e45ea39d6f992ab95b46502ea13eda4ec8a380ba947d78"}}