{"as_of":"2026-08-04T17:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e40d8ba88e532b5a7972f042e4680284169eb0361b2137e7c121688df43d8cd5","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-21T05:49:28.713982Z","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.582172Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2110.03300","last_updated":"2021-10-07T09:38:15Z","snapshot_observed_at":"2026-07-06T11:55:17.935458Z","submitted_at":"2021-10-07T09:38:15Z","title":"Permutation Compressors for Provably Faster Distributed Nonconvex Optimization","version":1},"cited_work":{"arxiv_id":"2110.03300","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2110.03300","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2110.03300 , year=","venue":null,"work_id":"4950977b-be4f-482a-a4f5-cca01a9ddd83","year":null},"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":155,"source":"arxiv_source","source_observed_at":"2026-05-12T01:51:20.003552Z"},"links":{"cited_paper":"/paper/2110.03300","citing_paper":"/paper/2605.08871"},"observation_digest":"sha256:f3fb7df5bd37b3517df8039125607901749abb38454ed7804b6b84c6f45af47c","observation_id":"1a2c46b8-d61a-4c85-b4df-d9d7c5502e6c","resolution":{"observed_at":"2026-05-12T07:51:30.093415Z","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":"2110.03300","last_updated":"2021-10-07T09:38:15Z","snapshot_observed_at":"2026-07-06T11:55:17.935458Z","submitted_at":"2021-10-07T09:38:15Z","title":"Permutation Compressors for Provably Faster Distributed Nonconvex Optimization","version":1},"cited_work":{"arxiv_id":"2110.03300","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2110.03300","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2110.03300 , year=","venue":null,"work_id":"4950977b-be4f-482a-a4f5-cca01a9ddd83","year":null},"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":262,"source":"arxiv_source","source_observed_at":"2026-05-14T19:31:12.149482Z"},"links":{"cited_paper":"/paper/2110.03300","citing_paper":"/paper/2605.13434"},"observation_digest":"sha256:21b07ff3af94d7444435e7ccc2c625faa8045461e8849e1b5325e09011c13865","observation_id":"c1a5a468-6d6e-4143-81b6-fe17b72f488d","resolution":{"observed_at":"2026-05-14T19:32:52.074968Z","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":"2110.03300","last_updated":"2021-10-07T09:38:15Z","snapshot_observed_at":"2026-07-06T11:55:17.935458Z","submitted_at":"2021-10-07T09:38:15Z","title":"Permutation Compressors for Provably Faster Distributed Nonconvex Optimization","version":1},"cited_work":{"arxiv_id":"2110.03300","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2110.03300","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2110.03300 , year=","venue":null,"work_id":"4950977b-be4f-482a-a4f5-cca01a9ddd83","year":null},"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":157,"source":"arxiv_source","source_observed_at":"2026-05-20T13:08:52.912250Z"},"links":{"cited_paper":"/paper/2110.03300","citing_paper":"/paper/2605.18174"},"observation_digest":"sha256:6b335fbc5c9ab1754f492c88c228c84bdaf4a72cdda6d97e3101e471a1a1684c","observation_id":"63be7c6a-1349-4ed2-921c-9c56ab01f715","resolution":{"observed_at":"2026-05-20T13:13:18.491756Z","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":"2110.03300","last_updated":"2021-10-07T09:38:15Z","snapshot_observed_at":"2026-07-06T11:55:17.935458Z","submitted_at":"2021-10-07T09:38:15Z","title":"Permutation Compressors for Provably Faster Distributed Nonconvex Optimization","version":1},"cited_work":{"arxiv_id":"2110.03300","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2110.03300","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2110.03300 , year=","venue":null,"work_id":"4950977b-be4f-482a-a4f5-cca01a9ddd83","year":null},"citing_paper":{"arxiv_id":"2605.20866","last_updated":"2026-05-20T08:01:45Z","snapshot_observed_at":"2026-08-02T02:54:50.828651Z","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":159,"source":"arxiv_source","source_observed_at":"2026-05-21T05:49:28.713982Z"},"links":{"cited_paper":"/paper/2110.03300","citing_paper":"/paper/2605.20866"},"observation_digest":"sha256:0cc7c282f580cb22a99a8abe85f3fb9e9e77a4deed7090398d61d18cba7a9be5","observation_id":"35283e4a-6d4d-428a-828a-1a3cfae87c79","resolution":{"observed_at":"2026-05-21T05:49:40.583765Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2110.03300/citation-record","integrity":"/paper/2110.03300/integrity","json":"/paper/2110.03300/citation-record.json","paper":"/paper/2110.03300"},"outbound":[],"paper":{"arxiv_id":"2110.03300","last_updated":"2021-10-07T09:38:15Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T11:55:17.935458Z","submitted_at":"2021-10-07T09:38:15Z","title":"Permutation Compressors for Provably Faster Distributed Nonconvex Optimization"},"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 4 inbound Pith citation observations for arXiv:2110.03300."}