{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:T65FPMFSR7YPI3BAA5DHXHTTRW","short_pith_number":"pith:T65FPMFS","canonical_record":{"source":{"id":"1202.5447","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2012-02-24T13:24:38Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"7e5fa7bb3311afe0532147af171943413e6aa5d521e9aa90bf79c293f1f4a6b9","abstract_canon_sha256":"72fb74ee2a6fb2f86e5ef5ffeb99a4c5e09ca2cdee0dddeeeb6b6b046c01579d"},"schema_version":"1.0"},"canonical_sha256":"9fba57b0b28ff0f46c2007467b9e738daf4493fda3cdec6e3eb0a8d770bb9319","source":{"kind":"arxiv","id":"1202.5447","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.5447","created_at":"2026-05-18T04:01:37Z"},{"alias_kind":"arxiv_version","alias_value":"1202.5447v1","created_at":"2026-05-18T04:01:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.5447","created_at":"2026-05-18T04:01:37Z"},{"alias_kind":"pith_short_12","alias_value":"T65FPMFSR7YP","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"T65FPMFSR7YPI3BA","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"T65FPMFS","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:T65FPMFSR7YPI3BAA5DHXHTTRW","target":"record","payload":{"canonical_record":{"source":{"id":"1202.5447","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2012-02-24T13:24:38Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"7e5fa7bb3311afe0532147af171943413e6aa5d521e9aa90bf79c293f1f4a6b9","abstract_canon_sha256":"72fb74ee2a6fb2f86e5ef5ffeb99a4c5e09ca2cdee0dddeeeb6b6b046c01579d"},"schema_version":"1.0"},"canonical_sha256":"9fba57b0b28ff0f46c2007467b9e738daf4493fda3cdec6e3eb0a8d770bb9319","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:37.129670Z","signature_b64":"jjCogS7+bn52om8H8Kdyig3+n9L6+Lr6F1gzZsSezwEWTQQrB5vMJ0nzyBXBSxN9Ewle6/i+8MaWU1CulHvJDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9fba57b0b28ff0f46c2007467b9e738daf4493fda3cdec6e3eb0a8d770bb9319","last_reissued_at":"2026-05-18T04:01:37.129054Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:37.129054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.5447","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-18T04:01:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DlbHBAlN+wQwKnzCbz9aZZLq95GLQaRUj//hSB6HYEHq3UXArY8zg03HmgEfGqyVLorfSmMAwvc3kPlOOcVjCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:08:20.633625Z"},"content_sha256":"435f5d91944d4072930ad68020fff66c6b212ff84ff26ad6d89776918d48b7b2","schema_version":"1.0","event_id":"sha256:435f5d91944d4072930ad68020fff66c6b212ff84ff26ad6d89776918d48b7b2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:T65FPMFSR7YPI3BAA5DHXHTTRW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Global $H_\\infty$ Consensus of Multi-Agent Systems with Lipschitz Nonlinear Dynamics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Lihua Xie, Mengyin Fu, Xiangdong Liu, Zhongkui Li","submitted_at":"2012-02-24T13:24:38Z","abstract_excerpt":"This paper addresses the global consensus problems of a class of nonlinear multi-agent systems with Lipschitz nonlinearity and directed communication graphs, by using a distributed consensus protocol based on the relative states of neighboring agents. A two-step algorithm is presented to construct a protocol, under which a Lipschitz multi-agent system without disturbances can reach global consensus for a strongly connected directed communication graph. Another algorithm is then given to design a protocol which can achieve global consensus with a guaranteed $H_\\infty$ performance for a Lipschit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.5447","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-18T04:01:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iTH+qj7L9vdwDVjeNbPlWEG2fj6eAuwSUfnww97ze8cChNBVX0IxDqm0mgMf0PZznsLB/IXTbn3JZH6ePbheAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:08:20.634291Z"},"content_sha256":"f81ba762db447e48e6be66f4e4b8c53eb31a1ba5bd4a711e28304c6a290d33f0","schema_version":"1.0","event_id":"sha256:f81ba762db447e48e6be66f4e4b8c53eb31a1ba5bd4a711e28304c6a290d33f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T65FPMFSR7YPI3BAA5DHXHTTRW/bundle.json","state_url":"https://pith.science/pith/T65FPMFSR7YPI3BAA5DHXHTTRW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T65FPMFSR7YPI3BAA5DHXHTTRW/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-05-27T02:08:20Z","links":{"resolver":"https://pith.science/pith/T65FPMFSR7YPI3BAA5DHXHTTRW","bundle":"https://pith.science/pith/T65FPMFSR7YPI3BAA5DHXHTTRW/bundle.json","state":"https://pith.science/pith/T65FPMFSR7YPI3BAA5DHXHTTRW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T65FPMFSR7YPI3BAA5DHXHTTRW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:T65FPMFSR7YPI3BAA5DHXHTTRW","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":"72fb74ee2a6fb2f86e5ef5ffeb99a4c5e09ca2cdee0dddeeeb6b6b046c01579d","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2012-02-24T13:24:38Z","title_canon_sha256":"7e5fa7bb3311afe0532147af171943413e6aa5d521e9aa90bf79c293f1f4a6b9"},"schema_version":"1.0","source":{"id":"1202.5447","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.5447","created_at":"2026-05-18T04:01:37Z"},{"alias_kind":"arxiv_version","alias_value":"1202.5447v1","created_at":"2026-05-18T04:01:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.5447","created_at":"2026-05-18T04:01:37Z"},{"alias_kind":"pith_short_12","alias_value":"T65FPMFSR7YP","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"T65FPMFSR7YPI3BA","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"T65FPMFS","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:f81ba762db447e48e6be66f4e4b8c53eb31a1ba5bd4a711e28304c6a290d33f0","target":"graph","created_at":"2026-05-18T04:01:37Z","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 addresses the global consensus problems of a class of nonlinear multi-agent systems with Lipschitz nonlinearity and directed communication graphs, by using a distributed consensus protocol based on the relative states of neighboring agents. A two-step algorithm is presented to construct a protocol, under which a Lipschitz multi-agent system without disturbances can reach global consensus for a strongly connected directed communication graph. Another algorithm is then given to design a protocol which can achieve global consensus with a guaranteed $H_\\infty$ performance for a Lipschit","authors_text":"Lihua Xie, Mengyin Fu, Xiangdong Liu, Zhongkui Li","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2012-02-24T13:24:38Z","title":"Global $H_\\infty$ Consensus of Multi-Agent Systems with Lipschitz Nonlinear Dynamics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.5447","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:435f5d91944d4072930ad68020fff66c6b212ff84ff26ad6d89776918d48b7b2","target":"record","created_at":"2026-05-18T04:01:37Z","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":"72fb74ee2a6fb2f86e5ef5ffeb99a4c5e09ca2cdee0dddeeeb6b6b046c01579d","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2012-02-24T13:24:38Z","title_canon_sha256":"7e5fa7bb3311afe0532147af171943413e6aa5d521e9aa90bf79c293f1f4a6b9"},"schema_version":"1.0","source":{"id":"1202.5447","kind":"arxiv","version":1}},"canonical_sha256":"9fba57b0b28ff0f46c2007467b9e738daf4493fda3cdec6e3eb0a8d770bb9319","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9fba57b0b28ff0f46c2007467b9e738daf4493fda3cdec6e3eb0a8d770bb9319","first_computed_at":"2026-05-18T04:01:37.129054Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:01:37.129054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jjCogS7+bn52om8H8Kdyig3+n9L6+Lr6F1gzZsSezwEWTQQrB5vMJ0nzyBXBSxN9Ewle6/i+8MaWU1CulHvJDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:01:37.129670Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.5447","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:435f5d91944d4072930ad68020fff66c6b212ff84ff26ad6d89776918d48b7b2","sha256:f81ba762db447e48e6be66f4e4b8c53eb31a1ba5bd4a711e28304c6a290d33f0"],"state_sha256":"41db0813b0687c6e1f66f5ad649bdda1796643f532668aa1d4821c88f9a109e1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rz8kGJHXoEkwtHHzVWWF0ygvQuIK9fWQY+304d6F/SoQuOS/tHIqPh5itQR6uCupAUrAlJkU8oGRHxPsVljPCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T02:08:20.637842Z","bundle_sha256":"75db3020d1bfdb288002fa9504e43242a8d80b204c9277dcbdde831a6022e237"}}