{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:D5VR5GYNS7TJKZ2RWQGC47ZIAO","short_pith_number":"pith:D5VR5GYN","canonical_record":{"source":{"id":"1109.3320","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-09-15T11:49:15Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"3cc9219b6031671554f930ec50aae3c2ed01812ac43653594b240e81b4ff6fc2","abstract_canon_sha256":"2b2500de02b7a44a7a9c8880829ffd249b1c09759f56244d1aa30c136c58292b"},"schema_version":"1.0"},"canonical_sha256":"1f6b1e9b0d97e6956751b40c2e7f280388286c956f8b6a1702d14f72b4eeb1ee","source":{"kind":"arxiv","id":"1109.3320","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.3320","created_at":"2026-05-18T04:12:55Z"},{"alias_kind":"arxiv_version","alias_value":"1109.3320v1","created_at":"2026-05-18T04:12:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.3320","created_at":"2026-05-18T04:12:55Z"},{"alias_kind":"pith_short_12","alias_value":"D5VR5GYNS7TJ","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"D5VR5GYNS7TJKZ2R","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"D5VR5GYN","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:D5VR5GYNS7TJKZ2RWQGC47ZIAO","target":"record","payload":{"canonical_record":{"source":{"id":"1109.3320","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-09-15T11:49:15Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"3cc9219b6031671554f930ec50aae3c2ed01812ac43653594b240e81b4ff6fc2","abstract_canon_sha256":"2b2500de02b7a44a7a9c8880829ffd249b1c09759f56244d1aa30c136c58292b"},"schema_version":"1.0"},"canonical_sha256":"1f6b1e9b0d97e6956751b40c2e7f280388286c956f8b6a1702d14f72b4eeb1ee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:55.486626Z","signature_b64":"AJ5Dy0jCqWTcOg5a47f/pdlyAffEkX830ObSft4+mVpYa+HXSsycZrjFZmo+foN9Cd8L9ecswhX9b15HzvAGDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f6b1e9b0d97e6956751b40c2e7f280388286c956f8b6a1702d14f72b4eeb1ee","last_reissued_at":"2026-05-18T04:12:55.485814Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:55.485814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.3320","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-18T04:12:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HSweOFSDILUChn+dMkWV2HIdn5OGMo+JNEz50pR86r43fvx1IxJn/sW/rTUHxMcAuM3x5di5W+7Ejd8oLkopCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:35:14.596160Z"},"content_sha256":"0854a320fc45cab459e5e207b8faaba715955dd679274f16c305658736812fe4","schema_version":"1.0","event_id":"sha256:0854a320fc45cab459e5e207b8faaba715955dd679274f16c305658736812fe4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:D5VR5GYNS7TJKZ2RWQGC47ZIAO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Combining Convex-Concave Decompositions and Linearization Approaches for solving BMIs, with application to Static Output Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Moritz Diehl, Quoc Tran Dinh, Suat Gumussoy, Wim Michiels","submitted_at":"2011-09-15T11:49:15Z","abstract_excerpt":"A novel optimization method is proposed to minimize a convex function subject to bilinear matrix inequality (BMI) constraints. The key idea is to decompose the bilinear mapping as a difference between two positive semidefinite convex mappings. At each iteration of the algorithm the concave part is linearized, leading to a convex subproblem.Applications to various output feedback controller synthesis problems are presented. In these applications the subproblem in each iteration step can be turned into a convex optimization problem with linear matrix inequality (LMI) constraints. The performance"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.3320","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-18T04:12:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DlQKsBjHtocemq27mHSSqVJ9HIih8RzQQ0jlPvYRwuYTTqOM0uRTpSxy5bDKEKmkWXZvV2c7IpcVlEICjnsxCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:35:14.596817Z"},"content_sha256":"30bb812af362c84f15e8388329abcca86090d8786d15f550a08caeb2da55a95a","schema_version":"1.0","event_id":"sha256:30bb812af362c84f15e8388329abcca86090d8786d15f550a08caeb2da55a95a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D5VR5GYNS7TJKZ2RWQGC47ZIAO/bundle.json","state_url":"https://pith.science/pith/D5VR5GYNS7TJKZ2RWQGC47ZIAO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D5VR5GYNS7TJKZ2RWQGC47ZIAO/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-26T22:35:14Z","links":{"resolver":"https://pith.science/pith/D5VR5GYNS7TJKZ2RWQGC47ZIAO","bundle":"https://pith.science/pith/D5VR5GYNS7TJKZ2RWQGC47ZIAO/bundle.json","state":"https://pith.science/pith/D5VR5GYNS7TJKZ2RWQGC47ZIAO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D5VR5GYNS7TJKZ2RWQGC47ZIAO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:D5VR5GYNS7TJKZ2RWQGC47ZIAO","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":"2b2500de02b7a44a7a9c8880829ffd249b1c09759f56244d1aa30c136c58292b","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-09-15T11:49:15Z","title_canon_sha256":"3cc9219b6031671554f930ec50aae3c2ed01812ac43653594b240e81b4ff6fc2"},"schema_version":"1.0","source":{"id":"1109.3320","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.3320","created_at":"2026-05-18T04:12:55Z"},{"alias_kind":"arxiv_version","alias_value":"1109.3320v1","created_at":"2026-05-18T04:12:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.3320","created_at":"2026-05-18T04:12:55Z"},{"alias_kind":"pith_short_12","alias_value":"D5VR5GYNS7TJ","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"D5VR5GYNS7TJKZ2R","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"D5VR5GYN","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:30bb812af362c84f15e8388329abcca86090d8786d15f550a08caeb2da55a95a","target":"graph","created_at":"2026-05-18T04:12:55Z","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":"A novel optimization method is proposed to minimize a convex function subject to bilinear matrix inequality (BMI) constraints. The key idea is to decompose the bilinear mapping as a difference between two positive semidefinite convex mappings. At each iteration of the algorithm the concave part is linearized, leading to a convex subproblem.Applications to various output feedback controller synthesis problems are presented. In these applications the subproblem in each iteration step can be turned into a convex optimization problem with linear matrix inequality (LMI) constraints. The performance","authors_text":"Moritz Diehl, Quoc Tran Dinh, Suat Gumussoy, Wim Michiels","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-09-15T11:49:15Z","title":"Combining Convex-Concave Decompositions and Linearization Approaches for solving BMIs, with application to Static Output Feedback"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.3320","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:0854a320fc45cab459e5e207b8faaba715955dd679274f16c305658736812fe4","target":"record","created_at":"2026-05-18T04:12:55Z","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":"2b2500de02b7a44a7a9c8880829ffd249b1c09759f56244d1aa30c136c58292b","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-09-15T11:49:15Z","title_canon_sha256":"3cc9219b6031671554f930ec50aae3c2ed01812ac43653594b240e81b4ff6fc2"},"schema_version":"1.0","source":{"id":"1109.3320","kind":"arxiv","version":1}},"canonical_sha256":"1f6b1e9b0d97e6956751b40c2e7f280388286c956f8b6a1702d14f72b4eeb1ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1f6b1e9b0d97e6956751b40c2e7f280388286c956f8b6a1702d14f72b4eeb1ee","first_computed_at":"2026-05-18T04:12:55.485814Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:12:55.485814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AJ5Dy0jCqWTcOg5a47f/pdlyAffEkX830ObSft4+mVpYa+HXSsycZrjFZmo+foN9Cd8L9ecswhX9b15HzvAGDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:12:55.486626Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.3320","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0854a320fc45cab459e5e207b8faaba715955dd679274f16c305658736812fe4","sha256:30bb812af362c84f15e8388329abcca86090d8786d15f550a08caeb2da55a95a"],"state_sha256":"731bb1527f4051e54f2cd33a4ed1dc9993e069845396fc3447ff4e734f840d24"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UR46knWlMJ4wN7hUiHOhPhWCrOY4NEfXKFv4fugOfocOz3Bti5B89RzPVtRKFLpIrQJ7/yNEzs7vl2tHmSiACw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T22:35:14.599632Z","bundle_sha256":"bfc4636ea3b922815d0068c356529a93566ee7890ae2d3e633f06bc796d713ac"}}