{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ICLIKXCATIVSYZ3G3UQYT4JXVX","short_pith_number":"pith:ICLIKXCA","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"},"canonical_sha256":"4096855c409a2b2c6766dd2189f137adc1912876a0b6e0dc81fad5310274839a","source":{"kind":"arxiv","id":"1906.05562","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.05562","created_at":"2026-05-17T23:43:24Z"},{"alias_kind":"arxiv_version","alias_value":"1906.05562v1","created_at":"2026-05-17T23:43:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.05562","created_at":"2026-05-17T23:43:24Z"},{"alias_kind":"pith_short_12","alias_value":"ICLIKXCATIVS","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"ICLIKXCATIVSYZ3G","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"ICLIKXCA","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ICLIKXCATIVSYZ3G3UQYT4JXVX","target":"record","payload":{"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"},"canonical_sha256":"4096855c409a2b2c6766dd2189f137adc1912876a0b6e0dc81fad5310274839a","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"},"source_kind":"arxiv","source_id":"1906.05562","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-17T23:43:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hekkgG2HoOFjn9c78FLy0EAxS3fB7VKAt8jN16vatZv9Fh003Q4O0z1mqW03QGGhxtCXxQ1vhGpqVl6YcYbXCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T23:39:07.792206Z"},"content_sha256":"e45730292549560e3505b183b1b6ba12d884c78ce1863865fd022d4580e64b6e","schema_version":"1.0","event_id":"sha256:e45730292549560e3505b183b1b6ba12d884c78ce1863865fd022d4580e64b6e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ICLIKXCATIVSYZ3G3UQYT4JXVX","target":"graph","payload":{"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"},"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-17T23:43:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XQp8r5lddvOOMNB54Z7KkNRPq/5ofs9bWy8HTpkqRQvDgW4mjdBwluTK0zB+XZU31iOXQrIFKI9Jp5WKBHO/Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T23:39:07.792926Z"},"content_sha256":"b47b0daa22cd27ca8029ed483e440d360936ba2650c7184ddf18f984931c94b4","schema_version":"1.0","event_id":"sha256:b47b0daa22cd27ca8029ed483e440d360936ba2650c7184ddf18f984931c94b4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ICLIKXCATIVSYZ3G3UQYT4JXVX/bundle.json","state_url":"https://pith.science/pith/ICLIKXCATIVSYZ3G3UQYT4JXVX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ICLIKXCATIVSYZ3G3UQYT4JXVX/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-10T23:39:07Z","links":{"resolver":"https://pith.science/pith/ICLIKXCATIVSYZ3G3UQYT4JXVX","bundle":"https://pith.science/pith/ICLIKXCATIVSYZ3G3UQYT4JXVX/bundle.json","state":"https://pith.science/pith/ICLIKXCATIVSYZ3G3UQYT4JXVX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ICLIKXCATIVSYZ3G3UQYT4JXVX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ICLIKXCATIVSYZ3G3UQYT4JXVX","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":"dec960160ec3287ff527269026791adeff4b9d6f7a0d18947e352edc53f18de8","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2019-06-13T09:26:01Z","title_canon_sha256":"d50da4f7826a5d9fcbb88ea10ed0f6ff6d53c9776d8aadbaa4fcbf825decbe5c"},"schema_version":"1.0","source":{"id":"1906.05562","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.05562","created_at":"2026-05-17T23:43:24Z"},{"alias_kind":"arxiv_version","alias_value":"1906.05562v1","created_at":"2026-05-17T23:43:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.05562","created_at":"2026-05-17T23:43:24Z"},{"alias_kind":"pith_short_12","alias_value":"ICLIKXCATIVS","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"ICLIKXCATIVSYZ3G","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"ICLIKXCA","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:b47b0daa22cd27ca8029ed483e440d360936ba2650c7184ddf18f984931c94b4","target":"graph","created_at":"2026-05-17T23:43:24Z","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":"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","authors_text":"Alexandra Duel-Hallen, Aranya Chakrabortty, Feier Lian","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2019-06-13T09:26:01Z","title":"Game-Theoretic Mixed $H_2/H_{\\infty}$ Control with Sparsity Constraint for Multi-agent Networked Control Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.05562","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:e45730292549560e3505b183b1b6ba12d884c78ce1863865fd022d4580e64b6e","target":"record","created_at":"2026-05-17T23:43:24Z","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":"dec960160ec3287ff527269026791adeff4b9d6f7a0d18947e352edc53f18de8","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2019-06-13T09:26:01Z","title_canon_sha256":"d50da4f7826a5d9fcbb88ea10ed0f6ff6d53c9776d8aadbaa4fcbf825decbe5c"},"schema_version":"1.0","source":{"id":"1906.05562","kind":"arxiv","version":1}},"canonical_sha256":"4096855c409a2b2c6766dd2189f137adc1912876a0b6e0dc81fad5310274839a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4096855c409a2b2c6766dd2189f137adc1912876a0b6e0dc81fad5310274839a","first_computed_at":"2026-05-17T23:43:24.949267Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:24.949267Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/KaA/0QAnXzUwTgDcyw4Zh9heGj+1ai+wfR7sy2Yfjfylud23UuF48JTOrO9c1wc3y7okHclWwigpz8JtKgvDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:24.949745Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.05562","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e45730292549560e3505b183b1b6ba12d884c78ce1863865fd022d4580e64b6e","sha256:b47b0daa22cd27ca8029ed483e440d360936ba2650c7184ddf18f984931c94b4"],"state_sha256":"5c3b50b5b6fe7c0aabbd0fd2d70293a2fd37f1b16727fa441134f075ffecdfed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TQczZGbuWxs4LE67fBHSzerwmztBUUZoWuue0c8kIokJPgoUrfHoWwGv6tx+xtQijPTKLEiWU4fUpuoqmXpXDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T23:39:07.796853Z","bundle_sha256":"cab6185707c778fbe47808586f82d2ca104c83ef9561e12e3714c0771ce39c84"}}