{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:LCRHCU7JWBPZMQ55RICF2VVK4H","short_pith_number":"pith:LCRHCU7J","schema_version":"1.0","canonical_sha256":"58a27153e9b05f9643bd8a045d56aae1cea8c60102a1426a6fac097d59b74aba","source":{"kind":"arxiv","id":"1411.4186","version":7},"attestation_state":"computed","paper":{"title":"Linear Time Average Consensus on Fixed Graphs and Implications for Decentralized Optimization and Multi-Agent Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.SY"],"primary_cat":"math.OC","authors_text":"Alex Olshevsky","submitted_at":"2014-11-15T21:02:08Z","abstract_excerpt":"We describe a protocol for the average consensus problem on any fixed undirected graph whose convergence time scales linearly in the total number nodes $n$. The protocol is completely distributed, with the exception of requiring all nodes to know the same upper bound $U$ on the total number of nodes which is correct within a constant multiplicative factor.\n  We next discuss applications of this protocol to problems in multi-agent control connected to the consensus problem. In particular, we describe protocols for formation maintenance and leader-following with convergence times which also scal"},"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":"1411.4186","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-11-15T21:02:08Z","cross_cats_sorted":["cs.DC","cs.SY"],"title_canon_sha256":"ec4d1f56205a3e757cd95491910220ce81824c9fa814fc0543012623a53cff6b","abstract_canon_sha256":"605302b27bbe9c2a26db33cb05bfd2d8ff190902f540daf30481a08f908f8813"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:40.215350Z","signature_b64":"VKVEH9cNJtFH4VoZv8DzvksbzVP320RqeyLgRBzgxO6VqJ/XSYoJGQ1U/uRXvNXd2qDLUNhgIAu8rh/HFEQkDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58a27153e9b05f9643bd8a045d56aae1cea8c60102a1426a6fac097d59b74aba","last_reissued_at":"2026-05-18T00:38:40.214725Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:40.214725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear Time Average Consensus on Fixed Graphs and Implications for Decentralized Optimization and Multi-Agent Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.SY"],"primary_cat":"math.OC","authors_text":"Alex Olshevsky","submitted_at":"2014-11-15T21:02:08Z","abstract_excerpt":"We describe a protocol for the average consensus problem on any fixed undirected graph whose convergence time scales linearly in the total number nodes $n$. The protocol is completely distributed, with the exception of requiring all nodes to know the same upper bound $U$ on the total number of nodes which is correct within a constant multiplicative factor.\n  We next discuss applications of this protocol to problems in multi-agent control connected to the consensus problem. In particular, we describe protocols for formation maintenance and leader-following with convergence times which also scal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.4186","kind":"arxiv","version":7},"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":"1411.4186","created_at":"2026-05-18T00:38:40.214843+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.4186v7","created_at":"2026-05-18T00:38:40.214843+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.4186","created_at":"2026-05-18T00:38:40.214843+00:00"},{"alias_kind":"pith_short_12","alias_value":"LCRHCU7JWBPZ","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"LCRHCU7JWBPZMQ55","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"LCRHCU7J","created_at":"2026-05-18T12:28:35.611951+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2505.03736","citing_title":"Decentralized Nonconvex Optimization under Heavy-Tailed Noise: Normalization and Optimal Convergence","ref_index":52,"is_internal_anchor":true},{"citing_arxiv_id":"2603.07633","citing_title":"Coordination Games on Multiplex Networks: Consensus, Convergence, and Stability of Opinion Dynamics","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LCRHCU7JWBPZMQ55RICF2VVK4H","json":"https://pith.science/pith/LCRHCU7JWBPZMQ55RICF2VVK4H.json","graph_json":"https://pith.science/api/pith-number/LCRHCU7JWBPZMQ55RICF2VVK4H/graph.json","events_json":"https://pith.science/api/pith-number/LCRHCU7JWBPZMQ55RICF2VVK4H/events.json","paper":"https://pith.science/paper/LCRHCU7J"},"agent_actions":{"view_html":"https://pith.science/pith/LCRHCU7JWBPZMQ55RICF2VVK4H","download_json":"https://pith.science/pith/LCRHCU7JWBPZMQ55RICF2VVK4H.json","view_paper":"https://pith.science/paper/LCRHCU7J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.4186&json=true","fetch_graph":"https://pith.science/api/pith-number/LCRHCU7JWBPZMQ55RICF2VVK4H/graph.json","fetch_events":"https://pith.science/api/pith-number/LCRHCU7JWBPZMQ55RICF2VVK4H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LCRHCU7JWBPZMQ55RICF2VVK4H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LCRHCU7JWBPZMQ55RICF2VVK4H/action/storage_attestation","attest_author":"https://pith.science/pith/LCRHCU7JWBPZMQ55RICF2VVK4H/action/author_attestation","sign_citation":"https://pith.science/pith/LCRHCU7JWBPZMQ55RICF2VVK4H/action/citation_signature","submit_replication":"https://pith.science/pith/LCRHCU7JWBPZMQ55RICF2VVK4H/action/replication_record"}},"created_at":"2026-05-18T00:38:40.214843+00:00","updated_at":"2026-05-18T00:38:40.214843+00:00"}