{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:JGXFXO6JZFZGRONY4XFC7VINH6","short_pith_number":"pith:JGXFXO6J","canonical_record":{"source":{"id":"1406.5622","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-06-21T14:50:30Z","cross_cats_sorted":[],"title_canon_sha256":"02df0061a52b06f36eaec5f62f19103ac494cf51ee2e6178195a1c4c9685cb7f","abstract_canon_sha256":"3200d7f49562f6a68341db4c39c8453e3f8ee02476a4a5ea176876f466cd1063"},"schema_version":"1.0"},"canonical_sha256":"49ae5bbbc9c97268b9b8e5ca2fd50d3fb97178a4fc0567675b50abc286a0f813","source":{"kind":"arxiv","id":"1406.5622","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.5622","created_at":"2026-05-18T02:37:44Z"},{"alias_kind":"arxiv_version","alias_value":"1406.5622v1","created_at":"2026-05-18T02:37:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.5622","created_at":"2026-05-18T02:37:44Z"},{"alias_kind":"pith_short_12","alias_value":"JGXFXO6JZFZG","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"JGXFXO6JZFZGRONY","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"JGXFXO6J","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:JGXFXO6JZFZGRONY4XFC7VINH6","target":"record","payload":{"canonical_record":{"source":{"id":"1406.5622","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-06-21T14:50:30Z","cross_cats_sorted":[],"title_canon_sha256":"02df0061a52b06f36eaec5f62f19103ac494cf51ee2e6178195a1c4c9685cb7f","abstract_canon_sha256":"3200d7f49562f6a68341db4c39c8453e3f8ee02476a4a5ea176876f466cd1063"},"schema_version":"1.0"},"canonical_sha256":"49ae5bbbc9c97268b9b8e5ca2fd50d3fb97178a4fc0567675b50abc286a0f813","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:37:44.477009Z","signature_b64":"GKgNYJXBfaucqIPKwbL/7ELfrJFDhoDxCiShlLEs3PX6cYNENnV6loWlKjCJBHizepVWo4k3jpOeJJqTDSNYBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49ae5bbbc9c97268b9b8e5ca2fd50d3fb97178a4fc0567675b50abc286a0f813","last_reissued_at":"2026-05-18T02:37:44.476576Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:37:44.476576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.5622","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-18T02:37:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L6yhpVHtfRwcyWF7CkZwZES23LI14qLZ2Udv2346YmzooCiY1DJwfG0LSww6nbVhWHxiv1RTQvMJh52YSE+TDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:15:06.954116Z"},"content_sha256":"46e307313f8fefecb593d16c71ab3f41b2d5e022036ee02f952dbcbbeaa1160c","schema_version":"1.0","event_id":"sha256:46e307313f8fefecb593d16c71ab3f41b2d5e022036ee02f952dbcbbeaa1160c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:JGXFXO6JZFZGRONY4XFC7VINH6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Gain-scheduled synchronization of parameter varying systems via relative $H_\\infty$ consensus with application to synchronization of uncertain bilinear systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"V. Ugrinovskii","submitted_at":"2014-06-21T14:50:30Z","abstract_excerpt":"The paper considers a problem of consensus-based synchronization of uncertain parameter varying multi-agent systems. We present a method for constructing consensus-based synchronization protocol schedules for each agent to ensure it synchronizes with a reference parameter-varying system. The proposed protocol guarantees a specified level of $H_\\infty$ transient consensus between the agents. The algorithm uses a consensus-preserving interpolation and produces continuous (in the scheduling parameter) coefficients for the protocol. An application to synchronization of uncertain bilinear systems i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.5622","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-18T02:37:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"swiSXX1xvVhdNoOVxA6ysj0HMUAVYnV1P9RPFNDMXGmKqLj1FrFkDTvNEI87o4d4erYanHNGIu3kRNNZeNOvCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:15:06.954492Z"},"content_sha256":"66f4741cf6c13f14a1ed0aa2b61c767224cbd1ef5736dadf93e462814d4ace23","schema_version":"1.0","event_id":"sha256:66f4741cf6c13f14a1ed0aa2b61c767224cbd1ef5736dadf93e462814d4ace23"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JGXFXO6JZFZGRONY4XFC7VINH6/bundle.json","state_url":"https://pith.science/pith/JGXFXO6JZFZGRONY4XFC7VINH6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JGXFXO6JZFZGRONY4XFC7VINH6/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-27T14:15:06Z","links":{"resolver":"https://pith.science/pith/JGXFXO6JZFZGRONY4XFC7VINH6","bundle":"https://pith.science/pith/JGXFXO6JZFZGRONY4XFC7VINH6/bundle.json","state":"https://pith.science/pith/JGXFXO6JZFZGRONY4XFC7VINH6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JGXFXO6JZFZGRONY4XFC7VINH6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:JGXFXO6JZFZGRONY4XFC7VINH6","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":"3200d7f49562f6a68341db4c39c8453e3f8ee02476a4a5ea176876f466cd1063","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-06-21T14:50:30Z","title_canon_sha256":"02df0061a52b06f36eaec5f62f19103ac494cf51ee2e6178195a1c4c9685cb7f"},"schema_version":"1.0","source":{"id":"1406.5622","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.5622","created_at":"2026-05-18T02:37:44Z"},{"alias_kind":"arxiv_version","alias_value":"1406.5622v1","created_at":"2026-05-18T02:37:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.5622","created_at":"2026-05-18T02:37:44Z"},{"alias_kind":"pith_short_12","alias_value":"JGXFXO6JZFZG","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"JGXFXO6JZFZGRONY","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"JGXFXO6J","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:66f4741cf6c13f14a1ed0aa2b61c767224cbd1ef5736dadf93e462814d4ace23","target":"graph","created_at":"2026-05-18T02:37:44Z","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":"The paper considers a problem of consensus-based synchronization of uncertain parameter varying multi-agent systems. We present a method for constructing consensus-based synchronization protocol schedules for each agent to ensure it synchronizes with a reference parameter-varying system. The proposed protocol guarantees a specified level of $H_\\infty$ transient consensus between the agents. The algorithm uses a consensus-preserving interpolation and produces continuous (in the scheduling parameter) coefficients for the protocol. An application to synchronization of uncertain bilinear systems i","authors_text":"V. Ugrinovskii","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-06-21T14:50:30Z","title":"Gain-scheduled synchronization of parameter varying systems via relative $H_\\infty$ consensus with application to synchronization of uncertain bilinear systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.5622","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:46e307313f8fefecb593d16c71ab3f41b2d5e022036ee02f952dbcbbeaa1160c","target":"record","created_at":"2026-05-18T02:37:44Z","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":"3200d7f49562f6a68341db4c39c8453e3f8ee02476a4a5ea176876f466cd1063","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-06-21T14:50:30Z","title_canon_sha256":"02df0061a52b06f36eaec5f62f19103ac494cf51ee2e6178195a1c4c9685cb7f"},"schema_version":"1.0","source":{"id":"1406.5622","kind":"arxiv","version":1}},"canonical_sha256":"49ae5bbbc9c97268b9b8e5ca2fd50d3fb97178a4fc0567675b50abc286a0f813","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"49ae5bbbc9c97268b9b8e5ca2fd50d3fb97178a4fc0567675b50abc286a0f813","first_computed_at":"2026-05-18T02:37:44.476576Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:37:44.476576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GKgNYJXBfaucqIPKwbL/7ELfrJFDhoDxCiShlLEs3PX6cYNENnV6loWlKjCJBHizepVWo4k3jpOeJJqTDSNYBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:37:44.477009Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.5622","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:46e307313f8fefecb593d16c71ab3f41b2d5e022036ee02f952dbcbbeaa1160c","sha256:66f4741cf6c13f14a1ed0aa2b61c767224cbd1ef5736dadf93e462814d4ace23"],"state_sha256":"aba5b3409169dac71ed15362c603c22cd9da3c4aa04db6b625c88a8f3fae60ea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T7wup8cABnWfJO+qYE3mLCgFx5PN4K6Hya85WbuWEh98nEngCuXJoCUOhypzwKeEWY1MHpRXy1H0pdyi8Ws8AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T14:15:06.956977Z","bundle_sha256":"aee4ac132d75477c19521c347cffb8af122ba0fb7e92da1f33f583c8319ff0e0"}}