{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:NAA2CZQ7UL5SQ7BOF5WNOPDFUS","short_pith_number":"pith:NAA2CZQ7","canonical_record":{"source":{"id":"2205.04180","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-05-09T10:44:23Z","cross_cats_sorted":["cs.DC","math.OC"],"title_canon_sha256":"e4733f41a89bb734e6efce37a444d76072a35cf72f163ecad65d80ee116c41be","abstract_canon_sha256":"bead560c5538ac571608b9bba7b0b33efc8504f6e027143326b39a07ae84d673"},"schema_version":"1.0"},"canonical_sha256":"6801a1661fa2fb287c2e2f6cd73c65a4ba6564e6d02f65229f9327f475b7178c","source":{"kind":"arxiv","id":"2205.04180","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.04180","created_at":"2026-07-05T05:47:58Z"},{"alias_kind":"arxiv_version","alias_value":"2205.04180v4","created_at":"2026-07-05T05:47:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.04180","created_at":"2026-07-05T05:47:58Z"},{"alias_kind":"pith_short_12","alias_value":"NAA2CZQ7UL5S","created_at":"2026-07-05T05:47:58Z"},{"alias_kind":"pith_short_16","alias_value":"NAA2CZQ7UL5SQ7BO","created_at":"2026-07-05T05:47:58Z"},{"alias_kind":"pith_short_8","alias_value":"NAA2CZQ7","created_at":"2026-07-05T05:47:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:NAA2CZQ7UL5SQ7BOF5WNOPDFUS","target":"record","payload":{"canonical_record":{"source":{"id":"2205.04180","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-05-09T10:44:23Z","cross_cats_sorted":["cs.DC","math.OC"],"title_canon_sha256":"e4733f41a89bb734e6efce37a444d76072a35cf72f163ecad65d80ee116c41be","abstract_canon_sha256":"bead560c5538ac571608b9bba7b0b33efc8504f6e027143326b39a07ae84d673"},"schema_version":"1.0"},"canonical_sha256":"6801a1661fa2fb287c2e2f6cd73c65a4ba6564e6d02f65229f9327f475b7178c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:47:58.646260Z","signature_b64":"25MM5rBWdr/6H0XQK/e/hHPtWkwMrp1CJPFwub85dkc14RL0fpdmlTHHT6lHFhlwZF9dzIcOKR1OtT4GY5gnCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6801a1661fa2fb287c2e2f6cd73c65a4ba6564e6d02f65229f9327f475b7178c","last_reissued_at":"2026-07-05T05:47:58.645698Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:47:58.645698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2205.04180","source_version":4,"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-07-05T05:47:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I5bVgmYpFdVVHEuoxnGIqVmlGCer/uR1LjOb+h1L/u0uuBRuOtJN3NyavUh0cII9fIR+lyhZOjHeksaq/2VGAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T17:49:21.787270Z"},"content_sha256":"cd31291f5e737254f62f38d956208ce96197f4cb3cb5afd0e922907671187d76","schema_version":"1.0","event_id":"sha256:cd31291f5e737254f62f38d956208ce96197f4cb3cb5afd0e922907671187d76"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:NAA2CZQ7UL5SQ7BOF5WNOPDFUS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"EF-BV: A Unified Theory of Error Feedback and Variance Reduction Mechanisms for Biased and Unbiased Compression in Distributed Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.OC"],"primary_cat":"cs.LG","authors_text":"Kai Yi, Laurent Condat, Peter Richt\\'arik","submitted_at":"2022-05-09T10:44:23Z","abstract_excerpt":"In distributed or federated optimization and learning, communication between the different computing units is often the bottleneck and gradient compression is widely used to reduce the number of bits sent within each communication round of iterative methods. There are two classes of compression operators and separate algorithms making use of them. In the case of unbiased random compressors with bounded variance (e.g., rand-k), the DIANA algorithm of Mishchenko et al. (2019), which implements a variance reduction technique for handling the variance introduced by compression, is the current stat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.04180","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2205.04180/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T05:47:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sr7LTvEyXuijvEjSsbjpfwHUW80qG734P1Sx6mWiOx8pM2bVyId5VyprZmGeSHsGO6w3w6OxQI4ZqdKz0YrWAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T17:49:21.787783Z"},"content_sha256":"8f791080defe4d56a1f33c41c601a357d964a3dbd14ca31f00e17f0d1519b5b9","schema_version":"1.0","event_id":"sha256:8f791080defe4d56a1f33c41c601a357d964a3dbd14ca31f00e17f0d1519b5b9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NAA2CZQ7UL5SQ7BOF5WNOPDFUS/bundle.json","state_url":"https://pith.science/pith/NAA2CZQ7UL5SQ7BOF5WNOPDFUS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NAA2CZQ7UL5SQ7BOF5WNOPDFUS/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-04T17:49:21Z","links":{"resolver":"https://pith.science/pith/NAA2CZQ7UL5SQ7BOF5WNOPDFUS","bundle":"https://pith.science/pith/NAA2CZQ7UL5SQ7BOF5WNOPDFUS/bundle.json","state":"https://pith.science/pith/NAA2CZQ7UL5SQ7BOF5WNOPDFUS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NAA2CZQ7UL5SQ7BOF5WNOPDFUS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:NAA2CZQ7UL5SQ7BOF5WNOPDFUS","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":"bead560c5538ac571608b9bba7b0b33efc8504f6e027143326b39a07ae84d673","cross_cats_sorted":["cs.DC","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-05-09T10:44:23Z","title_canon_sha256":"e4733f41a89bb734e6efce37a444d76072a35cf72f163ecad65d80ee116c41be"},"schema_version":"1.0","source":{"id":"2205.04180","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.04180","created_at":"2026-07-05T05:47:58Z"},{"alias_kind":"arxiv_version","alias_value":"2205.04180v4","created_at":"2026-07-05T05:47:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.04180","created_at":"2026-07-05T05:47:58Z"},{"alias_kind":"pith_short_12","alias_value":"NAA2CZQ7UL5S","created_at":"2026-07-05T05:47:58Z"},{"alias_kind":"pith_short_16","alias_value":"NAA2CZQ7UL5SQ7BO","created_at":"2026-07-05T05:47:58Z"},{"alias_kind":"pith_short_8","alias_value":"NAA2CZQ7","created_at":"2026-07-05T05:47:58Z"}],"graph_snapshots":[{"event_id":"sha256:8f791080defe4d56a1f33c41c601a357d964a3dbd14ca31f00e17f0d1519b5b9","target":"graph","created_at":"2026-07-05T05:47:58Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2205.04180/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In distributed or federated optimization and learning, communication between the different computing units is often the bottleneck and gradient compression is widely used to reduce the number of bits sent within each communication round of iterative methods. There are two classes of compression operators and separate algorithms making use of them. In the case of unbiased random compressors with bounded variance (e.g., rand-k), the DIANA algorithm of Mishchenko et al. (2019), which implements a variance reduction technique for handling the variance introduced by compression, is the current stat","authors_text":"Kai Yi, Laurent Condat, Peter Richt\\'arik","cross_cats":["cs.DC","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-05-09T10:44:23Z","title":"EF-BV: A Unified Theory of Error Feedback and Variance Reduction Mechanisms for Biased and Unbiased Compression in Distributed Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.04180","kind":"arxiv","version":4},"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:cd31291f5e737254f62f38d956208ce96197f4cb3cb5afd0e922907671187d76","target":"record","created_at":"2026-07-05T05:47:58Z","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":"bead560c5538ac571608b9bba7b0b33efc8504f6e027143326b39a07ae84d673","cross_cats_sorted":["cs.DC","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-05-09T10:44:23Z","title_canon_sha256":"e4733f41a89bb734e6efce37a444d76072a35cf72f163ecad65d80ee116c41be"},"schema_version":"1.0","source":{"id":"2205.04180","kind":"arxiv","version":4}},"canonical_sha256":"6801a1661fa2fb287c2e2f6cd73c65a4ba6564e6d02f65229f9327f475b7178c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6801a1661fa2fb287c2e2f6cd73c65a4ba6564e6d02f65229f9327f475b7178c","first_computed_at":"2026-07-05T05:47:58.645698Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:47:58.645698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"25MM5rBWdr/6H0XQK/e/hHPtWkwMrp1CJPFwub85dkc14RL0fpdmlTHHT6lHFhlwZF9dzIcOKR1OtT4GY5gnCw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:47:58.646260Z","signed_message":"canonical_sha256_bytes"},"source_id":"2205.04180","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd31291f5e737254f62f38d956208ce96197f4cb3cb5afd0e922907671187d76","sha256:8f791080defe4d56a1f33c41c601a357d964a3dbd14ca31f00e17f0d1519b5b9"],"state_sha256":"71992a3a4f3e69883f93acc0a93be516648081766bb580833ffdd49d8abc330a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XsXyAiil/Ohft06YTHuUuy4UGtQPJYc6asyMHGdIW1ykdcU03YPNJJzasg3wKmhZ5gNh/53yZy9N8+SHWIS5BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T17:49:21.809991Z","bundle_sha256":"5b57a401c77e91d0c28c415c278b5001e4e9901726de6c83c79eaeea09887281"}}