{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:R6X3HCA4TUVBDQHIHFXAGVBNRX","short_pith_number":"pith:R6X3HCA4","canonical_record":{"source":{"id":"1304.2222","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-04-08T14:35:18Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"bcbff1bc38d33b22ba0b3559233cf016ef381c4baf5fbe2d66c31656061d7b8c","abstract_canon_sha256":"0cddb98cd0a0fee5215fbae972be023e6951a4044cc13a738b3cdb85465f5a19"},"schema_version":"1.0"},"canonical_sha256":"8fafb3881c9d2a11c0e8396e03542d8dcb77a1a3bc915bdc93f4e7e6bb305dac","source":{"kind":"arxiv","id":"1304.2222","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.2222","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"arxiv_version","alias_value":"1304.2222v3","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.2222","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"pith_short_12","alias_value":"R6X3HCA4TUVB","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"R6X3HCA4TUVBDQHI","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"R6X3HCA4","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:R6X3HCA4TUVBDQHIHFXAGVBNRX","target":"record","payload":{"canonical_record":{"source":{"id":"1304.2222","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-04-08T14:35:18Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"bcbff1bc38d33b22ba0b3559233cf016ef381c4baf5fbe2d66c31656061d7b8c","abstract_canon_sha256":"0cddb98cd0a0fee5215fbae972be023e6951a4044cc13a738b3cdb85465f5a19"},"schema_version":"1.0"},"canonical_sha256":"8fafb3881c9d2a11c0e8396e03542d8dcb77a1a3bc915bdc93f4e7e6bb305dac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:42.523817Z","signature_b64":"GmUkehBclR0vxXFcZVCe5/y6KpPVWrv554E4ugPwqL5ZcLhwIChsYz20O3ln5kO2I1jz78ysZWkuudDuguAJCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8fafb3881c9d2a11c0e8396e03542d8dcb77a1a3bc915bdc93f4e7e6bb305dac","last_reissued_at":"2026-05-18T00:58:42.523372Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:42.523372Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.2222","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-18T00:58:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nfL7tXpyjYXQSPMAJ7GGDoeJWMspe7Z+JICfS59F4i3hdk1awfRvFOE673xJlu+yqmsq+oV8T5XAW7QeqsayAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T18:46:45.673189Z"},"content_sha256":"a98ae30fc49cdbb6f65844a00f7dd9f85f4b783c1f76d0d088aa32e54de992fc","schema_version":"1.0","event_id":"sha256:a98ae30fc49cdbb6f65844a00f7dd9f85f4b783c1f76d0d088aa32e54de992fc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:R6X3HCA4TUVBDQHIHFXAGVBNRX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sequential Randomized Algorithms for Convex Optimization in the Presence of Uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Fabrizio Dabbene, Mohammadreza Chamanbaz, Qing-Guo Wang, Roberto Tempo, Venkatakrishnan Venkataramanan","submitted_at":"2013-04-08T14:35:18Z","abstract_excerpt":"In this paper, we propose new sequential randomized algorithms for convex optimization problems in the presence of uncertainty. A rigorous analysis of the theoretical properties of the solutions obtained by these algorithms, for full constraint satisfaction and partial constraint satisfaction, respectively, is given. The proposed methods allow to enlarge the applicability of the existing randomized methods to real-world applications involving a large number of design variables. Since the proposed approach does not provide a priori bounds on the sample complexity, extensive numerical simulation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.2222","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-18T00:58:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QBVvmhhJVJbwog3AQ5rb2zATJC87Ag5pNyeENimgY3O+Igrqin0XZYZWzR7ityuj3kJVneT7d5OE0XzD2wt7Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T18:46:45.673939Z"},"content_sha256":"94d0a5282a2d98c14feff153e3243c90d82acbc857c45593fb41d38c2b6b7591","schema_version":"1.0","event_id":"sha256:94d0a5282a2d98c14feff153e3243c90d82acbc857c45593fb41d38c2b6b7591"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R6X3HCA4TUVBDQHIHFXAGVBNRX/bundle.json","state_url":"https://pith.science/pith/R6X3HCA4TUVBDQHIHFXAGVBNRX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R6X3HCA4TUVBDQHIHFXAGVBNRX/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-06-11T18:46:45Z","links":{"resolver":"https://pith.science/pith/R6X3HCA4TUVBDQHIHFXAGVBNRX","bundle":"https://pith.science/pith/R6X3HCA4TUVBDQHIHFXAGVBNRX/bundle.json","state":"https://pith.science/pith/R6X3HCA4TUVBDQHIHFXAGVBNRX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R6X3HCA4TUVBDQHIHFXAGVBNRX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:R6X3HCA4TUVBDQHIHFXAGVBNRX","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":"0cddb98cd0a0fee5215fbae972be023e6951a4044cc13a738b3cdb85465f5a19","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-04-08T14:35:18Z","title_canon_sha256":"bcbff1bc38d33b22ba0b3559233cf016ef381c4baf5fbe2d66c31656061d7b8c"},"schema_version":"1.0","source":{"id":"1304.2222","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.2222","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"arxiv_version","alias_value":"1304.2222v3","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.2222","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"pith_short_12","alias_value":"R6X3HCA4TUVB","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"R6X3HCA4TUVBDQHI","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"R6X3HCA4","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:94d0a5282a2d98c14feff153e3243c90d82acbc857c45593fb41d38c2b6b7591","target":"graph","created_at":"2026-05-18T00:58:42Z","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, we propose new sequential randomized algorithms for convex optimization problems in the presence of uncertainty. A rigorous analysis of the theoretical properties of the solutions obtained by these algorithms, for full constraint satisfaction and partial constraint satisfaction, respectively, is given. The proposed methods allow to enlarge the applicability of the existing randomized methods to real-world applications involving a large number of design variables. Since the proposed approach does not provide a priori bounds on the sample complexity, extensive numerical simulation","authors_text":"Fabrizio Dabbene, Mohammadreza Chamanbaz, Qing-Guo Wang, Roberto Tempo, Venkatakrishnan Venkataramanan","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-04-08T14:35:18Z","title":"Sequential Randomized Algorithms for Convex Optimization in the Presence of Uncertainty"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.2222","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:a98ae30fc49cdbb6f65844a00f7dd9f85f4b783c1f76d0d088aa32e54de992fc","target":"record","created_at":"2026-05-18T00:58:42Z","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":"0cddb98cd0a0fee5215fbae972be023e6951a4044cc13a738b3cdb85465f5a19","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-04-08T14:35:18Z","title_canon_sha256":"bcbff1bc38d33b22ba0b3559233cf016ef381c4baf5fbe2d66c31656061d7b8c"},"schema_version":"1.0","source":{"id":"1304.2222","kind":"arxiv","version":3}},"canonical_sha256":"8fafb3881c9d2a11c0e8396e03542d8dcb77a1a3bc915bdc93f4e7e6bb305dac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8fafb3881c9d2a11c0e8396e03542d8dcb77a1a3bc915bdc93f4e7e6bb305dac","first_computed_at":"2026-05-18T00:58:42.523372Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:42.523372Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GmUkehBclR0vxXFcZVCe5/y6KpPVWrv554E4ugPwqL5ZcLhwIChsYz20O3ln5kO2I1jz78ysZWkuudDuguAJCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:42.523817Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.2222","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a98ae30fc49cdbb6f65844a00f7dd9f85f4b783c1f76d0d088aa32e54de992fc","sha256:94d0a5282a2d98c14feff153e3243c90d82acbc857c45593fb41d38c2b6b7591"],"state_sha256":"9fa705059b2ce03f27e358b9360d6f467ebc43ddee377575235333b89ecc3dff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DwbuonVJ0eUDWYoH1r3RywdBznnFwPVY8xKCnwp1eGpNl+YPwFOqPd2t1i/8G5grqBwjdgYneI6/xXfyH1f5Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T18:46:45.677989Z","bundle_sha256":"36cc5367a8604b14b6d1cd33652518189e112355dd4c5cd4cd874bc63e6c1bc8"}}