{"as_of":"2026-08-05T03:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:72c1e97f6ba150b6c728df3b22f6c26aec080f278eee554ea963316397b896c0","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.718891Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2205.15580","last_updated":"2024-01-03T14:21:38Z","snapshot_observed_at":"2026-07-06T13:15:46.719493Z","submitted_at":"2022-05-31T07:41:20Z","title":"A Computation and Communication Efficient Method for Distributed Nonconvex Problems in the Partial Participation Setting","version":4},"cited_work":{"arxiv_id":"2205.15580","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2205.15580","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2205.15580 , year=","venue":null,"work_id":"4f00cf9c-6286-4847-acbd-7b9a3ea4f602","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":170,"source":"arxiv_source","source_observed_at":"2026-05-12T01:51:20.003552Z"},"links":{"cited_paper":"/paper/2205.15580","citing_paper":"/paper/2605.08871"},"observation_digest":"sha256:f8a62b3d4c0609480c5e8541e781353539006de89b9ca5430444d40135fac2c7","observation_id":"eea1df5f-bd54-4b73-bf96-7923bdc5efec","resolution":{"observed_at":"2026-05-12T07:51:33.295299Z","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":"2205.15580","last_updated":"2024-01-03T14:21:38Z","snapshot_observed_at":"2026-07-06T13:15:46.719493Z","submitted_at":"2022-05-31T07:41:20Z","title":"A Computation and Communication Efficient Method for Distributed Nonconvex Problems in the Partial Participation Setting","version":4},"cited_work":{"arxiv_id":"2205.15580","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2205.15580","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2205.15580 , year=","venue":null,"work_id":"4f00cf9c-6286-4847-acbd-7b9a3ea4f602","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":276,"source":"arxiv_source","source_observed_at":"2026-05-14T19:31:12.149482Z"},"links":{"cited_paper":"/paper/2205.15580","citing_paper":"/paper/2605.13434"},"observation_digest":"sha256:38bf8c37ad5080c618e9273043f6d55f0eaadc89ab443389ad86e1c9222457f3","observation_id":"73e48f43-77d1-43da-aeb5-66065062835d","resolution":{"observed_at":"2026-05-14T19:32:52.099415Z","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":"2205.15580","last_updated":"2024-01-03T14:21:38Z","snapshot_observed_at":"2026-07-06T13:15:46.719493Z","submitted_at":"2022-05-31T07:41:20Z","title":"A Computation and Communication Efficient Method for Distributed Nonconvex Problems in the Partial Participation Setting","version":4},"cited_work":{"arxiv_id":"2205.15580","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2205.15580","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2205.15580 , year=","venue":null,"work_id":"4f00cf9c-6286-4847-acbd-7b9a3ea4f602","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":172,"source":"arxiv_source","source_observed_at":"2026-05-20T13:08:52.912250Z"},"links":{"cited_paper":"/paper/2205.15580","citing_paper":"/paper/2605.18174"},"observation_digest":"sha256:b1ee705963596cf1ff4dc383539798661e842b6ca894fd3fc4b6de9ec1c17367","observation_id":"016fd9bf-0c16-4f9a-b410-abc4c54be181","resolution":{"observed_at":"2026-05-20T13:13:18.649909Z","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":"2205.15580","last_updated":"2024-01-03T14:21:38Z","snapshot_observed_at":"2026-07-06T13:15:46.719493Z","submitted_at":"2022-05-31T07:41:20Z","title":"A Computation and Communication Efficient Method for Distributed Nonconvex Problems in the Partial Participation Setting","version":4},"cited_work":{"arxiv_id":"2205.15580","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2205.15580","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2205.15580 , year=","venue":null,"work_id":"4f00cf9c-6286-4847-acbd-7b9a3ea4f602","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":173,"source":"arxiv_source","source_observed_at":"2026-05-21T05:49:28.713982Z"},"links":{"cited_paper":"/paper/2205.15580","citing_paper":"/paper/2605.20866"},"observation_digest":"sha256:a64debdc4c345630c85e869c9eb5c031a3e12e8799ab5744e919adfbc0852b9f","observation_id":"a11841c8-73d6-4a72-b8fd-f2f22bb549ef","resolution":{"observed_at":"2026-05-21T05:49:40.720536Z","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/2205.15580/citation-record","integrity":"/paper/2205.15580/integrity","json":"/paper/2205.15580/citation-record.json","paper":"/paper/2205.15580"},"outbound":[],"paper":{"arxiv_id":"2205.15580","last_updated":"2024-01-03T14:21:38Z","latest_version":4,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T13:15:46.719493Z","submitted_at":"2022-05-31T07:41:20Z","title":"A Computation and Communication Efficient Method for Distributed Nonconvex Problems in the Partial Participation Setting"},"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 5 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2205.15580."}