{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:7U7ZHAQM25MGWMKQDV3N7NCVTQ","short_pith_number":"pith:7U7ZHAQM","canonical_record":{"source":{"id":"1809.09817","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-26T05:36:28Z","cross_cats_sorted":[],"title_canon_sha256":"98fd166c910f10b700e4d59ab8f63fd49b7c45aa6f82d19f4727c583b324b1f5","abstract_canon_sha256":"6d9ca4ffe1f318ea0929c793dc25db8839f2e279e8ba4eb81ea0a429cb443332"},"schema_version":"1.0"},"canonical_sha256":"fd3f93820cd7586b31501d76dfb4559c2ea4ce04affa6f80e81b61e479b3d7ea","source":{"kind":"arxiv","id":"1809.09817","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.09817","created_at":"2026-05-18T00:04:43Z"},{"alias_kind":"arxiv_version","alias_value":"1809.09817v1","created_at":"2026-05-18T00:04:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.09817","created_at":"2026-05-18T00:04:43Z"},{"alias_kind":"pith_short_12","alias_value":"7U7ZHAQM25MG","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7U7ZHAQM25MGWMKQ","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7U7ZHAQM","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:7U7ZHAQM25MGWMKQDV3N7NCVTQ","target":"record","payload":{"canonical_record":{"source":{"id":"1809.09817","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-26T05:36:28Z","cross_cats_sorted":[],"title_canon_sha256":"98fd166c910f10b700e4d59ab8f63fd49b7c45aa6f82d19f4727c583b324b1f5","abstract_canon_sha256":"6d9ca4ffe1f318ea0929c793dc25db8839f2e279e8ba4eb81ea0a429cb443332"},"schema_version":"1.0"},"canonical_sha256":"fd3f93820cd7586b31501d76dfb4559c2ea4ce04affa6f80e81b61e479b3d7ea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:43.571139Z","signature_b64":"zQfmEq0y26kHheHDxxjByJaUKacLOG1K32/p5C/+TIMOeawIg60fPU9scW2X6c7RVh7AlmMWYDgHSvEe5/wxBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd3f93820cd7586b31501d76dfb4559c2ea4ce04affa6f80e81b61e479b3d7ea","last_reissued_at":"2026-05-18T00:04:43.570533Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:43.570533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.09817","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-18T00:04:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ePmeleEoUziY45PktK13hd/QyWXLN86aTnVYtCcw7gE5GZXw5jDrUIctaMhwgaw53KwA7lWLd0MxOLbur8zKDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:05:41.982512Z"},"content_sha256":"5f99d345b41a1f3adc4c6b23c78bd34c1dea571e6946024d63b154ff68956e49","schema_version":"1.0","event_id":"sha256:5f99d345b41a1f3adc4c6b23c78bd34c1dea571e6946024d63b154ff68956e49"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:7U7ZHAQM25MGWMKQDV3N7NCVTQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convex Relaxation of Bilinear Matrix Inequalities Part II: Applications to Optimal Control Synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Fariba Zohrizadeh, Mohsen Kheirandishfard, Muhammad Adil, Ramtin Madani","submitted_at":"2018-09-26T05:36:28Z","abstract_excerpt":"The first part of this paper proposed a family of penalized convex relaxations for solving optimization problems with bilinear matrix inequality (BMI) constraints. In this part, we generalize our approach to a sequential scheme which starts from an arbitrary initial point (feasible or infeasible) and solves a sequence of penalized convex relaxations in order to find feasible and near-optimal solutions for BMI optimization problems. We evaluate the performance of the proposed method on the H2 and Hinfinity optimal controller design problems with both centralized and decentralized structures. Th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.09817","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-18T00:04:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Okh7IiWNWT4KOHvFa356a5WbshAnyxmc3E4f06xjiaXEY0miqT/NkzCOFfs9wo2KNCYgacJH5VwAdK4/+hCVCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:05:41.982851Z"},"content_sha256":"6574f1281ea24ef2fbe1e460bedf7dc7b1049389124d318e78de70fc9f2b7e3b","schema_version":"1.0","event_id":"sha256:6574f1281ea24ef2fbe1e460bedf7dc7b1049389124d318e78de70fc9f2b7e3b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7U7ZHAQM25MGWMKQDV3N7NCVTQ/bundle.json","state_url":"https://pith.science/pith/7U7ZHAQM25MGWMKQDV3N7NCVTQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7U7ZHAQM25MGWMKQDV3N7NCVTQ/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-02T02:05:41Z","links":{"resolver":"https://pith.science/pith/7U7ZHAQM25MGWMKQDV3N7NCVTQ","bundle":"https://pith.science/pith/7U7ZHAQM25MGWMKQDV3N7NCVTQ/bundle.json","state":"https://pith.science/pith/7U7ZHAQM25MGWMKQDV3N7NCVTQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7U7ZHAQM25MGWMKQDV3N7NCVTQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:7U7ZHAQM25MGWMKQDV3N7NCVTQ","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":"6d9ca4ffe1f318ea0929c793dc25db8839f2e279e8ba4eb81ea0a429cb443332","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-26T05:36:28Z","title_canon_sha256":"98fd166c910f10b700e4d59ab8f63fd49b7c45aa6f82d19f4727c583b324b1f5"},"schema_version":"1.0","source":{"id":"1809.09817","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.09817","created_at":"2026-05-18T00:04:43Z"},{"alias_kind":"arxiv_version","alias_value":"1809.09817v1","created_at":"2026-05-18T00:04:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.09817","created_at":"2026-05-18T00:04:43Z"},{"alias_kind":"pith_short_12","alias_value":"7U7ZHAQM25MG","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7U7ZHAQM25MGWMKQ","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7U7ZHAQM","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:6574f1281ea24ef2fbe1e460bedf7dc7b1049389124d318e78de70fc9f2b7e3b","target":"graph","created_at":"2026-05-18T00:04:43Z","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":"The first part of this paper proposed a family of penalized convex relaxations for solving optimization problems with bilinear matrix inequality (BMI) constraints. In this part, we generalize our approach to a sequential scheme which starts from an arbitrary initial point (feasible or infeasible) and solves a sequence of penalized convex relaxations in order to find feasible and near-optimal solutions for BMI optimization problems. We evaluate the performance of the proposed method on the H2 and Hinfinity optimal controller design problems with both centralized and decentralized structures. Th","authors_text":"Fariba Zohrizadeh, Mohsen Kheirandishfard, Muhammad Adil, Ramtin Madani","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-26T05:36:28Z","title":"Convex Relaxation of Bilinear Matrix Inequalities Part II: Applications to Optimal Control Synthesis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.09817","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:5f99d345b41a1f3adc4c6b23c78bd34c1dea571e6946024d63b154ff68956e49","target":"record","created_at":"2026-05-18T00:04:43Z","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":"6d9ca4ffe1f318ea0929c793dc25db8839f2e279e8ba4eb81ea0a429cb443332","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-26T05:36:28Z","title_canon_sha256":"98fd166c910f10b700e4d59ab8f63fd49b7c45aa6f82d19f4727c583b324b1f5"},"schema_version":"1.0","source":{"id":"1809.09817","kind":"arxiv","version":1}},"canonical_sha256":"fd3f93820cd7586b31501d76dfb4559c2ea4ce04affa6f80e81b61e479b3d7ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd3f93820cd7586b31501d76dfb4559c2ea4ce04affa6f80e81b61e479b3d7ea","first_computed_at":"2026-05-18T00:04:43.570533Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:43.570533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zQfmEq0y26kHheHDxxjByJaUKacLOG1K32/p5C/+TIMOeawIg60fPU9scW2X6c7RVh7AlmMWYDgHSvEe5/wxBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:43.571139Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.09817","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f99d345b41a1f3adc4c6b23c78bd34c1dea571e6946024d63b154ff68956e49","sha256:6574f1281ea24ef2fbe1e460bedf7dc7b1049389124d318e78de70fc9f2b7e3b"],"state_sha256":"054af98b613e374bc1fe4d933573068bbee5e65bda1f4ee28d41c9a97ea1af1c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"07JJ6ouVW/PcnntM6kTSi2qxeLhd31ucl0ZqSvqG322IR2QoVM5F66IIveaeyEZvQcugKapqUuyDvZwOzItpDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T02:05:41.984692Z","bundle_sha256":"f49c0ac1ea40491655eb5e9226a4199cb9d303990793d269b49634406cce45b9"}}