{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:4HJGUB3WBRUIUBC7COBZYZG3XT","short_pith_number":"pith:4HJGUB3W","canonical_record":{"source":{"id":"1401.2200","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-01-09T23:16:43Z","cross_cats_sorted":[],"title_canon_sha256":"4b781507961b9026f6ffe080e2f0fddfea8553a88bda0f9864116f383f08ec2c","abstract_canon_sha256":"1504c64064f89dc876556aece7bc2a4af374f908aa940ba26699a7b500b35905"},"schema_version":"1.0"},"canonical_sha256":"e1d26a07760c688a045f13839c64dbbcfc20ab49b3eb31b877381d104f60c638","source":{"kind":"arxiv","id":"1401.2200","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.2200","created_at":"2026-05-18T01:56:00Z"},{"alias_kind":"arxiv_version","alias_value":"1401.2200v1","created_at":"2026-05-18T01:56:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2200","created_at":"2026-05-18T01:56:00Z"},{"alias_kind":"pith_short_12","alias_value":"4HJGUB3WBRUI","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4HJGUB3WBRUIUBC7","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4HJGUB3W","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:4HJGUB3WBRUIUBC7COBZYZG3XT","target":"record","payload":{"canonical_record":{"source":{"id":"1401.2200","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-01-09T23:16:43Z","cross_cats_sorted":[],"title_canon_sha256":"4b781507961b9026f6ffe080e2f0fddfea8553a88bda0f9864116f383f08ec2c","abstract_canon_sha256":"1504c64064f89dc876556aece7bc2a4af374f908aa940ba26699a7b500b35905"},"schema_version":"1.0"},"canonical_sha256":"e1d26a07760c688a045f13839c64dbbcfc20ab49b3eb31b877381d104f60c638","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:56:00.048164Z","signature_b64":"3ySPzSFBYlh5PnVXtRc32CbeXsZlNwboI8kgFneRYwhE9CRWPqA1y+Rqc8KJj01ht07wSQbVBokAEbZvxWebCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1d26a07760c688a045f13839c64dbbcfc20ab49b3eb31b877381d104f60c638","last_reissued_at":"2026-05-18T01:56:00.047776Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:56:00.047776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.2200","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-18T01:56:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4ku+M0NKWGbSRzjRPxhlhMc2EcraHrDZh9q0pG6FjorZ6D/Uy6QEH9VnS+uSf8ZYFsMQWU5o71dEyxKeZY1gDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T13:19:30.552692Z"},"content_sha256":"15dff833f7f48aed33a57b8d18b723cf95989d7366acad08e923b35372eb4d58","schema_version":"1.0","event_id":"sha256:15dff833f7f48aed33a57b8d18b723cf95989d7366acad08e923b35372eb4d58"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:4HJGUB3WBRUIUBC7COBZYZG3XT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A scenario approach for non-convex control design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"John Lygeros, Kostas Margellos, Paul Goulart, Sergio Grammatico, Xiaojing Zhang","submitted_at":"2014-01-09T23:16:43Z","abstract_excerpt":"Randomized optimization is an established tool for control design with modulated robustness. While for uncertain convex programs there exist randomized approaches with efficient sampling, this is not the case for non-convex problems. Approaches based on statistical learning theory are applicable to non-convex problems, but they usually are conservative in terms of performance and require high sample complexity to achieve the desired probabilistic guarantees. In this paper, we derive a novel scenario approach for a wide class of random non-convex programs, with a sample complexity similar to th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2200","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-18T01:56:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aZ9piIKcJUsi9GV4R5vlWO3Oiatar8JcifPcJhvCr0NvwxPespQ6sf+9W7ET7blBoHwtc7ARksSSEXQBT2BpDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T13:19:30.553418Z"},"content_sha256":"0ee80caf20d9a41c70362d9b112a26d65ea086445f6549a9b1182677839f95e9","schema_version":"1.0","event_id":"sha256:0ee80caf20d9a41c70362d9b112a26d65ea086445f6549a9b1182677839f95e9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4HJGUB3WBRUIUBC7COBZYZG3XT/bundle.json","state_url":"https://pith.science/pith/4HJGUB3WBRUIUBC7COBZYZG3XT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4HJGUB3WBRUIUBC7COBZYZG3XT/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-23T13:19:30Z","links":{"resolver":"https://pith.science/pith/4HJGUB3WBRUIUBC7COBZYZG3XT","bundle":"https://pith.science/pith/4HJGUB3WBRUIUBC7COBZYZG3XT/bundle.json","state":"https://pith.science/pith/4HJGUB3WBRUIUBC7COBZYZG3XT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4HJGUB3WBRUIUBC7COBZYZG3XT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4HJGUB3WBRUIUBC7COBZYZG3XT","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":"1504c64064f89dc876556aece7bc2a4af374f908aa940ba26699a7b500b35905","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-01-09T23:16:43Z","title_canon_sha256":"4b781507961b9026f6ffe080e2f0fddfea8553a88bda0f9864116f383f08ec2c"},"schema_version":"1.0","source":{"id":"1401.2200","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.2200","created_at":"2026-05-18T01:56:00Z"},{"alias_kind":"arxiv_version","alias_value":"1401.2200v1","created_at":"2026-05-18T01:56:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2200","created_at":"2026-05-18T01:56:00Z"},{"alias_kind":"pith_short_12","alias_value":"4HJGUB3WBRUI","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4HJGUB3WBRUIUBC7","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4HJGUB3W","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:0ee80caf20d9a41c70362d9b112a26d65ea086445f6549a9b1182677839f95e9","target":"graph","created_at":"2026-05-18T01:56:00Z","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":"Randomized optimization is an established tool for control design with modulated robustness. While for uncertain convex programs there exist randomized approaches with efficient sampling, this is not the case for non-convex problems. Approaches based on statistical learning theory are applicable to non-convex problems, but they usually are conservative in terms of performance and require high sample complexity to achieve the desired probabilistic guarantees. In this paper, we derive a novel scenario approach for a wide class of random non-convex programs, with a sample complexity similar to th","authors_text":"John Lygeros, Kostas Margellos, Paul Goulart, Sergio Grammatico, Xiaojing Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-01-09T23:16:43Z","title":"A scenario approach for non-convex control design"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2200","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:15dff833f7f48aed33a57b8d18b723cf95989d7366acad08e923b35372eb4d58","target":"record","created_at":"2026-05-18T01:56:00Z","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":"1504c64064f89dc876556aece7bc2a4af374f908aa940ba26699a7b500b35905","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-01-09T23:16:43Z","title_canon_sha256":"4b781507961b9026f6ffe080e2f0fddfea8553a88bda0f9864116f383f08ec2c"},"schema_version":"1.0","source":{"id":"1401.2200","kind":"arxiv","version":1}},"canonical_sha256":"e1d26a07760c688a045f13839c64dbbcfc20ab49b3eb31b877381d104f60c638","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e1d26a07760c688a045f13839c64dbbcfc20ab49b3eb31b877381d104f60c638","first_computed_at":"2026-05-18T01:56:00.047776Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:56:00.047776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3ySPzSFBYlh5PnVXtRc32CbeXsZlNwboI8kgFneRYwhE9CRWPqA1y+Rqc8KJj01ht07wSQbVBokAEbZvxWebCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:56:00.048164Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.2200","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:15dff833f7f48aed33a57b8d18b723cf95989d7366acad08e923b35372eb4d58","sha256:0ee80caf20d9a41c70362d9b112a26d65ea086445f6549a9b1182677839f95e9"],"state_sha256":"1b07e25e118d121ea43b6034708d55017cec1b3574224d3875bba5fbfd16ee13"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JKpf2mx9t6c940cYaW+eUMsD0RNvHy/AzuIAdZzmqz5yrhHOzeBjX72ktBchyVfWEttoJXDtv4yVpJ7fa1lwDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T13:19:30.557435Z","bundle_sha256":"79734cc1341b31340239a15213f1784118db5cf9fbc1ac391a31fab3d7c8bbb3"}}