{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:37DVDBNLFLHMBWSHJJBOQSOFUW","short_pith_number":"pith:37DVDBNL","canonical_record":{"source":{"id":"1605.03647","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-12T01:31:29Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"af948941afa89e7b66480aae51f70b64d07e6620e10838d5f700df00fcd054d6","abstract_canon_sha256":"e364b5704ef40549ad820c65f99ee97cebdee8e10299beb974533447d7a89143"},"schema_version":"1.0"},"canonical_sha256":"dfc75185ab2acec0da474a42e849c5a5aefd2f3e5325e5a1d97a26d683f247ad","source":{"kind":"arxiv","id":"1605.03647","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.03647","created_at":"2026-05-18T01:15:00Z"},{"alias_kind":"arxiv_version","alias_value":"1605.03647v1","created_at":"2026-05-18T01:15:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03647","created_at":"2026-05-18T01:15:00Z"},{"alias_kind":"pith_short_12","alias_value":"37DVDBNLFLHM","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"37DVDBNLFLHMBWSH","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"37DVDBNL","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:37DVDBNLFLHMBWSHJJBOQSOFUW","target":"record","payload":{"canonical_record":{"source":{"id":"1605.03647","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-12T01:31:29Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"af948941afa89e7b66480aae51f70b64d07e6620e10838d5f700df00fcd054d6","abstract_canon_sha256":"e364b5704ef40549ad820c65f99ee97cebdee8e10299beb974533447d7a89143"},"schema_version":"1.0"},"canonical_sha256":"dfc75185ab2acec0da474a42e849c5a5aefd2f3e5325e5a1d97a26d683f247ad","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:00.740031Z","signature_b64":"yHY54+IiUZFPCnjhqANpF5laKYd2kgcHZ3lYw7kgiYjmDRVXs151nxH729TeeklBEVy/OmdVOi1tuSgo4Rd+CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dfc75185ab2acec0da474a42e849c5a5aefd2f3e5325e5a1d97a26d683f247ad","last_reissued_at":"2026-05-18T01:15:00.739643Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:00.739643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.03647","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:15:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"58hwgV9bHXM0K8E/8hiFGrsJuHYmktFZ8qbQfpASSPL74wcJcP2mTwtkeGqpsx0woj+PipAqeEawizKTpYXqDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T02:05:31.106602Z"},"content_sha256":"2510000b15256c394dd514db1de1c38d8b1b8b25c6b5aa3de2aaa1b73c874181","schema_version":"1.0","event_id":"sha256:2510000b15256c394dd514db1de1c38d8b1b8b25c6b5aa3de2aaa1b73c874181"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:37DVDBNLFLHMBWSHJJBOQSOFUW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Consensus Analysis and Design under Relative State 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:31:29Z","abstract_excerpt":"This paper proposes a new approach to analyze and design distributed robust consensus control protocols for general linear leaderless multi-agent systems (MASs) in presence of relative-state constraints or uncertainties. First, we show that the MAS robust consensus under relative-state constraints or uncertainties is equivalent to the robust stability under state constraints or uncertainties of a transformed MAS. Next, the transformed MAS under state constraints or uncertainties is reformulated as a network of Lur'e systems. By employing S-procedure, Lyapunov theory, and Lasalle's invariance p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03647","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:15:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0WIyk25eHrRdRt2urj+fh/jt3UU967ZKUcTzd7HTzB41IpxPQ1rqx3kyyVb+jukUrg0sS9FmfjJeFU4gUe+hAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T02:05:31.107296Z"},"content_sha256":"01adf77068a1313ee5a5d3a8558e654f1647842bb2c8c57aaaa9d3f48a45ab9b","schema_version":"1.0","event_id":"sha256:01adf77068a1313ee5a5d3a8558e654f1647842bb2c8c57aaaa9d3f48a45ab9b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/37DVDBNLFLHMBWSHJJBOQSOFUW/bundle.json","state_url":"https://pith.science/pith/37DVDBNLFLHMBWSHJJBOQSOFUW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/37DVDBNLFLHMBWSHJJBOQSOFUW/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-09T02:05:31Z","links":{"resolver":"https://pith.science/pith/37DVDBNLFLHMBWSHJJBOQSOFUW","bundle":"https://pith.science/pith/37DVDBNLFLHMBWSHJJBOQSOFUW/bundle.json","state":"https://pith.science/pith/37DVDBNLFLHMBWSHJJBOQSOFUW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/37DVDBNLFLHMBWSHJJBOQSOFUW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:37DVDBNLFLHMBWSHJJBOQSOFUW","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":"e364b5704ef40549ad820c65f99ee97cebdee8e10299beb974533447d7a89143","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-12T01:31:29Z","title_canon_sha256":"af948941afa89e7b66480aae51f70b64d07e6620e10838d5f700df00fcd054d6"},"schema_version":"1.0","source":{"id":"1605.03647","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.03647","created_at":"2026-05-18T01:15:00Z"},{"alias_kind":"arxiv_version","alias_value":"1605.03647v1","created_at":"2026-05-18T01:15:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03647","created_at":"2026-05-18T01:15:00Z"},{"alias_kind":"pith_short_12","alias_value":"37DVDBNLFLHM","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"37DVDBNLFLHMBWSH","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"37DVDBNL","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:01adf77068a1313ee5a5d3a8558e654f1647842bb2c8c57aaaa9d3f48a45ab9b","target":"graph","created_at":"2026-05-18T01:15:00Z","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 design distributed robust consensus control protocols for general linear leaderless multi-agent systems (MASs) in presence of relative-state constraints or uncertainties. First, we show that the MAS robust consensus under relative-state constraints or uncertainties is equivalent to the robust stability under state constraints or uncertainties of a transformed MAS. Next, the transformed MAS under state constraints or uncertainties is reformulated as a network of Lur'e systems. By employing S-procedure, Lyapunov theory, and Lasalle's invariance p","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:31:29Z","title":"Robust Consensus Analysis and Design under Relative State Constraints or Uncertainties"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03647","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:2510000b15256c394dd514db1de1c38d8b1b8b25c6b5aa3de2aaa1b73c874181","target":"record","created_at":"2026-05-18T01:15:00Z","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":"e364b5704ef40549ad820c65f99ee97cebdee8e10299beb974533447d7a89143","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-12T01:31:29Z","title_canon_sha256":"af948941afa89e7b66480aae51f70b64d07e6620e10838d5f700df00fcd054d6"},"schema_version":"1.0","source":{"id":"1605.03647","kind":"arxiv","version":1}},"canonical_sha256":"dfc75185ab2acec0da474a42e849c5a5aefd2f3e5325e5a1d97a26d683f247ad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dfc75185ab2acec0da474a42e849c5a5aefd2f3e5325e5a1d97a26d683f247ad","first_computed_at":"2026-05-18T01:15:00.739643Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:00.739643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yHY54+IiUZFPCnjhqANpF5laKYd2kgcHZ3lYw7kgiYjmDRVXs151nxH729TeeklBEVy/OmdVOi1tuSgo4Rd+CA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:00.740031Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.03647","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2510000b15256c394dd514db1de1c38d8b1b8b25c6b5aa3de2aaa1b73c874181","sha256:01adf77068a1313ee5a5d3a8558e654f1647842bb2c8c57aaaa9d3f48a45ab9b"],"state_sha256":"14c7429b06380e199c6b0e0cd72a079c71c19ecf84faab399e54e04e4b92a426"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LqmxA1bUxEiNdDLsXWhJ1Pzs8BKtGSrqjuw7aN7UbtyEbV354749dBWWzGVy/5GGjCcC608NTpRuNCb16kDZBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T02:05:31.111391Z","bundle_sha256":"2dfae436496438e0d725e5779c0dabfa49ebf0ead06b86c42b9ee2773a3fe472"}}