{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ZMK3EACLUVL6OPSWOO7JHLDTWJ","short_pith_number":"pith:ZMK3EACL","canonical_record":{"source":{"id":"1605.03648","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-12T01:39:48Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"2bd7a38a60a04807f2643734efa7365d873d941f4c556f7140338d15627d3570","abstract_canon_sha256":"9cc268f86f4a0cb8d3b97673869a705879a1f028c4715e74cdd5cae011c0db69"},"schema_version":"1.0"},"canonical_sha256":"cb15b2004ba557e73e5673be93ac73b264422cad27b2e132e413b71ebe94709e","source":{"kind":"arxiv","id":"1605.03648","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.03648","created_at":"2026-05-18T01:14:52Z"},{"alias_kind":"arxiv_version","alias_value":"1605.03648v1","created_at":"2026-05-18T01:14:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03648","created_at":"2026-05-18T01:14:52Z"},{"alias_kind":"pith_short_12","alias_value":"ZMK3EACLUVL6","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"ZMK3EACLUVL6OPSW","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"ZMK3EACL","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ZMK3EACLUVL6OPSWOO7JHLDTWJ","target":"record","payload":{"canonical_record":{"source":{"id":"1605.03648","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-12T01:39:48Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"2bd7a38a60a04807f2643734efa7365d873d941f4c556f7140338d15627d3570","abstract_canon_sha256":"9cc268f86f4a0cb8d3b97673869a705879a1f028c4715e74cdd5cae011c0db69"},"schema_version":"1.0"},"canonical_sha256":"cb15b2004ba557e73e5673be93ac73b264422cad27b2e132e413b71ebe94709e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:52.095688Z","signature_b64":"zvHhMYqqvEXy7EuXkujQy1b0Unq1lrLKzDo6KNF59yfD8nS1Z+QrtSCd0gSxXy4SgpbgRuNoF7eQtumnMV6zCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb15b2004ba557e73e5673be93ac73b264422cad27b2e132e413b71ebe94709e","last_reissued_at":"2026-05-18T01:14:52.095134Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:52.095134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.03648","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:14:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n35/BRHx5i7ABweBBlycpii42bNDhsGKlBpwf/GpTb0z910BaLLqWwLGpXPDLKwPOrBY1ficnoITMZXs+zpIAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:18:03.261394Z"},"content_sha256":"0268264ba74c209c2a68ce051353424722bdfc9ac304531f4efd4bd3b60047cb","schema_version":"1.0","event_id":"sha256:0268264ba74c209c2a68ce051353424722bdfc9ac304531f4efd4bd3b60047cb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ZMK3EACLUVL6OPSWOO7JHLDTWJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Consensus of Linear Multi-Agent Systems under Input Constraints or Uncertainties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Dinh Hoa Nguyen, Michihiro Kawanishi, Tatsuo Narikiyo","submitted_at":"2016-05-12T01:39:48Z","abstract_excerpt":"This paper proposes a new approach to analyze and synthesize robust consensus control laws for general linear leaderless multi-agent systems (MASs) subjected to input constraints or uncertainties. First, the MAS under input constraints or uncertainties is reformulated as a network of Lur'e systems. Next, two scenarios of communication topology are considered, namely undirected and directed cyclic structures. In each case, a sufficient condition for consensus and the design of consensus controller gain are derived from solutions of a distributed LMI convex problem. Finally, a numerical example "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03648","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:14:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S1LdS7K+LTQWkDztZ/BA7muR2BenKlgU5ZQVevbw5+1EkGboIoTAEtLdDyzaaMJIJNHgU93r6IpfFkffF3+WBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:18:03.262097Z"},"content_sha256":"670971bfd019f37d36619bb5c77f322af4d825d8c251873c110904f0166685c3","schema_version":"1.0","event_id":"sha256:670971bfd019f37d36619bb5c77f322af4d825d8c251873c110904f0166685c3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZMK3EACLUVL6OPSWOO7JHLDTWJ/bundle.json","state_url":"https://pith.science/pith/ZMK3EACLUVL6OPSWOO7JHLDTWJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZMK3EACLUVL6OPSWOO7JHLDTWJ/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-09T08:18:03Z","links":{"resolver":"https://pith.science/pith/ZMK3EACLUVL6OPSWOO7JHLDTWJ","bundle":"https://pith.science/pith/ZMK3EACLUVL6OPSWOO7JHLDTWJ/bundle.json","state":"https://pith.science/pith/ZMK3EACLUVL6OPSWOO7JHLDTWJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZMK3EACLUVL6OPSWOO7JHLDTWJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ZMK3EACLUVL6OPSWOO7JHLDTWJ","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":"9cc268f86f4a0cb8d3b97673869a705879a1f028c4715e74cdd5cae011c0db69","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-12T01:39:48Z","title_canon_sha256":"2bd7a38a60a04807f2643734efa7365d873d941f4c556f7140338d15627d3570"},"schema_version":"1.0","source":{"id":"1605.03648","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.03648","created_at":"2026-05-18T01:14:52Z"},{"alias_kind":"arxiv_version","alias_value":"1605.03648v1","created_at":"2026-05-18T01:14:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03648","created_at":"2026-05-18T01:14:52Z"},{"alias_kind":"pith_short_12","alias_value":"ZMK3EACLUVL6","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"ZMK3EACLUVL6OPSW","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"ZMK3EACL","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:670971bfd019f37d36619bb5c77f322af4d825d8c251873c110904f0166685c3","target":"graph","created_at":"2026-05-18T01:14:52Z","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 proposes a new approach to analyze and synthesize robust consensus control laws for general linear leaderless multi-agent systems (MASs) subjected to input constraints or uncertainties. First, the MAS under input constraints or uncertainties is reformulated as a network of Lur'e systems. Next, two scenarios of communication topology are considered, namely undirected and directed cyclic structures. In each case, a sufficient condition for consensus and the design of consensus controller gain are derived from solutions of a distributed LMI convex problem. Finally, a numerical example ","authors_text":"Dinh Hoa Nguyen, Michihiro Kawanishi, Tatsuo Narikiyo","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-12T01:39:48Z","title":"Robust Consensus of Linear Multi-Agent Systems under Input Constraints or Uncertainties"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03648","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:0268264ba74c209c2a68ce051353424722bdfc9ac304531f4efd4bd3b60047cb","target":"record","created_at":"2026-05-18T01:14:52Z","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":"9cc268f86f4a0cb8d3b97673869a705879a1f028c4715e74cdd5cae011c0db69","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-12T01:39:48Z","title_canon_sha256":"2bd7a38a60a04807f2643734efa7365d873d941f4c556f7140338d15627d3570"},"schema_version":"1.0","source":{"id":"1605.03648","kind":"arxiv","version":1}},"canonical_sha256":"cb15b2004ba557e73e5673be93ac73b264422cad27b2e132e413b71ebe94709e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cb15b2004ba557e73e5673be93ac73b264422cad27b2e132e413b71ebe94709e","first_computed_at":"2026-05-18T01:14:52.095134Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:52.095134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zvHhMYqqvEXy7EuXkujQy1b0Unq1lrLKzDo6KNF59yfD8nS1Z+QrtSCd0gSxXy4SgpbgRuNoF7eQtumnMV6zCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:52.095688Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.03648","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0268264ba74c209c2a68ce051353424722bdfc9ac304531f4efd4bd3b60047cb","sha256:670971bfd019f37d36619bb5c77f322af4d825d8c251873c110904f0166685c3"],"state_sha256":"d11d23841038f32019073654f4df247811cd28cc6e402b01053b5f71b6929c29"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S2ccD3OptuLANR/OroLyRIiW4qP7hc0enhIjk33s5oMZY5lExtSC794CRdJVyzjr0ZTZiIJfcqGcJYjpMw9IBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T08:18:03.266543Z","bundle_sha256":"2f1614cd22811dd282ec12d0160239843cfc74a53e21b667c4a2bedc550c4a44"}}