{"as_of":"2026-08-04T12:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8522e950ea8e35b4c3ba66518e52af64494bc5b07f06fe2008ad4adc7fddac1d","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-25T17:02:34.602404Z","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-25T17:06:07.868772Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1810.10690","last_updated":"2020-05-15T19:12:01Z","snapshot_observed_at":"2026-07-06T07:10:28.375412Z","submitted_at":"2018-10-25T02:18:03Z","title":"SpiderBoost and Momentum: Faster Stochastic Variance Reduction Algorithms","version":3},"cited_work":{"arxiv_id":"1810.10690","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1810.10690","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"SpiderBoost: A class of faster variance-reduced algorithms for nonconvex optimization","venue":null,"work_id":"04196ace-2fe5-45d7-a9dd-d68d46391296","year":2018},"citing_paper":{"arxiv_id":"1906.10186","last_updated":"2019-06-24T19:21:29Z","snapshot_observed_at":"2026-08-02T11:11:25.599799Z","submitted_at":"2019-06-24T19:21:29Z","title":"A Stochastic Composite Gradient Method with Incremental Variance Reduction","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-25T17:02:34.602404Z"},"links":{"cited_paper":"/paper/1810.10690","citing_paper":"/paper/1906.10186"},"observation_digest":"sha256:6d9ce220aa163039a044bd6490cc2397a2c16f0948603fe3f76555b2b5353717","observation_id":"c5a0a8d6-82f4-4586-909a-657ba354cb4a","resolution":{"observed_at":"2026-05-25T17:06:07.872693Z","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":"1810.10690","last_updated":"2020-05-15T19:12:01Z","snapshot_observed_at":"2026-07-06T07:10:28.375412Z","submitted_at":"2018-10-25T02:18:03Z","title":"SpiderBoost and Momentum: Faster Stochastic Variance Reduction Algorithms","version":3},"cited_work":{"arxiv_id":"1810.10690","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1810.10690","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"SpiderBoost: A class of faster variance-reduced algorithms for nonconvex optimization","venue":null,"work_id":"04196ace-2fe5-45d7-a9dd-d68d46391296","year":2018},"citing_paper":{"arxiv_id":"2003.00295","last_updated":"2021-09-08T23:37:17Z","snapshot_observed_at":"2026-07-06T09:01:12.515300Z","submitted_at":"2020-02-29T16:37:29Z","title":"Adaptive Federated Optimization","version":5},"reference_index":182,"source":"arxiv_source","source_observed_at":"2026-05-21T10:30:58.601351Z"},"links":{"cited_paper":"/paper/1810.10690","citing_paper":"/paper/2003.00295"},"observation_digest":"sha256:7b2edac5b5350521f466fb61144ae8ab428ceea8224adc2081cb90514deb1316","observation_id":"f1dd3bfd-3d47-40db-8aa8-96362560f76c","resolution":{"observed_at":"2026-05-21T10:30:58.704670Z","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":"1810.10690","last_updated":"2020-05-15T19:12:01Z","snapshot_observed_at":"2026-07-06T07:10:28.375412Z","submitted_at":"2018-10-25T02:18:03Z","title":"SpiderBoost and Momentum: Faster Stochastic Variance Reduction Algorithms","version":3},"cited_work":{"arxiv_id":"1810.10690","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1810.10690","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"SpiderBoost: A class of faster variance-reduced algorithms for nonconvex optimization","venue":null,"work_id":"04196ace-2fe5-45d7-a9dd-d68d46391296","year":2018},"citing_paper":{"arxiv_id":"2605.15314","last_updated":"2026-05-14T18:27:49Z","snapshot_observed_at":"2026-07-06T23:26:37.362117Z","submitted_at":"2026-05-14T18:27:49Z","title":"Beyond Bounded Variance: Variance-Reduced Normalized Methods for Nonconvex Optimization under Blum-Gladyshev Noise","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-19T16:12:03.664411Z"},"links":{"cited_paper":"/paper/1810.10690","citing_paper":"/paper/2605.15314"},"observation_digest":"sha256:b4926831be7d4be2bd235878f3d1ffa330d464f670bc733a4d8d9835c32838f4","observation_id":"d6fe913e-2a3a-4864-a2d9-c9366a03c8ca","resolution":{"observed_at":"2026-05-19T16:12:38.857525Z","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/1810.10690/citation-record","integrity":"/paper/1810.10690/integrity","json":"/paper/1810.10690/citation-record.json","paper":"/paper/1810.10690"},"outbound":[],"paper":{"arxiv_id":"1810.10690","last_updated":"2020-05-15T19:12:01Z","latest_version":3,"primary_category":"math.OC","snapshot_observed_at":"2026-07-06T07:10:28.375412Z","submitted_at":"2018-10-25T02:18:03Z","title":"SpiderBoost and Momentum: Faster Stochastic Variance Reduction Algorithms"},"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 3 inbound Pith citation observations for arXiv:1810.10690."}