{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:R3YRV6NV5N5BMYCJ4CKARTFRX3","short_pith_number":"pith:R3YRV6NV","canonical_record":{"source":{"id":"1804.07382","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-04-19T21:23:27Z","cross_cats_sorted":[],"title_canon_sha256":"1905eaf750edfb88b71de488065bc51907573c9147d9bc9535ba5b20b1452071","abstract_canon_sha256":"26b4751527d23d5bc2cb7d5d9fca80e7b5f146e3d74c86541dc8aef9df490d4e"},"schema_version":"1.0"},"canonical_sha256":"8ef11af9b5eb7a166049e09408ccb1bec75e0a9539720d8ccd3f43e5dcf096ad","source":{"kind":"arxiv","id":"1804.07382","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.07382","created_at":"2026-05-18T00:17:58Z"},{"alias_kind":"arxiv_version","alias_value":"1804.07382v1","created_at":"2026-05-18T00:17:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.07382","created_at":"2026-05-18T00:17:58Z"},{"alias_kind":"pith_short_12","alias_value":"R3YRV6NV5N5B","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"R3YRV6NV5N5BMYCJ","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"R3YRV6NV","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:R3YRV6NV5N5BMYCJ4CKARTFRX3","target":"record","payload":{"canonical_record":{"source":{"id":"1804.07382","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-04-19T21:23:27Z","cross_cats_sorted":[],"title_canon_sha256":"1905eaf750edfb88b71de488065bc51907573c9147d9bc9535ba5b20b1452071","abstract_canon_sha256":"26b4751527d23d5bc2cb7d5d9fca80e7b5f146e3d74c86541dc8aef9df490d4e"},"schema_version":"1.0"},"canonical_sha256":"8ef11af9b5eb7a166049e09408ccb1bec75e0a9539720d8ccd3f43e5dcf096ad","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:59.000493Z","signature_b64":"gan8aD7HVyqRdEfvIv6qBksgjyZ5YQQHIu29nb9BDv+W0kpL5JhmEtkVcQPskwrKHOKz9a4MIRpvhaCM3xfzDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ef11af9b5eb7a166049e09408ccb1bec75e0a9539720d8ccd3f43e5dcf096ad","last_reissued_at":"2026-05-18T00:17:58.999827Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:58.999827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.07382","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-18T00:17:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J7VSjmBuERbWXVNE2ZGDStun9ST0HanVu0UzepMIZRp5KPykZu7mM3ZEEOsEp7VYPyPw36tu6wbdQWUJYud+Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:38:42.574311Z"},"content_sha256":"a9b60f096d21f163ff43bc07dcb00d2d95a842fe725991948578b6486e63f0df","schema_version":"1.0","event_id":"sha256:a9b60f096d21f163ff43bc07dcb00d2d95a842fe725991948578b6486e63f0df"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:R3YRV6NV5N5BMYCJ4CKARTFRX3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Suboptimality Approach to Distributed $\\mathcal{H}_2$ Optimal Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Harry L. Trentelman, Junjie Jiao, M. Kanat Camlibel","submitted_at":"2018-04-19T21:23:27Z","abstract_excerpt":"This paper deals with the distributed $\\mathcal{H}_2$ optimal control problem for linear multi-agent systems. In particular, we consider a suboptimal version of the distributed $\\mathcal{H}_2$ optimal control problem. Given a linear multi-agent system with identical agent dynamics and an associated $\\mathcal{H}_2$ cost functional, our aim is to design a distributed diffusive static protocol such that the protocol achieves state synchronization for the controlled network and such that the associated cost is smaller than an a priori given upper bound. We first analyze the $\\mathcal{H}_2$ perform"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.07382","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-18T00:17:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fnmZ3XALw/TWM1OyQUxcNapPYGoJJ9b3iB4txWC0hg/N5WDzDCrOFk4o7yYMtF8xvUQ+pM6+jRg4Sw47zR9yCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:38:42.574677Z"},"content_sha256":"ad671e284f158561d8a5b7c3cb6646a3ad37daf7da5afd897e034062c561fb52","schema_version":"1.0","event_id":"sha256:ad671e284f158561d8a5b7c3cb6646a3ad37daf7da5afd897e034062c561fb52"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R3YRV6NV5N5BMYCJ4CKARTFRX3/bundle.json","state_url":"https://pith.science/pith/R3YRV6NV5N5BMYCJ4CKARTFRX3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R3YRV6NV5N5BMYCJ4CKARTFRX3/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-05T14:38:42Z","links":{"resolver":"https://pith.science/pith/R3YRV6NV5N5BMYCJ4CKARTFRX3","bundle":"https://pith.science/pith/R3YRV6NV5N5BMYCJ4CKARTFRX3/bundle.json","state":"https://pith.science/pith/R3YRV6NV5N5BMYCJ4CKARTFRX3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R3YRV6NV5N5BMYCJ4CKARTFRX3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:R3YRV6NV5N5BMYCJ4CKARTFRX3","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":"26b4751527d23d5bc2cb7d5d9fca80e7b5f146e3d74c86541dc8aef9df490d4e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-04-19T21:23:27Z","title_canon_sha256":"1905eaf750edfb88b71de488065bc51907573c9147d9bc9535ba5b20b1452071"},"schema_version":"1.0","source":{"id":"1804.07382","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.07382","created_at":"2026-05-18T00:17:58Z"},{"alias_kind":"arxiv_version","alias_value":"1804.07382v1","created_at":"2026-05-18T00:17:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.07382","created_at":"2026-05-18T00:17:58Z"},{"alias_kind":"pith_short_12","alias_value":"R3YRV6NV5N5B","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"R3YRV6NV5N5BMYCJ","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"R3YRV6NV","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:ad671e284f158561d8a5b7c3cb6646a3ad37daf7da5afd897e034062c561fb52","target":"graph","created_at":"2026-05-18T00:17:58Z","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":"This paper deals with the distributed $\\mathcal{H}_2$ optimal control problem for linear multi-agent systems. In particular, we consider a suboptimal version of the distributed $\\mathcal{H}_2$ optimal control problem. Given a linear multi-agent system with identical agent dynamics and an associated $\\mathcal{H}_2$ cost functional, our aim is to design a distributed diffusive static protocol such that the protocol achieves state synchronization for the controlled network and such that the associated cost is smaller than an a priori given upper bound. We first analyze the $\\mathcal{H}_2$ perform","authors_text":"Harry L. Trentelman, Junjie Jiao, M. Kanat Camlibel","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-04-19T21:23:27Z","title":"A Suboptimality Approach to Distributed $\\mathcal{H}_2$ Optimal Control"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.07382","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:a9b60f096d21f163ff43bc07dcb00d2d95a842fe725991948578b6486e63f0df","target":"record","created_at":"2026-05-18T00:17:58Z","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":"26b4751527d23d5bc2cb7d5d9fca80e7b5f146e3d74c86541dc8aef9df490d4e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-04-19T21:23:27Z","title_canon_sha256":"1905eaf750edfb88b71de488065bc51907573c9147d9bc9535ba5b20b1452071"},"schema_version":"1.0","source":{"id":"1804.07382","kind":"arxiv","version":1}},"canonical_sha256":"8ef11af9b5eb7a166049e09408ccb1bec75e0a9539720d8ccd3f43e5dcf096ad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ef11af9b5eb7a166049e09408ccb1bec75e0a9539720d8ccd3f43e5dcf096ad","first_computed_at":"2026-05-18T00:17:58.999827Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:58.999827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gan8aD7HVyqRdEfvIv6qBksgjyZ5YQQHIu29nb9BDv+W0kpL5JhmEtkVcQPskwrKHOKz9a4MIRpvhaCM3xfzDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:59.000493Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.07382","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a9b60f096d21f163ff43bc07dcb00d2d95a842fe725991948578b6486e63f0df","sha256:ad671e284f158561d8a5b7c3cb6646a3ad37daf7da5afd897e034062c561fb52"],"state_sha256":"f392475e52c2e41747d5babd6b5a1099cd1ad9708ddbb76580402d0ae9a107da"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"32WYk2sfBFE85QpA3bMYiLFI1LNfCSBBEASOO+GtewCVydrBs7NdRAMpEaKQ1+q6Z2eO5A3wRKE4pW69qwLjBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T14:38:42.576691Z","bundle_sha256":"3f5b791b93fe877c7213da680ee317349664af6e9d47ce5a36f58359036770ce"}}