{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:7OYV2GZCMM5I3ZW7MZJMHMJP3Z","short_pith_number":"pith:7OYV2GZC","schema_version":"1.0","canonical_sha256":"fbb15d1b22633a8de6df6652c3b12fde6cfc1940b0724e50d87871368bc9483e","source":{"kind":"arxiv","id":"1312.7377","version":2},"attestation_state":"computed","paper":{"title":"Designing Fully Distributed Consensus Protocols for Linear Multi-agent Systems with Directed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Guanghui Wen, Wei Ren, Zhisheng Duan, Zhongkui Li","submitted_at":"2013-12-28T01:15:23Z","abstract_excerpt":"This paper addresses the distributed consensus protocol design problem for multi-agent systems with general linear dynamics and directed communication graphs. Existing works usually design consensus protocols using the smallest real part of the nonzero eigenvalues of the Laplacian matrix associated with the communication graph, which however is global information. In this paper, based on only the agent dynamics and the relative states of neighboring agents, a distributed adaptive consensus protocol is designed to achieve leader-follower consensus for any communication graph containing a direct"},"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":"1312.7377","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-12-28T01:15:23Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"0edb272a92d4c9e9fb16b568d0d65d48d70f8a2abc0e4ad47252db6b6a622b7c","abstract_canon_sha256":"e6fe5fafe5def76038e69586d39251ecbf06e02f9ebea99dd4caee24f4215a99"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:03.486812Z","signature_b64":"ALiv6DeVQcO66oMXmutEeB4XGXsBKIY/8OQXqygJvKhwc0qzu38zOnh5UFRWFgqLU+2Aboi6gGqFLoyAXWOiDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fbb15d1b22633a8de6df6652c3b12fde6cfc1940b0724e50d87871368bc9483e","last_reissued_at":"2026-05-18T00:59:03.486205Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:03.486205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Designing Fully Distributed Consensus Protocols for Linear Multi-agent Systems with Directed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Guanghui Wen, Wei Ren, Zhisheng Duan, Zhongkui Li","submitted_at":"2013-12-28T01:15:23Z","abstract_excerpt":"This paper addresses the distributed consensus protocol design problem for multi-agent systems with general linear dynamics and directed communication graphs. Existing works usually design consensus protocols using the smallest real part of the nonzero eigenvalues of the Laplacian matrix associated with the communication graph, which however is global information. In this paper, based on only the agent dynamics and the relative states of neighboring agents, a distributed adaptive consensus protocol is designed to achieve leader-follower consensus for any communication graph containing a direct"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.7377","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":"1312.7377","created_at":"2026-05-18T00:59:03.486304+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.7377v2","created_at":"2026-05-18T00:59:03.486304+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7377","created_at":"2026-05-18T00:59:03.486304+00:00"},{"alias_kind":"pith_short_12","alias_value":"7OYV2GZCMM5I","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"7OYV2GZCMM5I3ZW7","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"7OYV2GZC","created_at":"2026-05-18T12:27:36.564083+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/7OYV2GZCMM5I3ZW7MZJMHMJP3Z","json":"https://pith.science/pith/7OYV2GZCMM5I3ZW7MZJMHMJP3Z.json","graph_json":"https://pith.science/api/pith-number/7OYV2GZCMM5I3ZW7MZJMHMJP3Z/graph.json","events_json":"https://pith.science/api/pith-number/7OYV2GZCMM5I3ZW7MZJMHMJP3Z/events.json","paper":"https://pith.science/paper/7OYV2GZC"},"agent_actions":{"view_html":"https://pith.science/pith/7OYV2GZCMM5I3ZW7MZJMHMJP3Z","download_json":"https://pith.science/pith/7OYV2GZCMM5I3ZW7MZJMHMJP3Z.json","view_paper":"https://pith.science/paper/7OYV2GZC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.7377&json=true","fetch_graph":"https://pith.science/api/pith-number/7OYV2GZCMM5I3ZW7MZJMHMJP3Z/graph.json","fetch_events":"https://pith.science/api/pith-number/7OYV2GZCMM5I3ZW7MZJMHMJP3Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7OYV2GZCMM5I3ZW7MZJMHMJP3Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7OYV2GZCMM5I3ZW7MZJMHMJP3Z/action/storage_attestation","attest_author":"https://pith.science/pith/7OYV2GZCMM5I3ZW7MZJMHMJP3Z/action/author_attestation","sign_citation":"https://pith.science/pith/7OYV2GZCMM5I3ZW7MZJMHMJP3Z/action/citation_signature","submit_replication":"https://pith.science/pith/7OYV2GZCMM5I3ZW7MZJMHMJP3Z/action/replication_record"}},"created_at":"2026-05-18T00:59:03.486304+00:00","updated_at":"2026-05-18T00:59:03.486304+00:00"}