{"as_of":"2026-08-10T01:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7894996456273fd7a217396cb2f8f9f8ae416ff7b67dd9f0f2c5630769249035","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":11,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":11,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":11,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":11,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T00:16:20.234748Z","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-21T05:49:40.712610Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1901.09269","last_updated":"2023-12-28T11:46:43Z","snapshot_observed_at":"2026-08-09T20:25:51.841154Z","submitted_at":"2019-01-26T19:50:45Z","title":"Distributed Learning with Compressed Gradient Differences","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1901.09269","snapshot_observed_at":"2026-08-07T00:16:20.234748Z","title":"Distributed learning with compressed gradient differences","venue":null,"work_id":null,"year":1901},"citing_paper":{"arxiv_id":"2506.14911","last_updated":"2025-06-17T18:41:43Z","snapshot_observed_at":"2026-08-09T00:03:28.829956Z","submitted_at":"2025-06-17T18:41:43Z","title":"Event-Driven Online Vertical Federated Learning","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-07T00:16:20.234748Z"},"links":{"cited_paper":"/paper/1901.09269","citing_paper":"/paper/2506.14911"},"observation_digest":"sha256:77f79fdbbb1082833403af79097cdc6e43e33ae3edb57475523ba6da50c92f27","observation_id":"6750f118-febd-4c13-a7f4-dbe79892840a","resolution":{"observed_at":"2026-08-07T00:16:20.234748Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1901.09269","last_updated":"2023-12-28T11:46:43Z","snapshot_observed_at":"2026-08-09T20:25:51.841154Z","submitted_at":"2019-01-26T19:50:45Z","title":"Distributed Learning with Compressed Gradient Differences","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1901.09269","snapshot_observed_at":"2026-08-06T19:35:15.337111Z","title":"Recht, B., R´e, C., Wright, S","venue":null,"work_id":null,"year":1901},"citing_paper":{"arxiv_id":"2507.05508","last_updated":"2025-07-07T22:06:04Z","snapshot_observed_at":"2026-08-08T16:45:33.843592Z","submitted_at":"2025-07-07T22:06:04Z","title":"Beyond Communication Overhead: A Multilevel Monte Carlo Approach for Mitigating Compression Bias in Distributed Learning","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T19:35:15.337111Z"},"links":{"cited_paper":"/paper/1901.09269","citing_paper":"/paper/2507.05508"},"observation_digest":"sha256:6ab1e2dfa7fab0b227dae83f7f6848aaac06cb687c3be3300f41fec27f981713","observation_id":"9d4e5667-3ad4-45e2-b4c5-4edfee898bad","resolution":{"observed_at":"2026-08-06T19:35:15.337111Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1901.09269","last_updated":"2023-12-28T11:46:43Z","snapshot_observed_at":"2026-08-09T20:25:51.841154Z","submitted_at":"2019-01-26T19:50:45Z","title":"Distributed Learning with Compressed Gradient Differences","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1901.09269","snapshot_observed_at":"2026-08-06T17:19:32.513897Z","title":"Distributed learning with compressed gradient differences,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.11183","last_updated":"2025-07-15T10:37:59Z","snapshot_observed_at":"2026-08-06T17:12:02.002725Z","submitted_at":"2025-07-15T10:37:59Z","title":"Quantized Rank Reduction: A Communications-Efficient Federated Learning Scheme for Network-Critical Applications","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T17:19:32.513897Z"},"links":{"cited_paper":"/paper/1901.09269","citing_paper":"/paper/2507.11183"},"observation_digest":"sha256:7e7f5f9580986a404120017507b10f58fec81abfdda32d4060d1a0660e70aa8d","observation_id":"058ca985-3f8f-484f-a715-8f4815e29f4e","resolution":{"observed_at":"2026-08-06T17:19:32.513897Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1901.09269","last_updated":"2023-12-28T11:46:43Z","snapshot_observed_at":"2026-08-09T20:25:51.841154Z","submitted_at":"2019-01-26T19:50:45Z","title":"Distributed Learning with Compressed Gradient Differences","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1901.09269","snapshot_observed_at":"2026-08-06T14:54:37.077686Z","title":"Mishchenko, E","venue":null,"work_id":null,"year":1901},"citing_paper":{"arxiv_id":"2507.17534","last_updated":"2025-07-23T14:13:19Z","snapshot_observed_at":"2026-08-06T14:44:02.439597Z","submitted_at":"2025-07-23T14:13:19Z","title":"Federated Majorize-Minimization: Beyond Parameter Aggregation","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:37.077686Z"},"links":{"cited_paper":"/paper/1901.09269","citing_paper":"/paper/2507.17534"},"observation_digest":"sha256:434c102f3a1780e4b1f6e46eb5c66dbe6089fd8e803ff5c6d236710247611d33","observation_id":"b006044d-54cc-418d-bdd6-7cf479bb6aef","resolution":{"observed_at":"2026-08-06T14:54:37.077686Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1901.09269","last_updated":"2023-12-28T11:46:43Z","snapshot_observed_at":"2026-08-09T20:25:51.841154Z","submitted_at":"2019-01-26T19:50:45Z","title":"Distributed Learning with Compressed Gradient Differences","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1901.09269","snapshot_observed_at":"2026-08-04T21:20:47.215429Z","title":"arXiv:1901.09269 http://arxiv.org/abs/1901","venue":null,"work_id":null,"year":1901},"citing_paper":{"arxiv_id":"2509.08120","last_updated":"2025-09-09T19:58:03Z","snapshot_observed_at":"2026-08-04T21:20:12.411461Z","submitted_at":"2025-09-09T19:58:03Z","title":"Optimization Methods and Software for Federated Learning","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-04T21:20:47.215429Z"},"links":{"cited_paper":"/paper/1901.09269","citing_paper":"/paper/2509.08120"},"observation_digest":"sha256:8983dba0be1fe8b4fbeef1cf093df1ac2b0c7199ba8f081233e9d0733e4cd0ba","observation_id":"4193532b-7aeb-491d-b65f-be918068dc3b","resolution":{"observed_at":"2026-08-04T21:20:47.215429Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1901.09269","last_updated":"2023-12-28T11:46:43Z","snapshot_observed_at":"2026-08-09T20:25:51.841154Z","submitted_at":"2019-01-26T19:50:45Z","title":"Distributed Learning with Compressed Gradient Differences","version":3},"cited_work":{"arxiv_id":"1901.09269","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1901.09269","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:1901.09269 , title =","venue":null,"work_id":"0b17c208-30f8-468c-955e-f369d6051955","year":1901},"citing_paper":{"arxiv_id":"2604.14663","last_updated":"2026-04-16T06:16:14Z","snapshot_observed_at":"2026-07-06T23:02:22.790426Z","submitted_at":"2026-04-16T06:16:14Z","title":"EdgeDetect: Importance-Aware Gradient Compression with Homomorphic Aggregation for Federated Intrusion Detection","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-10T11:26:34.134190Z"},"links":{"cited_paper":"/paper/1901.09269","citing_paper":"/paper/2604.14663"},"observation_digest":"sha256:caba24f9e73d35c2809f2584fff44d0b41f7669c67e172fb25a4a0052f56b68e","observation_id":"ee8337e3-0f14-4d8f-b4f5-f0dcaa0e16d2","resolution":{"observed_at":"2026-05-10T11:30:18.963677Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1901.09269","last_updated":"2023-12-28T11:46:43Z","snapshot_observed_at":"2026-08-09T20:25:51.841154Z","submitted_at":"2019-01-26T19:50:45Z","title":"Distributed Learning with Compressed Gradient Differences","version":3},"cited_work":{"arxiv_id":"1901.09269","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1901.09269","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:1901.09269 , title =","venue":null,"work_id":"0b17c208-30f8-468c-955e-f369d6051955","year":1901},"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":19,"source":"arxiv_source","source_observed_at":"2026-05-11T02:52:53.588595Z"},"links":{"cited_paper":"/paper/1901.09269","citing_paper":"/paper/2605.07795"},"observation_digest":"sha256:8d67ffe6adf51d029e3f84cd003c2a14b2360e56826f976c0e88d9e52617b41c","observation_id":"b60bd406-62ab-468b-9774-9d81a2fa8b74","resolution":{"observed_at":"2026-05-11T03:05:54.861564Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1901.09269","last_updated":"2023-12-28T11:46:43Z","snapshot_observed_at":"2026-08-09T20:25:51.841154Z","submitted_at":"2019-01-26T19:50:45Z","title":"Distributed Learning with Compressed Gradient Differences","version":3},"cited_work":{"arxiv_id":"1901.09269","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1901.09269","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:1901.09269 , title =","venue":null,"work_id":"0b17c208-30f8-468c-955e-f369d6051955","year":1901},"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":95,"source":"arxiv_source","source_observed_at":"2026-05-12T01:51:20.003552Z"},"links":{"cited_paper":"/paper/1901.09269","citing_paper":"/paper/2605.08871"},"observation_digest":"sha256:b2b25a81ad9158ea28cfff2297ef94d725f89d9594e358c2e65533029e12543e","observation_id":"69f1287d-6031-4b31-8fff-d39dfcae1abb","resolution":{"observed_at":"2026-05-12T07:51:29.893744Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1901.09269","last_updated":"2023-12-28T11:46:43Z","snapshot_observed_at":"2026-08-09T20:25:51.841154Z","submitted_at":"2019-01-26T19:50:45Z","title":"Distributed Learning with Compressed Gradient Differences","version":3},"cited_work":{"arxiv_id":"1901.09269","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1901.09269","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:1901.09269 , title =","venue":null,"work_id":"0b17c208-30f8-468c-955e-f369d6051955","year":1901},"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":213,"source":"arxiv_source","source_observed_at":"2026-05-14T19:31:12.149482Z"},"links":{"cited_paper":"/paper/1901.09269","citing_paper":"/paper/2605.13434"},"observation_digest":"sha256:ea881232c482497fb65945a5e4eef481f27ddc9668562178c084e5ddd7bc9cef","observation_id":"5757dc2c-0f63-47b2-89c1-a1d2974dd3da","resolution":{"observed_at":"2026-05-14T19:32:52.115188Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1901.09269","last_updated":"2023-12-28T11:46:43Z","snapshot_observed_at":"2026-08-09T20:25:51.841154Z","submitted_at":"2019-01-26T19:50:45Z","title":"Distributed Learning with Compressed Gradient Differences","version":3},"cited_work":{"arxiv_id":"1901.09269","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1901.09269","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:1901.09269 , title =","venue":null,"work_id":"0b17c208-30f8-468c-955e-f369d6051955","year":1901},"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":97,"source":"arxiv_source","source_observed_at":"2026-05-20T13:08:52.912250Z"},"links":{"cited_paper":"/paper/1901.09269","citing_paper":"/paper/2605.18174"},"observation_digest":"sha256:1f4d8a820e5feafe89ffd556e50ee909726552bfaef0c35a87d9f970f149db6e","observation_id":"ce4f0e07-7b67-440d-9fa5-7cef5a2449a6","resolution":{"observed_at":"2026-05-20T13:13:18.628288Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1901.09269","last_updated":"2023-12-28T11:46:43Z","snapshot_observed_at":"2026-08-09T20:25:51.841154Z","submitted_at":"2019-01-26T19:50:45Z","title":"Distributed Learning with Compressed Gradient Differences","version":3},"cited_work":{"arxiv_id":"1901.09269","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1901.09269","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:1901.09269 , title =","venue":null,"work_id":"0b17c208-30f8-468c-955e-f369d6051955","year":1901},"citing_paper":{"arxiv_id":"2605.20866","last_updated":"2026-05-20T08:01:45Z","snapshot_observed_at":"2026-08-08T08:24:16.610481Z","submitted_at":"2026-05-20T08:01:45Z","title":"LOSCAR-SGD: Local SGD with Communication-Computation Overlap and Delay-Corrected Sparse Model Averaging","version":1},"reference_index":99,"source":"arxiv_source","source_observed_at":"2026-05-21T05:49:28.713982Z"},"links":{"cited_paper":"/paper/1901.09269","citing_paper":"/paper/2605.20866"},"observation_digest":"sha256:6d870f81a5c61d551f121e4f906de7e72bfbb5255dc66950194352e28fcf5e8e","observation_id":"f04a6f94-5f30-4392-be56-2c3dd2846d82","resolution":{"observed_at":"2026-05-21T05:49:40.714172Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1901.09269/citation-record","integrity":"/paper/1901.09269/integrity","json":"/paper/1901.09269/citation-record.json","paper":"/paper/1901.09269"},"outbound":[],"paper":{"arxiv_id":"1901.09269","last_updated":"2023-12-28T11:46:43Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T20:25:51.841154Z","submitted_at":"2019-01-26T19:50:45Z","title":"Distributed Learning with Compressed Gradient Differences"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 11 inbound Pith citation observations for arXiv:1901.09269."}