{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:GQDCGUZFTXLRJ5V5RHEWSKHCZ7","short_pith_number":"pith:GQDCGUZF","schema_version":"1.0","canonical_sha256":"34062353259dd714f6bd89c96928e2cfc732bbb79509c1cefb22d72529a2b733","source":{"kind":"arxiv","id":"1311.5220","version":2},"attestation_state":"computed","paper":{"title":"Convergence Tools for Consensus in Multi-Agent Systems with Switching Topologies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Johan Thunberg, Xiaoming Hu","submitted_at":"2013-11-20T12:17:18Z","abstract_excerpt":"We present two main theorems along the lines of Lyapunov's second method that guarantee asymptotic state consensus in multi-agent systems of agents in R^m with switching interconnection topologies. The two theorems complement each other in the sense that the first one is formulated in terms of the states of the agents in the multi-agent system, whereas the second one is formulated in terms of the pairwise states for each pair of agents in the multi-agent system. In the first theorem, under the assumption that the interconnection topology is uniformly strongly connected and the agents are conta"},"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":"1311.5220","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-11-20T12:17:18Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"f558d1ea7b3a46f7a25ddfe4b63baa90340a4490a2155f991d3e58b4d1ddc20d","abstract_canon_sha256":"6fe6176e1ab7a6848a6f6940fe7e8986dd5eccffa6931043345982a23131627b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:10.801506Z","signature_b64":"iZG264tSeoYpz9bqERFyOO8AuOw5XoEH0jNSUjWuPR35rS2fhjnrF8cqi9yaCSATKRxq6U6ChAJwZHAQ7pCHCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34062353259dd714f6bd89c96928e2cfc732bbb79509c1cefb22d72529a2b733","last_reissued_at":"2026-05-18T02:55:10.800923Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:10.800923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convergence Tools for Consensus in Multi-Agent Systems with Switching Topologies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Johan Thunberg, Xiaoming Hu","submitted_at":"2013-11-20T12:17:18Z","abstract_excerpt":"We present two main theorems along the lines of Lyapunov's second method that guarantee asymptotic state consensus in multi-agent systems of agents in R^m with switching interconnection topologies. The two theorems complement each other in the sense that the first one is formulated in terms of the states of the agents in the multi-agent system, whereas the second one is formulated in terms of the pairwise states for each pair of agents in the multi-agent system. In the first theorem, under the assumption that the interconnection topology is uniformly strongly connected and the agents are conta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.5220","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":"1311.5220","created_at":"2026-05-18T02:55:10.801021+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.5220v2","created_at":"2026-05-18T02:55:10.801021+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.5220","created_at":"2026-05-18T02:55:10.801021+00:00"},{"alias_kind":"pith_short_12","alias_value":"GQDCGUZFTXLR","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"GQDCGUZFTXLRJ5V5","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"GQDCGUZF","created_at":"2026-05-18T12:27:45.050594+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/GQDCGUZFTXLRJ5V5RHEWSKHCZ7","json":"https://pith.science/pith/GQDCGUZFTXLRJ5V5RHEWSKHCZ7.json","graph_json":"https://pith.science/api/pith-number/GQDCGUZFTXLRJ5V5RHEWSKHCZ7/graph.json","events_json":"https://pith.science/api/pith-number/GQDCGUZFTXLRJ5V5RHEWSKHCZ7/events.json","paper":"https://pith.science/paper/GQDCGUZF"},"agent_actions":{"view_html":"https://pith.science/pith/GQDCGUZFTXLRJ5V5RHEWSKHCZ7","download_json":"https://pith.science/pith/GQDCGUZFTXLRJ5V5RHEWSKHCZ7.json","view_paper":"https://pith.science/paper/GQDCGUZF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.5220&json=true","fetch_graph":"https://pith.science/api/pith-number/GQDCGUZFTXLRJ5V5RHEWSKHCZ7/graph.json","fetch_events":"https://pith.science/api/pith-number/GQDCGUZFTXLRJ5V5RHEWSKHCZ7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GQDCGUZFTXLRJ5V5RHEWSKHCZ7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GQDCGUZFTXLRJ5V5RHEWSKHCZ7/action/storage_attestation","attest_author":"https://pith.science/pith/GQDCGUZFTXLRJ5V5RHEWSKHCZ7/action/author_attestation","sign_citation":"https://pith.science/pith/GQDCGUZFTXLRJ5V5RHEWSKHCZ7/action/citation_signature","submit_replication":"https://pith.science/pith/GQDCGUZFTXLRJ5V5RHEWSKHCZ7/action/replication_record"}},"created_at":"2026-05-18T02:55:10.801021+00:00","updated_at":"2026-05-18T02:55:10.801021+00:00"}