{"as_of":"2026-08-04T18:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6cca7c8bb7d96b3c3262567279216983cf925921bd93e3e056f131088b19d5f9","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-23T18:58:32.168274Z","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-07-06T09:00:46.442419Z","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-07-06T19:36:36.994783Z","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:eaa1c165198c80dc2c43228acdbf75d1cae418750d78f717544d4729698ad1ea","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-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-06T09:00:46.442419Z","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-01T02:42:06.788725Z","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:b4f303c077085e116625701988ae2c4997df11324f6ee8959efcda4f52036eb0","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-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-06T09:00:46.442419Z","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-07-06T23:20:06.574823Z","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:47d92b866da41f269c05827070422f80777def61d793c86f29865a84852ccb18","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-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-06T09:00:46.442419Z","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-07-31T15:53:03.039634Z","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:6cff2f01da318fd3070a1b612496be5fd4f9a844434fa28701bd51cc76bf430d","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-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-06T09:00:46.442419Z","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-07-06T23:25:01.951546Z","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:1d6ba804ed57d76a92a8a33a6f25b2bcb8e73f7f92ad9442030350bb2c669156","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-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-06T09:00:46.442419Z","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-07-06T23:29:04.241654Z","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:2ef7b714c2a03a0a2833e8787fd43c4f14851d287f7bfbf47328a9fac72f13c8","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-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-06T09:00:46.442419Z","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-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 4 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2002.12410."}