{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:RIL3XDBRO34ET37WEAFN3OXN5U","short_pith_number":"pith:RIL3XDBR","canonical_record":{"source":{"id":"1601.07972","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-01-29T03:27:34Z","cross_cats_sorted":[],"title_canon_sha256":"06fe23a9f50aba2c498ec1f6c4a814c7661419624f173c6b28840f95ef0896b8","abstract_canon_sha256":"6d5b6a499b77bfe987c255245ecf27f2d0b28d67b13f55cf1cd5f10103c8092c"},"schema_version":"1.0"},"canonical_sha256":"8a17bb8c3176f849eff6200addbaeded3c47744a30a2d64d2fc72f648a73d150","source":{"kind":"arxiv","id":"1601.07972","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.07972","created_at":"2026-05-18T01:21:41Z"},{"alias_kind":"arxiv_version","alias_value":"1601.07972v1","created_at":"2026-05-18T01:21:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.07972","created_at":"2026-05-18T01:21:41Z"},{"alias_kind":"pith_short_12","alias_value":"RIL3XDBRO34E","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RIL3XDBRO34ET37W","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RIL3XDBR","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:RIL3XDBRO34ET37WEAFN3OXN5U","target":"record","payload":{"canonical_record":{"source":{"id":"1601.07972","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-01-29T03:27:34Z","cross_cats_sorted":[],"title_canon_sha256":"06fe23a9f50aba2c498ec1f6c4a814c7661419624f173c6b28840f95ef0896b8","abstract_canon_sha256":"6d5b6a499b77bfe987c255245ecf27f2d0b28d67b13f55cf1cd5f10103c8092c"},"schema_version":"1.0"},"canonical_sha256":"8a17bb8c3176f849eff6200addbaeded3c47744a30a2d64d2fc72f648a73d150","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:41.373534Z","signature_b64":"XG6OejwT+RbHMKPiUU1TOJX0DbR6zQxDeLIRfD2DVV5V4TK6/Ngb9BNAMwV0BE2w9plj9nBhkt4g1syoyC6WBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a17bb8c3176f849eff6200addbaeded3c47744a30a2d64d2fc72f648a73d150","last_reissued_at":"2026-05-18T01:21:41.372875Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:41.372875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.07972","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:21:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N8fyb9TUdrjK1jJvloTyctgFJLC/KA0OdkbYtGPia24lFfCj90AzB0YILMjCoUTz735NGvZdxHC0QxjMLCYWAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:19:50.232803Z"},"content_sha256":"1e1ecfe3674679feddb01464d3337ac903f12d16463bab93bdb47f1738b271a6","schema_version":"1.0","event_id":"sha256:1e1ecfe3674679feddb01464d3337ac903f12d16463bab93bdb47f1738b271a6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:RIL3XDBRO34ET37WEAFN3OXN5U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Receding Horizon Consensus of General Linear Multi-agent Systems with Input Constraints: An Inverse Optimality Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Fuqiang Liu, Huiping Li, Weisheng Yan, Yang Shi","submitted_at":"2016-01-29T03:27:34Z","abstract_excerpt":"It is desirable but challenging to fulfill system constraints and reach optimal performance in consensus protocol design for practical multi-agent systems (MASs). This paper investigates the optimal consensus problem for general linear MASs subject to control input constraints. Two classes of MASs including subsystems with semi-stable and unstable dynamics are considered. For both classes of MASs without input constraints, the results on designing optimal consensus protocols are first developed by inverse optimality approach. Utilizing the optimal consensus protocols, the receding horizon cont"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.07972","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:21:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2ICwTqoX0xcxmJJgjBFlaFg22ImMakBoGMNjj1ETYHAtRnTgjhf/4U5zL1LVUzk/bREA0umRzXb9jn355JNLBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:19:50.233377Z"},"content_sha256":"e041e4c2f21828c04ce2abf395df6cc8c4498d92fd9f45fc56b756cc36136108","schema_version":"1.0","event_id":"sha256:e041e4c2f21828c04ce2abf395df6cc8c4498d92fd9f45fc56b756cc36136108"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RIL3XDBRO34ET37WEAFN3OXN5U/bundle.json","state_url":"https://pith.science/pith/RIL3XDBRO34ET37WEAFN3OXN5U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RIL3XDBRO34ET37WEAFN3OXN5U/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-04T22:19:50Z","links":{"resolver":"https://pith.science/pith/RIL3XDBRO34ET37WEAFN3OXN5U","bundle":"https://pith.science/pith/RIL3XDBRO34ET37WEAFN3OXN5U/bundle.json","state":"https://pith.science/pith/RIL3XDBRO34ET37WEAFN3OXN5U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RIL3XDBRO34ET37WEAFN3OXN5U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:RIL3XDBRO34ET37WEAFN3OXN5U","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":"6d5b6a499b77bfe987c255245ecf27f2d0b28d67b13f55cf1cd5f10103c8092c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-01-29T03:27:34Z","title_canon_sha256":"06fe23a9f50aba2c498ec1f6c4a814c7661419624f173c6b28840f95ef0896b8"},"schema_version":"1.0","source":{"id":"1601.07972","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.07972","created_at":"2026-05-18T01:21:41Z"},{"alias_kind":"arxiv_version","alias_value":"1601.07972v1","created_at":"2026-05-18T01:21:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.07972","created_at":"2026-05-18T01:21:41Z"},{"alias_kind":"pith_short_12","alias_value":"RIL3XDBRO34E","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RIL3XDBRO34ET37W","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RIL3XDBR","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:e041e4c2f21828c04ce2abf395df6cc8c4498d92fd9f45fc56b756cc36136108","target":"graph","created_at":"2026-05-18T01:21:41Z","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":"It is desirable but challenging to fulfill system constraints and reach optimal performance in consensus protocol design for practical multi-agent systems (MASs). This paper investigates the optimal consensus problem for general linear MASs subject to control input constraints. Two classes of MASs including subsystems with semi-stable and unstable dynamics are considered. For both classes of MASs without input constraints, the results on designing optimal consensus protocols are first developed by inverse optimality approach. Utilizing the optimal consensus protocols, the receding horizon cont","authors_text":"Fuqiang Liu, Huiping Li, Weisheng Yan, Yang Shi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-01-29T03:27:34Z","title":"Receding Horizon Consensus of General Linear Multi-agent Systems with Input Constraints: An Inverse Optimality Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.07972","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:1e1ecfe3674679feddb01464d3337ac903f12d16463bab93bdb47f1738b271a6","target":"record","created_at":"2026-05-18T01:21:41Z","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":"6d5b6a499b77bfe987c255245ecf27f2d0b28d67b13f55cf1cd5f10103c8092c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-01-29T03:27:34Z","title_canon_sha256":"06fe23a9f50aba2c498ec1f6c4a814c7661419624f173c6b28840f95ef0896b8"},"schema_version":"1.0","source":{"id":"1601.07972","kind":"arxiv","version":1}},"canonical_sha256":"8a17bb8c3176f849eff6200addbaeded3c47744a30a2d64d2fc72f648a73d150","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a17bb8c3176f849eff6200addbaeded3c47744a30a2d64d2fc72f648a73d150","first_computed_at":"2026-05-18T01:21:41.372875Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:41.372875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XG6OejwT+RbHMKPiUU1TOJX0DbR6zQxDeLIRfD2DVV5V4TK6/Ngb9BNAMwV0BE2w9plj9nBhkt4g1syoyC6WBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:41.373534Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.07972","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e1ecfe3674679feddb01464d3337ac903f12d16463bab93bdb47f1738b271a6","sha256:e041e4c2f21828c04ce2abf395df6cc8c4498d92fd9f45fc56b756cc36136108"],"state_sha256":"6da6df736086a5b0f1e880b9a8d1a91a01d8f6c140fcb62c964eab849f8c39ba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NpedmXff8aTurc7K3YGvpp9Z0gU5j8iBTLYeL9obITcFeiBXSqqj3wLoYNnsVKqq86hL+uBvCImx++VWc7QkBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T22:19:50.236798Z","bundle_sha256":"cd68df95d84161c536652199e99c1c078211925815d63e128c2e4d7fad40f3c8"}}