{"as_of":"2026-08-04T20:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7eb40fcc72ccf0c979e83b8b26e502e4a5e6300a5b63d09172a9003b4faf2ddb","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.660531Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2202.01268","last_updated":"2022-05-22T10:31:19Z","snapshot_observed_at":"2026-08-04T12:59:41.910595Z","submitted_at":"2022-02-02T20:10:40Z","title":"DASHA: Distributed Nonconvex Optimization with Communication Compression, Optimal Oracle Complexity, and No Client Synchronization","version":2},"cited_work":{"arxiv_id":"2202.01268","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2202.01268","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2202.01268 , year=","venue":null,"work_id":"0d6f881e-8161-4a6f-b308-0478091d4ead","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":150,"source":"arxiv_source","source_observed_at":"2026-05-12T01:51:20.003552Z"},"links":{"cited_paper":"/paper/2202.01268","citing_paper":"/paper/2605.08871"},"observation_digest":"sha256:4c1adf1fba1efd7ce68fc813be092c37900739a65a4da4cdc0e6e4ac35729a40","observation_id":"1a062553-a720-4949-a105-c573a4a42528","resolution":{"observed_at":"2026-05-12T07:51:31.648350Z","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":"2202.01268","last_updated":"2022-05-22T10:31:19Z","snapshot_observed_at":"2026-08-04T12:59:41.910595Z","submitted_at":"2022-02-02T20:10:40Z","title":"DASHA: Distributed Nonconvex Optimization with Communication Compression, Optimal Oracle Complexity, and No Client Synchronization","version":2},"cited_work":{"arxiv_id":"2202.01268","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2202.01268","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2202.01268 , year=","venue":null,"work_id":"0d6f881e-8161-4a6f-b308-0478091d4ead","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":259,"source":"arxiv_source","source_observed_at":"2026-05-14T19:31:12.149482Z"},"links":{"cited_paper":"/paper/2202.01268","citing_paper":"/paper/2605.13434"},"observation_digest":"sha256:cbb300a944bf4b4ffcdd1b2ccda9711f2c3da8663165a550fe07e7735c5addfd","observation_id":"b1f5362f-6f86-4cf4-a1bc-c26acd9bf324","resolution":{"observed_at":"2026-05-14T19:32:52.205167Z","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":"2202.01268","last_updated":"2022-05-22T10:31:19Z","snapshot_observed_at":"2026-08-04T12:59:41.910595Z","submitted_at":"2022-02-02T20:10:40Z","title":"DASHA: Distributed Nonconvex Optimization with Communication Compression, Optimal Oracle Complexity, and No Client Synchronization","version":2},"cited_work":{"arxiv_id":"2202.01268","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2202.01268","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2202.01268 , year=","venue":null,"work_id":"0d6f881e-8161-4a6f-b308-0478091d4ead","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":152,"source":"arxiv_source","source_observed_at":"2026-05-20T13:08:52.912250Z"},"links":{"cited_paper":"/paper/2202.01268","citing_paper":"/paper/2605.18174"},"observation_digest":"sha256:9f23262856ff37e88fb3236f9817ae4949d833a8c98eff3b3b82095d998d705e","observation_id":"cd5d21bc-7359-41b3-a2f3-5edce214f920","resolution":{"observed_at":"2026-05-20T13:13:18.640629Z","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":"2202.01268","last_updated":"2022-05-22T10:31:19Z","snapshot_observed_at":"2026-08-04T12:59:41.910595Z","submitted_at":"2022-02-02T20:10:40Z","title":"DASHA: Distributed Nonconvex Optimization with Communication Compression, Optimal Oracle Complexity, and No Client Synchronization","version":2},"cited_work":{"arxiv_id":"2202.01268","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2202.01268","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2202.01268 , year=","venue":null,"work_id":"0d6f881e-8161-4a6f-b308-0478091d4ead","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":154,"source":"arxiv_source","source_observed_at":"2026-05-21T05:49:28.713982Z"},"links":{"cited_paper":"/paper/2202.01268","citing_paper":"/paper/2605.20866"},"observation_digest":"sha256:43f9ba5914855a653ff4b30ad7eb65f570c88c4176c52212209efd2e5d5f23fb","observation_id":"bb11ecee-feb7-480c-ab48-7380b4dd8a62","resolution":{"observed_at":"2026-05-21T05:49:40.662066Z","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/2202.01268/citation-record","integrity":"/paper/2202.01268/integrity","json":"/paper/2202.01268/citation-record.json","paper":"/paper/2202.01268"},"outbound":[],"paper":{"arxiv_id":"2202.01268","last_updated":"2022-05-22T10:31:19Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-04T12:59:41.910595Z","submitted_at":"2022-02-02T20:10:40Z","title":"DASHA: Distributed Nonconvex Optimization with Communication Compression, Optimal Oracle Complexity, and No Client Synchronization"},"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:2202.01268."}