{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:5UA67STTTNQSQ2WKMUQNLTUIFP","short_pith_number":"pith:5UA67STT","canonical_record":{"source":{"id":"1905.08645","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-20T14:36:59Z","cross_cats_sorted":["cs.DC","cs.LG","cs.MA","cs.SY"],"title_canon_sha256":"b9d7fbf157fa428842db3ebe4b83a427a1f0721ca74715cbfa6c412fb857f534","abstract_canon_sha256":"0642e2b4e1476fe3fa5555eb64ceaf1fabc40eff7100fcc7ad7c2eaf5019614d"},"schema_version":"1.0"},"canonical_sha256":"ed01efca739b61286aca6520d5ce882bf02f6b10477eec21b349382642648ec0","source":{"kind":"arxiv","id":"1905.08645","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.08645","created_at":"2026-05-17T23:44:28Z"},{"alias_kind":"arxiv_version","alias_value":"1905.08645v2","created_at":"2026-05-17T23:44:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.08645","created_at":"2026-05-17T23:44:28Z"},{"alias_kind":"pith_short_12","alias_value":"5UA67STTTNQS","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5UA67STTTNQSQ2WK","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5UA67STT","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:5UA67STTTNQSQ2WKMUQNLTUIFP","target":"record","payload":{"canonical_record":{"source":{"id":"1905.08645","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-20T14:36:59Z","cross_cats_sorted":["cs.DC","cs.LG","cs.MA","cs.SY"],"title_canon_sha256":"b9d7fbf157fa428842db3ebe4b83a427a1f0721ca74715cbfa6c412fb857f534","abstract_canon_sha256":"0642e2b4e1476fe3fa5555eb64ceaf1fabc40eff7100fcc7ad7c2eaf5019614d"},"schema_version":"1.0"},"canonical_sha256":"ed01efca739b61286aca6520d5ce882bf02f6b10477eec21b349382642648ec0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:28.481112Z","signature_b64":"odqHTJAogSZiLEUl2xwDCMYU+SHxD54FHcFdDUI/lbJVyr7HIfi6GOJ2P5IG+CfYrunMOr9cWInDZAf6mYxYBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed01efca739b61286aca6520d5ce882bf02f6b10477eec21b349382642648ec0","last_reissued_at":"2026-05-17T23:44:28.480551Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:28.480551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.08645","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-17T23:44:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sr5LWLo8JgeVaRKX7IRz71v2aOtO4PXBB1rPZ9HBd7WbwUgX2r1cnnm8QeA4gKaPFuT24qgn4b3vFDzMT2I4Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:41:54.547204Z"},"content_sha256":"b2ecb011bfb7f03e7e0390b76cb5913e2a8b4e57920b8ad561a99525b93bcdfc","schema_version":"1.0","event_id":"sha256:b2ecb011bfb7f03e7e0390b76cb5913e2a8b4e57920b8ad561a99525b93bcdfc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:5UA67STTTNQSQ2WKMUQNLTUIFP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Revisiting Randomized Gossip Algorithms: General Framework, Convergence Rates and Novel Block and Accelerated Protocols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LG","cs.MA","cs.SY"],"primary_cat":"math.OC","authors_text":"Nicolas Loizou, Peter Richt\\'arik","submitted_at":"2019-05-20T14:36:59Z","abstract_excerpt":"In this work we present a new framework for the analysis and design of randomized gossip algorithms for solving the average consensus problem. We show how classical randomized iterative methods for solving linear systems can be interpreted as gossip algorithms when applied to special systems encoding the underlying network and explain in detail their decentralized nature. Our general framework recovers a comprehensive array of well-known gossip algorithms as special cases, including the pairwise randomized gossip algorithm and path averaging gossip, and allows for the development of provably f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.08645","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-17T23:44:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xLmlfE5qh/GshTHtSujYmCyzvltW7Y3J7jVdU+D5GlM03sx+KRTJtxfSwWpwHV1kp6phYkwZxM41SQAb9ZZDCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:41:54.547847Z"},"content_sha256":"e5e07809151a415bee3c4e4b8bff7fd008b28a53375a28fe7fe05bc38f287764","schema_version":"1.0","event_id":"sha256:e5e07809151a415bee3c4e4b8bff7fd008b28a53375a28fe7fe05bc38f287764"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5UA67STTTNQSQ2WKMUQNLTUIFP/bundle.json","state_url":"https://pith.science/pith/5UA67STTTNQSQ2WKMUQNLTUIFP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5UA67STTTNQSQ2WKMUQNLTUIFP/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-27T03:41:54Z","links":{"resolver":"https://pith.science/pith/5UA67STTTNQSQ2WKMUQNLTUIFP","bundle":"https://pith.science/pith/5UA67STTTNQSQ2WKMUQNLTUIFP/bundle.json","state":"https://pith.science/pith/5UA67STTTNQSQ2WKMUQNLTUIFP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5UA67STTTNQSQ2WKMUQNLTUIFP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5UA67STTTNQSQ2WKMUQNLTUIFP","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":"0642e2b4e1476fe3fa5555eb64ceaf1fabc40eff7100fcc7ad7c2eaf5019614d","cross_cats_sorted":["cs.DC","cs.LG","cs.MA","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-20T14:36:59Z","title_canon_sha256":"b9d7fbf157fa428842db3ebe4b83a427a1f0721ca74715cbfa6c412fb857f534"},"schema_version":"1.0","source":{"id":"1905.08645","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.08645","created_at":"2026-05-17T23:44:28Z"},{"alias_kind":"arxiv_version","alias_value":"1905.08645v2","created_at":"2026-05-17T23:44:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.08645","created_at":"2026-05-17T23:44:28Z"},{"alias_kind":"pith_short_12","alias_value":"5UA67STTTNQS","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5UA67STTTNQSQ2WK","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5UA67STT","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:e5e07809151a415bee3c4e4b8bff7fd008b28a53375a28fe7fe05bc38f287764","target":"graph","created_at":"2026-05-17T23:44:28Z","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 work we present a new framework for the analysis and design of randomized gossip algorithms for solving the average consensus problem. We show how classical randomized iterative methods for solving linear systems can be interpreted as gossip algorithms when applied to special systems encoding the underlying network and explain in detail their decentralized nature. Our general framework recovers a comprehensive array of well-known gossip algorithms as special cases, including the pairwise randomized gossip algorithm and path averaging gossip, and allows for the development of provably f","authors_text":"Nicolas Loizou, Peter Richt\\'arik","cross_cats":["cs.DC","cs.LG","cs.MA","cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-20T14:36:59Z","title":"Revisiting Randomized Gossip Algorithms: General Framework, Convergence Rates and Novel Block and Accelerated Protocols"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.08645","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:b2ecb011bfb7f03e7e0390b76cb5913e2a8b4e57920b8ad561a99525b93bcdfc","target":"record","created_at":"2026-05-17T23:44:28Z","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":"0642e2b4e1476fe3fa5555eb64ceaf1fabc40eff7100fcc7ad7c2eaf5019614d","cross_cats_sorted":["cs.DC","cs.LG","cs.MA","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-20T14:36:59Z","title_canon_sha256":"b9d7fbf157fa428842db3ebe4b83a427a1f0721ca74715cbfa6c412fb857f534"},"schema_version":"1.0","source":{"id":"1905.08645","kind":"arxiv","version":2}},"canonical_sha256":"ed01efca739b61286aca6520d5ce882bf02f6b10477eec21b349382642648ec0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ed01efca739b61286aca6520d5ce882bf02f6b10477eec21b349382642648ec0","first_computed_at":"2026-05-17T23:44:28.480551Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:28.480551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"odqHTJAogSZiLEUl2xwDCMYU+SHxD54FHcFdDUI/lbJVyr7HIfi6GOJ2P5IG+CfYrunMOr9cWInDZAf6mYxYBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:28.481112Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.08645","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b2ecb011bfb7f03e7e0390b76cb5913e2a8b4e57920b8ad561a99525b93bcdfc","sha256:e5e07809151a415bee3c4e4b8bff7fd008b28a53375a28fe7fe05bc38f287764"],"state_sha256":"475d4797eedaf8f3d688ba8b3d132788127a82b5dc2b51aa6735e7877368410f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IL/iwCtNOOLCuM01O3GZjhWz2ZpT3WySLNQ19NXUv0jJW4qNnqG1KySeh5QTBscbKs1Y9MxfaQWDGHJupg9FCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T03:41:54.551174Z","bundle_sha256":"4938219a2ddfb7845141cb3d1bebdbc7c84d443dd5a27f4b5f1b23be037f0bed"}}