{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:QBWGBEEWBMBZCAX5ZEJINZ2II4","short_pith_number":"pith:QBWGBEEW","schema_version":"1.0","canonical_sha256":"806c6090960b039102fdc91286e74847339bdc5e9bc3a5f86ee79139e5828477","source":{"kind":"arxiv","id":"2304.11037","version":2},"attestation_state":"computed","paper":{"title":"An Accelerated Proximal Alternating Direction Method of Multipliers for Optimal Decentralized Control of Uncertain Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bo Yang, Defeng Sun, Xinyuan Zhao, Xudong Li","submitted_at":"2023-04-21T15:35:13Z","abstract_excerpt":"To ensure the system stability of the $\\bf{\\mathcal{H}_{2}}$-guaranteed cost optimal decentralized control problem (ODC), an approximate semidefinite programming (SDP) problem is formulated based on the sparsity of the gain matrix of the decentralized controller. To reduce data storage and improve computational efficiency, the SDP problem is vectorized into a conic programming (CP) problem using the Kronecker product. Then, a proximal alternating direction method of multipliers (PADMM) is proposed to solve the dual of the resulted CP. By linking the (generalized) PADMM with the (relaxed) proxi"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2304.11037","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-04-21T15:35:13Z","cross_cats_sorted":[],"title_canon_sha256":"053925d07c61826c222e2315dc59ee501790f39e863dc894c0f2f2ae716280bb","abstract_canon_sha256":"eb0f7bd6fba28008b0e3bee8eced92604af7914ac067448545a622e60a670f3d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:40:21.133530Z","signature_b64":"Lb+moqkE4znPpJbnYnLx56cBI1p0V2tS2YqFaRWF1ewjDA9vrmDvL7rnwnj8MIOlRyTkxcyrcOqCy3vhaHGmCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"806c6090960b039102fdc91286e74847339bdc5e9bc3a5f86ee79139e5828477","last_reissued_at":"2026-07-05T07:40:21.132997Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:40:21.132997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Accelerated Proximal Alternating Direction Method of Multipliers for Optimal Decentralized Control of Uncertain Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bo Yang, Defeng Sun, Xinyuan Zhao, Xudong Li","submitted_at":"2023-04-21T15:35:13Z","abstract_excerpt":"To ensure the system stability of the $\\bf{\\mathcal{H}_{2}}$-guaranteed cost optimal decentralized control problem (ODC), an approximate semidefinite programming (SDP) problem is formulated based on the sparsity of the gain matrix of the decentralized controller. To reduce data storage and improve computational efficiency, the SDP problem is vectorized into a conic programming (CP) problem using the Kronecker product. Then, a proximal alternating direction method of multipliers (PADMM) is proposed to solve the dual of the resulted CP. By linking the (generalized) PADMM with the (relaxed) proxi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.11037","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2304.11037/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2304.11037","created_at":"2026-07-05T07:40:21.133066+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.11037v2","created_at":"2026-07-05T07:40:21.133066+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.11037","created_at":"2026-07-05T07:40:21.133066+00:00"},{"alias_kind":"pith_short_12","alias_value":"QBWGBEEWBMBZ","created_at":"2026-07-05T07:40:21.133066+00:00"},{"alias_kind":"pith_short_16","alias_value":"QBWGBEEWBMBZCAX5","created_at":"2026-07-05T07:40:21.133066+00:00"},{"alias_kind":"pith_short_8","alias_value":"QBWGBEEW","created_at":"2026-07-05T07:40:21.133066+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.19895","citing_title":"Douglas-Rachford Splitting for Group-Sparse Feedback Linear-Quadratic Control","ref_index":16,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QBWGBEEWBMBZCAX5ZEJINZ2II4","json":"https://pith.science/pith/QBWGBEEWBMBZCAX5ZEJINZ2II4.json","graph_json":"https://pith.science/api/pith-number/QBWGBEEWBMBZCAX5ZEJINZ2II4/graph.json","events_json":"https://pith.science/api/pith-number/QBWGBEEWBMBZCAX5ZEJINZ2II4/events.json","paper":"https://pith.science/paper/QBWGBEEW"},"agent_actions":{"view_html":"https://pith.science/pith/QBWGBEEWBMBZCAX5ZEJINZ2II4","download_json":"https://pith.science/pith/QBWGBEEWBMBZCAX5ZEJINZ2II4.json","view_paper":"https://pith.science/paper/QBWGBEEW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.11037&json=true","fetch_graph":"https://pith.science/api/pith-number/QBWGBEEWBMBZCAX5ZEJINZ2II4/graph.json","fetch_events":"https://pith.science/api/pith-number/QBWGBEEWBMBZCAX5ZEJINZ2II4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QBWGBEEWBMBZCAX5ZEJINZ2II4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QBWGBEEWBMBZCAX5ZEJINZ2II4/action/storage_attestation","attest_author":"https://pith.science/pith/QBWGBEEWBMBZCAX5ZEJINZ2II4/action/author_attestation","sign_citation":"https://pith.science/pith/QBWGBEEWBMBZCAX5ZEJINZ2II4/action/citation_signature","submit_replication":"https://pith.science/pith/QBWGBEEWBMBZCAX5ZEJINZ2II4/action/replication_record"}},"created_at":"2026-07-05T07:40:21.133066+00:00","updated_at":"2026-07-05T07:40:21.133066+00:00"}