{"as_of":"2026-08-21T04:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:05514b791204a340b41b9e9dc069662a33500e1a7aedff306d409b684bf81462","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-20T06:33:59.587034+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-08-14T10:41:34.769327Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-06-29T05:43:08.869845Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1705.07261","last_updated":"2017-05-20T05:09:33Z","snapshot_observed_at":"2026-08-14T20:59:24.018366Z","submitted_at":"2017-05-20T05:09:33Z","title":"Stochastic Recursive Gradient Algorithm for Nonconvex Optimization","version":1},"cited_work":{"arxiv_id":"1705.07261","doi":null,"metadata_source":"pith","pith_arxiv_id":"1705.07261","snapshot_observed_at":"2026-06-29T05:43:08.869845Z","title":"Stochastic Recursive Gradient Algorithm for Nonconvex Optimization","venue":"stat.ML","work_id":"695838e8-11ef-46cf-8266-734f0dfbbb81","year":2017},"citing_paper":{"arxiv_id":"1906.08496","last_updated":"2019-06-20T08:22:48Z","snapshot_observed_at":"2026-08-19T05:31:08.852261Z","submitted_at":"2019-06-20T08:22:48Z","title":"Accelerating Mini-batch SARAH by Step Size Rules","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-25T20:03:01.738514Z"},"links":{"cited_paper":"/paper/1705.07261","citing_paper":"/paper/1906.08496"},"observation_digest":"sha256:9a936b13242f243fcb7002a35721d5df83c982bd793b60e3682fcbc29998d324","observation_id":"05bca6a4-c1a6-4258-b4cf-5f3a1f2c667c","resolution":{"observed_at":"2026-05-25T20:07:08.537502Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1705.07261","last_updated":"2017-05-20T05:09:33Z","snapshot_observed_at":"2026-08-14T20:59:24.018366Z","submitted_at":"2017-05-20T05:09:33Z","title":"Stochastic Recursive Gradient Algorithm for Nonconvex Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1705.07261","snapshot_observed_at":"2026-08-14T10:41:34.769327Z","title":"Stochastic recursive gradient algorithm for nonconvex optimization","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.10831","last_updated":"2020-06-30T03:25:14Z","snapshot_observed_at":"2026-08-19T18:09:38.555016Z","submitted_at":"2019-08-28T17:02:49Z","title":"Stochastic AUC Maximization with Deep Neural Networks","version":5},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-14T10:41:34.769327Z"},"links":{"cited_paper":"/paper/1705.07261","citing_paper":"/paper/1908.10831"},"observation_digest":"sha256:caaf61c433f92c72c031823ea86ce518a82d428d95f9fd7442ed980902da96b8","observation_id":"45d40c13-af2c-448e-99db-c15f82ab4383","resolution":{"observed_at":"2026-08-14T10:41:34.769327Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1705.07261","last_updated":"2017-05-20T05:09:33Z","snapshot_observed_at":"2026-08-14T20:59:24.018366Z","submitted_at":"2017-05-20T05:09:33Z","title":"Stochastic Recursive Gradient Algorithm for Nonconvex Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1705.07261","snapshot_observed_at":"2026-08-12T19:43:01.913923Z","title":"M., Liu, J., Scheinberg, K., and Tak \\'a c , M","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2411.10438","last_updated":"2025-09-04T09:37:05Z","snapshot_observed_at":"2026-08-17T20:25:32.027243Z","submitted_at":"2024-11-15T18:57:39Z","title":"MARS: Unleashing the Power of Variance Reduction for Training Large Models","version":4},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-12T19:43:01.913923Z"},"links":{"cited_paper":"/paper/1705.07261","citing_paper":"/paper/2411.10438"},"observation_digest":"sha256:89be31257d4885c99b9cce530727373c615de18e16cdc3444116ad35109fb8e4","observation_id":"3f2a9ec6-1ccb-468c-bb19-2d2e95021808","resolution":{"observed_at":"2026-08-12T19:43:01.913923Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1705.07261","last_updated":"2017-05-20T05:09:33Z","snapshot_observed_at":"2026-08-14T20:59:24.018366Z","submitted_at":"2017-05-20T05:09:33Z","title":"Stochastic Recursive Gradient Algorithm for Nonconvex Optimization","version":1},"cited_work":{"arxiv_id":"1705.07261","doi":null,"metadata_source":"pith","pith_arxiv_id":"1705.07261","snapshot_observed_at":"2026-06-29T05:43:08.869845Z","title":"Stochastic Recursive Gradient Algorithm for Nonconvex Optimization","venue":"stat.ML","work_id":"695838e8-11ef-46cf-8266-734f0dfbbb81","year":2017},"citing_paper":{"arxiv_id":"2606.08783","last_updated":"2026-06-26T09:55:08Z","snapshot_observed_at":"2026-07-06T23:48:11.819398Z","submitted_at":"2026-06-07T18:59:24Z","title":"OptMuon: Closed-Loop Orthogonalized Momentum Methods for Stochastic Optimization with Zero-Noise Optimality","version":2},"reference_index":187,"source":"arxiv_source","source_observed_at":"2026-06-29T05:33:27.870787Z"},"links":{"cited_paper":"/paper/1705.07261","citing_paper":"/paper/2606.08783"},"observation_digest":"sha256:b0ec4e09b3c2a33d8fe0f8d938145910e3a44593d9400944b362ca088c804015","observation_id":"89ba97dd-6e22-4fd5-a3ba-ef1675ae95a5","resolution":{"observed_at":"2026-06-29T05:43:08.873421Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1705.07261/citation-record","integrity":"/paper/1705.07261/integrity","json":"/paper/1705.07261/citation-record.json","paper":"/paper/1705.07261"},"outbound":[],"paper":{"arxiv_id":"1705.07261","last_updated":"2017-05-20T05:09:33Z","latest_version":1,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-14T20:59:24.018366Z","submitted_at":"2017-05-20T05:09:33Z","title":"Stochastic Recursive Gradient Algorithm for 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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:1705.07261."}