{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ICLIKXCATIVSYZ3G3UQYT4JXVX","short_pith_number":"pith:ICLIKXCA","schema_version":"1.0","canonical_sha256":"4096855c409a2b2c6766dd2189f137adc1912876a0b6e0dc81fad5310274839a","source":{"kind":"arxiv","id":"1906.05562","version":1},"attestation_state":"computed","paper":{"title":"Game-Theoretic Mixed $H_2/H_{\\infty}$ Control with Sparsity Constraint for Multi-agent Networked Control Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Alexandra Duel-Hallen, Aranya Chakrabortty, Feier Lian","submitted_at":"2019-06-13T09:26:01Z","abstract_excerpt":"Multi-agent networked control systems (NCSs) are often subject to model uncertainty and are limited by large communication cost, associated with feedback of data between the system nodes. To provide robustness against model uncertainty and to reduce the communication cost, this paper investigates the mixed $H_2/H_{\\infty}$ control problem for NCS under the sparsity constraint. First, proximal alternating linearized minimization (PALM) is employed to solve the centralized social optimization where the agents have the same optimization objective. Next, we investigate a sparsity-constrained nonco"},"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":"1906.05562","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2019-06-13T09:26:01Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"d50da4f7826a5d9fcbb88ea10ed0f6ff6d53c9776d8aadbaa4fcbf825decbe5c","abstract_canon_sha256":"dec960160ec3287ff527269026791adeff4b9d6f7a0d18947e352edc53f18de8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:24.949745Z","signature_b64":"/KaA/0QAnXzUwTgDcyw4Zh9heGj+1ai+wfR7sy2Yfjfylud23UuF48JTOrO9c1wc3y7okHclWwigpz8JtKgvDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4096855c409a2b2c6766dd2189f137adc1912876a0b6e0dc81fad5310274839a","last_reissued_at":"2026-05-17T23:43:24.949267Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:24.949267Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Game-Theoretic Mixed $H_2/H_{\\infty}$ Control with Sparsity Constraint for Multi-agent Networked Control Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Alexandra Duel-Hallen, Aranya Chakrabortty, Feier Lian","submitted_at":"2019-06-13T09:26:01Z","abstract_excerpt":"Multi-agent networked control systems (NCSs) are often subject to model uncertainty and are limited by large communication cost, associated with feedback of data between the system nodes. To provide robustness against model uncertainty and to reduce the communication cost, this paper investigates the mixed $H_2/H_{\\infty}$ control problem for NCS under the sparsity constraint. First, proximal alternating linearized minimization (PALM) is employed to solve the centralized social optimization where the agents have the same optimization objective. Next, we investigate a sparsity-constrained nonco"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.05562","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1906.05562","created_at":"2026-05-17T23:43:24.949358+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.05562v1","created_at":"2026-05-17T23:43:24.949358+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.05562","created_at":"2026-05-17T23:43:24.949358+00:00"},{"alias_kind":"pith_short_12","alias_value":"ICLIKXCATIVS","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"ICLIKXCATIVSYZ3G","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"ICLIKXCA","created_at":"2026-05-18T12:33:18.533446+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ICLIKXCATIVSYZ3G3UQYT4JXVX","json":"https://pith.science/pith/ICLIKXCATIVSYZ3G3UQYT4JXVX.json","graph_json":"https://pith.science/api/pith-number/ICLIKXCATIVSYZ3G3UQYT4JXVX/graph.json","events_json":"https://pith.science/api/pith-number/ICLIKXCATIVSYZ3G3UQYT4JXVX/events.json","paper":"https://pith.science/paper/ICLIKXCA"},"agent_actions":{"view_html":"https://pith.science/pith/ICLIKXCATIVSYZ3G3UQYT4JXVX","download_json":"https://pith.science/pith/ICLIKXCATIVSYZ3G3UQYT4JXVX.json","view_paper":"https://pith.science/paper/ICLIKXCA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.05562&json=true","fetch_graph":"https://pith.science/api/pith-number/ICLIKXCATIVSYZ3G3UQYT4JXVX/graph.json","fetch_events":"https://pith.science/api/pith-number/ICLIKXCATIVSYZ3G3UQYT4JXVX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ICLIKXCATIVSYZ3G3UQYT4JXVX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ICLIKXCATIVSYZ3G3UQYT4JXVX/action/storage_attestation","attest_author":"https://pith.science/pith/ICLIKXCATIVSYZ3G3UQYT4JXVX/action/author_attestation","sign_citation":"https://pith.science/pith/ICLIKXCATIVSYZ3G3UQYT4JXVX/action/citation_signature","submit_replication":"https://pith.science/pith/ICLIKXCATIVSYZ3G3UQYT4JXVX/action/replication_record"}},"created_at":"2026-05-17T23:43:24.949358+00:00","updated_at":"2026-05-17T23:43:24.949358+00:00"}