{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:TJICWVGLYJSRX5BFVLHXVKHK4P","short_pith_number":"pith:TJICWVGL","canonical_record":{"source":{"id":"1402.6382","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-02-26T00:21:16Z","cross_cats_sorted":[],"title_canon_sha256":"d3fdf6883313d0541f6f000accbbaa9c618fe87179702d4fbc8f75033fa5e728","abstract_canon_sha256":"627b6ff03faa8747bbec853e3370bf0923673c131c0c71005bf41c6af1012a79"},"schema_version":"1.0"},"canonical_sha256":"9a502b54cbc2651bf425aacf7aa8eae3d9651640279ac33f035fd66cbbd46a8c","source":{"kind":"arxiv","id":"1402.6382","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.6382","created_at":"2026-05-18T02:16:21Z"},{"alias_kind":"arxiv_version","alias_value":"1402.6382v3","created_at":"2026-05-18T02:16:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.6382","created_at":"2026-05-18T02:16:21Z"},{"alias_kind":"pith_short_12","alias_value":"TJICWVGLYJSR","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TJICWVGLYJSRX5BF","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TJICWVGL","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:TJICWVGLYJSRX5BFVLHXVKHK4P","target":"record","payload":{"canonical_record":{"source":{"id":"1402.6382","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-02-26T00:21:16Z","cross_cats_sorted":[],"title_canon_sha256":"d3fdf6883313d0541f6f000accbbaa9c618fe87179702d4fbc8f75033fa5e728","abstract_canon_sha256":"627b6ff03faa8747bbec853e3370bf0923673c131c0c71005bf41c6af1012a79"},"schema_version":"1.0"},"canonical_sha256":"9a502b54cbc2651bf425aacf7aa8eae3d9651640279ac33f035fd66cbbd46a8c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:16:21.253391Z","signature_b64":"R9aXTfYId3424ClVSxTtqbfzKA0k+CZArPA8Yhdt5r+ldcWdMW4SBAZgZOzOBtVsXasoqObDXmGIBvA1qtuAAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a502b54cbc2651bf425aacf7aa8eae3d9651640279ac33f035fd66cbbd46a8c","last_reissued_at":"2026-05-18T02:16:21.252686Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:16:21.252686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.6382","source_version":3,"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-18T02:16:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8ynpjBllQ9s+q9BXEaiesI+4DG71+Jq2POAcuNrGH+1I8H8YP82iKYDsl24yGMxHDVc6OczjqUKhCv/BfbDiDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:37:13.182349Z"},"content_sha256":"676bc940749866d3f67c1cd27c2f8f3b07baac8482e8a40650544b387da44fa4","schema_version":"1.0","event_id":"sha256:676bc940749866d3f67c1cd27c2f8f3b07baac8482e8a40650544b387da44fa4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:TJICWVGLYJSRX5BFVLHXVKHK4P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Semidefinite Programming For Chance Constrained Optimization Over Semialgebraic Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ashkan Jasour, Constantino Lagoa, Necdet Serhat Aybat","submitted_at":"2014-02-26T00:21:16Z","abstract_excerpt":"In this paper, \"chance optimization\" problems are introduced, where one aims at maximizing the probability of a set defined by polynomial inequalities. These problems are, in general, nonconvex and computationally hard. With the objective of developing systematic numerical procedures to solve such problems, a sequence of convex relaxations based on the theory of measures and moments is provided, whose sequence of optimal values is shown to converge to the optimal value of the original problem. Indeed, we provide a sequence of semidefinite programs of increasing dimension which can arbitrarily "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.6382","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"},"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-18T02:16:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T/SpUdP++j1/WvoHBlOE+1qAwugGBICXURFmfhJ0FztjYhb0hogpcBpuwjCHOXtiRD6OvwR59/KmjyPpMscUAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:37:13.183014Z"},"content_sha256":"e5a8e4d9ffcbeafa1b32d28379f70ea29db704a5029d591e02c528e5134f9976","schema_version":"1.0","event_id":"sha256:e5a8e4d9ffcbeafa1b32d28379f70ea29db704a5029d591e02c528e5134f9976"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TJICWVGLYJSRX5BFVLHXVKHK4P/bundle.json","state_url":"https://pith.science/pith/TJICWVGLYJSRX5BFVLHXVKHK4P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TJICWVGLYJSRX5BFVLHXVKHK4P/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-31T00:37:13Z","links":{"resolver":"https://pith.science/pith/TJICWVGLYJSRX5BFVLHXVKHK4P","bundle":"https://pith.science/pith/TJICWVGLYJSRX5BFVLHXVKHK4P/bundle.json","state":"https://pith.science/pith/TJICWVGLYJSRX5BFVLHXVKHK4P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TJICWVGLYJSRX5BFVLHXVKHK4P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:TJICWVGLYJSRX5BFVLHXVKHK4P","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":"627b6ff03faa8747bbec853e3370bf0923673c131c0c71005bf41c6af1012a79","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-02-26T00:21:16Z","title_canon_sha256":"d3fdf6883313d0541f6f000accbbaa9c618fe87179702d4fbc8f75033fa5e728"},"schema_version":"1.0","source":{"id":"1402.6382","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.6382","created_at":"2026-05-18T02:16:21Z"},{"alias_kind":"arxiv_version","alias_value":"1402.6382v3","created_at":"2026-05-18T02:16:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.6382","created_at":"2026-05-18T02:16:21Z"},{"alias_kind":"pith_short_12","alias_value":"TJICWVGLYJSR","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TJICWVGLYJSRX5BF","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TJICWVGL","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:e5a8e4d9ffcbeafa1b32d28379f70ea29db704a5029d591e02c528e5134f9976","target":"graph","created_at":"2026-05-18T02:16:21Z","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":"In this paper, \"chance optimization\" problems are introduced, where one aims at maximizing the probability of a set defined by polynomial inequalities. These problems are, in general, nonconvex and computationally hard. With the objective of developing systematic numerical procedures to solve such problems, a sequence of convex relaxations based on the theory of measures and moments is provided, whose sequence of optimal values is shown to converge to the optimal value of the original problem. Indeed, we provide a sequence of semidefinite programs of increasing dimension which can arbitrarily ","authors_text":"Ashkan Jasour, Constantino Lagoa, Necdet Serhat Aybat","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-02-26T00:21:16Z","title":"Semidefinite Programming For Chance Constrained Optimization Over Semialgebraic Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.6382","kind":"arxiv","version":3},"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:676bc940749866d3f67c1cd27c2f8f3b07baac8482e8a40650544b387da44fa4","target":"record","created_at":"2026-05-18T02:16:21Z","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":"627b6ff03faa8747bbec853e3370bf0923673c131c0c71005bf41c6af1012a79","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-02-26T00:21:16Z","title_canon_sha256":"d3fdf6883313d0541f6f000accbbaa9c618fe87179702d4fbc8f75033fa5e728"},"schema_version":"1.0","source":{"id":"1402.6382","kind":"arxiv","version":3}},"canonical_sha256":"9a502b54cbc2651bf425aacf7aa8eae3d9651640279ac33f035fd66cbbd46a8c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9a502b54cbc2651bf425aacf7aa8eae3d9651640279ac33f035fd66cbbd46a8c","first_computed_at":"2026-05-18T02:16:21.252686Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:16:21.252686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R9aXTfYId3424ClVSxTtqbfzKA0k+CZArPA8Yhdt5r+ldcWdMW4SBAZgZOzOBtVsXasoqObDXmGIBvA1qtuAAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:16:21.253391Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.6382","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:676bc940749866d3f67c1cd27c2f8f3b07baac8482e8a40650544b387da44fa4","sha256:e5a8e4d9ffcbeafa1b32d28379f70ea29db704a5029d591e02c528e5134f9976"],"state_sha256":"a128a9c528d5ded2258a75ccc2cea13569ccc88c780c6f8387c880523649e2dd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WVBdPlIz1Csk7nK2EUKuRHwfL2KeigkJ68XqkrvOazID492dwWvaf6Wc0KL4y4ifPRczvW11zY2afCE74olwAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T00:37:13.185535Z","bundle_sha256":"14c7082025ed155b3654e95a1d9cd1b3fbcb4fb85261b2d80b2326a5a1ecc927"}}