{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:KVMCW3CNHGCRLXEFKXPVJFGWEX","short_pith_number":"pith:KVMCW3CN","schema_version":"1.0","canonical_sha256":"55582b6c4d398515dc8555df5494d625d22f973b15c0739944780e7ea6637f68","source":{"kind":"arxiv","id":"1605.07761","version":2},"attestation_state":"computed","paper":{"title":"Designing Distributed Fixed-Time Consensus Protocols for Linear Multi-Agent Systems Over Directed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.SY","authors_text":"Guanrong Chen, Yongfang Liu, Yu Zhao","submitted_at":"2016-05-25T07:37:13Z","abstract_excerpt":"This technical note addresses the distributed fixed-time consensus protocol design problem for multi-agent systems with general linear dynamics over directed communication graphs. By using motion planning approaches, a class of distributed fixed-time consensus algorithms are developed, which rely only on the sampling information at some sampling instants. For linear multi-agent systems, the proposed algorithms solve the fixed-time consensus problem for any directed graph containing a directed spanning tree. In particular, the settling time can be off-line pre-assigned according to task require"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1605.07761","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-05-25T07:37:13Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"cbff17a6180d676e4bc3de1f8fd22e404173f33b8e60b7f5be88af9c90154763","abstract_canon_sha256":"f9af197d8e78ca0b24b8a5b906ebe6faef76911dc34d6bfad3e7012395e8e245"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:37.338533Z","signature_b64":"3IQkiURWg2u3STbFEq8xm5ALAT2Fn9h16484egT3dl3AURAbZxSGG7l1rsPOWwPNJGlnYf0+Gdhdi6epiTJUAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55582b6c4d398515dc8555df5494d625d22f973b15c0739944780e7ea6637f68","last_reissued_at":"2026-05-18T01:13:37.337686Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:37.337686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Designing Distributed Fixed-Time Consensus Protocols for Linear Multi-Agent Systems Over Directed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.SY","authors_text":"Guanrong Chen, Yongfang Liu, Yu Zhao","submitted_at":"2016-05-25T07:37:13Z","abstract_excerpt":"This technical note addresses the distributed fixed-time consensus protocol design problem for multi-agent systems with general linear dynamics over directed communication graphs. By using motion planning approaches, a class of distributed fixed-time consensus algorithms are developed, which rely only on the sampling information at some sampling instants. For linear multi-agent systems, the proposed algorithms solve the fixed-time consensus problem for any directed graph containing a directed spanning tree. In particular, the settling time can be off-line pre-assigned according to task require"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07761","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1605.07761","created_at":"2026-05-18T01:13:37.337813+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.07761v2","created_at":"2026-05-18T01:13:37.337813+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07761","created_at":"2026-05-18T01:13:37.337813+00:00"},{"alias_kind":"pith_short_12","alias_value":"KVMCW3CNHGCR","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"KVMCW3CNHGCRLXEF","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"KVMCW3CN","created_at":"2026-05-18T12:30:29.479603+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KVMCW3CNHGCRLXEFKXPVJFGWEX","json":"https://pith.science/pith/KVMCW3CNHGCRLXEFKXPVJFGWEX.json","graph_json":"https://pith.science/api/pith-number/KVMCW3CNHGCRLXEFKXPVJFGWEX/graph.json","events_json":"https://pith.science/api/pith-number/KVMCW3CNHGCRLXEFKXPVJFGWEX/events.json","paper":"https://pith.science/paper/KVMCW3CN"},"agent_actions":{"view_html":"https://pith.science/pith/KVMCW3CNHGCRLXEFKXPVJFGWEX","download_json":"https://pith.science/pith/KVMCW3CNHGCRLXEFKXPVJFGWEX.json","view_paper":"https://pith.science/paper/KVMCW3CN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.07761&json=true","fetch_graph":"https://pith.science/api/pith-number/KVMCW3CNHGCRLXEFKXPVJFGWEX/graph.json","fetch_events":"https://pith.science/api/pith-number/KVMCW3CNHGCRLXEFKXPVJFGWEX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KVMCW3CNHGCRLXEFKXPVJFGWEX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KVMCW3CNHGCRLXEFKXPVJFGWEX/action/storage_attestation","attest_author":"https://pith.science/pith/KVMCW3CNHGCRLXEFKXPVJFGWEX/action/author_attestation","sign_citation":"https://pith.science/pith/KVMCW3CNHGCRLXEFKXPVJFGWEX/action/citation_signature","submit_replication":"https://pith.science/pith/KVMCW3CNHGCRLXEFKXPVJFGWEX/action/replication_record"}},"created_at":"2026-05-18T01:13:37.337813+00:00","updated_at":"2026-05-18T01:13:37.337813+00:00"}