{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:LCRHCU7JWBPZMQ55RICF2VVK4H","short_pith_number":"pith:LCRHCU7J","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"},"canonical_sha256":"58a27153e9b05f9643bd8a045d56aae1cea8c60102a1426a6fac097d59b74aba","source":{"kind":"arxiv","id":"1411.4186","version":7},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.4186","created_at":"2026-05-18T00:38:40Z"},{"alias_kind":"arxiv_version","alias_value":"1411.4186v7","created_at":"2026-05-18T00:38:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.4186","created_at":"2026-05-18T00:38:40Z"},{"alias_kind":"pith_short_12","alias_value":"LCRHCU7JWBPZ","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"LCRHCU7JWBPZMQ55","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"LCRHCU7J","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:LCRHCU7JWBPZMQ55RICF2VVK4H","target":"record","payload":{"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"},"canonical_sha256":"58a27153e9b05f9643bd8a045d56aae1cea8c60102a1426a6fac097d59b74aba","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"},"source_kind":"arxiv","source_id":"1411.4186","source_version":7,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:38:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vgYNuezFz1s8qEL1rzPOLXLjFbx+4tPXfqU46DPU+oe/zT5SgDt8/xSdIociVP4+ikH0cLBXImqLImmDqcafDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T03:31:57.474221Z"},"content_sha256":"638f44d0657eb2e3ddffe2411fbb6f2466adec5240ea21ba1a3876d4fa017690","schema_version":"1.0","event_id":"sha256:638f44d0657eb2e3ddffe2411fbb6f2466adec5240ea21ba1a3876d4fa017690"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:LCRHCU7JWBPZMQ55RICF2VVK4H","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:38:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1hm6k3Ni324u2tb046hB+D09tVTxN43A4x8y7VBsOKsQcjA2epFJxbhrrmFK/UC4S0iy1OqvOI4MXUtp3qaZAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T03:31:57.474888Z"},"content_sha256":"126221c5281a7709a050e320b67a12a4a1b0924398c70ddf74a52aad5f7daa43","schema_version":"1.0","event_id":"sha256:126221c5281a7709a050e320b67a12a4a1b0924398c70ddf74a52aad5f7daa43"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LCRHCU7JWBPZMQ55RICF2VVK4H/bundle.json","state_url":"https://pith.science/pith/LCRHCU7JWBPZMQ55RICF2VVK4H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LCRHCU7JWBPZMQ55RICF2VVK4H/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-23T03:31:57Z","links":{"resolver":"https://pith.science/pith/LCRHCU7JWBPZMQ55RICF2VVK4H","bundle":"https://pith.science/pith/LCRHCU7JWBPZMQ55RICF2VVK4H/bundle.json","state":"https://pith.science/pith/LCRHCU7JWBPZMQ55RICF2VVK4H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LCRHCU7JWBPZMQ55RICF2VVK4H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:LCRHCU7JWBPZMQ55RICF2VVK4H","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":"605302b27bbe9c2a26db33cb05bfd2d8ff190902f540daf30481a08f908f8813","cross_cats_sorted":["cs.DC","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-11-15T21:02:08Z","title_canon_sha256":"ec4d1f56205a3e757cd95491910220ce81824c9fa814fc0543012623a53cff6b"},"schema_version":"1.0","source":{"id":"1411.4186","kind":"arxiv","version":7}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.4186","created_at":"2026-05-18T00:38:40Z"},{"alias_kind":"arxiv_version","alias_value":"1411.4186v7","created_at":"2026-05-18T00:38:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.4186","created_at":"2026-05-18T00:38:40Z"},{"alias_kind":"pith_short_12","alias_value":"LCRHCU7JWBPZ","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"LCRHCU7JWBPZMQ55","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"LCRHCU7J","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:126221c5281a7709a050e320b67a12a4a1b0924398c70ddf74a52aad5f7daa43","target":"graph","created_at":"2026-05-18T00:38:40Z","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"},"paper":{"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","authors_text":"Alex Olshevsky","cross_cats":["cs.DC","cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-11-15T21:02:08Z","title":"Linear Time Average Consensus on Fixed Graphs and Implications for Decentralized Optimization and Multi-Agent Control"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.4186","kind":"arxiv","version":7},"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:638f44d0657eb2e3ddffe2411fbb6f2466adec5240ea21ba1a3876d4fa017690","target":"record","created_at":"2026-05-18T00:38:40Z","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":"605302b27bbe9c2a26db33cb05bfd2d8ff190902f540daf30481a08f908f8813","cross_cats_sorted":["cs.DC","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-11-15T21:02:08Z","title_canon_sha256":"ec4d1f56205a3e757cd95491910220ce81824c9fa814fc0543012623a53cff6b"},"schema_version":"1.0","source":{"id":"1411.4186","kind":"arxiv","version":7}},"canonical_sha256":"58a27153e9b05f9643bd8a045d56aae1cea8c60102a1426a6fac097d59b74aba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"58a27153e9b05f9643bd8a045d56aae1cea8c60102a1426a6fac097d59b74aba","first_computed_at":"2026-05-18T00:38:40.214725Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:40.214725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VKVEH9cNJtFH4VoZv8DzvksbzVP320RqeyLgRBzgxO6VqJ/XSYoJGQ1U/uRXvNXd2qDLUNhgIAu8rh/HFEQkDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:40.215350Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.4186","source_kind":"arxiv","source_version":7}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:638f44d0657eb2e3ddffe2411fbb6f2466adec5240ea21ba1a3876d4fa017690","sha256:126221c5281a7709a050e320b67a12a4a1b0924398c70ddf74a52aad5f7daa43"],"state_sha256":"c64b06fba1708ffff86d15c96d7f17e067e1a293ede296f7038c64fd592f8fd2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O5qOccTtwFhVTmKEOKFJjB6dS3i0hqfgGTAVrWcFMc1IiOBxsnIyfb2m1QcfpXWLYWk765BFgfcyik0940kPAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T03:31:57.479290Z","bundle_sha256":"0a125d8a7c8388ada7c9b3a2267f79f7ecf16a6bade4301709526aaa805f4789"}}