{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:EMCZ3RMKCS7PPXA7CO3RV4UCTL","short_pith_number":"pith:EMCZ3RMK","canonical_record":{"source":{"id":"math/0612682","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2006-12-22T06:45:41Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"752d2a2f2617f980312b37fcd496d2aa7475c1d0e7962024c686b3de1f397c2a","abstract_canon_sha256":"6be1fd80420a647758818b97cc3ac85924a2cb52fdce16f1f135b72f7f9f0c51"},"schema_version":"1.0"},"canonical_sha256":"23059dc58a14bef7dc1f13b71af2829ae97f171dea8666fd1616f709a19af3f4","source":{"kind":"arxiv","id":"math/0612682","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0612682","created_at":"2026-05-18T04:20:13Z"},{"alias_kind":"arxiv_version","alias_value":"math/0612682v2","created_at":"2026-05-18T04:20:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0612682","created_at":"2026-05-18T04:20:13Z"},{"alias_kind":"pith_short_12","alias_value":"EMCZ3RMKCS7P","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"EMCZ3RMKCS7PPXA7","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"EMCZ3RMK","created_at":"2026-05-18T12:25:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:EMCZ3RMKCS7PPXA7CO3RV4UCTL","target":"record","payload":{"canonical_record":{"source":{"id":"math/0612682","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2006-12-22T06:45:41Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"752d2a2f2617f980312b37fcd496d2aa7475c1d0e7962024c686b3de1f397c2a","abstract_canon_sha256":"6be1fd80420a647758818b97cc3ac85924a2cb52fdce16f1f135b72f7f9f0c51"},"schema_version":"1.0"},"canonical_sha256":"23059dc58a14bef7dc1f13b71af2829ae97f171dea8666fd1616f709a19af3f4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:13.525696Z","signature_b64":"Y0CgYLWu/lyz+f2WSbjfECGtjFqvXDqtnddVHHUEv0vlzJKNWsKm9wXgnJ4YpsovKRpaJgDSPcaP/CsdDVQPAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23059dc58a14bef7dc1f13b71af2829ae97f171dea8666fd1616f709a19af3f4","last_reissued_at":"2026-05-18T04:20:13.525038Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:13.525038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0612682","source_version":2,"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-18T04:20:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6s38+AfuO8tmPGPIpAsAkW+/3bQ7KkKLlHzRtn2tbazftIw6eoPvA2lw8BGIskkCIqGEdOfYp6BeZCYHuxowCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T22:08:29.293211Z"},"content_sha256":"d118c21006750a1d92638bc960bea2223120efc1cc258dbdcb800374e0126fd8","schema_version":"1.0","event_id":"sha256:d118c21006750a1d92638bc960bea2223120efc1cc258dbdcb800374e0126fd8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:EMCZ3RMKCS7PPXA7CO3RV4UCTL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convergence Speed in Distributed Consensus and Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Alex Olshevsky, John N. Tsitsiklis","submitted_at":"2006-12-22T06:45:41Z","abstract_excerpt":"We study the convergence speed of distributed iterative algorithms for the consensus and averaging problems, with emphasis on the latter. We first consider the case of a fixed communication topology. We show that a simple adaptation of a consensus algorithm leads to an averaging algorithm. We prove lower bounds on the worst-case convergence time for various classes of linear, time-invariant, distributed consensus methods, and provide an algorithm that essentially matches those lower bounds. We then consider the case of a time-varying topology, and provide a polynomial-time averaging algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0612682","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"},"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-18T04:20:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tjbw2XsWjj8ze5k4U5iCCgKAN84dZ4O+HWVzIgdmo+NGHhFjoMhP0hjw2E3n1ZjkXhn9AYKhuiBA+tBzLo9CDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T22:08:29.293774Z"},"content_sha256":"29881661e7d4928cb20eb9814924b8cae126704960b187f2a3fef44b1e1cf9f4","schema_version":"1.0","event_id":"sha256:29881661e7d4928cb20eb9814924b8cae126704960b187f2a3fef44b1e1cf9f4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EMCZ3RMKCS7PPXA7CO3RV4UCTL/bundle.json","state_url":"https://pith.science/pith/EMCZ3RMKCS7PPXA7CO3RV4UCTL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EMCZ3RMKCS7PPXA7CO3RV4UCTL/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-08-04T22:08:29Z","links":{"resolver":"https://pith.science/pith/EMCZ3RMKCS7PPXA7CO3RV4UCTL","bundle":"https://pith.science/pith/EMCZ3RMKCS7PPXA7CO3RV4UCTL/bundle.json","state":"https://pith.science/pith/EMCZ3RMKCS7PPXA7CO3RV4UCTL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EMCZ3RMKCS7PPXA7CO3RV4UCTL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:EMCZ3RMKCS7PPXA7CO3RV4UCTL","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":"6be1fd80420a647758818b97cc3ac85924a2cb52fdce16f1f135b72f7f9f0c51","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2006-12-22T06:45:41Z","title_canon_sha256":"752d2a2f2617f980312b37fcd496d2aa7475c1d0e7962024c686b3de1f397c2a"},"schema_version":"1.0","source":{"id":"math/0612682","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0612682","created_at":"2026-05-18T04:20:13Z"},{"alias_kind":"arxiv_version","alias_value":"math/0612682v2","created_at":"2026-05-18T04:20:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0612682","created_at":"2026-05-18T04:20:13Z"},{"alias_kind":"pith_short_12","alias_value":"EMCZ3RMKCS7P","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"EMCZ3RMKCS7PPXA7","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"EMCZ3RMK","created_at":"2026-05-18T12:25:53Z"}],"graph_snapshots":[{"event_id":"sha256:29881661e7d4928cb20eb9814924b8cae126704960b187f2a3fef44b1e1cf9f4","target":"graph","created_at":"2026-05-18T04:20:13Z","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 study the convergence speed of distributed iterative algorithms for the consensus and averaging problems, with emphasis on the latter. We first consider the case of a fixed communication topology. We show that a simple adaptation of a consensus algorithm leads to an averaging algorithm. We prove lower bounds on the worst-case convergence time for various classes of linear, time-invariant, distributed consensus methods, and provide an algorithm that essentially matches those lower bounds. We then consider the case of a time-varying topology, and provide a polynomial-time averaging algorithm.","authors_text":"Alex Olshevsky, John N. Tsitsiklis","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2006-12-22T06:45:41Z","title":"Convergence Speed in Distributed Consensus and Control"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0612682","kind":"arxiv","version":2},"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:d118c21006750a1d92638bc960bea2223120efc1cc258dbdcb800374e0126fd8","target":"record","created_at":"2026-05-18T04:20:13Z","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":"6be1fd80420a647758818b97cc3ac85924a2cb52fdce16f1f135b72f7f9f0c51","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2006-12-22T06:45:41Z","title_canon_sha256":"752d2a2f2617f980312b37fcd496d2aa7475c1d0e7962024c686b3de1f397c2a"},"schema_version":"1.0","source":{"id":"math/0612682","kind":"arxiv","version":2}},"canonical_sha256":"23059dc58a14bef7dc1f13b71af2829ae97f171dea8666fd1616f709a19af3f4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"23059dc58a14bef7dc1f13b71af2829ae97f171dea8666fd1616f709a19af3f4","first_computed_at":"2026-05-18T04:20:13.525038Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:20:13.525038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y0CgYLWu/lyz+f2WSbjfECGtjFqvXDqtnddVHHUEv0vlzJKNWsKm9wXgnJ4YpsovKRpaJgDSPcaP/CsdDVQPAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:20:13.525696Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0612682","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d118c21006750a1d92638bc960bea2223120efc1cc258dbdcb800374e0126fd8","sha256:29881661e7d4928cb20eb9814924b8cae126704960b187f2a3fef44b1e1cf9f4"],"state_sha256":"20707bad83fcdd5978035a1280f616ca3a966e647fe847fa786f29e77581afd7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a/H7KBXQa0QixILU+hSUCulk50mDltVRwJMFtZXqEYWFyMGis3LopQme6u7nJ3JxrqR7ZI9+3q/6bNemRNjDAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T22:08:29.299034Z","bundle_sha256":"30fb2735c8f87b3fd2df3b3f6f950ace8fa153c0848ce3395c941e221e9b90e9"}}