{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:KETNWRFABPC6VZPAHHNQYV74BX","short_pith_number":"pith:KETNWRFA","schema_version":"1.0","canonical_sha256":"5126db44a00bc5eae5e039db0c57fc0dd6f8fa91cc0faad63ce89d7384b1dc47","source":{"kind":"arxiv","id":"2406.11168","version":4},"attestation_state":"computed","paper":{"title":"Two-Timescale Optimization Framework for Sparse-Feedback Linear-Quadratic Optimal Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Lechen Feng, Xuebo Zhang, Yuan-Hua Ni","submitted_at":"2024-06-17T03:17:33Z","abstract_excerpt":"A $\\mathcal{H}_2$-guaranteed sparse-feedback linear-quadratic (LQ) optimal control with convex parameterization and convex-bounded uncertainty is studied in this paper, where $\\ell_0$-penalty is added into the $\\mathcal{H}_2$ cost to penalize the number of communication links among distributed controllers. Then, the sparse-feedback gain is investigated to minimize the modified $\\mathcal{H}_2$ cost together with the stability guarantee, and the corresponding main results are of three parts. First, the $\\ell_1$ relaxation sparse-feedback LQ problem is of concern, and a two-timescale algorithm is"},"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":"2406.11168","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-06-17T03:17:33Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"05442835d0a27ae3acd38696e0eb3a7702635a3670b8437d124eba2bef6af266","abstract_canon_sha256":"78d2b2e2f39af3b7226384d076d20036855a74de0f07c211315891f742b0c010"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:46:47.951340Z","signature_b64":"Q73jteKG/aodJeTxCkMJ9FwfdQZzy2a/hE/c3MH80ceUpabvFcN32miZWXfrZvoE8kDJKsopk+2VPLGi5CKtBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5126db44a00bc5eae5e039db0c57fc0dd6f8fa91cc0faad63ce89d7384b1dc47","last_reissued_at":"2026-07-05T09:46:47.950756Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:46:47.950756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two-Timescale Optimization Framework for Sparse-Feedback Linear-Quadratic Optimal Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Lechen Feng, Xuebo Zhang, Yuan-Hua Ni","submitted_at":"2024-06-17T03:17:33Z","abstract_excerpt":"A $\\mathcal{H}_2$-guaranteed sparse-feedback linear-quadratic (LQ) optimal control with convex parameterization and convex-bounded uncertainty is studied in this paper, where $\\ell_0$-penalty is added into the $\\mathcal{H}_2$ cost to penalize the number of communication links among distributed controllers. Then, the sparse-feedback gain is investigated to minimize the modified $\\mathcal{H}_2$ cost together with the stability guarantee, and the corresponding main results are of three parts. First, the $\\ell_1$ relaxation sparse-feedback LQ problem is of concern, and a two-timescale algorithm is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.11168","kind":"arxiv","version":4},"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/2406.11168/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":"2406.11168","created_at":"2026-07-05T09:46:47.950820+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.11168v4","created_at":"2026-07-05T09:46:47.950820+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.11168","created_at":"2026-07-05T09:46:47.950820+00:00"},{"alias_kind":"pith_short_12","alias_value":"KETNWRFABPC6","created_at":"2026-07-05T09:46:47.950820+00:00"},{"alias_kind":"pith_short_16","alias_value":"KETNWRFABPC6VZPA","created_at":"2026-07-05T09:46:47.950820+00:00"},{"alias_kind":"pith_short_8","alias_value":"KETNWRFA","created_at":"2026-07-05T09:46:47.950820+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.19965","citing_title":"A Convex Optimization Approach to Model-Free Inverse Optimal Control with Provable Convergence","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KETNWRFABPC6VZPAHHNQYV74BX","json":"https://pith.science/pith/KETNWRFABPC6VZPAHHNQYV74BX.json","graph_json":"https://pith.science/api/pith-number/KETNWRFABPC6VZPAHHNQYV74BX/graph.json","events_json":"https://pith.science/api/pith-number/KETNWRFABPC6VZPAHHNQYV74BX/events.json","paper":"https://pith.science/paper/KETNWRFA"},"agent_actions":{"view_html":"https://pith.science/pith/KETNWRFABPC6VZPAHHNQYV74BX","download_json":"https://pith.science/pith/KETNWRFABPC6VZPAHHNQYV74BX.json","view_paper":"https://pith.science/paper/KETNWRFA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.11168&json=true","fetch_graph":"https://pith.science/api/pith-number/KETNWRFABPC6VZPAHHNQYV74BX/graph.json","fetch_events":"https://pith.science/api/pith-number/KETNWRFABPC6VZPAHHNQYV74BX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KETNWRFABPC6VZPAHHNQYV74BX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KETNWRFABPC6VZPAHHNQYV74BX/action/storage_attestation","attest_author":"https://pith.science/pith/KETNWRFABPC6VZPAHHNQYV74BX/action/author_attestation","sign_citation":"https://pith.science/pith/KETNWRFABPC6VZPAHHNQYV74BX/action/citation_signature","submit_replication":"https://pith.science/pith/KETNWRFABPC6VZPAHHNQYV74BX/action/replication_record"}},"created_at":"2026-07-05T09:46:47.950820+00:00","updated_at":"2026-07-05T09:46:47.950820+00:00"}