{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:JWYRC3DX3L4V36KQMBE7JD5LZ6","short_pith_number":"pith:JWYRC3DX","canonical_record":{"source":{"id":"1610.04714","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-10-15T10:30:34Z","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"title_canon_sha256":"d8f89087923e54645f00ee6e8a0fc3e2a22f5f85a646149df2147a2c4942b1e4","abstract_canon_sha256":"9188bda2e756b307e30a7d280b2e1e48e72d5bf979d7bdbe530369c9ca1fa7eb"},"schema_version":"1.0"},"canonical_sha256":"4db1116c77daf95df9506049f48fabcf80a62e54d038d21a6c01cee2b9ea3d98","source":{"kind":"arxiv","id":"1610.04714","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.04714","created_at":"2026-05-18T01:02:07Z"},{"alias_kind":"arxiv_version","alias_value":"1610.04714v1","created_at":"2026-05-18T01:02:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.04714","created_at":"2026-05-18T01:02:07Z"},{"alias_kind":"pith_short_12","alias_value":"JWYRC3DX3L4V","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JWYRC3DX3L4V36KQ","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JWYRC3DX","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:JWYRC3DX3L4V36KQMBE7JD5LZ6","target":"record","payload":{"canonical_record":{"source":{"id":"1610.04714","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-10-15T10:30:34Z","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"title_canon_sha256":"d8f89087923e54645f00ee6e8a0fc3e2a22f5f85a646149df2147a2c4942b1e4","abstract_canon_sha256":"9188bda2e756b307e30a7d280b2e1e48e72d5bf979d7bdbe530369c9ca1fa7eb"},"schema_version":"1.0"},"canonical_sha256":"4db1116c77daf95df9506049f48fabcf80a62e54d038d21a6c01cee2b9ea3d98","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:07.227476Z","signature_b64":"4MstoSolyyqjQf/fVe3AHN/7/a3cfVIvXYPSpUbg2r+7bcpDtwy2frueWEBmJk90IkKZqOeUKj5+B+edBzU8Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4db1116c77daf95df9506049f48fabcf80a62e54d038d21a6c01cee2b9ea3d98","last_reissued_at":"2026-05-18T01:02:07.226558Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:07.226558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.04714","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-18T01:02:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o2ljXeK+g0koPsUazL4Z45Rmlno44zPrNJN3Y0ATG8i31JT3Sw0/ka62QkSUfmyc+x2uaRxUWvdELu/JXSnjDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T02:07:05.766710Z"},"content_sha256":"a18f5477b128804e33875434d26b85c95fe6fedf08128082a2b3c5d049d61c64","schema_version":"1.0","event_id":"sha256:a18f5477b128804e33875434d26b85c95fe6fedf08128082a2b3c5d049d61c64"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:JWYRC3DX3L4V36KQMBE7JD5LZ6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A New Perspective on Randomized Gossip Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.OC"],"primary_cat":"cs.DC","authors_text":"Nicolas Loizou, Peter Richt\\'arik","submitted_at":"2016-10-15T10:30:34Z","abstract_excerpt":"In this short note we propose a new approach for the design and analysis of randomized gossip algorithms which can be used to solve the average consensus problem. We show how that Randomized Block Kaczmarz (RBK) method - a method for solving linear systems - works as gossip algorithm when applied to a special system encoding the underlying network. The famous pairwise gossip algorithm arises as a special case. Subsequently, we reveal a hidden duality of randomized gossip algorithms, with the dual iterative process maintaining a set of numbers attached to the edges as opposed to nodes of the ne"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.04714","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-18T01:02:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YRhjWKcRcN9bWwpHg+NgfSTahjwMv+I17aMKKLE41gUH/lXtwyLwKHLMtx83Wyl8YYFErm98O2+zz6HsOqcFBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T02:07:05.767373Z"},"content_sha256":"649ac05305f2f4f2011600ff545a50dbf59816991c00e388641d3c12d32def5d","schema_version":"1.0","event_id":"sha256:649ac05305f2f4f2011600ff545a50dbf59816991c00e388641d3c12d32def5d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JWYRC3DX3L4V36KQMBE7JD5LZ6/bundle.json","state_url":"https://pith.science/pith/JWYRC3DX3L4V36KQMBE7JD5LZ6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JWYRC3DX3L4V36KQMBE7JD5LZ6/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-24T02:07:05Z","links":{"resolver":"https://pith.science/pith/JWYRC3DX3L4V36KQMBE7JD5LZ6","bundle":"https://pith.science/pith/JWYRC3DX3L4V36KQMBE7JD5LZ6/bundle.json","state":"https://pith.science/pith/JWYRC3DX3L4V36KQMBE7JD5LZ6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JWYRC3DX3L4V36KQMBE7JD5LZ6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:JWYRC3DX3L4V36KQMBE7JD5LZ6","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":"9188bda2e756b307e30a7d280b2e1e48e72d5bf979d7bdbe530369c9ca1fa7eb","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-10-15T10:30:34Z","title_canon_sha256":"d8f89087923e54645f00ee6e8a0fc3e2a22f5f85a646149df2147a2c4942b1e4"},"schema_version":"1.0","source":{"id":"1610.04714","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.04714","created_at":"2026-05-18T01:02:07Z"},{"alias_kind":"arxiv_version","alias_value":"1610.04714v1","created_at":"2026-05-18T01:02:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.04714","created_at":"2026-05-18T01:02:07Z"},{"alias_kind":"pith_short_12","alias_value":"JWYRC3DX3L4V","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JWYRC3DX3L4V36KQ","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JWYRC3DX","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:649ac05305f2f4f2011600ff545a50dbf59816991c00e388641d3c12d32def5d","target":"graph","created_at":"2026-05-18T01:02:07Z","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":"In this short note we propose a new approach for the design and analysis of randomized gossip algorithms which can be used to solve the average consensus problem. We show how that Randomized Block Kaczmarz (RBK) method - a method for solving linear systems - works as gossip algorithm when applied to a special system encoding the underlying network. The famous pairwise gossip algorithm arises as a special case. Subsequently, we reveal a hidden duality of randomized gossip algorithms, with the dual iterative process maintaining a set of numbers attached to the edges as opposed to nodes of the ne","authors_text":"Nicolas Loizou, Peter Richt\\'arik","cross_cats":["cs.IT","math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-10-15T10:30:34Z","title":"A New Perspective on Randomized Gossip Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.04714","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:a18f5477b128804e33875434d26b85c95fe6fedf08128082a2b3c5d049d61c64","target":"record","created_at":"2026-05-18T01:02:07Z","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":"9188bda2e756b307e30a7d280b2e1e48e72d5bf979d7bdbe530369c9ca1fa7eb","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-10-15T10:30:34Z","title_canon_sha256":"d8f89087923e54645f00ee6e8a0fc3e2a22f5f85a646149df2147a2c4942b1e4"},"schema_version":"1.0","source":{"id":"1610.04714","kind":"arxiv","version":1}},"canonical_sha256":"4db1116c77daf95df9506049f48fabcf80a62e54d038d21a6c01cee2b9ea3d98","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4db1116c77daf95df9506049f48fabcf80a62e54d038d21a6c01cee2b9ea3d98","first_computed_at":"2026-05-18T01:02:07.226558Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:07.226558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4MstoSolyyqjQf/fVe3AHN/7/a3cfVIvXYPSpUbg2r+7bcpDtwy2frueWEBmJk90IkKZqOeUKj5+B+edBzU8Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:07.227476Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.04714","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a18f5477b128804e33875434d26b85c95fe6fedf08128082a2b3c5d049d61c64","sha256:649ac05305f2f4f2011600ff545a50dbf59816991c00e388641d3c12d32def5d"],"state_sha256":"cc73964c91e4123b4c4836ed25fe10b17e402f1676f4788d442a58857461931e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HhDJf8ZO4DND4ir9RGw20lZJEHTvSxN405iCUmZHUJsLYOpPeUP+daGCu8RA9jrw0akMqUurpXEoAbXQLcdBDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T02:07:05.770964Z","bundle_sha256":"fdc20f9623e69cca48fd48b3d997c756526afa3cfb932d9189edf2590e385f10"}}