{"as_of":"2026-08-04T21:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1dee26be7abd20748552c458899e523f347f44d18bff1dfaed8aae72ac323b6e","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-27T03:42:57.288700Z","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-07-03T17:48:46.076812Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2103.01447","last_updated":"2021-10-10T19:03:07Z","snapshot_observed_at":"2026-08-04T17:07:02.401955Z","submitted_at":"2021-03-02T03:31:06Z","title":"ZeroSARAH: Efficient Nonconvex Finite-Sum Optimization with Zero Full Gradient Computation","version":3},"cited_work":{"arxiv_id":"2103.01447","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2103.01447","snapshot_observed_at":"2026-07-03T17:48:46.076812Z","title":"arXiv preprint arXiv:2103.01447 , year=","venue":null,"work_id":"2493b71f-3c43-49ad-bbd2-690538dc6d42","year":2021},"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":85,"source":"arxiv_source","source_observed_at":"2026-05-11T02:52:53.588595Z"},"links":{"cited_paper":"/paper/2103.01447","citing_paper":"/paper/2605.07795"},"observation_digest":"sha256:30398c6fa218eac0c2a9978312cee65a613a60f42251bfdb1fecb9f242198f23","observation_id":"5720ea85-627b-4e32-99d2-94a7e111d634","resolution":{"observed_at":"2026-05-11T03:05:54.900162Z","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":"2103.01447","last_updated":"2021-10-10T19:03:07Z","snapshot_observed_at":"2026-08-04T17:07:02.401955Z","submitted_at":"2021-03-02T03:31:06Z","title":"ZeroSARAH: Efficient Nonconvex Finite-Sum Optimization with Zero Full Gradient Computation","version":3},"cited_work":{"arxiv_id":"2103.01447","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2103.01447","snapshot_observed_at":"2026-07-03T17:48:46.076812Z","title":"arXiv preprint arXiv:2103.01447 , year=","venue":null,"work_id":"2493b71f-3c43-49ad-bbd2-690538dc6d42","year":2021},"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":165,"source":"arxiv_source","source_observed_at":"2026-05-12T01:51:20.003552Z"},"links":{"cited_paper":"/paper/2103.01447","citing_paper":"/paper/2605.08871"},"observation_digest":"sha256:9a2335907d41c88c7050d09a4026889bf2ed57586aa9433bd8b468b4a65261d0","observation_id":"75a95cfc-7eed-493e-8078-3776fe28d587","resolution":{"observed_at":"2026-05-12T07:51:30.301755Z","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":"2103.01447","last_updated":"2021-10-10T19:03:07Z","snapshot_observed_at":"2026-08-04T17:07:02.401955Z","submitted_at":"2021-03-02T03:31:06Z","title":"ZeroSARAH: Efficient Nonconvex Finite-Sum Optimization with Zero Full Gradient Computation","version":3},"cited_work":{"arxiv_id":"2103.01447","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2103.01447","snapshot_observed_at":"2026-07-03T17:48:46.076812Z","title":"arXiv preprint arXiv:2103.01447 , year=","venue":null,"work_id":"2493b71f-3c43-49ad-bbd2-690538dc6d42","year":2021},"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":272,"source":"arxiv_source","source_observed_at":"2026-05-14T19:31:12.149482Z"},"links":{"cited_paper":"/paper/2103.01447","citing_paper":"/paper/2605.13434"},"observation_digest":"sha256:ec13ae92bbb11bd3445a1d2dae48b91c2095cee13af1c28acf869a08f1067f33","observation_id":"906bc9d7-14b3-4416-9323-3ceeaec93a63","resolution":{"observed_at":"2026-05-14T19:32:52.172706Z","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":"2103.01447","last_updated":"2021-10-10T19:03:07Z","snapshot_observed_at":"2026-08-04T17:07:02.401955Z","submitted_at":"2021-03-02T03:31:06Z","title":"ZeroSARAH: Efficient Nonconvex Finite-Sum Optimization with Zero Full Gradient Computation","version":3},"cited_work":{"arxiv_id":"2103.01447","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2103.01447","snapshot_observed_at":"2026-07-03T17:48:46.076812Z","title":"arXiv preprint arXiv:2103.01447 , year=","venue":null,"work_id":"2493b71f-3c43-49ad-bbd2-690538dc6d42","year":2021},"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":167,"source":"arxiv_source","source_observed_at":"2026-05-20T13:08:52.912250Z"},"links":{"cited_paper":"/paper/2103.01447","citing_paper":"/paper/2605.18174"},"observation_digest":"sha256:8440e8f4f8409947f5f5ea21afb2c89d7bab55882d8fb39ba8fdc74f925d8e2f","observation_id":"d5418adb-490f-46b8-82b0-700cc966d5c6","resolution":{"observed_at":"2026-05-20T13:13:18.504512Z","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":"2103.01447","last_updated":"2021-10-10T19:03:07Z","snapshot_observed_at":"2026-08-04T17:07:02.401955Z","submitted_at":"2021-03-02T03:31:06Z","title":"ZeroSARAH: Efficient Nonconvex Finite-Sum Optimization with Zero Full Gradient Computation","version":3},"cited_work":{"arxiv_id":"2103.01447","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2103.01447","snapshot_observed_at":"2026-07-03T17:48:46.076812Z","title":"arXiv preprint arXiv:2103.01447 , year=","venue":null,"work_id":"2493b71f-3c43-49ad-bbd2-690538dc6d42","year":2021},"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":169,"source":"arxiv_source","source_observed_at":"2026-05-21T05:49:28.713982Z"},"links":{"cited_paper":"/paper/2103.01447","citing_paper":"/paper/2605.20866"},"observation_digest":"sha256:58b77be94fbcbc7bd7073a6bf06fdcc3544c786e4c481ffba3c849b2064f2483","observation_id":"252c06b4-27cd-4123-b8d7-085679a83fb4","resolution":{"observed_at":"2026-05-21T05:49:40.624426Z","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":"2103.01447","last_updated":"2021-10-10T19:03:07Z","snapshot_observed_at":"2026-08-04T17:07:02.401955Z","submitted_at":"2021-03-02T03:31:06Z","title":"ZeroSARAH: Efficient Nonconvex Finite-Sum Optimization with Zero Full Gradient Computation","version":3},"cited_work":{"arxiv_id":"2103.01447","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2103.01447","snapshot_observed_at":"2026-07-03T17:48:46.076812Z","title":"arXiv preprint arXiv:2103.01447 , year=","venue":null,"work_id":"2493b71f-3c43-49ad-bbd2-690538dc6d42","year":2021},"citing_paper":{"arxiv_id":"2606.15832","last_updated":"2026-06-18T09:39:02Z","snapshot_observed_at":"2026-08-03T13:43:00.763355Z","submitted_at":"2026-06-14T14:11:07Z","title":"SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-27T03:42:57.288700Z"},"links":{"cited_paper":"/paper/2103.01447","citing_paper":"/paper/2606.15832"},"observation_digest":"sha256:ac7efbd3e4668b0b990b22503f421f03c4e7f9e834cbfa57662371ef421e53ce","observation_id":"94b25f71-bd67-4437-a415-e36a0d01142b","resolution":{"observed_at":"2026-07-03T17:48:46.078192Z","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/2103.01447/citation-record","integrity":"/paper/2103.01447/integrity","json":"/paper/2103.01447/citation-record.json","paper":"/paper/2103.01447"},"outbound":[],"paper":{"arxiv_id":"2103.01447","last_updated":"2021-10-10T19:03:07Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-04T17:07:02.401955Z","submitted_at":"2021-03-02T03:31:06Z","title":"ZeroSARAH: Efficient Nonconvex Finite-Sum Optimization with Zero Full Gradient Computation"},"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 6 inbound Pith citation observations for arXiv:2103.01447."}