{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:V644EDMJPKYF4M3YCOH3X5Y4HS","short_pith_number":"pith:V644EDMJ","canonical_record":{"source":{"id":"1003.5941","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-03-30T22:26:32Z","cross_cats_sorted":[],"title_canon_sha256":"2f566ea12d0a1fb74ebb91204053f0aad0c3416719a752b94f09df72ed53a37e","abstract_canon_sha256":"1e7c54a07417fd61a19fabf18be0b623adfb165995d83bf90f22d98dd1029abf"},"schema_version":"1.0"},"canonical_sha256":"afb9c20d897ab05e3378138fbbf71c3cb6d9d51ea0af5396c8c21b958ecbaa8d","source":{"kind":"arxiv","id":"1003.5941","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1003.5941","created_at":"2026-05-18T02:24:25Z"},{"alias_kind":"arxiv_version","alias_value":"1003.5941v1","created_at":"2026-05-18T02:24:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.5941","created_at":"2026-05-18T02:24:25Z"},{"alias_kind":"pith_short_12","alias_value":"V644EDMJPKYF","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"V644EDMJPKYF4M3Y","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"V644EDMJ","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:V644EDMJPKYF4M3YCOH3X5Y4HS","target":"record","payload":{"canonical_record":{"source":{"id":"1003.5941","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-03-30T22:26:32Z","cross_cats_sorted":[],"title_canon_sha256":"2f566ea12d0a1fb74ebb91204053f0aad0c3416719a752b94f09df72ed53a37e","abstract_canon_sha256":"1e7c54a07417fd61a19fabf18be0b623adfb165995d83bf90f22d98dd1029abf"},"schema_version":"1.0"},"canonical_sha256":"afb9c20d897ab05e3378138fbbf71c3cb6d9d51ea0af5396c8c21b958ecbaa8d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:25.876883Z","signature_b64":"hWWZdQXN8RAbG0RKIXjwhHNOoNr5gYYIU6eRX6Rlnr9DD3h9gMU/L1ubf5V/VMc43jzM3W9JeJ7rumS00zYBDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"afb9c20d897ab05e3378138fbbf71c3cb6d9d51ea0af5396c8c21b958ecbaa8d","last_reissued_at":"2026-05-18T02:24:25.876228Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:25.876228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1003.5941","source_version":1,"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-18T02:24:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UY375cwCMQSDiBWuYSNNg8Z0r+rb09s29XCbd61qK5DE4l2232c6gok0d6enHiSlJU0bgnuqLVcgU6Ty11ILBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T07:20:43.766142Z"},"content_sha256":"25bd2a8d2d701b7b8714ec751bc02119c0a1a84b6ed283d2df9087786a424029","schema_version":"1.0","event_id":"sha256:25bd2a8d2d701b7b8714ec751bc02119c0a1a84b6ed283d2df9087786a424029"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:V644EDMJPKYF4M3YCOH3X5Y4HS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A lower bound for distributed averaging algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alex Olshevsky, John N. Tsitsiklis","submitted_at":"2010-03-30T22:26:32Z","abstract_excerpt":"We derive lower bounds on the convergence speed of a widely used class of distributed averaging algorithms. In particular, we prove that any distributed averaging algorithm whose state consists of a single real number and whose (possibly nonlinear) update function satisfies a natural smoothness condition has a worst case running time of at least on the order of $n^2$ on a network of $n$ nodes. Our results suggest that increased memory or expansion of the state space is crucial for improving the running times of distributed averaging algorithms."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.5941","kind":"arxiv","version":1},"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-18T02:24:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4h/+ErzAt7IBaegEYc7lPLe4tMejDHiwdA/6QhIObN3Md1CZQeV7uYl12CiRcnvVXSZat8Xbf8hD1NmMoaToDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T07:20:43.766668Z"},"content_sha256":"a4c6ed886ae73eaf353bb49b725e400e6e9958d9fdbc30f13d881957fa082b69","schema_version":"1.0","event_id":"sha256:a4c6ed886ae73eaf353bb49b725e400e6e9958d9fdbc30f13d881957fa082b69"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V644EDMJPKYF4M3YCOH3X5Y4HS/bundle.json","state_url":"https://pith.science/pith/V644EDMJPKYF4M3YCOH3X5Y4HS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V644EDMJPKYF4M3YCOH3X5Y4HS/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-20T07:20:43Z","links":{"resolver":"https://pith.science/pith/V644EDMJPKYF4M3YCOH3X5Y4HS","bundle":"https://pith.science/pith/V644EDMJPKYF4M3YCOH3X5Y4HS/bundle.json","state":"https://pith.science/pith/V644EDMJPKYF4M3YCOH3X5Y4HS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V644EDMJPKYF4M3YCOH3X5Y4HS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:V644EDMJPKYF4M3YCOH3X5Y4HS","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":"1e7c54a07417fd61a19fabf18be0b623adfb165995d83bf90f22d98dd1029abf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-03-30T22:26:32Z","title_canon_sha256":"2f566ea12d0a1fb74ebb91204053f0aad0c3416719a752b94f09df72ed53a37e"},"schema_version":"1.0","source":{"id":"1003.5941","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1003.5941","created_at":"2026-05-18T02:24:25Z"},{"alias_kind":"arxiv_version","alias_value":"1003.5941v1","created_at":"2026-05-18T02:24:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.5941","created_at":"2026-05-18T02:24:25Z"},{"alias_kind":"pith_short_12","alias_value":"V644EDMJPKYF","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"V644EDMJPKYF4M3Y","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"V644EDMJ","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:a4c6ed886ae73eaf353bb49b725e400e6e9958d9fdbc30f13d881957fa082b69","target":"graph","created_at":"2026-05-18T02:24:25Z","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 derive lower bounds on the convergence speed of a widely used class of distributed averaging algorithms. In particular, we prove that any distributed averaging algorithm whose state consists of a single real number and whose (possibly nonlinear) update function satisfies a natural smoothness condition has a worst case running time of at least on the order of $n^2$ on a network of $n$ nodes. Our results suggest that increased memory or expansion of the state space is crucial for improving the running times of distributed averaging algorithms.","authors_text":"Alex Olshevsky, John N. Tsitsiklis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-03-30T22:26:32Z","title":"A lower bound for distributed averaging algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.5941","kind":"arxiv","version":1},"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:25bd2a8d2d701b7b8714ec751bc02119c0a1a84b6ed283d2df9087786a424029","target":"record","created_at":"2026-05-18T02:24:25Z","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":"1e7c54a07417fd61a19fabf18be0b623adfb165995d83bf90f22d98dd1029abf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-03-30T22:26:32Z","title_canon_sha256":"2f566ea12d0a1fb74ebb91204053f0aad0c3416719a752b94f09df72ed53a37e"},"schema_version":"1.0","source":{"id":"1003.5941","kind":"arxiv","version":1}},"canonical_sha256":"afb9c20d897ab05e3378138fbbf71c3cb6d9d51ea0af5396c8c21b958ecbaa8d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"afb9c20d897ab05e3378138fbbf71c3cb6d9d51ea0af5396c8c21b958ecbaa8d","first_computed_at":"2026-05-18T02:24:25.876228Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:24:25.876228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hWWZdQXN8RAbG0RKIXjwhHNOoNr5gYYIU6eRX6Rlnr9DD3h9gMU/L1ubf5V/VMc43jzM3W9JeJ7rumS00zYBDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:24:25.876883Z","signed_message":"canonical_sha256_bytes"},"source_id":"1003.5941","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:25bd2a8d2d701b7b8714ec751bc02119c0a1a84b6ed283d2df9087786a424029","sha256:a4c6ed886ae73eaf353bb49b725e400e6e9958d9fdbc30f13d881957fa082b69"],"state_sha256":"1d23d2c8f0c2ecbf5fab52cdf38c1d78b357ce4e3390ea71f599f2546fb16646"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zozMJAn9ZBIBY5TlYe2VnP6W51aJlFac6XLUZjZH2eyb5o6eFGQfaOCJidk1t6kPsL4u8a0ph44ILsD7zmMvCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T07:20:43.771726Z","bundle_sha256":"9a59eda4c6ca60b9669499f9d1aff2dd53a1daa2a957e963f6277eb98f000e45"}}