{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:HKOQ62H4MGECPHN47IXA463ZOP","short_pith_number":"pith:HKOQ62H4","canonical_record":{"source":{"id":"1803.02682","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-07T14:42:40Z","cross_cats_sorted":[],"title_canon_sha256":"bbb99e550edb983f168fef1747f364538da8a3de7f8a16806aced412896c3975","abstract_canon_sha256":"4bb5bc4334f070336efeea40bf926d84ed0c037463a7b3ec435623314b4af4a1"},"schema_version":"1.0"},"canonical_sha256":"3a9d0f68fc6188279dbcfa2e0e7b7973d9609bac9fe308043ddfeab68e2e9ee3","source":{"kind":"arxiv","id":"1803.02682","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.02682","created_at":"2026-05-18T00:21:49Z"},{"alias_kind":"arxiv_version","alias_value":"1803.02682v1","created_at":"2026-05-18T00:21:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.02682","created_at":"2026-05-18T00:21:49Z"},{"alias_kind":"pith_short_12","alias_value":"HKOQ62H4MGEC","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HKOQ62H4MGECPHN4","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HKOQ62H4","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:HKOQ62H4MGECPHN47IXA463ZOP","target":"record","payload":{"canonical_record":{"source":{"id":"1803.02682","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-07T14:42:40Z","cross_cats_sorted":[],"title_canon_sha256":"bbb99e550edb983f168fef1747f364538da8a3de7f8a16806aced412896c3975","abstract_canon_sha256":"4bb5bc4334f070336efeea40bf926d84ed0c037463a7b3ec435623314b4af4a1"},"schema_version":"1.0"},"canonical_sha256":"3a9d0f68fc6188279dbcfa2e0e7b7973d9609bac9fe308043ddfeab68e2e9ee3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:49.524733Z","signature_b64":"TCNx/wkP1p3GS623WGPs2aQjAgiBzxPaWAkSRmRRL1SvdtweMzVkRVb5cDdGuLUi3AbuPbsLGS2dwG5e4OsmDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a9d0f68fc6188279dbcfa2e0e7b7973d9609bac9fe308043ddfeab68e2e9ee3","last_reissued_at":"2026-05-18T00:21:49.524123Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:49.524123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.02682","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:21:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DTATvlkapExsWuXJL8/HhIYAXplJRuYiULryrBKdmj2cVnLovy3XhoMtEdB8xbaJhdeWKgXswM0ozTo1UGskBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T19:04:48.358391Z"},"content_sha256":"07f0ef7a6e27e3f97b60f295c467db56646e95629e30941928a1ef9ea1228f8c","schema_version":"1.0","event_id":"sha256:07f0ef7a6e27e3f97b60f295c467db56646e95629e30941928a1ef9ea1228f8c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:HKOQ62H4MGECPHN47IXA463ZOP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Suboptimality Approach to Distributed Linear Quadratic 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-03-07T14:42:40Z","abstract_excerpt":"This paper is concerned with the distributed linear quadratic optimal control problem. In particular, we consider a suboptimal version of the distributed optimal control problem for undirected multi-agent networks. Given a multi-agent system with identical agent dynamics and an associated global quadratic cost functional, our objective is to design suboptimal distributed control laws that guarantee the controlled network to reach consensus and the associated cost to be smaller than an a priori given upper bound. We first analyze the suboptimality for a given linear system and then apply the re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.02682","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:21:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vlcPDVPlkYKwJS3//rtQ907/9IXoDibzb+as/+8DAhtbU87kOph+eODXi5/VMtt5m5JOcFkT46OtJfdTIEd+CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T19:04:48.359061Z"},"content_sha256":"7c459b14ae1cdd4aff1b65b1e6a407e797df8c66b4c75b71b86a90b18313ca61","schema_version":"1.0","event_id":"sha256:7c459b14ae1cdd4aff1b65b1e6a407e797df8c66b4c75b71b86a90b18313ca61"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HKOQ62H4MGECPHN47IXA463ZOP/bundle.json","state_url":"https://pith.science/pith/HKOQ62H4MGECPHN47IXA463ZOP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HKOQ62H4MGECPHN47IXA463ZOP/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-05T19:04:48Z","links":{"resolver":"https://pith.science/pith/HKOQ62H4MGECPHN47IXA463ZOP","bundle":"https://pith.science/pith/HKOQ62H4MGECPHN47IXA463ZOP/bundle.json","state":"https://pith.science/pith/HKOQ62H4MGECPHN47IXA463ZOP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HKOQ62H4MGECPHN47IXA463ZOP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HKOQ62H4MGECPHN47IXA463ZOP","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":"4bb5bc4334f070336efeea40bf926d84ed0c037463a7b3ec435623314b4af4a1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-07T14:42:40Z","title_canon_sha256":"bbb99e550edb983f168fef1747f364538da8a3de7f8a16806aced412896c3975"},"schema_version":"1.0","source":{"id":"1803.02682","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.02682","created_at":"2026-05-18T00:21:49Z"},{"alias_kind":"arxiv_version","alias_value":"1803.02682v1","created_at":"2026-05-18T00:21:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.02682","created_at":"2026-05-18T00:21:49Z"},{"alias_kind":"pith_short_12","alias_value":"HKOQ62H4MGEC","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HKOQ62H4MGECPHN4","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HKOQ62H4","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:7c459b14ae1cdd4aff1b65b1e6a407e797df8c66b4c75b71b86a90b18313ca61","target":"graph","created_at":"2026-05-18T00:21:49Z","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 is concerned with the distributed linear quadratic optimal control problem. In particular, we consider a suboptimal version of the distributed optimal control problem for undirected multi-agent networks. Given a multi-agent system with identical agent dynamics and an associated global quadratic cost functional, our objective is to design suboptimal distributed control laws that guarantee the controlled network to reach consensus and the associated cost to be smaller than an a priori given upper bound. We first analyze the suboptimality for a given linear system and then apply the re","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-03-07T14:42:40Z","title":"A Suboptimality Approach to Distributed Linear Quadratic Optimal Control"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.02682","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:07f0ef7a6e27e3f97b60f295c467db56646e95629e30941928a1ef9ea1228f8c","target":"record","created_at":"2026-05-18T00:21:49Z","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":"4bb5bc4334f070336efeea40bf926d84ed0c037463a7b3ec435623314b4af4a1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-07T14:42:40Z","title_canon_sha256":"bbb99e550edb983f168fef1747f364538da8a3de7f8a16806aced412896c3975"},"schema_version":"1.0","source":{"id":"1803.02682","kind":"arxiv","version":1}},"canonical_sha256":"3a9d0f68fc6188279dbcfa2e0e7b7973d9609bac9fe308043ddfeab68e2e9ee3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a9d0f68fc6188279dbcfa2e0e7b7973d9609bac9fe308043ddfeab68e2e9ee3","first_computed_at":"2026-05-18T00:21:49.524123Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:49.524123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TCNx/wkP1p3GS623WGPs2aQjAgiBzxPaWAkSRmRRL1SvdtweMzVkRVb5cDdGuLUi3AbuPbsLGS2dwG5e4OsmDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:49.524733Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.02682","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:07f0ef7a6e27e3f97b60f295c467db56646e95629e30941928a1ef9ea1228f8c","sha256:7c459b14ae1cdd4aff1b65b1e6a407e797df8c66b4c75b71b86a90b18313ca61"],"state_sha256":"3612a59848dcb60dd6219582bc919bdb934ea9873575d0bcd27df266ff6c7134"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zrAJBul2jov4ZlpDJIUWEZh0KiuOoNF1GsDSkDWi9CRUzlljiLsc+EZ4V4alAIGGGtLJwXFOpkz7Tlg4POzOBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T19:04:48.362644Z","bundle_sha256":"97769b74c72d7551c56103c76acb109ae3705e8059cfd1404073349c10acc949"}}