{"as_of":"2026-08-16T17:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fa2b0c304a30784ff0f88267ff0a8e11b0bf0e378ac42524ef50f392af32627c","coverage":[{"denominator":42,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":42,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T19:54:41.688032Z","state":"measured"},{"denominator":43,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":43,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T22:35:24.562911Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-15T22:35:24.599706Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.00206","last_updated":"2025-01-31T22:48:43Z","snapshot_observed_at":"2026-08-15T10:56:56.118555Z","submitted_at":"2025-01-31T22:48:43Z","title":"BICompFL: Stochastic Federated Learning with Bi-Directional Compression","version":1},"cited_work":{"arxiv_id":"2502.00206","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.00206","snapshot_observed_at":"2026-08-15T22:35:24.599706Z","title":"BICompFL: Stochastic Federated Learning with Bi-Directional Compression","venue":"cs.LG","work_id":"48af64ed-367a-413e-b73b-cc16fb544f40","year":2025},"citing_paper":{"arxiv_id":"2505.07016","last_updated":"2025-05-11T15:22:29Z","snapshot_observed_at":"2026-08-15T22:24:58.901690Z","submitted_at":"2025-05-11T15:22:29Z","title":"Multi-Terminal Remote Generation and Estimation Over a Broadcast Channel With Correlated Priors","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T22:35:24.562911Z"},"links":{"cited_paper":"/paper/2502.00206","citing_paper":"/paper/2505.07016"},"observation_digest":"sha256:298d4c12fe110d429c0e7a05ac8755cc4316725ca3d7e2a579fc31278deb6e65","observation_id":"b1eb61ad-c777-4de5-81e4-6d29ccf98dbc","resolution":{"observed_at":"2026-08-15T22:35:24.605943Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2502.00206/citation-record","integrity":"/paper/2502.00206/integrity","json":"/paper/2502.00206/citation-record.json","paper":"/paper/2502.00206"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1904.01197","last_updated":"2019-04-02T03:47:28Z","snapshot_observed_at":"2026-08-14T16:53:14.484744Z","submitted_at":"2019-04-02T03:47:28Z","title":"Nested Dithered Quantization for Communication Reduction in Distributed Training","version":1},"cited_work":{"arxiv_id":"1904.01197","doi":null,"metadata_source":"pith","pith_arxiv_id":"1904.01197","snapshot_observed_at":"2026-08-09T19:54:41.896300Z","title":"Nested Dithered Quantization for Communication Reduction in Distributed Training","venue":"cs.DC","work_id":"b8caf9ac-d6d4-4359-849c-26e0a74a7f51","year":2019},"citing_paper":{"arxiv_id":"2502.00206","last_updated":"2025-01-31T22:48:43Z","snapshot_observed_at":"2026-08-15T10:56:56.118555Z","submitted_at":"2025-01-31T22:48:43Z","title":"BICompFL: Stochastic Federated Learning with Bi-Directional Compression","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-09T19:54:41.524085Z"},"links":{"cited_paper":"/paper/1904.01197","citing_paper":"/paper/2502.00206"},"observation_digest":"sha256:d1b427a746dd1f13fc6c379b03bbe7ca0394e006cac5611065da8ece9a9ade4d","observation_id":"768df459-a206-4ef4-91ba-d6f34ce29326","resolution":{"observed_at":"2026-08-09T19:54:41.900896Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:54:42.334508Z","title":"QSGD : Communication-efficient SGD via gradient quantization and encoding","venue":null,"work_id":"41639611-c5fd-4148-bd63-134a10bbbb50","year":2017},"citing_paper":{"arxiv_id":"2502.00206","last_updated":"2025-01-31T22:48:43Z","snapshot_observed_at":"2026-08-15T10:56:56.118555Z","submitted_at":"2025-01-31T22:48:43Z","title":"BICompFL: Stochastic Federated Learning with Bi-Directional Compression","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-09T19:54:41.530003Z"},"links":{"citing_paper":"/paper/2502.00206"},"observation_digest":"sha256:9ae34d1f3d4ffd718d4aad454d1ff92af539fd8ac13bacdd09d36c0796fd3263","observation_id":"bbbbf099-919c-4f76-8dd7-f6eb6a346417","resolution":{"observed_at":"2026-08-09T19:54:42.338757Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.10672","last_updated":"2020-10-07T01:15:06Z","snapshot_observed_at":"2026-08-09T02:11:01.681294Z","submitted_at":"2020-06-18T16:55:20Z","title":"Federated Learning With Quantized Global Model Updates","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.10672","snapshot_observed_at":"2026-08-09T19:54:41.534388Z","title":"Kulkarni, and H","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2502.00206","last_updated":"2025-01-31T22:48:43Z","snapshot_observed_at":"2026-08-15T10:56:56.118555Z","submitted_at":"2025-01-31T22:48:43Z","title":"BICompFL: Stochastic Federated Learning with Bi-Directional Compression","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-09T19:54:41.534388Z"},"links":{"cited_paper":"/paper/2006.10672","citing_paper":"/paper/2502.00206"},"observation_digest":"sha256:eaa6dd874971443c9dabb0196e50a83e17ca0395650726ce181e61e351c2d6c8","observation_id":"c0544a38-da4b-4933-876a-86df72b4880f","resolution":{"observed_at":"2026-08-09T19:54:41.534388Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:54:42.321616Z","title":"The sample size required in importance sampling","venue":null,"work_id":"594d5235-b050-4c77-b857-aeed25a2c92a","year":2018},"citing_paper":{"arxiv_id":"2502.00206","last_updated":"2025-01-31T22:48:43Z","snapshot_observed_at":"2026-08-15T10:56:56.118555Z","submitted_at":"2025-01-31T22:48:43Z","title":"BICompFL: Stochastic Federated Learning with Bi-Directional Compression","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-09T19:54:41.539850Z"},"links":{"citing_paper":"/paper/2502.00206"},"observation_digest":"sha256:6dc748344fcf3c2bcdeddca75a87149e84251f04262b6156d04341e8f160717d","observation_id":"7eedc403-1290-4b6a-8395-c447b44200e7","resolution":{"observed_at":"2026-08-09T19:54:42.326498Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.11857","last_updated":"2024-02-19T05:59:09Z","snapshot_observed_at":"2026-08-16T14:17:28.521985Z","submitted_at":"2024-02-19T05:59:09Z","title":"Communication-Efficient Distributed Learning with Local Immediate Error Compensation","version":1},"cited_work":{"arxiv_id":"2402.11857","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.11857","snapshot_observed_at":"2026-08-09T19:54:41.867427Z","title":"Communication-Efficient Distributed Learning with Local Immediate Error Compensation","venue":"cs.LG","work_id":"f98025af-327f-4db0-b00c-15eb4a557070","year":2024},"citing_paper":{"arxiv_id":"2502.00206","last_updated":"2025-01-31T22:48:43Z","snapshot_observed_at":"2026-08-15T10:56:56.118555Z","submitted_at":"2025-01-31T22:48:43Z","title":"BICompFL: Stochastic Federated Learning with Bi-Directional Compression","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-09T19:54:41.544135Z"},"links":{"cited_paper":"/paper/2402.11857","citing_paper":"/paper/2502.00206"},"observation_digest":"sha256:0c470367d9aa041add52a6884969bec98942a5faca963751197afbbc5d1f420b","observation_id":"e591b6f1-2103-41dd-905c-0a5e1eb3bf8c","resolution":{"observed_at":"2026-08-09T19:54:41.873974Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:54:42.302358Z","title":"Elements of information theory","venue":null,"work_id":"898a006d-b98e-488e-9ed0-7b7a8856bf51","year":2006},"citing_paper":{"arxiv_id":"2502.00206","last_updated":"2025-01-31T22:48:43Z","snapshot_observed_at":"2026-08-15T10:56:56.118555Z","submitted_at":"2025-01-31T22:48:43Z","title":"BICompFL: Stochastic Federated Learning with Bi-Directional Compression","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-09T19:54:41.548947Z"},"links":{"citing_paper":"/paper/2502.00206"},"observation_digest":"sha256:a5bc5aab0111ac95aa9d565d548e29bcc2813b16f9ec5b7f284ac57c756660ea","observation_id":"4b20f330-b052-41d9-a8f2-527845e7351a","resolution":{"observed_at":"2026-08-09T19:54:42.307945Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:54:42.280663Z","title":"DoCoFL : Downlink compression for cross-device federated learning","venue":null,"work_id":"12939880-d2d1-4f9a-a003-374783a35164","year":2023},"citing_paper":{"arxiv_id":"2502.00206","last_updated":"2025-01-31T22:48:43Z","snapshot_observed_at":"2026-08-15T10:56:56.118555Z","submitted_at":"2025-01-31T22:48:43Z","title":"BICompFL: Stochastic Federated Learning with Bi-Directional Compression","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-09T19:54:41.553337Z"},"links":{"citing_paper":"/paper/2502.00206"},"observation_digest":"sha256:25daae35dedcdfb215df697588dc7f534543b0f448820a5ddf084e9494bf3b7f","observation_id":"1744da45-9161-4912-9f98-9a5d7a5643b0","resolution":{"observed_at":"2026-08-09T19:54:42.290468Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:54:41.557577Z","title":"The lottery ticket hypothesis: Finding sparse, trainable neural networks","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.00206","last_updated":"2025-01-31T22:48:43Z","snapshot_observed_at":"2026-08-15T10:56:56.118555Z","submitted_at":"2025-01-31T22:48:43Z","title":"BICompFL: Stochastic Federated Learning with Bi-Directional Compression","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-09T19:54:41.557577Z"},"links":{"citing_paper":"/paper/2502.00206"},"observation_digest":"sha256:6470135d4ce74c5a430b69e5ccb9724930a10f6660325f52c47b4f55d760cd8b","observation_id":"5c4da31c-cee0-48a7-90e6-46be2e9fb03d","resolution":{"observed_at":"2026-08-09T19:54:41.557577Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:54:42.256323Z","title":"vqSGD : Vector quantized stochastic gradient descent","venue":null,"work_id":"2851e9e9-c01d-40bc-a865-0e4954dde7d3","year":2021},"citing_paper":{"arxiv_id":"2502.00206","last_updated":"2025-01-31T22:48:43Z","snapshot_observed_at":"2026-08-15T10:56:56.118555Z","submitted_at":"2025-01-31T22:48:43Z","title":"BICompFL: Stochastic Federated Learning with Bi-Directional Compression","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-09T19:54:41.561959Z"},"links":{"citing_paper":"/paper/2502.00206"},"observation_digest":"sha256:c5cbf4116ccdf9d7bd2aff2c5fc61de5544f4fa0f22819aabffba8a8ccacddb7","observation_id":"9438079b-ffd7-40ba-923f-591e66a144ac","resolution":{"observed_at":"2026-08-09T19:54:42.261319Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:54:42.242703Z","title":"EF21-P and friends: Improved theoretical communication complexity for distributed optimization with bidirectional compression","venue":null,"work_id":"e98f748d-1323-4b36-827e-ed7fbd4d396f","year":2023},"citing_paper":{"arxiv_id":"2502.00206","last_updated":"2025-01-31T22:48:43Z","snapshot_observed_at":"2026-08-15T10:56:56.118555Z","submitted_at":"2025-01-31T22:48:43Z","title":"BICompFL: Stochastic Federated Learning with Bi-Directional Compression","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-09T19:54:41.566297Z"},"links":{"citing_paper":"/paper/2502.00206"},"observation_digest":"sha256:6e3c1dbe9fbf6cdf7ee4d1a58aff5d0b03f09501fc13d6b126a5b60741b217f3","observation_id":"ddc12b13-deed-43bf-a068-eebd9bbbfc0b","resolution":{"observed_at":"2026-08-09T19:54:42.247352Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.06412","last_updated":"2024-11-02T18:54:03Z","snapshot_observed_at":"2026-08-16T14:19:53.568422Z","submitted_at":"2024-02-09T13:58:33Z","title":"Improving the Worst-Case Bidirectional Communication Complexity for Nonconvex Distributed Optimization under Function Similarity","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.06412","snapshot_observed_at":"2026-08-09T19:54:41.570533Z","title":"Improving the worst-case bidirectional communication complexity for nonconvex distributed optimization under function similarity","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.00206","last_updated":"2025-01-31T22:48:43Z","snapshot_observed_at":"2026-08-15T10:56:56.118555Z","submitted_at":"2025-01-31T22:48:43Z","title":"BICompFL: Stochastic Federated Learning with Bi-Directional Compression","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-09T19:54:41.570533Z"},"links":{"cited_paper":"/paper/2402.06412","citing_paper":"/paper/2502.00206"},"observation_digest":"sha256:16af97f1782e341063a8536c3702d810af9b1aecf7de6e00770a9756a4cb5f3f","observation_id":"d642548d-837f-453f-8cae-b46953b186fd","resolution":{"observed_at":"2026-08-09T19:54:41.570533Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:54:42.229677Z","title":"Minimal random code learning: Getting bits back from compressed model parameters","venue":null,"work_id":"f101842a-026e-4dfc-95f0-13731ebddca8","year":2019},"citing_paper":{"arxiv_id":"2502.00206","last_updated":"2025-01-31T22:48:43Z","snapshot_observed_at":"2026-08-15T10:56:56.118555Z","submitted_at":"2025-01-31T22:48:43Z","title":"BICompFL: Stochastic Federated Learning with Bi-Directional Compression","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-09T19:54:41.574516Z"},"links":{"citing_paper":"/paper/2502.00206"},"observation_digest":"sha256:a160590d273364bdd3bbe589c0068d1e541df497b1411410c6389fe6b2da53fc","observation_id":"1197d661-33d5-4340-8e74-75aed0018dbb","resolution":{"observed_at":"2026-08-09T19:54:42.234124Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:54:42.217201Z","title":"Natural compression for distributed deep learning","venue":null,"work_id":"a1e3c84e-5835-4173-8a98-af33be371837","year":2022},"citing_paper":{"arxiv_id":"2502.00206","last_updated":"2025-01-31T22:48:43Z","snapshot_observed_at":"2026-08-15T10:56:56.118555Z","submitted_at":"2025-01-31T22:48:43Z","title":"BICompFL: Stochastic Federated Learning with Bi-Directional Compression","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-09T19:54:41.577453Z"},"links":{"citing_paper":"/paper/2502.00206"},"observation_digest":"sha256:3ed40996c3396e4191c23dcd5c9ca1b6c94051712eb2671bea7dea3cdb582026","observation_id":"c8eb371a-1159-43f6-9484-d9a5d40b5d50","resolution":{"observed_at":"2026-08-09T19:54:42.221432Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:54:42.202975Z","title":"Lower bounds and nearly optimal algorithms in distributed learning with communication compression","venue":null,"work_id":"8fe344df-305b-4924-a026-101f16f2976d","year":2022},"citing_paper":{"arxiv_id":"2502.00206","last_updated":"2025-01-31T22:48:43Z","snapshot_observed_at":"2026-08-15T10:56:56.118555Z","submitted_at":"2025-01-31T22:48:43Z","title":"BICompFL: Stochastic Federated Learning with Bi-Directional Compression","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-09T19:54:41.580323Z"},"links":{"citing_paper":"/paper/2502.00206"},"observation_digest":"sha256:0e4f647b8e0d790c61d13533f8d8aa4e1c440eddba69c5625dcc11331ade66da","observation_id":"c1421abc-9761-4978-a8dc-cf534f98849c","resolution":{"observed_at":"2026-08-09T19:54:42.207805Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:54:42.189085Z","title":"Sparse random networks for communication-efficient federated learning","venue":null,"work_id":"7f390e05-30d8-4d6d-9bbc-d2b7ae465f64","year":2023},"citing_paper":{"arxiv_id":"2502.00206","last_updated":"2025-01-31T22:48:43Z","snapshot_observed_at":"2026-08-15T10:56:56.118555Z","submitted_at":"2025-01-31T22:48:43Z","title":"BICompFL: Stochastic Federated Learning with Bi-Directional Compression","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-09T19:54:41.583587Z"},"links":{"citing_paper":"/paper/2502.00206"},"observation_digest":"sha256:121cc3c2c0fa4fe2525821203400c2e8736f82da41421537ca077966a1a2642c","observation_id":"dbca338a-e874-4d10-9f08-8b671357e528","resolution":{"observed_at":"2026-08-09T19:54:42.193740Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:54:42.173404Z","title":"Adaptive compression in federated learning via side information","venue":null,"work_id":"8721b552-902d-4c8e-94b2-f8b99396f267","year":2024},"citing_paper":{"arxiv_id":"2502.00206","last_updated":"2025-01-31T22:48:43Z","snapshot_observed_at":"2026-08-15T10:56:56.118555Z","submitted_at":"2025-01-31T22:48:43Z","title":"BICompFL: Stochastic Federated Learning with Bi-Directional Compression","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-09T19:54:41.587072Z"},"links":{"citing_paper":"/paper/2502.00206"},"observation_digest":"sha256:7c40cbc36d0717d1c5cc21d92b312c7d537e582f1a5748a417a3ac3690a64b17","observation_id":"3d83b14e-be02-437e-8b1f-63d83bd34f47","resolution":{"observed_at":"2026-08-09T19:54:42.177996Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:54:42.158524Z","title":"Error feedback fixes SignSGD and other gradient compression schemes","venue":null,"work_id":"2e4a7e21-7046-42a8-ab41-878cb0b14e71","year":2019},"citing_paper":{"arxiv_id":"2502.00206","last_updated":"2025-01-31T22:48:43Z","snapshot_observed_at":"2026-08-15T10:56:56.118555Z","submitted_at":"2025-01-31T22:48:43Z","title":"BICompFL: Stochastic Federated Learning with Bi-Directional Compression","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-09T19:54:41.590705Z"},"links":{"citing_paper":"/paper/2502.00206"},"observation_digest":"sha256:e2dbcfa707302a41dc019a2d2e277f6a1ea5659bbbc53a75ecc921770c349dde","observation_id":"3a3cb79c-e132-4227-bf0e-1a5454dd274d","resolution":{"observed_at":"2026-08-09T19:54:42.163882Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:54:41.593996Z","title":"Adam: A method for stochastic optimization","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2502.00206","last_updated":"2025-01-31T22:48:43Z","snapshot_observed_at":"2026-08-15T10:56:56.118555Z","submitted_at":"2025-01-31T22:48:43Z","title":"BICompFL: Stochastic Federated Learning with Bi-Directional Compression","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-09T19:54:41.593996Z"},"links":{"citing_paper":"/paper/2502.00206"},"observation_digest":"sha256:80f424528184dc03c7f1027c6f86cda13c4ca1cfbb59779fec8cd5f8dd5e578b","observation_id":"edad39fd-e353-4b65-9a5f-ac233568b08d","resolution":{"observed_at":"2026-08-09T19:54:41.593996Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:54:41.597375Z","title":"Lecun, L","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2502.00206","last_updated":"2025-01-31T22:48:43Z","snapshot_observed_at":"2026-08-15T10:56:56.118555Z","submitted_at":"2025-01-31T22:48:43Z","title":"BICompFL: Stochastic Federated Learning with Bi-Directional Compression","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-09T19:54:41.597375Z"},"links":{"citing_paper":"/paper/2502.00206"},"observation_digest":"sha256:099a32b6b73a29de8dfee2756239fc31261c7efa9f176094aae091b7bdb7688e","observation_id":"40288b40-a1c6-4297-b25c-300e14b04928","resolution":{"observed_at":"2026-08-09T19:54:41.597375Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:54:42.131413Z","title":"Communication-Efficient Learning of Deep Networks from Decentralized Data","venue":null,"work_id":"f9541936-f718-4e7c-b534-95b8106b4bee","year":2017},"citing_paper":{"arxiv_id":"2502.00206","last_updated":"2025-01-31T22:48:43Z","snapshot_observed_at":"2026-08-15T10:56:56.118555Z","submitted_at":"2025-01-31T22:48:43Z","title":"BICompFL: Stochastic Federated Learning with Bi-Directional Compression","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-09T19:54:41.601021Z"},"links":{"citing_paper":"/paper/2502.00206"},"observation_digest":"sha256:029527de034bb8d0eea4d5daba913c59f199a522988e98945634f0883a8637bd","observation_id":"a0d13c6c-7aaa-45d2-99f7-0960ee97c418","resolution":{"observed_at":"2026-08-09T19:54:42.136283Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.14591","last_updated":"2022-06-19T15:40:37Z","snapshot_observed_at":"2026-08-12T03:09:42.476215Z","submitted_at":"2020-06-25T17:37:45Z","title":"Bidirectional compression in heterogeneous settings for distributed or federated learning with partial participation: tight convergence guarantees","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.14591","snapshot_observed_at":"2026-08-09T19:54:41.604681Z","title":"Bidirectional compression in heterogeneous settings for distributed or federated learning with partial participation: tight convergence guarantees","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2502.00206","last_updated":"2025-01-31T22:48:43Z","snapshot_observed_at":"2026-08-15T10:56:56.118555Z","submitted_at":"2025-01-31T22:48:43Z","title":"BICompFL: Stochastic Federated Learning with Bi-Directional Compression","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-09T19:54:41.604681Z"},"links":{"cited_paper":"/paper/2006.14591","citing_paper":"/paper/2502.00206"},"observation_digest":"sha256:8ec7fadb72dc417eaec2669d66f4ced8dd891a6afad934206782b2e44d12477c","observation_id":"3f2e247e-b4ff-40a3-b8e9-d6907decc848","resolution":{"observed_at":"2026-08-09T19:54:41.604681Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:54:42.119771Z","title":"Preserved central model for faster bidirectional compression in distributed settings","venue":null,"work_id":"d94df496-9bf4-48c8-a559-0d6da8976a13","year":2021},"citing_paper":{"arxiv_id":"2502.00206","last_updated":"2025-01-31T22:48:43Z","snapshot_observed_at":"2026-08-15T10:56:56.118555Z","submitted_at":"2025-01-31T22:48:43Z","title":"BICompFL: Stochastic Federated Learning with Bi-Directional Compression","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-09T19:54:41.609333Z"},"links":{"citing_paper":"/paper/2502.00206"},"observation_digest":"sha256:2b6f866db9b1bf759fba9d587a2a34368e4487e033fcf9ea7956aa5a1b0f1af0","observation_id":"5609cb75-25e5-4179-8e30-b573419491b1","resolution":{"observed_at":"2026-08-09T19:54:42.124185Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:54:42.105703Z","title":"What's hidden in a randomly weighted neural network? In IEEE/CVF conference on computer vision and pattern recognition, pp.\\ 11893--11902, 2020","venue":null,"work_id":"1885d923-a3fe-42e6-90b9-d551f6e24f30","year":2020},"citing_paper":{"arxiv_id":"2502.00206","last_updated":"2025-01-31T22:48:43Z","snapshot_observed_at":"2026-08-15T10:56:56.118555Z","submitted_at":"2025-01-31T22:48:43Z","title":"BICompFL: Stochastic Federated Learning with Bi-Directional Compression","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-09T19:54:41.612993Z"},"links":{"citing_paper":"/paper/2502.00206"},"observation_digest":"sha256:0a4659ca67d8641838e24b94bc165d9241252db36bec64eb3a1e27bb4799e6e2","observation_id":"5d15b3da-97d1-4827-8e3e-dac0f17246d3","resolution":{"observed_at":"2026-08-09T19:54:42.110706Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:54:42.092608Z","title":"Ef21: A new, simpler, theoretically better, and practically faster error feedback","venue":null,"work_id":"e365cec4-4dc2-4e26-a98e-4d3ccfc049ea","year":2021},"citing_paper":{"arxiv_id":"2502.00206","last_updated":"2025-01-31T22:48:43Z","snapshot_observed_at":"2026-08-15T10:56:56.118555Z","submitted_at":"2025-01-31T22:48:43Z","title":"BICompFL: Stochastic Federated Learning with Bi-Directional Compression","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-09T19:54:41.617180Z"},"links":{"citing_paper":"/paper/2502.00206"},"observation_digest":"sha256:553776dc6461301e0500fdf56eb76a15a3e854be0b489678e423c1ff50ed80d3","observation_id":"305c1acf-06ae-4e86-bd4e-e1a8382940ff","resolution":{"observed_at":"2026-08-09T19:54:42.096697Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:54:42.079750Z","title":"1-bit stochastic gradient descent and its application to data-parallel distributed training of speech DNNs","venue":null,"work_id":"ef6c2544-ade1-4c29-8700-9ba1fa2867cc","year":2014},"citing_paper":{"arxiv_id":"2502.00206","last_updated":"2025-01-31T22:48:43Z","snapshot_observed_at":"2026-08-15T10:56:56.118555Z","submitted_at":"2025-01-31T22:48:43Z","title":"BICompFL: Stochastic Federated Learning with Bi-Directional Compression","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-09T19:54:41.621624Z"},"links":{"citing_paper":"/paper/2502.00206"},"observation_digest":"sha256:8dbd82d0d2af5c60ee7d2a27834781b17aa7953822ee4b80fdda8a9ceed0aba3","observation_id":"c9c3d054-2705-4f05-8da5-e0a8708a2630","resolution":{"observed_at":"2026-08-09T19:54:42.084260Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:54:42.068608Z","title":"A distributed synchronous SGD algorithm with global top-k sparsification for low bandwidth networks","venue":null,"work_id":"0aebdaac-6f0c-4c2c-98c5-64d4337e92a8","year":2019},"citing_paper":{"arxiv_id":"2502.00206","last_updated":"2025-01-31T22:48:43Z","snapshot_observed_at":"2026-08-15T10:56:56.118555Z","submitted_at":"2025-01-31T22:48:43Z","title":"BICompFL: Stochastic Federated Learning with Bi-Directional Compression","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-09T19:54:41.625697Z"},"links":{"citing_paper":"/paper/2502.00206"},"observation_digest":"sha256:234a13b1ff2e41f3afd141d4fa1250040660736e806ed8e0f87bab9094af71e1","observation_id":"6daea999-c4c3-49d8-a233-e43fc25bc246","resolution":{"observed_at":"2026-08-09T19:54:42.072635Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:54:42.056252Z","title":"Importance sampling: Applications in communications and detection","venue":null,"work_id":"56ec5e49-1f63-47cd-8139-a38a46f7b2b9","year":2002},"citing_paper":{"arxiv_id":"2502.00206","last_updated":"2025-01-31T22:48:43Z","snapshot_observed_at":"2026-08-15T10:56:56.118555Z","submitted_at":"2025-01-31T22:48:43Z","title":"BICompFL: Stochastic Federated Learning with Bi-Directional Compression","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-09T19:54:41.629456Z"},"links":{"citing_paper":"/paper/2502.00206"},"observation_digest":"sha256:7825b0c93b96b21f2bdb1c4871dc5353b475648eb9db55ea76077eb38766abed","observation_id":"ad57469a-3441-448d-90fe-a7ec5795a9fc","resolution":{"observed_at":"2026-08-09T19:54:42.060812Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:54:42.044974Z","title":"Sparsified SGD with memory","venue":null,"work_id":"e2011cf6-6181-4c03-9dea-bc142b36cccc","year":2018},"citing_paper":{"arxiv_id":"2502.00206","last_updated":"2025-01-31T22:48:43Z","snapshot_observed_at":"2026-08-15T10:56:56.118555Z","submitted_at":"2025-01-31T22:48:43Z","title":"BICompFL: Stochastic Federated Learning with Bi-Directional Compression","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-09T19:54:41.633587Z"},"links":{"citing_paper":"/paper/2502.00206"},"observation_digest":"sha256:8a3b58fa2b70c74187e942990416923b0a8268c656f33a3a99df282c9348648c","observation_id":"90fa7a00-b238-42e0-a83e-151e7e478d68","resolution":{"observed_at":"2026-08-09T19:54:42.048638Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:54:42.033828Z","title":"Doublesqueeze: Parallel stochastic gradient descent with double-pass error-compensated compression","venue":null,"work_id":"6445356b-3896-4cf6-bfe6-faefafd08ac4","year":2019},"citing_paper":{"arxiv_id":"2502.00206","last_updated":"2025-01-31T22:48:43Z","snapshot_observed_at":"2026-08-15T10:56:56.118555Z","submitted_at":"2025-01-31T22:48:43Z","title":"BICompFL: Stochastic Federated Learning with Bi-Directional Compression","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-09T19:54:41.637466Z"},"links":{"citing_paper":"/paper/2502.00206"},"observation_digest":"sha256:283fc023bbeb507b3584cc53c65b8b914f9b2a20909d9c0a72f06d3d56d0edbe","observation_id":"5973b717-b063-4588-b39c-0eb13fd9a874","resolution":{"observed_at":"2026-08-09T19:54:42.038213Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:54:42.021990Z","title":"DP - REC : Private & communication-efficient federated learning, 2022","venue":null,"work_id":"a6d4f3e0-28d6-4cf5-a22c-e77445e48a2d","year":2022},"citing_paper":{"arxiv_id":"2502.00206","last_updated":"2025-01-31T22:48:43Z","snapshot_observed_at":"2026-08-15T10:56:56.118555Z","submitted_at":"2025-01-31T22:48:43Z","title":"BICompFL: Stochastic Federated Learning with Bi-Directional Compression","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-09T19:54:41.641433Z"},"links":{"citing_paper":"/paper/2502.00206"},"observation_digest":"sha256:ec2f2ce0576f0c4994c3e6ca6b0409d6561e79394a89055527ef568921a623ea","observation_id":"194fa0e1-b08d-4a3a-8510-20524fb40901","resolution":{"observed_at":"2026-08-09T19:54:42.026587Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:54:42.008572Z","title":"2Direction: theoretically faster distributed training with bidirectional communication compression","venue":null,"work_id":"f80282bd-b663-4404-9bda-70096dc8cef6","year":2023},"citing_paper":{"arxiv_id":"2502.00206","last_updated":"2025-01-31T22:48:43Z","snapshot_observed_at":"2026-08-15T10:56:56.118555Z","submitted_at":"2025-01-31T22:48:43Z","title":"BICompFL: Stochastic Federated Learning with Bi-Directional Compression","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-09T19:54:41.645137Z"},"links":{"citing_paper":"/paper/2502.00206"},"observation_digest":"sha256:b5b5d6e1a69abbeb606e2edb5a5f087ad4d7523fe991a90fdf728ab404cd7522","observation_id":"bc4e7ecd-bf57-4652-9ce9-f7f9b54647c3","resolution":{"observed_at":"2026-08-09T19:54:42.014188Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:54:41.996101Z","title":"QLSD: quantised langevin stochastic dynamics for bayesian federated learning","venue":null,"work_id":"502dfe6f-c4cd-4ca8-a9b1-f12433e21b17","year":2022},"citing_paper":{"arxiv_id":"2502.00206","last_updated":"2025-01-31T22:48:43Z","snapshot_observed_at":"2026-08-15T10:56:56.118555Z","submitted_at":"2025-01-31T22:48:43Z","title":"BICompFL: Stochastic Federated Learning with Bi-Directional Compression","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-09T19:54:41.648757Z"},"links":{"citing_paper":"/paper/2502.00206"},"observation_digest":"sha256:1f26842f96f2b55b7a02c69baf1cfe950845f4ac25620ddcddc5f6e180fa03bb","observation_id":"d62d2772-81c6-478e-ad22-220571b9d692","resolution":{"observed_at":"2026-08-09T19:54:42.000723Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:54:41.652442Z","title":"Gradient sparsification for communication-efficient distributed optimization","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.00206","last_updated":"2025-01-31T22:48:43Z","snapshot_observed_at":"2026-08-15T10:56:56.118555Z","submitted_at":"2025-01-31T22:48:43Z","title":"BICompFL: Stochastic Federated Learning with Bi-Directional Compression","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-09T19:54:41.652442Z"},"links":{"citing_paper":"/paper/2502.00206"},"observation_digest":"sha256:8a6dd4ca63d08282833fd3400c271c365ebb3d19afcddfd4b0d6e74d7765f4e6","observation_id":"89cce0e1-7dc3-47ab-a84a-5768325f172d","resolution":{"observed_at":"2026-08-09T19:54:41.652442Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:54:41.973028Z","title":"Multi-armed bandits with self-information rewards","venue":null,"work_id":"d20fbff5-529c-4091-bfbe-f9541a3988d2","year":2023},"citing_paper":{"arxiv_id":"2502.00206","last_updated":"2025-01-31T22:48:43Z","snapshot_observed_at":"2026-08-15T10:56:56.118555Z","submitted_at":"2025-01-31T22:48:43Z","title":"BICompFL: Stochastic Federated Learning with Bi-Directional Compression","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-09T19:54:41.656142Z"},"links":{"citing_paper":"/paper/2502.00206"},"observation_digest":"sha256:c88c3613066b051d8cfc399ccd3a795e0f2208d50a3ee3c58f115278215103bc","observation_id":"3a44b7c4-1df1-429a-aa2f-42bc71a9c06a","resolution":{"observed_at":"2026-08-09T19:54:41.977716Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:54:41.659830Z","title":"A survey on federated learning: challenges and applications","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.00206","last_updated":"2025-01-31T22:48:43Z","snapshot_observed_at":"2026-08-15T10:56:56.118555Z","submitted_at":"2025-01-31T22:48:43Z","title":"BICompFL: Stochastic Federated Learning with Bi-Directional Compression","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-09T19:54:41.659830Z"},"links":{"citing_paper":"/paper/2502.00206"},"observation_digest":"sha256:122fb3dcea107879ba07ae068a86a6f406373c04085a532cc9b9f3106ac9d366","observation_id":"9180f107-4964-42f2-a330-3ee6e4d22e9f","resolution":{"observed_at":"2026-08-09T19:54:41.659830Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:54:41.954166Z","title":"TernGrad : Ternary gradients to reduce communication in distributed deep learning","venue":null,"work_id":"063c6a21-be79-418a-805e-bb37d71c68db","year":2017},"citing_paper":{"arxiv_id":"2502.00206","last_updated":"2025-01-31T22:48:43Z","snapshot_observed_at":"2026-08-15T10:56:56.118555Z","submitted_at":"2025-01-31T22:48:43Z","title":"BICompFL: Stochastic Federated Learning with Bi-Directional Compression","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-09T19:54:41.664403Z"},"links":{"citing_paper":"/paper/2502.00206"},"observation_digest":"sha256:78b443dca06b83c44c6185d293b0fe462376d82e3edcdc4d7ec929277ee22415","observation_id":"d22ba350-2a1a-47de-8d5e-75edd641c414","resolution":{"observed_at":"2026-08-09T19:54:41.958484Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:54:41.940961Z","title":"Cser: Communication-efficient sgd with error reset","venue":null,"work_id":"1288e089-c0e9-41e4-9d25-92ee77435634","year":2020},"citing_paper":{"arxiv_id":"2502.00206","last_updated":"2025-01-31T22:48:43Z","snapshot_observed_at":"2026-08-15T10:56:56.118555Z","submitted_at":"2025-01-31T22:48:43Z","title":"BICompFL: Stochastic Federated Learning with Bi-Directional Compression","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-09T19:54:41.668174Z"},"links":{"citing_paper":"/paper/2502.00206"},"observation_digest":"sha256:446ebaca74d55650b9078736451085306b37de2a66c1f15a0e9d39014d022526","observation_id":"5662cd5f-1937-4186-a87f-236f7c198526","resolution":{"observed_at":"2026-08-09T19:54:41.944787Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:54:41.930862Z","title":"A survey on federated learning","venue":null,"work_id":"78e951a3-85b1-4be3-9a21-e842f28168fd","year":2021},"citing_paper":{"arxiv_id":"2502.00206","last_updated":"2025-01-31T22:48:43Z","snapshot_observed_at":"2026-08-15T10:56:56.118555Z","submitted_at":"2025-01-31T22:48:43Z","title":"BICompFL: Stochastic Federated Learning with Bi-Directional Compression","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-09T19:54:41.671779Z"},"links":{"citing_paper":"/paper/2502.00206"},"observation_digest":"sha256:1683b6b279045accca5a6eea1f1468fa81213ac9349c0483b9e282cd1ce66ba4","observation_id":"0a7a07b8-690f-4cc1-b1b2-722a7c2000b8","resolution":{"observed_at":"2026-08-09T19:54:41.934256Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:54:41.920666Z","title":"Communication-efficient distributed blockwise momentum SGD with error-feedback","venue":null,"work_id":"29a0bec3-c6bd-4f7a-925a-ce73b5274071","year":2019},"citing_paper":{"arxiv_id":"2502.00206","last_updated":"2025-01-31T22:48:43Z","snapshot_observed_at":"2026-08-15T10:56:56.118555Z","submitted_at":"2025-01-31T22:48:43Z","title":"BICompFL: Stochastic Federated Learning with Bi-Directional Compression","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-09T19:54:41.675401Z"},"links":{"citing_paper":"/paper/2502.00206"},"observation_digest":"sha256:c702ab355648a3fd3e66e419e8568576384a294ebca476480cb37fb2153d7073","observation_id":"34985e4d-e2a7-42e7-a58b-594356912909","resolution":{"observed_at":"2026-08-09T19:54:41.924237Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:54:41.679052Z","title":"@esa (Ref","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.00206","last_updated":"2025-01-31T22:48:43Z","snapshot_observed_at":"2026-08-15T10:56:56.118555Z","submitted_at":"2025-01-31T22:48:43Z","title":"BICompFL: Stochastic Federated Learning with Bi-Directional Compression","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-09T19:54:41.679052Z"},"links":{"citing_paper":"/paper/2502.00206"},"observation_digest":"sha256:211c21d1ecba534ef03477f4ae4ed26ddde5875daae9a6b711c6c8afaa9cac72","observation_id":"22c68df7-9592-445c-84bd-66b5758b4926","resolution":{"observed_at":"2026-08-09T19:54:41.679052Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:54:41.683927Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.00206","last_updated":"2025-01-31T22:48:43Z","snapshot_observed_at":"2026-08-15T10:56:56.118555Z","submitted_at":"2025-01-31T22:48:43Z","title":"BICompFL: Stochastic Federated Learning with Bi-Directional Compression","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-09T19:54:41.683927Z"},"links":{"citing_paper":"/paper/2502.00206"},"observation_digest":"sha256:57fa362d83f9e6e545ceb89f85e2db33f6f5d062ff74ad9e8f405e32898d7043","observation_id":"f0abb1d8-6c9c-498c-ac14-47320f2148bc","resolution":{"observed_at":"2026-08-09T19:54:41.683927Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:54:41.688032Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.00206","last_updated":"2025-01-31T22:48:43Z","snapshot_observed_at":"2026-08-15T10:56:56.118555Z","submitted_at":"2025-01-31T22:48:43Z","title":"BICompFL: Stochastic Federated Learning with Bi-Directional Compression","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-09T19:54:41.688032Z"},"links":{"citing_paper":"/paper/2502.00206"},"observation_digest":"sha256:0db39363a6196612e416d9a9b8081e535ef9efa20ebb81632f48bc70c779d950","observation_id":"cdc28e84-3747-4859-ba53-63dfce5dd274","resolution":{"observed_at":"2026-08-09T19:54:41.688032Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2502.00206","last_updated":"2025-01-31T22:48:43Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-15T10:56:56.118555Z","submitted_at":"2025-01-31T22:48:43Z","title":"BICompFL: Stochastic Federated Learning with Bi-Directional Compression"},"reference_resolution":{"displayed":42,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":11,"verified_exact":2,"verified_fuzzy":29},"total_outbound_references":42},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 42 of 42 outbound references and 1 inbound Pith citation observation for arXiv:2502.00206."}