{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:JHLV4XAGXE2KPBDBGOYJV26VGW","short_pith_number":"pith:JHLV4XAG","canonical_record":{"source":{"id":"1305.4952","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-05-21T20:23:25Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"ae82d13f119a4023022ab2c95ed3f2e56c16cfa8bc35a559f8aca86bbe273753","abstract_canon_sha256":"70f494263a78849314b0dbd5cc7e062a619113e36778467ea422ec90028da373"},"schema_version":"1.0"},"canonical_sha256":"49d75e5c06b934a7846133b09aebd535abea5928411b88574acdae65f803af18","source":{"kind":"arxiv","id":"1305.4952","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.4952","created_at":"2026-05-18T02:00:59Z"},{"alias_kind":"arxiv_version","alias_value":"1305.4952v2","created_at":"2026-05-18T02:00:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4952","created_at":"2026-05-18T02:00:59Z"},{"alias_kind":"pith_short_12","alias_value":"JHLV4XAGXE2K","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JHLV4XAGXE2KPBDB","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JHLV4XAG","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:JHLV4XAGXE2KPBDBGOYJV26VGW","target":"record","payload":{"canonical_record":{"source":{"id":"1305.4952","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-05-21T20:23:25Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"ae82d13f119a4023022ab2c95ed3f2e56c16cfa8bc35a559f8aca86bbe273753","abstract_canon_sha256":"70f494263a78849314b0dbd5cc7e062a619113e36778467ea422ec90028da373"},"schema_version":"1.0"},"canonical_sha256":"49d75e5c06b934a7846133b09aebd535abea5928411b88574acdae65f803af18","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:00:59.240533Z","signature_b64":"JZfvZ7GST6n38MAo2kYiqC7jn0SQioJGdG8NWyPVtuwBpDXFVFTmg6DWeCZin8S9Fp19/Ua0NVo4qGsN4TYtDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49d75e5c06b934a7846133b09aebd535abea5928411b88574acdae65f803af18","last_reissued_at":"2026-05-18T02:00:59.240037Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:00:59.240037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.4952","source_version":2,"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:00:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wnRfO1TnqcXYaNK4yMk3uRYyUtNLY6ARVU0td3W2UXVHhGCRKKO1aqlAtm6xBppn5XkQo0LWPpqBXXBYlwjkDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:12:10.383438Z"},"content_sha256":"61cc5ba1cbf61a0441a6771a8b85ea9462bde420fd487c462b6422d9271fb0c6","schema_version":"1.0","event_id":"sha256:61cc5ba1cbf61a0441a6771a8b85ea9462bde420fd487c462b6422d9271fb0c6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:JHLV4XAGXE2KPBDBGOYJV26VGW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Statistical Learning Theory Approach for Uncertain Linear and Bilinear Matrix Inequalities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Fabrizio Dabbene, Mohammadreza Chamanbaz, Qing-Guo Wang, Roberto Tempo, Venkatakrishnan Venkataramanan","submitted_at":"2013-05-21T20:23:25Z","abstract_excerpt":"In this paper, we consider the problem of minimizing a linear functional subject to uncertain linear and bilinear matrix inequalities, which depend in a possibly nonlinear way on a vector of uncertain parameters. Motivated by recent results in statistical learning theory, we show that probabilistic guaranteed solutions can be obtained by means of randomized algorithms. In particular, we show that the Vapnik-Chervonenkis dimension (VC-dimension) of the two problems is finite, and we compute upper bounds on it. In turn, these bounds allow us to derive explicitly the sample complexity of these pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.4952","kind":"arxiv","version":2},"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:00:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vKd/ISdQnpx/ypBQyRcr5ilVSt+mnhA8ABJEZKx/0yVOpWKMvFVWHmH6mYhTh1djeUrdXxcoO++VtAnsadfeBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:12:10.383813Z"},"content_sha256":"9475e7635e1dad122fd5ba73b5d2206aa8393426c7a786468c326612081c04aa","schema_version":"1.0","event_id":"sha256:9475e7635e1dad122fd5ba73b5d2206aa8393426c7a786468c326612081c04aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JHLV4XAGXE2KPBDBGOYJV26VGW/bundle.json","state_url":"https://pith.science/pith/JHLV4XAGXE2KPBDBGOYJV26VGW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JHLV4XAGXE2KPBDBGOYJV26VGW/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-04T06:12:10Z","links":{"resolver":"https://pith.science/pith/JHLV4XAGXE2KPBDBGOYJV26VGW","bundle":"https://pith.science/pith/JHLV4XAGXE2KPBDBGOYJV26VGW/bundle.json","state":"https://pith.science/pith/JHLV4XAGXE2KPBDBGOYJV26VGW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JHLV4XAGXE2KPBDBGOYJV26VGW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:JHLV4XAGXE2KPBDBGOYJV26VGW","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":"70f494263a78849314b0dbd5cc7e062a619113e36778467ea422ec90028da373","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-05-21T20:23:25Z","title_canon_sha256":"ae82d13f119a4023022ab2c95ed3f2e56c16cfa8bc35a559f8aca86bbe273753"},"schema_version":"1.0","source":{"id":"1305.4952","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.4952","created_at":"2026-05-18T02:00:59Z"},{"alias_kind":"arxiv_version","alias_value":"1305.4952v2","created_at":"2026-05-18T02:00:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4952","created_at":"2026-05-18T02:00:59Z"},{"alias_kind":"pith_short_12","alias_value":"JHLV4XAGXE2K","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JHLV4XAGXE2KPBDB","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JHLV4XAG","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:9475e7635e1dad122fd5ba73b5d2206aa8393426c7a786468c326612081c04aa","target":"graph","created_at":"2026-05-18T02:00:59Z","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 consider the problem of minimizing a linear functional subject to uncertain linear and bilinear matrix inequalities, which depend in a possibly nonlinear way on a vector of uncertain parameters. Motivated by recent results in statistical learning theory, we show that probabilistic guaranteed solutions can be obtained by means of randomized algorithms. In particular, we show that the Vapnik-Chervonenkis dimension (VC-dimension) of the two problems is finite, and we compute upper bounds on it. In turn, these bounds allow us to derive explicitly the sample complexity of these pr","authors_text":"Fabrizio Dabbene, Mohammadreza Chamanbaz, Qing-Guo Wang, Roberto Tempo, Venkatakrishnan Venkataramanan","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-05-21T20:23:25Z","title":"A Statistical Learning Theory Approach for Uncertain Linear and Bilinear Matrix Inequalities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.4952","kind":"arxiv","version":2},"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:61cc5ba1cbf61a0441a6771a8b85ea9462bde420fd487c462b6422d9271fb0c6","target":"record","created_at":"2026-05-18T02:00:59Z","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":"70f494263a78849314b0dbd5cc7e062a619113e36778467ea422ec90028da373","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-05-21T20:23:25Z","title_canon_sha256":"ae82d13f119a4023022ab2c95ed3f2e56c16cfa8bc35a559f8aca86bbe273753"},"schema_version":"1.0","source":{"id":"1305.4952","kind":"arxiv","version":2}},"canonical_sha256":"49d75e5c06b934a7846133b09aebd535abea5928411b88574acdae65f803af18","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"49d75e5c06b934a7846133b09aebd535abea5928411b88574acdae65f803af18","first_computed_at":"2026-05-18T02:00:59.240037Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:00:59.240037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JZfvZ7GST6n38MAo2kYiqC7jn0SQioJGdG8NWyPVtuwBpDXFVFTmg6DWeCZin8S9Fp19/Ua0NVo4qGsN4TYtDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:00:59.240533Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.4952","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:61cc5ba1cbf61a0441a6771a8b85ea9462bde420fd487c462b6422d9271fb0c6","sha256:9475e7635e1dad122fd5ba73b5d2206aa8393426c7a786468c326612081c04aa"],"state_sha256":"607705393febf0f85be3cff26db4e013a059fecbd986d01e48cc61b57cadc596"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zfxXiHQcyNvPrgYiS9CVoVz5iYpkRg6FFNwgw9d4+1aMGbNy779G+ZY4FAlNByntu2iLMua8xDUZqhPq17lkDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T06:12:10.386004Z","bundle_sha256":"19f31152a19af5725de5086b09821abda358b17c2336a618ce82cc0db98cef8c"}}