{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FFWM2N7LUXE255GLQD5VF4PRBC","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":"a4e5fbad7901a0ad5e43c31115dea4e8afcb5df53f9e4dfc807fd7e78568d7b9","cross_cats_sorted":["cs.MA","cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2018-10-31T20:53:01Z","title_canon_sha256":"b608f6f5281d7cf67d375ebd8844af00e46e6d1c716587e9063374c810e81d1b"},"schema_version":"1.0","source":{"id":"1811.00111","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.00111","created_at":"2026-06-04T20:13:38Z"},{"alias_kind":"arxiv_version","alias_value":"1811.00111v2","created_at":"2026-06-04T20:13:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.00111","created_at":"2026-06-04T20:13:38Z"},{"alias_kind":"pith_short_12","alias_value":"FFWM2N7LUXE2","created_at":"2026-06-04T20:13:38Z"},{"alias_kind":"pith_short_16","alias_value":"FFWM2N7LUXE255GL","created_at":"2026-06-04T20:13:38Z"},{"alias_kind":"pith_short_8","alias_value":"FFWM2N7L","created_at":"2026-06-04T20:13:38Z"}],"graph_snapshots":[{"event_id":"sha256:83dd4fb9f5e47ac75a455a19210e19d4c88d1c91a386c68eb9872ed2a87f0ab0","target":"graph","created_at":"2026-06-04T20:13:38Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1811.00111/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The aim of this paper is to analyze a class of consensus algorithms with finite-time or fixed-time convergence for dynamic networks formed by agents with first-order dynamics. In particular, in the analyzed class a single evaluation of a nonlinear function of the consensus error is performed per each node. The classical assumption of switching among connected graphs is dropped here, allowing to represent failures and intermittent communications between agents. Thus, conditions to guarantee finite and fixed-time convergence, even while switching among disconnected graphs, are provided. Moreover","authors_text":"Carlos Renato V\\'azquez, David G\\'omez-Guti\\'errez, Javier Ruiz Le\\'on, Juan Diego S\\'anchez-Torres, Sergej \\v{C}elikovsk\\'y","cross_cats":["cs.MA","cs.SY","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2018-10-31T20:53:01Z","title":"On finite-time and fixed-time consensus algorithms for dynamic networks switching among disconnected digraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.00111","kind":"arxiv","version":2},"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:213ea3dea7ffbe2e87bbe9a9c83efbf7ded2338f1ecf2685a26b03bf56bc4815","target":"record","created_at":"2026-06-04T20:13:38Z","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":"a4e5fbad7901a0ad5e43c31115dea4e8afcb5df53f9e4dfc807fd7e78568d7b9","cross_cats_sorted":["cs.MA","cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2018-10-31T20:53:01Z","title_canon_sha256":"b608f6f5281d7cf67d375ebd8844af00e46e6d1c716587e9063374c810e81d1b"},"schema_version":"1.0","source":{"id":"1811.00111","kind":"arxiv","version":2}},"canonical_sha256":"296ccd37eba5c9aef4cb80fb52f1f108853ae8683e48093c6e1b0ff5f740c5ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"296ccd37eba5c9aef4cb80fb52f1f108853ae8683e48093c6e1b0ff5f740c5ac","first_computed_at":"2026-06-04T20:13:38.711538Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-04T20:13:38.711538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oqOPu+HK4JY1T72UELO4+RVVseO0mcUVlysTi3n3A0mQxizTArAGc1unypjZoxRkw1YHcTKsC11JC+Ynz5iKDg==","signature_status":"signed_v1","signed_at":"2026-06-04T20:13:38.712044Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.00111","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:213ea3dea7ffbe2e87bbe9a9c83efbf7ded2338f1ecf2685a26b03bf56bc4815","sha256:83dd4fb9f5e47ac75a455a19210e19d4c88d1c91a386c68eb9872ed2a87f0ab0"],"state_sha256":"e93662a18998beaf215a99d7cd09eafc3aaeaf61bba42b7a0e08fa0cc4158300"}