{"as_of":"2026-08-16T16:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:93f136fc5aab5e4dd34d92c1f5032e74f281f5970cabe2c0b1f0d2b665aec20c","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":8,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":8,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":8,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":8,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T20:44:56.935157Z","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-05-23T19:03:21.891826Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2002.12410","last_updated":"2024-01-14T16:36:09Z","snapshot_observed_at":"2026-08-15T11:28:49.008698Z","submitted_at":"2020-02-27T19:52:24Z","title":"On Biased Compression for Distributed Learning","version":4},"cited_work":{"arxiv_id":"2002.12410","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2002.12410","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On biased compression for distributed learning","venue":null,"work_id":"0420bb27-40fe-4b81-8896-377958176bf8","year":2002},"citing_paper":{"arxiv_id":"2410.15368","last_updated":"2026-04-18T10:06:33Z","snapshot_observed_at":"2026-08-13T23:17:23.005963Z","submitted_at":"2024-10-20T11:53:25Z","title":"Tighter Performance Theory of FedExProx","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-05-23T18:58:32.168274Z"},"links":{"cited_paper":"/paper/2002.12410","citing_paper":"/paper/2410.15368"},"observation_digest":"sha256:4541bd0ee418da4f782c8ddadc803fcea7aeffd85c722021e6a0a0f9868710a1","observation_id":"9fcbb58b-25ab-471d-8615-8477c017405a","resolution":{"observed_at":"2026-05-23T19:03:21.896166Z","resolver_source":"arxiv_id","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":{"arxiv_id":"2002.12410","last_updated":"2024-01-14T16:36:09Z","snapshot_observed_at":"2026-08-15T11:28:49.008698Z","submitted_at":"2020-02-27T19:52:24Z","title":"On Biased Compression for Distributed Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.12410","snapshot_observed_at":"2026-08-15T20:44:56.935157Z","title":"Beznosikov, S","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2505.12409","last_updated":"2025-05-18T13:22:11Z","snapshot_observed_at":"2026-08-15T20:32:03.995719Z","submitted_at":"2025-05-18T13:22:11Z","title":"The Stochastic Multi-Proximal Method for Nonsmooth Optimization","version":1},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-15T20:44:56.935157Z"},"links":{"cited_paper":"/paper/2002.12410","citing_paper":"/paper/2505.12409"},"observation_digest":"sha256:940f529fed7a55e1d2f3bc0087c76290f19b8ddb248c90be7441e2ccef233e47","observation_id":"a8aff9a0-40f8-4ad6-ae27-57d2cccd30eb","resolution":{"observed_at":"2026-08-15T20:44:56.935157Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.12410","last_updated":"2024-01-14T16:36:09Z","snapshot_observed_at":"2026-08-15T11:28:49.008698Z","submitted_at":"2020-02-27T19:52:24Z","title":"On Biased Compression for Distributed Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.12410","snapshot_observed_at":"2026-08-04T21:06:25.963642Z","title":"Beznosikov, S","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2509.08233","last_updated":"2025-09-10T02:19:56Z","snapshot_observed_at":"2026-08-14T20:31:36.327522Z","submitted_at":"2025-09-10T02:19:56Z","title":"Strategies for Improving Communication Efficiency in Distributed and Federated Learning: Compression, Local Training, and Personalization","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-04T21:06:25.963642Z"},"links":{"cited_paper":"/paper/2002.12410","citing_paper":"/paper/2509.08233"},"observation_digest":"sha256:cc4b9a9b6afc837200a32e9bee281955fba4760a46b7755e22e0012e73846eca","observation_id":"c1d7b0e5-c077-4ba5-a7cd-f80239f887b4","resolution":{"observed_at":"2026-08-04T21:06:25.963642Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.12410","last_updated":"2024-01-14T16:36:09Z","snapshot_observed_at":"2026-08-15T11:28:49.008698Z","submitted_at":"2020-02-27T19:52:24Z","title":"On Biased Compression for Distributed Learning","version":4},"cited_work":{"arxiv_id":"2002.12410","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2002.12410","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On biased compression for distributed learning","venue":null,"work_id":"0420bb27-40fe-4b81-8896-377958176bf8","year":2002},"citing_paper":{"arxiv_id":"2604.08236","last_updated":"2026-04-09T13:28:29Z","snapshot_observed_at":"2026-08-15T00:23:14.834993Z","submitted_at":"2026-04-09T13:28:29Z","title":"Improved Convergence for Decentralized Stochastic Optimization with Biased Gradients","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-10T16:51:55.474356Z"},"links":{"cited_paper":"/paper/2002.12410","citing_paper":"/paper/2604.08236"},"observation_digest":"sha256:2f62a89c54869150cc9cfb478e0a6fc8f25ee22aa55db4cae30f923d426c8007","observation_id":"a1a4f7a4-5787-482e-a273-7134eb3a5807","resolution":{"observed_at":"2026-05-11T08:00:58.038131Z","resolver_source":"arxiv_id","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":{"arxiv_id":"2002.12410","last_updated":"2024-01-14T16:36:09Z","snapshot_observed_at":"2026-08-15T11:28:49.008698Z","submitted_at":"2020-02-27T19:52:24Z","title":"On Biased Compression for Distributed Learning","version":4},"cited_work":{"arxiv_id":"2002.12410","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2002.12410","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On biased compression for distributed learning","venue":null,"work_id":"0420bb27-40fe-4b81-8896-377958176bf8","year":2002},"citing_paper":{"arxiv_id":"2605.07795","last_updated":"2026-05-08T14:32:41Z","snapshot_observed_at":"2026-08-13T15:10:40.244698Z","submitted_at":"2026-05-08T14:32:41Z","title":"Scalable Distributed Stochastic Optimization via Bidirectional Compression: Beyond Pessimistic Limits","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-05-11T02:52:53.588595Z"},"links":{"cited_paper":"/paper/2002.12410","citing_paper":"/paper/2605.07795"},"observation_digest":"sha256:7c8416de5ffc337973d78a57f49deefb6b36b3875ec58ffca960377c2cbba19a","observation_id":"6f4324de-bc99-42f1-9305-de594a6c9926","resolution":{"observed_at":"2026-05-11T03:05:54.881821Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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":"2002.12410","last_updated":"2024-01-14T16:36:09Z","snapshot_observed_at":"2026-08-15T11:28:49.008698Z","submitted_at":"2020-02-27T19:52:24Z","title":"On Biased Compression for Distributed Learning","version":4},"cited_work":{"arxiv_id":"2002.12410","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2002.12410","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On biased compression for distributed learning","venue":null,"work_id":"0420bb27-40fe-4b81-8896-377958176bf8","year":2002},"citing_paper":{"arxiv_id":"2605.08871","last_updated":"2026-05-09T10:46:59Z","snapshot_observed_at":"2026-08-11T12:27:08.580370Z","submitted_at":"2026-05-09T10:46:59Z","title":"Rennala MVR: Improved Time Complexity for Parallel Stochastic Optimization via Momentum-Based Variance Reduction","version":1},"reference_index":101,"source":"arxiv_source","source_observed_at":"2026-05-12T01:51:20.003552Z"},"links":{"cited_paper":"/paper/2002.12410","citing_paper":"/paper/2605.08871"},"observation_digest":"sha256:769f87b97d96102e44faec181aa6be4265aabc73908cba00b836ccf4ba83e59a","observation_id":"39d40f27-4799-4843-95f3-84fc64e75ed5","resolution":{"observed_at":"2026-05-12T07:51:32.227933Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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":"2002.12410","last_updated":"2024-01-14T16:36:09Z","snapshot_observed_at":"2026-08-15T11:28:49.008698Z","submitted_at":"2020-02-27T19:52:24Z","title":"On Biased Compression for Distributed Learning","version":4},"cited_work":{"arxiv_id":"2002.12410","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2002.12410","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On biased compression for distributed learning","venue":null,"work_id":"0420bb27-40fe-4b81-8896-377958176bf8","year":2002},"citing_paper":{"arxiv_id":"2605.13434","last_updated":"2026-05-13T12:27:22Z","snapshot_observed_at":"2026-08-14T23:38:08.370551Z","submitted_at":"2026-05-13T12:27:22Z","title":"Rescaled Asynchronous SGD: Optimal Distributed Optimization under Data and System Heterogeneity","version":1},"reference_index":218,"source":"arxiv_source","source_observed_at":"2026-05-14T19:31:12.149482Z"},"links":{"cited_paper":"/paper/2002.12410","citing_paper":"/paper/2605.13434"},"observation_digest":"sha256:12a6277bc1ef8de3de5414f9db72855627f25de9df1efd12cee4bb9d3c78d152","observation_id":"98a1d22d-b526-4db2-ac3f-324bfc4d2801","resolution":{"observed_at":"2026-05-14T19:32:52.154101Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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":"2002.12410","last_updated":"2024-01-14T16:36:09Z","snapshot_observed_at":"2026-08-15T11:28:49.008698Z","submitted_at":"2020-02-27T19:52:24Z","title":"On Biased Compression for Distributed Learning","version":4},"cited_work":{"arxiv_id":"2002.12410","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2002.12410","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On biased compression for distributed learning","venue":null,"work_id":"0420bb27-40fe-4b81-8896-377958176bf8","year":2002},"citing_paper":{"arxiv_id":"2605.18174","last_updated":"2026-05-18T10:18:02Z","snapshot_observed_at":"2026-08-15T08:55:48.785673Z","submitted_at":"2026-05-18T10:18:02Z","title":"Ringmaster LMO: Asynchronous Linear Minimization Oracle Momentum Method","version":1},"reference_index":103,"source":"arxiv_source","source_observed_at":"2026-05-20T13:08:52.912250Z"},"links":{"cited_paper":"/paper/2002.12410","citing_paper":"/paper/2605.18174"},"observation_digest":"sha256:01641eb86e88157044ded92e2e7c6840f228dea235602d8317f4af4efbd0a443","observation_id":"0dd46d94-8e11-4d7a-a00f-99a938f80eec","resolution":{"observed_at":"2026-05-20T13:13:18.631188Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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/2002.12410/citation-record","integrity":"/paper/2002.12410/integrity","json":"/paper/2002.12410/citation-record.json","paper":"/paper/2002.12410"},"outbound":[],"paper":{"arxiv_id":"2002.12410","last_updated":"2024-01-14T16:36:09Z","latest_version":4,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-15T11:28:49.008698Z","submitted_at":"2020-02-27T19:52:24Z","title":"On Biased Compression for Distributed Learning"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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 0 of 0 outbound references and 8 inbound Pith citation observations for arXiv:2002.12410."}