{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HPTU7PHRO6XG6QZELM2C6MH4RI","short_pith_number":"pith:HPTU7PHR","canonical_record":{"source":{"id":"1601.05050","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-01-19T19:44:32Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"d018f025f2146f995c9b2e8ea3b9ded104e6d40ae0cb86052d0d0867e5e9f9f7","abstract_canon_sha256":"a08a68998bea7a7edbcd05f44b85cd71fe4ac94b45626ec359066efc5f7879a6"},"schema_version":"1.0"},"canonical_sha256":"3be74fbcf177ae6f43245b342f30fc8a302f96c21533f9e558ca846ba17c2ef8","source":{"kind":"arxiv","id":"1601.05050","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.05050","created_at":"2026-05-18T01:22:31Z"},{"alias_kind":"arxiv_version","alias_value":"1601.05050v1","created_at":"2026-05-18T01:22:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05050","created_at":"2026-05-18T01:22:31Z"},{"alias_kind":"pith_short_12","alias_value":"HPTU7PHRO6XG","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HPTU7PHRO6XG6QZE","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HPTU7PHR","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HPTU7PHRO6XG6QZELM2C6MH4RI","target":"record","payload":{"canonical_record":{"source":{"id":"1601.05050","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-01-19T19:44:32Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"d018f025f2146f995c9b2e8ea3b9ded104e6d40ae0cb86052d0d0867e5e9f9f7","abstract_canon_sha256":"a08a68998bea7a7edbcd05f44b85cd71fe4ac94b45626ec359066efc5f7879a6"},"schema_version":"1.0"},"canonical_sha256":"3be74fbcf177ae6f43245b342f30fc8a302f96c21533f9e558ca846ba17c2ef8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:31.344343Z","signature_b64":"03DL9I4dGtlFYL2K0eGjzpcHOeTgPLm/7+AoDujyybsb0nTkFUCFmazIsrY8/eJeTzBNbIrM0X/uJNrrZDoYBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3be74fbcf177ae6f43245b342f30fc8a302f96c21533f9e558ca846ba17c2ef8","last_reissued_at":"2026-05-18T01:22:31.343794Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:31.343794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.05050","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-18T01:22:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ppvm6m6p1xiI05HibX1IS8+DJMUoeQ0VYpRHamIzzlMgIt710gyC9hrsPJDbOGbfKlvSz0cA3BAXoa3dNbidDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:39:21.928270Z"},"content_sha256":"2ba39d35a90dfabf215b540bc6d8f734bc46b1f99a1aceac4329637da346b261","schema_version":"1.0","event_id":"sha256:2ba39d35a90dfabf215b540bc6d8f734bc46b1f99a1aceac4329637da346b261"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HPTU7PHRO6XG6QZELM2C6MH4RI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"H2 Optimal Coordination of Homogeneous Agents Subject to Limited Information Exchange","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Anders Rantzer, Daria Madjidian, Leonid Mirkin","submitted_at":"2016-01-19T19:44:32Z","abstract_excerpt":"Controllers with a diagonal-plus-low-rank structure constitute a scalable class of controllers for multi-agent systems. Previous research has shown that diagonal-plus-low-rank control laws appear as the optimal solution to a class of multi-agent H2 coordination problems, which arise in the control of wind farms. In this paper we show that this result extends to the case where the information exchange between agents is subject to limitations. We also show that the computational effort required to obtain the optimal controller is independent of the number of agents and provide analytical express"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.05050","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-18T01:22:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yOlMAn/si7INECdmr5K3S4HgKjVbOqGkObv0o4WESVC7jay9DZ8wfMKxSIVfHkjFKAjTlYhCVR8xl2p25nhfBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:39:21.928636Z"},"content_sha256":"bb9082c44661aec7d0a944faf8e0b92d3072e07a1f17186d535c35ade2a5cf71","schema_version":"1.0","event_id":"sha256:bb9082c44661aec7d0a944faf8e0b92d3072e07a1f17186d535c35ade2a5cf71"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HPTU7PHRO6XG6QZELM2C6MH4RI/bundle.json","state_url":"https://pith.science/pith/HPTU7PHRO6XG6QZELM2C6MH4RI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HPTU7PHRO6XG6QZELM2C6MH4RI/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-05T01:39:21Z","links":{"resolver":"https://pith.science/pith/HPTU7PHRO6XG6QZELM2C6MH4RI","bundle":"https://pith.science/pith/HPTU7PHRO6XG6QZELM2C6MH4RI/bundle.json","state":"https://pith.science/pith/HPTU7PHRO6XG6QZELM2C6MH4RI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HPTU7PHRO6XG6QZELM2C6MH4RI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HPTU7PHRO6XG6QZELM2C6MH4RI","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":"a08a68998bea7a7edbcd05f44b85cd71fe4ac94b45626ec359066efc5f7879a6","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-01-19T19:44:32Z","title_canon_sha256":"d018f025f2146f995c9b2e8ea3b9ded104e6d40ae0cb86052d0d0867e5e9f9f7"},"schema_version":"1.0","source":{"id":"1601.05050","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.05050","created_at":"2026-05-18T01:22:31Z"},{"alias_kind":"arxiv_version","alias_value":"1601.05050v1","created_at":"2026-05-18T01:22:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05050","created_at":"2026-05-18T01:22:31Z"},{"alias_kind":"pith_short_12","alias_value":"HPTU7PHRO6XG","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HPTU7PHRO6XG6QZE","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HPTU7PHR","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:bb9082c44661aec7d0a944faf8e0b92d3072e07a1f17186d535c35ade2a5cf71","target":"graph","created_at":"2026-05-18T01:22:31Z","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":"Controllers with a diagonal-plus-low-rank structure constitute a scalable class of controllers for multi-agent systems. Previous research has shown that diagonal-plus-low-rank control laws appear as the optimal solution to a class of multi-agent H2 coordination problems, which arise in the control of wind farms. In this paper we show that this result extends to the case where the information exchange between agents is subject to limitations. We also show that the computational effort required to obtain the optimal controller is independent of the number of agents and provide analytical express","authors_text":"Anders Rantzer, Daria Madjidian, Leonid Mirkin","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-01-19T19:44:32Z","title":"H2 Optimal Coordination of Homogeneous Agents Subject to Limited Information Exchange"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.05050","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:2ba39d35a90dfabf215b540bc6d8f734bc46b1f99a1aceac4329637da346b261","target":"record","created_at":"2026-05-18T01:22:31Z","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":"a08a68998bea7a7edbcd05f44b85cd71fe4ac94b45626ec359066efc5f7879a6","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-01-19T19:44:32Z","title_canon_sha256":"d018f025f2146f995c9b2e8ea3b9ded104e6d40ae0cb86052d0d0867e5e9f9f7"},"schema_version":"1.0","source":{"id":"1601.05050","kind":"arxiv","version":1}},"canonical_sha256":"3be74fbcf177ae6f43245b342f30fc8a302f96c21533f9e558ca846ba17c2ef8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3be74fbcf177ae6f43245b342f30fc8a302f96c21533f9e558ca846ba17c2ef8","first_computed_at":"2026-05-18T01:22:31.343794Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:31.343794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"03DL9I4dGtlFYL2K0eGjzpcHOeTgPLm/7+AoDujyybsb0nTkFUCFmazIsrY8/eJeTzBNbIrM0X/uJNrrZDoYBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:31.344343Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.05050","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ba39d35a90dfabf215b540bc6d8f734bc46b1f99a1aceac4329637da346b261","sha256:bb9082c44661aec7d0a944faf8e0b92d3072e07a1f17186d535c35ade2a5cf71"],"state_sha256":"94741ab6f2743fed5a945350a65397be5efced91a7a85410ffeeae4156b89472"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i1XyvoW+y9aE/Qn6Re/6cydV+K3lJfQxw5SFI3BCI7RBRxVjz8JR/tkC3a8rKrwVzGvlu2wTtiXs71NmGzDlCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T01:39:21.930821Z","bundle_sha256":"fbd9f2e7207836bfacc513c6f321364b70c1bee42c550a2b95c299a53133d9c9"}}