{"as_of":"2026-08-21T13:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b2cdfe82ef140fd05792e59c41cc6e9e2e24f8e3c16b00dabe4672210640289b","coverage":[{"denominator":23,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":23,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T21:37:36.834608Z","state":"measured"},{"denominator":25,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":25,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T21:37:36.774003Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-06-29T14:53:31.212543Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.04538","last_updated":"2025-09-10T22:18:08Z","snapshot_observed_at":"2026-08-20T09:37:13.527865Z","submitted_at":"2024-12-05T18:46:20Z","title":"Communication Compression for Distributed Learning without Control Variates","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.04538","snapshot_observed_at":"2026-08-11T21:37:36.774003Z","title":"The general problem formulation is to minimize the sum of client loss functions, which are typically non-convex","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2412.04538","last_updated":"2025-09-10T22:18:08Z","snapshot_observed_at":"2026-08-20T09:37:13.527865Z","submitted_at":"2024-12-05T18:46:20Z","title":"Communication Compression for Distributed Learning without Control Variates","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T21:37:36.774003Z"},"links":{"cited_paper":"/paper/2412.04538","citing_paper":"/paper/2412.04538"},"observation_digest":"sha256:53dff80fc6fb9022c96076c9e0f0e631f2d04d4c96eef7deeeec7123e06ce856","observation_id":"cd590159-51d6-46ef-8efe-c1a91a3e347c","resolution":{"observed_at":"2026-08-11T21:37:36.774003Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.04538","last_updated":"2025-09-10T22:18:08Z","snapshot_observed_at":"2026-08-20T09:37:13.527865Z","submitted_at":"2024-12-05T18:46:20Z","title":"Communication Compression for Distributed Learning without Control Variates","version":2},"cited_work":{"arxiv_id":"2412.04538","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.04538","snapshot_observed_at":"2026-06-29T14:53:31.212543Z","title":"Communication compression for distributed learning without control variates,","venue":null,"work_id":"e3df3f2f-8785-47a7-97fc-e9ac9005add7","year":2024},"citing_paper":{"arxiv_id":"2605.27831","last_updated":"2026-05-27T01:37:00Z","snapshot_observed_at":"2026-08-15T13:22:55.859357Z","submitted_at":"2026-05-27T01:37:00Z","title":"Decentralized Parameter-Free Online Learning with Compressed Gossip","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-29T14:49:21.541948Z"},"links":{"cited_paper":"/paper/2412.04538","citing_paper":"/paper/2605.27831"},"observation_digest":"sha256:c1ff55a279bdae8b101230289ab58cc54b6c0a9eb90a18cefb9742c62c85a228","observation_id":"843a879b-1351-4129-9d25-ab345fb9489d","resolution":{"observed_at":"2026-06-29T14:53:31.214001Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2412.04538/citation-record","integrity":"/paper/2412.04538/integrity","json":"/paper/2412.04538/citation-record.json","paper":"/paper/2412.04538"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.04538","last_updated":"2025-09-10T22:18:08Z","snapshot_observed_at":"2026-08-20T09:37:13.527865Z","submitted_at":"2024-12-05T18:46:20Z","title":"Communication Compression for Distributed Learning without Control Variates","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.04538","snapshot_observed_at":"2026-08-11T21:37:36.774003Z","title":"The general problem formulation is to minimize the sum of client loss functions, which are typically non-convex","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2412.04538","last_updated":"2025-09-10T22:18:08Z","snapshot_observed_at":"2026-08-20T09:37:13.527865Z","submitted_at":"2024-12-05T18:46:20Z","title":"Communication Compression for Distributed Learning without Control Variates","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T21:37:36.774003Z"},"links":{"cited_paper":"/paper/2412.04538","citing_paper":"/paper/2412.04538"},"observation_digest":"sha256:53dff80fc6fb9022c96076c9e0f0e631f2d04d4c96eef7deeeec7123e06ce856","observation_id":"cd590159-51d6-46ef-8efe-c1a91a3e347c","resolution":{"observed_at":"2026-08-11T21:37:36.774003Z","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-11T21:37:37.026487Z","title":"In [7], the authors study the error feedback mechanism for one-bit per coordinate bi- ased compression","venue":null,"work_id":"74adc3e4-5aa3-4552-9144-bab8693fe70e","year":null},"citing_paper":{"arxiv_id":"2412.04538","last_updated":"2025-09-10T22:18:08Z","snapshot_observed_at":"2026-08-20T09:37:13.527865Z","submitted_at":"2024-12-05T18:46:20Z","title":"Communication Compression for Distributed Learning without Control Variates","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T21:37:36.778356Z"},"links":{"citing_paper":"/paper/2412.04538"},"observation_digest":"sha256:b3412e0d721851793fd3c3d2942f5c20b793b43c5b362bc6ce222a6de6150310","observation_id":"a333f516-3242-4bd6-a042-b61f1d728d63","resolution":{"observed_at":"2026-08-11T21:37:37.029444Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:37:36.980649Z","title":"QSGD: Communication-efficient SGD via gradient quantization and encoding,","venue":null,"work_id":"9da919a6-8f71-4de9-810e-76c46e734920","year":2017},"citing_paper":{"arxiv_id":"2412.04538","last_updated":"2025-09-10T22:18:08Z","snapshot_observed_at":"2026-08-20T09:37:13.527865Z","submitted_at":"2024-12-05T18:46:20Z","title":"Communication Compression for Distributed Learning without Control Variates","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T21:37:36.795607Z"},"links":{"citing_paper":"/paper/2412.04538"},"observation_digest":"sha256:f7b2c0e7e7bc0d4c1c48e7a7f0cfbd866eb50dd1ec22600f759cfd61e9c8ea1a","observation_id":"3ffffdd3-08f1-4fc2-ab5b-a351e16a4c44","resolution":{"observed_at":"2026-08-11T21:37:36.983626Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:37:37.019217Z","title":null,"venue":null,"work_id":"321024c7-9193-4e2c-b800-349d1986b9fb","year":null},"citing_paper":{"arxiv_id":"2412.04538","last_updated":"2025-09-10T22:18:08Z","snapshot_observed_at":"2026-08-20T09:37:13.527865Z","submitted_at":"2024-12-05T18:46:20Z","title":"Communication Compression for Distributed Learning without Control Variates","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T21:37:36.781203Z"},"links":{"citing_paper":"/paper/2412.04538"},"observation_digest":"sha256:db51600b8d07ff698734870c00dfd0cc8c7b53a9e7dd88cfd6242457a13bd711","observation_id":"aa1b185d-b486-4fc1-a0df-9b0109cc8b0c","resolution":{"observed_at":"2026-08-11T21:37:37.021935Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:37:37.011306Z","title":"The selected datasets are MNIST, EMNIST, and CIFAR-100, and we fol- low [17] to choose models for the three datasets, which are CONV4,CONV4, and ResNet-18, respectively","venue":null,"work_id":"01a613ee-28c5-4452-b8ee-8b434996ea5d","year":null},"citing_paper":{"arxiv_id":"2412.04538","last_updated":"2025-09-10T22:18:08Z","snapshot_observed_at":"2026-08-20T09:37:13.527865Z","submitted_at":"2024-12-05T18:46:20Z","title":"Communication Compression for Distributed Learning without Control Variates","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T21:37:36.784111Z"},"links":{"citing_paper":"/paper/2412.04538"},"observation_digest":"sha256:bf27ca97f627dfcead6b9e2a0b9e3290b92785f17fdbaa116f388f67ddc8c1a5","observation_id":"d4cd0e18-1f60-432c-adad-fb35e0311014","resolution":{"observed_at":"2026-08-11T21:37:37.014582Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:37:37.003637Z","title":"By leveraging the previous aggregated update,CAFe makes local updates more compressible, reducing upload costs for biased compressors","venue":null,"work_id":"81263a09-9630-4ca0-8176-895b08b69dd1","year":null},"citing_paper":{"arxiv_id":"2412.04538","last_updated":"2025-09-10T22:18:08Z","snapshot_observed_at":"2026-08-20T09:37:13.527865Z","submitted_at":"2024-12-05T18:46:20Z","title":"Communication Compression for Distributed Learning without Control Variates","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T21:37:36.787251Z"},"links":{"citing_paper":"/paper/2412.04538"},"observation_digest":"sha256:ed6737247cea4accaac5aaa7f09ad1f26ab89168640b50619df99ca6268413db","observation_id":"11efdab0-df54-4cb3-9e66-5494fc3f4661","resolution":{"observed_at":"2026-08-11T21:37:37.006895Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:37:36.995930Z","title":"Communication-efficient learning of deep networks from decentralized data,","venue":null,"work_id":"3cafac34-c37e-4f7d-a495-d7a01ac70a6b","year":2017},"citing_paper":{"arxiv_id":"2412.04538","last_updated":"2025-09-10T22:18:08Z","snapshot_observed_at":"2026-08-20T09:37:13.527865Z","submitted_at":"2024-12-05T18:46:20Z","title":"Communication Compression for Distributed Learning without Control Variates","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T21:37:36.790073Z"},"links":{"citing_paper":"/paper/2412.04538"},"observation_digest":"sha256:20c0b2476acf05e50fd147b9e24cb0146be61ea7b0fe60fd4d171c380dd03d65","observation_id":"6caaec4c-c8c0-4141-b6b4-12db62358dc7","resolution":{"observed_at":"2026-08-11T21:37:36.998903Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:37:36.988296Z","title":"Advances and open problems in federated learn- ing,","venue":null,"work_id":"79ba3d5e-6412-4c82-aa38-dbe51e882d2b","year":2021},"citing_paper":{"arxiv_id":"2412.04538","last_updated":"2025-09-10T22:18:08Z","snapshot_observed_at":"2026-08-20T09:37:13.527865Z","submitted_at":"2024-12-05T18:46:20Z","title":"Communication Compression for Distributed Learning without Control Variates","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T21:37:36.793086Z"},"links":{"citing_paper":"/paper/2412.04538"},"observation_digest":"sha256:6c27d5e4ba69831e205b2d2cb4f237158d771082446cdea0d832b31091f56c9d","observation_id":"9105adf6-a233-4058-aaf8-33a643c90460","resolution":{"observed_at":"2026-08-11T21:37:36.991157Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:37:36.973155Z","title":"PowerSGD: Practical low-rank gradient com- pression for distributed optimization,","venue":null,"work_id":"19af17fd-bb9f-4c41-86bf-2ae2ac566862","year":2019},"citing_paper":{"arxiv_id":"2412.04538","last_updated":"2025-09-10T22:18:08Z","snapshot_observed_at":"2026-08-20T09:37:13.527865Z","submitted_at":"2024-12-05T18:46:20Z","title":"Communication Compression for Distributed Learning without Control Variates","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T21:37:36.798274Z"},"links":{"citing_paper":"/paper/2412.04538"},"observation_digest":"sha256:ea76c451e978b9fde8974511ddd69778dc1c31dafb120c3c258bb7f82b965999","observation_id":"54fc7409-f6d4-43c9-8d5d-c249bdf1aaf1","resolution":{"observed_at":"2026-08-11T21:37:36.976009Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:37:36.965715Z","title":"Sparse communica- tion for distributed gradient descent,","venue":null,"work_id":"9e5531b0-1fe6-4a63-bb86-36729b59247b","year":2017},"citing_paper":{"arxiv_id":"2412.04538","last_updated":"2025-09-10T22:18:08Z","snapshot_observed_at":"2026-08-20T09:37:13.527865Z","submitted_at":"2024-12-05T18:46:20Z","title":"Communication Compression for Distributed Learning without Control Variates","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T21:37:36.800954Z"},"links":{"citing_paper":"/paper/2412.04538"},"observation_digest":"sha256:aa7507f8c3cb7a142e0ca86ef97ec022a404bfee91fcc50529b734361c67b325","observation_id":"36da8dcb-c384-4db1-8dbe-a97da438ce60","resolution":{"observed_at":"2026-08-11T21:37:36.968561Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:37:36.957815Z","title":"On biased com- pression for distributed learning,","venue":null,"work_id":"32fa6e55-ccaa-428a-8b73-190bb37882e3","year":2023},"citing_paper":{"arxiv_id":"2412.04538","last_updated":"2025-09-10T22:18:08Z","snapshot_observed_at":"2026-08-20T09:37:13.527865Z","submitted_at":"2024-12-05T18:46:20Z","title":"Communication Compression for Distributed Learning without Control Variates","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T21:37:36.803667Z"},"links":{"citing_paper":"/paper/2412.04538"},"observation_digest":"sha256:205ba1f1f392f0fe2dcf35edc5aa3661258483ae86e60b03449ad124c325cdd2","observation_id":"2ab3c8e1-be1c-4049-a06f-9e6ba1538d4a","resolution":{"observed_at":"2026-08-11T21:37:36.960798Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:37:36.949570Z","title":"Error feedback fixes signSGD and other gradient compression schemes,","venue":null,"work_id":"a217df07-7d03-43f2-b6b0-2c68d1a59e4f","year":2019},"citing_paper":{"arxiv_id":"2412.04538","last_updated":"2025-09-10T22:18:08Z","snapshot_observed_at":"2026-08-20T09:37:13.527865Z","submitted_at":"2024-12-05T18:46:20Z","title":"Communication Compression for Distributed Learning without Control Variates","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T21:37:36.806183Z"},"links":{"citing_paper":"/paper/2412.04538"},"observation_digest":"sha256:93626b3a6e9e725e624eccea1601d468fdc5dcd7257af97dfc3e5a01288510b0","observation_id":"a0e290c4-b48b-486e-8fcc-f6c5d588c35c","resolution":{"observed_at":"2026-08-11T21:37:36.952628Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:37:36.941576Z","title":"Multiple-description video coding using motion-compensated temporal prediction,","venue":null,"work_id":"f7ab470b-5a81-41e4-8d76-069ddc12b217","year":2002},"citing_paper":{"arxiv_id":"2412.04538","last_updated":"2025-09-10T22:18:08Z","snapshot_observed_at":"2026-08-20T09:37:13.527865Z","submitted_at":"2024-12-05T18:46:20Z","title":"Communication Compression for Distributed Learning without Control Variates","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T21:37:36.808995Z"},"links":{"citing_paper":"/paper/2412.04538"},"observation_digest":"sha256:ec95835b2081f65fdf14f7fbd0ee8e1603382b9019c593eb237b05daec0d9c66","observation_id":"7811709b-7b4e-4e1d-b635-e6825926acd0","resolution":{"observed_at":"2026-08-11T21:37:36.944541Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:37:36.933437Z","title":"SCAFFOLD: Stochastic controlled averaging for federated learning,","venue":null,"work_id":"bdf7210d-8af8-482a-b7a8-63402336fc7e","year":2020},"citing_paper":{"arxiv_id":"2412.04538","last_updated":"2025-09-10T22:18:08Z","snapshot_observed_at":"2026-08-20T09:37:13.527865Z","submitted_at":"2024-12-05T18:46:20Z","title":"Communication Compression for Distributed Learning without Control Variates","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T21:37:36.811576Z"},"links":{"citing_paper":"/paper/2412.04538"},"observation_digest":"sha256:5eda583ef7540455366ad4e828859cb38560297793f0268418853979111ce153","observation_id":"fc50632d-55ef-491c-b31f-3f3f3fab401b","resolution":{"observed_at":"2026-08-11T21:37:36.936416Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:37:36.926102Z","title":"Sparsified SGD with memory,","venue":null,"work_id":"3c7e7b1f-69e6-4c4d-b8f7-e8f655c069d4","year":2018},"citing_paper":{"arxiv_id":"2412.04538","last_updated":"2025-09-10T22:18:08Z","snapshot_observed_at":"2026-08-20T09:37:13.527865Z","submitted_at":"2024-12-05T18:46:20Z","title":"Communication Compression for Distributed Learning without Control Variates","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T21:37:36.814163Z"},"links":{"citing_paper":"/paper/2412.04538"},"observation_digest":"sha256:0bf86ebb62bea8249ba087314074000e05fca51a92bac6a2fc7ee5788b8b23e1","observation_id":"911ca084-cb99-4e20-8fa5-827d1dcb42cb","resolution":{"observed_at":"2026-08-11T21:37:36.928786Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:37:36.918644Z","title":"The convergence of sparsified gradient methods,","venue":null,"work_id":"fc7eefd6-6cf4-4689-8540-6b49c5651485","year":2018},"citing_paper":{"arxiv_id":"2412.04538","last_updated":"2025-09-10T22:18:08Z","snapshot_observed_at":"2026-08-20T09:37:13.527865Z","submitted_at":"2024-12-05T18:46:20Z","title":"Communication Compression for Distributed Learning without Control Variates","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T21:37:36.816884Z"},"links":{"citing_paper":"/paper/2412.04538"},"observation_digest":"sha256:af246b8aade150cd7978cd646e79f139e48b873edcccc23f029227a97ba7029f","observation_id":"2e708350-ca6d-4455-abe0-19c294f8b244","resolution":{"observed_at":"2026-08-11T21:37:36.921517Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:37:36.910566Z","title":"Decentralized stochastic optimization and gossip algo- rithms with compressed communication,","venue":null,"work_id":"d0f40185-dfda-43f8-85ca-44af495277b9","year":2019},"citing_paper":{"arxiv_id":"2412.04538","last_updated":"2025-09-10T22:18:08Z","snapshot_observed_at":"2026-08-20T09:37:13.527865Z","submitted_at":"2024-12-05T18:46:20Z","title":"Communication Compression for Distributed Learning without Control Variates","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T21:37:36.819354Z"},"links":{"citing_paper":"/paper/2412.04538"},"observation_digest":"sha256:29490c075942143e0159dcaf3dd3c261be7afeacece060f80f80544ae382398c","observation_id":"bf2ea2f5-9a57-4d82-a0bc-1970bf637b8f","resolution":{"observed_at":"2026-08-11T21:37:36.913611Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:37:36.902363Z","title":"Gossiped and quantized online multi-kernel learning,","venue":null,"work_id":"b707b3e1-a000-4d30-917a-7d8cb2ec7b62","year":2023},"citing_paper":{"arxiv_id":"2412.04538","last_updated":"2025-09-10T22:18:08Z","snapshot_observed_at":"2026-08-20T09:37:13.527865Z","submitted_at":"2024-12-05T18:46:20Z","title":"Communication Compression for Distributed Learning without Control Variates","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T21:37:36.821850Z"},"links":{"citing_paper":"/paper/2412.04538"},"observation_digest":"sha256:cf65d2865f32a7ec2be3fcb76ea737c7af83a064a01efbf5ec330e45b73fef1c","observation_id":"73aaa9d5-00b5-4f44-b1f0-bdcbb1a44de7","resolution":{"observed_at":"2026-08-11T21:37:36.905306Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:37:36.893842Z","title":"Asynchronous federated learning with bidirectional quantized commu- nications and buffered aggregation,","venue":null,"work_id":"e831f3a8-d0ad-46a2-8884-d162ff3b654b","year":2023},"citing_paper":{"arxiv_id":"2412.04538","last_updated":"2025-09-10T22:18:08Z","snapshot_observed_at":"2026-08-20T09:37:13.527865Z","submitted_at":"2024-12-05T18:46:20Z","title":"Communication Compression for Distributed Learning without Control Variates","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T21:37:36.824330Z"},"links":{"citing_paper":"/paper/2412.04538"},"observation_digest":"sha256:e8ed89a624aeb8ad131c3e3e5f755314f1b9c211a5d75010e980d7a0c71324c6","observation_id":"0ee8b64f-190d-4c92-bde6-a9266b8f9334","resolution":{"observed_at":"2026-08-11T21:37:36.897021Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:37:36.885108Z","title":"Quantized and asynchronous federated learning,","venue":null,"work_id":"117ed2c3-6fef-405d-b513-a351922eac51","year":2024},"citing_paper":{"arxiv_id":"2412.04538","last_updated":"2025-09-10T22:18:08Z","snapshot_observed_at":"2026-08-20T09:37:13.527865Z","submitted_at":"2024-12-05T18:46:20Z","title":"Communication Compression for Distributed Learning without Control Variates","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T21:37:36.826976Z"},"links":{"citing_paper":"/paper/2412.04538"},"observation_digest":"sha256:2750625472e10315504e05bd418ae6b6e5d7401a3927a5f88ca93ebb4a22a026","observation_id":"e987680f-4fb8-4697-8747-6eee5dc8f020","resolution":{"observed_at":"2026-08-11T21:37:36.888178Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:37:36.876684Z","title":"EF21: A new, simpler, theoretically better, and prac- tically faster error feedback,","venue":null,"work_id":"60950d85-0c5a-4581-b247-7c80e0f35f42","year":2021},"citing_paper":{"arxiv_id":"2412.04538","last_updated":"2025-09-10T22:18:08Z","snapshot_observed_at":"2026-08-20T09:37:13.527865Z","submitted_at":"2024-12-05T18:46:20Z","title":"Communication Compression for Distributed Learning without Control Variates","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T21:37:36.829638Z"},"links":{"citing_paper":"/paper/2412.04538"},"observation_digest":"sha256:d02ad99ba0288534641e36ea4504bd027b4ea2697026ab9ecb14cda5b2ed6d05","observation_id":"796d2cf0-2fd9-48d6-984d-e758618b5ef7","resolution":{"observed_at":"2026-08-11T21:37:36.879707Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:37:36.866379Z","title":"Adap- tive compression in federated learning via side informa- tion,","venue":null,"work_id":"a4c8e5b5-537b-4767-8f61-32f91144c402","year":2024},"citing_paper":{"arxiv_id":"2412.04538","last_updated":"2025-09-10T22:18:08Z","snapshot_observed_at":"2026-08-20T09:37:13.527865Z","submitted_at":"2024-12-05T18:46:20Z","title":"Communication Compression for Distributed Learning without Control Variates","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T21:37:36.832175Z"},"links":{"citing_paper":"/paper/2412.04538"},"observation_digest":"sha256:48e5d1d29886b891e895b619be04f7e5268a696b9aff4fb71a5e40c562524cf2","observation_id":"8be0b749-e5c2-4051-8539-54efb333e771","resolution":{"observed_at":"2026-08-11T21:37:36.870918Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.20935","last_updated":"2025-01-28T12:26:45Z","snapshot_observed_at":"2026-08-20T09:36:45.820795Z","submitted_at":"2024-05-31T15:34:13Z","title":"Effective Interplay between Sparsity and Quantization: From Theory to Practice","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.20935","snapshot_observed_at":"2026-08-11T21:37:36.834608Z","title":"Effective interplay between sparsity and quantization: From theory to practice,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.04538","last_updated":"2025-09-10T22:18:08Z","snapshot_observed_at":"2026-08-20T09:37:13.527865Z","submitted_at":"2024-12-05T18:46:20Z","title":"Communication Compression for Distributed Learning without Control Variates","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T21:37:36.834608Z"},"links":{"cited_paper":"/paper/2405.20935","citing_paper":"/paper/2412.04538"},"observation_digest":"sha256:e63cec7e4c11073203db18bf08f97be6b3cc3f42f50355bff09e5267dfb3057c","observation_id":"8ac4e283-c000-4898-b83e-985dde295732","resolution":{"observed_at":"2026-08-11T21:37:36.834608Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2412.04538","last_updated":"2025-09-10T22:18:08Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-20T09:37:13.527865Z","submitted_at":"2024-12-05T18:46:20Z","title":"Communication Compression for Distributed Learning without Control Variates"},"reference_resolution":{"displayed":23,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":0,"verified_fuzzy":19},"total_outbound_references":23},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 23 of 23 outbound references and 2 inbound Pith citation observations for arXiv:2412.04538."}