{"as_of":"2026-08-05T05:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fa8803e8cfa89e28fda2af5501e2754498689b51ade4179a75e22938dbc92b47","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"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.544337Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2102.07845","last_updated":"2022-01-07T19:37:53Z","snapshot_observed_at":"2026-08-04T14:25:48.424023Z","submitted_at":"2021-02-15T20:50:26Z","title":"MARINA: Faster Non-Convex Distributed Learning with Compression","version":3},"cited_work":{"arxiv_id":"2102.07845","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2102.07845","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2102.07845 , year=","venue":null,"work_id":"b5243c4b-5cd9-43ef-acfb-457748cc6d27","year":2022},"citing_paper":{"arxiv_id":"2604.10689","last_updated":"2026-04-12T15:30:28Z","snapshot_observed_at":"2026-07-06T22:59:13.936436Z","submitted_at":"2026-04-12T15:30:28Z","title":"Communication-Efficient Gluon in Federated Learning","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-05-10T15:16:15.739456Z"},"links":{"cited_paper":"/paper/2102.07845","citing_paper":"/paper/2604.10689"},"observation_digest":"sha256:0c6e29f2927b7c8e45122d046cb2a63e7d0cb38ed244d908c595c06b7af3e94f","observation_id":"fd9069d5-6dbd-4623-8f32-38662c85e650","resolution":{"observed_at":"2026-05-11T10:56:03.110130Z","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":"2102.07845","last_updated":"2022-01-07T19:37:53Z","snapshot_observed_at":"2026-08-04T14:25:48.424023Z","submitted_at":"2021-02-15T20:50:26Z","title":"MARINA: Faster Non-Convex Distributed Learning with Compression","version":3},"cited_work":{"arxiv_id":"2102.07845","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2102.07845","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2102.07845 , year=","venue":null,"work_id":"b5243c4b-5cd9-43ef-acfb-457748cc6d27","year":2022},"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":57,"source":"arxiv_source","source_observed_at":"2026-05-11T02:52:53.588595Z"},"links":{"cited_paper":"/paper/2102.07845","citing_paper":"/paper/2605.07795"},"observation_digest":"sha256:db8f50210311e235137f26dfc89cd72f43a2897f4e697f740e7130f05d32f76e","observation_id":"cc80a562-53bc-4aac-ae5f-5835399181ef","resolution":{"observed_at":"2026-05-11T03:05:54.664762Z","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":"2102.07845","last_updated":"2022-01-07T19:37:53Z","snapshot_observed_at":"2026-08-04T14:25:48.424023Z","submitted_at":"2021-02-15T20:50:26Z","title":"MARINA: Faster Non-Convex Distributed Learning with Compression","version":3},"cited_work":{"arxiv_id":"2102.07845","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2102.07845","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2102.07845 , year=","venue":null,"work_id":"b5243c4b-5cd9-43ef-acfb-457748cc6d27","year":2022},"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":134,"source":"arxiv_source","source_observed_at":"2026-05-12T01:51:20.003552Z"},"links":{"cited_paper":"/paper/2102.07845","citing_paper":"/paper/2605.08871"},"observation_digest":"sha256:7d59e312a00cb5a63bef591f4d93c71504180b7fad1e7b9d7e995be2c6c55567","observation_id":"1f8d6035-d1a7-416d-9cf5-5bcce43c9da2","resolution":{"observed_at":"2026-05-12T07:51:31.717246Z","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":"2102.07845","last_updated":"2022-01-07T19:37:53Z","snapshot_observed_at":"2026-08-04T14:25:48.424023Z","submitted_at":"2021-02-15T20:50:26Z","title":"MARINA: Faster Non-Convex Distributed Learning with Compression","version":3},"cited_work":{"arxiv_id":"2102.07845","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2102.07845","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2102.07845 , year=","venue":null,"work_id":"b5243c4b-5cd9-43ef-acfb-457748cc6d27","year":2022},"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":136,"source":"arxiv_source","source_observed_at":"2026-05-20T13:08:52.912250Z"},"links":{"cited_paper":"/paper/2102.07845","citing_paper":"/paper/2605.18174"},"observation_digest":"sha256:429be9dee6b0d15bde0c9380bed29ccd21458ed58a8b1b6070f9242142baabd2","observation_id":"59a8eaf9-f35c-47b5-a24e-c6860582b8de","resolution":{"observed_at":"2026-05-20T13:13:18.580897Z","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":"2102.07845","last_updated":"2022-01-07T19:37:53Z","snapshot_observed_at":"2026-08-04T14:25:48.424023Z","submitted_at":"2021-02-15T20:50:26Z","title":"MARINA: Faster Non-Convex Distributed Learning with Compression","version":3},"cited_work":{"arxiv_id":"2102.07845","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2102.07845","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2102.07845 , year=","venue":null,"work_id":"b5243c4b-5cd9-43ef-acfb-457748cc6d27","year":2022},"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":138,"source":"arxiv_source","source_observed_at":"2026-05-21T05:49:28.713982Z"},"links":{"cited_paper":"/paper/2102.07845","citing_paper":"/paper/2605.20866"},"observation_digest":"sha256:25204a5cc6271b578b04e51b306b5eb7185e8f8d57035d54cbb238bfcd91dbdf","observation_id":"12681c0d-ca2b-42a2-8913-13e96e77e886","resolution":{"observed_at":"2026-05-21T05:49:40.546173Z","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/2102.07845/citation-record","integrity":"/paper/2102.07845/integrity","json":"/paper/2102.07845/citation-record.json","paper":"/paper/2102.07845"},"outbound":[],"paper":{"arxiv_id":"2102.07845","last_updated":"2022-01-07T19:37:53Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-04T14:25:48.424023Z","submitted_at":"2021-02-15T20:50:26Z","title":"MARINA: Faster Non-Convex Distributed Learning with Compression"},"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 5 inbound Pith citation observations for arXiv:2102.07845."}