{"as_of":"2026-08-16T07:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d6c0edc6e10485e757401ff481a46bffbe73c98f209fdbe4fcf65ee07a288c2d","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-16T06:30:59.297886+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-08-14T14:45:51.807593Z","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-08-14T18:09:38.867315Z","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:b3ccddca6cfe56c1f81dca19db384aa52135f394e77eb14470623fd2bc539cc7","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-08-14T18:09:38.867315Z","submitted_at":"2018-10-25T02:18:03Z","title":"SpiderBoost and Momentum: Faster Stochastic Variance Reduction Algorithms","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.10690","snapshot_observed_at":"2026-08-14T14:45:51.807593Z","title":"Spiderboost: A class of faster variance-reduced algorithms for nonconvex optimization","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.02734","last_updated":"2022-01-27T00:38:36Z","snapshot_observed_at":"2026-08-15T20:12:31.772332Z","submitted_at":"2019-08-07T17:10:52Z","title":"Stochastic First-order Methods for Convex and Nonconvex Functional Constrained Optimization","version":4},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-14T14:45:51.807593Z"},"links":{"cited_paper":"/paper/1810.10690","citing_paper":"/paper/1908.02734"},"observation_digest":"sha256:882ae7ba8e4d28212133d5a62e20fe7b2c870052b31f90447a03e354981523c8","observation_id":"43905812-9b87-4e67-b7d9-facee20df254","resolution":{"observed_at":"2026-08-14T14:45:51.807593Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.10690","last_updated":"2020-05-15T19:12:01Z","snapshot_observed_at":"2026-08-14T18:09:38.867315Z","submitted_at":"2018-10-25T02:18:03Z","title":"SpiderBoost and Momentum: Faster Stochastic Variance Reduction Algorithms","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.10690","snapshot_observed_at":"2026-08-14T10:41:34.805848Z","title":"Spiderboost: A class of faster variance-reduced algorithms for nonconvex optimization","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.10831","last_updated":"2020-06-30T03:25:14Z","snapshot_observed_at":"2026-08-15T12:34:02.774919Z","submitted_at":"2019-08-28T17:02:49Z","title":"Stochastic AUC Maximization with Deep Neural Networks","version":5},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-14T10:41:34.805848Z"},"links":{"cited_paper":"/paper/1810.10690","citing_paper":"/paper/1908.10831"},"observation_digest":"sha256:e99c74740af3a1d1352339a6541d7d3ad46cc161f8cd6dc6a22b79c344445eb4","observation_id":"e3dfdfc1-5f79-41d9-bcde-55de5bdff928","resolution":{"observed_at":"2026-08-14T10:41:34.805848Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.10690","last_updated":"2020-05-15T19:12:01Z","snapshot_observed_at":"2026-08-14T18:09:38.867315Z","submitted_at":"2018-10-25T02:18:03Z","title":"SpiderBoost and Momentum: Faster Stochastic Variance Reduction Algorithms","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.10690","snapshot_observed_at":"2026-08-14T10:27:44.325097Z","title":"SpiderBoost: A class of faster variance-reduced algorithms for nonconvex optimization","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.11468","last_updated":"2021-05-10T22:58:57Z","snapshot_observed_at":"2026-08-14T10:12:20.891535Z","submitted_at":"2019-08-29T22:22:06Z","title":"Multi-Level Composite Stochastic Optimization via Nested Variance Reduction","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-14T10:27:44.325097Z"},"links":{"cited_paper":"/paper/1810.10690","citing_paper":"/paper/1908.11468"},"observation_digest":"sha256:da99e415c11dde4074e674fc6880584b413b11fdc25434ec1b8d8616e709d0b4","observation_id":"d2713746-dec0-4c75-a474-891a3f6f132e","resolution":{"observed_at":"2026-08-14T10:27:44.325097Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.10690","last_updated":"2020-05-15T19:12:01Z","snapshot_observed_at":"2026-08-14T18:09:38.867315Z","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-08-13T06:06:10.844945Z","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:593a253ca543780943e8dad432da80ab8b1287153444d4e03142fd6fc941c48c","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-08-14T18:09:38.867315Z","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-08-14T19:21:09.667986Z","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:b524400114c156a792bb68db1d2b7ba7a545c144f31ddb49ef41176931185f61","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-08-14T18:09:38.867315Z","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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:1810.10690."}