{"as_of":"2026-08-16T08:58:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:db97b8d3c00a482dddb04e10c3dc0efeb17b6a86e22f726412ef2d2b1ebf4f0d","coverage":[{"denominator":40,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":40,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T12:17:29.112066Z","state":"measured"},{"denominator":40,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":40,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/1908.07861/citation-record","integrity":"/paper/1908.07861/integrity","json":"/paper/1908.07861/citation-record.json","paper":"/paper/1908.07861"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:17:30.169011Z","title":"Agarwal, M","venue":null,"work_id":"cd9784e4-8b9d-49d1-b13c-fafdb558d522","year":2009},"citing_paper":{"arxiv_id":"1908.07861","last_updated":"2020-09-01T13:06:57Z","snapshot_observed_at":"2026-08-15T20:33:15.859436Z","submitted_at":"2019-08-21T13:25:31Z","title":"Nesterov's method with decreasing learning rate leads to accelerated stochastic gradient descent","version":5},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-14T12:17:28.781469Z"},"links":{"citing_paper":"/paper/1908.07861"},"observation_digest":"sha256:c267b6d613ffd585e8281cf57e013bf135a741e3b0df8376613388c09872d2d1","observation_id":"635af4f8-d410-4c6e-86ef-878458b19e17","resolution":{"observed_at":"2026-08-14T12:17:30.178369Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:17:30.139488Z","title":"Allen-Zhu","venue":null,"work_id":"85e5027e-d7b7-4746-b28d-c18879a568ec","year":2017},"citing_paper":{"arxiv_id":"1908.07861","last_updated":"2020-09-01T13:06:57Z","snapshot_observed_at":"2026-08-15T20:33:15.859436Z","submitted_at":"2019-08-21T13:25:31Z","title":"Nesterov's method with decreasing learning rate leads to accelerated stochastic gradient descent","version":5},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-14T12:17:28.788489Z"},"links":{"citing_paper":"/paper/1908.07861"},"observation_digest":"sha256:42d7b542d5c771b3a2f0c73540ee155d4190d656e1a33d84173b51682a423448","observation_id":"0f7b1d3f-2a00-496f-ac6d-9556713d753f","resolution":{"observed_at":"2026-08-14T12:17:30.153110Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:17:30.098898Z","title":"Alvarez, H","venue":null,"work_id":"9194e602-a324-41d3-88b8-d29bc81c7041","year":2002},"citing_paper":{"arxiv_id":"1908.07861","last_updated":"2020-09-01T13:06:57Z","snapshot_observed_at":"2026-08-15T20:33:15.859436Z","submitted_at":"2019-08-21T13:25:31Z","title":"Nesterov's method with decreasing learning rate leads to accelerated stochastic gradient descent","version":5},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-14T12:17:28.794626Z"},"links":{"citing_paper":"/paper/1908.07861"},"observation_digest":"sha256:bf41f7730bb0d9daa5fa336ac9ad3ecbd857fc0420a580a51f7019ad3633e2f5","observation_id":"82df8364-2060-406f-9470-91c950d57dfe","resolution":{"observed_at":"2026-08-14T12:17:30.107412Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:17:30.077064Z","title":"Assran and M","venue":null,"work_id":"1c64c4a6-e68e-46ef-b3e3-56b155e11c62","year":2020},"citing_paper":{"arxiv_id":"1908.07861","last_updated":"2020-09-01T13:06:57Z","snapshot_observed_at":"2026-08-15T20:33:15.859436Z","submitted_at":"2019-08-21T13:25:31Z","title":"Nesterov's method with decreasing learning rate leads to accelerated stochastic gradient descent","version":5},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-14T12:17:28.802330Z"},"links":{"citing_paper":"/paper/1908.07861"},"observation_digest":"sha256:123a53df167c5c0e1886d26f49160ede68c139c6114d2786d1cdcd04cd495707","observation_id":"a9c0749b-15a7-4f67-b804-28fec1319430","resolution":{"observed_at":"2026-08-14T12:17:30.084108Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:17:30.048165Z","title":"Attouch, J","venue":null,"work_id":"b821346c-e38e-458f-9337-d213fdb154dc","year":2016},"citing_paper":{"arxiv_id":"1908.07861","last_updated":"2020-09-01T13:06:57Z","snapshot_observed_at":"2026-08-15T20:33:15.859436Z","submitted_at":"2019-08-21T13:25:31Z","title":"Nesterov's method with decreasing learning rate leads to accelerated stochastic gradient descent","version":5},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-14T12:17:28.810042Z"},"links":{"citing_paper":"/paper/1908.07861"},"observation_digest":"sha256:f484d3e0ca5ac400d1f567f36dc4a5a097be466b5b764c50dfcd242e3a211416","observation_id":"8eec429c-b1b1-412c-959e-25cee37df99b","resolution":{"observed_at":"2026-08-14T12:17:30.057949Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:17:28.815828Z","title":"Beck and M","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"1908.07861","last_updated":"2020-09-01T13:06:57Z","snapshot_observed_at":"2026-08-15T20:33:15.859436Z","submitted_at":"2019-08-21T13:25:31Z","title":"Nesterov's method with decreasing learning rate leads to accelerated stochastic gradient descent","version":5},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-14T12:17:28.815828Z"},"links":{"citing_paper":"/paper/1908.07861"},"observation_digest":"sha256:adcd5e5199721a5b894bc79835722e425e8b38150a9240bf74da8845274a2594","observation_id":"16577a0c-5b42-4599-a2db-2f63e7d276df","resolution":{"observed_at":"2026-08-14T12:17:28.815828Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:17:30.001206Z","title":"Bengio, N","venue":null,"work_id":"fc7e3597-4031-4b04-a001-f5aec0ec925e","year":2013},"citing_paper":{"arxiv_id":"1908.07861","last_updated":"2020-09-01T13:06:57Z","snapshot_observed_at":"2026-08-15T20:33:15.859436Z","submitted_at":"2019-08-21T13:25:31Z","title":"Nesterov's method with decreasing learning rate leads to accelerated stochastic gradient descent","version":5},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-14T12:17:28.822829Z"},"links":{"citing_paper":"/paper/1908.07861"},"observation_digest":"sha256:017d531b5dec19e065cad745f8f13cecaef8703caee5bbdf6c3070dd44e2c596","observation_id":"618409e6-bcd7-400e-8eba-b88ef49a7733","resolution":{"observed_at":"2026-08-14T12:17:30.013244Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"1606.04838","last_updated":"2018-02-08T20:40:22Z","snapshot_observed_at":"2026-08-16T02:31:41.317959Z","submitted_at":"2016-06-15T16:15:53Z","title":"Optimization Methods for Large-Scale Machine Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1606.04838","snapshot_observed_at":"2026-08-14T12:17:28.833824Z","title":"Bottou, F","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.07861","last_updated":"2020-09-01T13:06:57Z","snapshot_observed_at":"2026-08-15T20:33:15.859436Z","submitted_at":"2019-08-21T13:25:31Z","title":"Nesterov's method with decreasing learning rate leads to accelerated stochastic gradient descent","version":5},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-14T12:17:28.833824Z"},"links":{"cited_paper":"/paper/1606.04838","citing_paper":"/paper/1908.07861"},"observation_digest":"sha256:584767c5c299cfa96c0809df5ed1baad125e57980a754c551c1820fce3fe9971","observation_id":"4bad5f04-18d9-4236-91c1-b46647a9a9ef","resolution":{"observed_at":"2026-08-14T12:17:28.833824Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:17:28.852619Z","title":"Bottou, F","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.07861","last_updated":"2020-09-01T13:06:57Z","snapshot_observed_at":"2026-08-15T20:33:15.859436Z","submitted_at":"2019-08-21T13:25:31Z","title":"Nesterov's method with decreasing learning rate leads to accelerated stochastic gradient descent","version":5},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-14T12:17:28.852619Z"},"links":{"citing_paper":"/paper/1908.07861"},"observation_digest":"sha256:bd0ca9afc7790371b78bdf2951fed62e5774dee011bc109abf71a6dc1897b10b","observation_id":"bb012f2b-0296-4a89-9ccb-679db4ff9e17","resolution":{"observed_at":"2026-08-14T12:17:28.852619Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:17:29.956542Z","title":null,"venue":null,"work_id":"b64144ba-2143-4d93-9499-c0800483b83b","year":2014},"citing_paper":{"arxiv_id":"1908.07861","last_updated":"2020-09-01T13:06:57Z","snapshot_observed_at":"2026-08-15T20:33:15.859436Z","submitted_at":"2019-08-21T13:25:31Z","title":"Nesterov's method with decreasing learning rate leads to accelerated stochastic gradient descent","version":5},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-14T12:17:28.859357Z"},"links":{"citing_paper":"/paper/1908.07861"},"observation_digest":"sha256:85e1f6e6897f8e94506f3ace4f19689065e228f710e2abf6225f77a3da4038b8","observation_id":"fee13996-1fe0-434b-ab95-c966f222ff72","resolution":{"observed_at":"2026-08-14T12:17:29.964244Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:17:29.936406Z","title":"Defazio and L","venue":null,"work_id":"e3504f26-4b1e-455f-b621-e7f5dd4e697f","year":2019},"citing_paper":{"arxiv_id":"1908.07861","last_updated":"2020-09-01T13:06:57Z","snapshot_observed_at":"2026-08-15T20:33:15.859436Z","submitted_at":"2019-08-21T13:25:31Z","title":"Nesterov's method with decreasing learning rate leads to accelerated stochastic gradient descent","version":5},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-14T12:17:28.868164Z"},"links":{"citing_paper":"/paper/1908.07861"},"observation_digest":"sha256:78f826de647d83f0cf06d9e1d7aa1de37ccd38c8da04dde98dc94fc3fc1c615d","observation_id":"f4e95edf-8e9a-4aed-9045-d28d1642ccb6","resolution":{"observed_at":"2026-08-14T12:17:29.942809Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:17:29.908678Z","title":"Defazio, F","venue":null,"work_id":"37e3f095-9cea-41d0-8d70-2c6cdbfbbd03","year":2014},"citing_paper":{"arxiv_id":"1908.07861","last_updated":"2020-09-01T13:06:57Z","snapshot_observed_at":"2026-08-15T20:33:15.859436Z","submitted_at":"2019-08-21T13:25:31Z","title":"Nesterov's method with decreasing learning rate leads to accelerated stochastic gradient descent","version":5},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-14T12:17:28.877265Z"},"links":{"citing_paper":"/paper/1908.07861"},"observation_digest":"sha256:f21ecb81a3ffd3e4f881149413d8891f86df0db48d083073a0ea4d7ddd170de7","observation_id":"d5b4292e-c468-4810-b770-cd1f3a225856","resolution":{"observed_at":"2026-08-14T12:17:29.918192Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:17:29.887235Z","title":"Flammarion and F","venue":null,"work_id":"7c359cd2-b925-48e1-8c0f-2b735705478f","year":2015},"citing_paper":{"arxiv_id":"1908.07861","last_updated":"2020-09-01T13:06:57Z","snapshot_observed_at":"2026-08-15T20:33:15.859436Z","submitted_at":"2019-08-21T13:25:31Z","title":"Nesterov's method with decreasing learning rate leads to accelerated stochastic gradient descent","version":5},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-14T12:17:28.888695Z"},"links":{"citing_paper":"/paper/1908.07861"},"observation_digest":"sha256:2c8cf7ec2bb82aa5022743bbda663369cb0e25ec3bb57c7432cf01a0562d7c03","observation_id":"3f02765d-3b5c-4e6c-b147-8b7375f4cf35","resolution":{"observed_at":"2026-08-14T12:17:29.894983Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:17:29.862347Z","title":"Frostig, R","venue":null,"work_id":"6bfc4148-2400-486b-b63a-59cfb9b19898","year":2015},"citing_paper":{"arxiv_id":"1908.07861","last_updated":"2020-09-01T13:06:57Z","snapshot_observed_at":"2026-08-15T20:33:15.859436Z","submitted_at":"2019-08-21T13:25:31Z","title":"Nesterov's method with decreasing learning rate leads to accelerated stochastic gradient descent","version":5},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-14T12:17:28.896517Z"},"links":{"citing_paper":"/paper/1908.07861"},"observation_digest":"sha256:0ac158bc622db4342a9d985c444610294d89afe7f9456928885ed49faf6987ef","observation_id":"7b29fdba-8675-472b-aa42-dafeee108e8f","resolution":{"observed_at":"2026-08-14T12:17:29.869291Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:17:29.838234Z","title":null,"venue":null,"work_id":"fb24f51f-1238-413b-bd07-468f16587425","year":2018},"citing_paper":{"arxiv_id":"1908.07861","last_updated":"2020-09-01T13:06:57Z","snapshot_observed_at":"2026-08-15T20:33:15.859436Z","submitted_at":"2019-08-21T13:25:31Z","title":"Nesterov's method with decreasing learning rate leads to accelerated stochastic gradient descent","version":5},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-14T12:17:28.904499Z"},"links":{"citing_paper":"/paper/1908.07861"},"observation_digest":"sha256:7971d2015a3384478ce610224c5905327c09d2feb26f7a90bf416b6f0164d59e","observation_id":"35b29361-e265-4de0-9aed-0a925a0280ac","resolution":{"observed_at":"2026-08-14T12:17:29.844998Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:17:29.813429Z","title":null,"venue":null,"work_id":"0f7ee006-13e4-4c10-a626-fb61a13921ef","year":2019},"citing_paper":{"arxiv_id":"1908.07861","last_updated":"2020-09-01T13:06:57Z","snapshot_observed_at":"2026-08-15T20:33:15.859436Z","submitted_at":"2019-08-21T13:25:31Z","title":"Nesterov's method with decreasing learning rate leads to accelerated stochastic gradient descent","version":5},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-14T12:17:28.910613Z"},"links":{"citing_paper":"/paper/1908.07861"},"observation_digest":"sha256:c3d0ec7059f7d4bb0b671588d0930958e774f2cfe9e17e410020837142ba9227","observation_id":"3c905381-f20d-4812-8046-60d9f30b3b6e","resolution":{"observed_at":"2026-08-14T12:17:29.820551Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:17:29.790105Z","title":"Johnson and T","venue":null,"work_id":"ef0433d5-5251-468a-a50b-28c687a199e9","year":2013},"citing_paper":{"arxiv_id":"1908.07861","last_updated":"2020-09-01T13:06:57Z","snapshot_observed_at":"2026-08-15T20:33:15.859436Z","submitted_at":"2019-08-21T13:25:31Z","title":"Nesterov's method with decreasing learning rate leads to accelerated stochastic gradient descent","version":5},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-14T12:17:28.916490Z"},"links":{"citing_paper":"/paper/1908.07861"},"observation_digest":"sha256:f3a60ce3ef317ce1e915cda2b4a52cc097f3b1111e996602fb100bc1c19511dd","observation_id":"bcf8ca3e-3e2d-4811-a651-18225a0f9f0f","resolution":{"observed_at":"2026-08-14T12:17:29.796617Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:17:29.765321Z","title":"Kidambi, P","venue":null,"work_id":"ff68f9c5-c4ad-43d2-9fde-6d52e7411346","year":2018},"citing_paper":{"arxiv_id":"1908.07861","last_updated":"2020-09-01T13:06:57Z","snapshot_observed_at":"2026-08-15T20:33:15.859436Z","submitted_at":"2019-08-21T13:25:31Z","title":"Nesterov's method with decreasing learning rate leads to accelerated stochastic gradient descent","version":5},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-14T12:17:28.923306Z"},"links":{"citing_paper":"/paper/1908.07861"},"observation_digest":"sha256:cb5ea0f49461cf6ac5583cf934577f9fae8a516f77fb8783e791d1e363fe835c","observation_id":"e339ea4f-99f0-4391-b8be-27a9891a2f73","resolution":{"observed_at":"2026-08-14T12:17:29.773493Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-08-14T18:51:16.666127Z","submitted_at":"2014-12-22T13:54:29Z","title":"Adam: A Method for Stochastic Optimization","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6980","snapshot_observed_at":"2026-08-14T12:17:28.937327Z","title":"Kingma and J","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"1908.07861","last_updated":"2020-09-01T13:06:57Z","snapshot_observed_at":"2026-08-15T20:33:15.859436Z","submitted_at":"2019-08-21T13:25:31Z","title":"Nesterov's method with decreasing learning rate leads to accelerated stochastic gradient descent","version":5},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-14T12:17:28.937327Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/1908.07861"},"observation_digest":"sha256:cef3c40cff9c865f25ac0e22f4a43c6a4d1124175275d0de06dbdca6c4991406","observation_id":"12ce9411-b7c9-40c7-9247-f526202a70df","resolution":{"observed_at":"2026-08-14T12:17:28.937327Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:17:29.732403Z","title":"Krichene, A","venue":null,"work_id":"9e4a0b53-07a3-4232-af1a-b8f539d02b42","year":2015},"citing_paper":{"arxiv_id":"1908.07861","last_updated":"2020-09-01T13:06:57Z","snapshot_observed_at":"2026-08-15T20:33:15.859436Z","submitted_at":"2019-08-21T13:25:31Z","title":"Nesterov's method with decreasing learning rate leads to accelerated stochastic gradient descent","version":5},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-14T12:17:28.947521Z"},"links":{"citing_paper":"/paper/1908.07861"},"observation_digest":"sha256:5c99353cc786b974356838db56625f3d7a5d0f40d162055219506a37f89757ca","observation_id":"629c59fd-1ec3-4fdd-8a98-4874552f3245","resolution":{"observed_at":"2026-08-14T12:17:29.739050Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"1212.2002","last_updated":"2012-12-20T20:55:23Z","snapshot_observed_at":"2026-08-16T01:09:00.338332Z","submitted_at":"2012-12-10T09:22:06Z","title":"A simpler approach to obtaining an O(1/t) convergence rate for the projected stochastic subgradient method","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1212.2002","snapshot_observed_at":"2026-08-14T12:17:28.956336Z","title":"Lacoste-Julien, M","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"1908.07861","last_updated":"2020-09-01T13:06:57Z","snapshot_observed_at":"2026-08-15T20:33:15.859436Z","submitted_at":"2019-08-21T13:25:31Z","title":"Nesterov's method with decreasing learning rate leads to accelerated stochastic gradient descent","version":5},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-14T12:17:28.956336Z"},"links":{"cited_paper":"/paper/1212.2002","citing_paper":"/paper/1908.07861"},"observation_digest":"sha256:130c038f807698653281500212ed80ca5d36f44cb1fc205ff8c92ef88fabe687","observation_id":"5d412789-5f40-45d9-aef3-f9eb98ae8f86","resolution":{"observed_at":"2026-08-14T12:17:28.956336Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:17:29.712352Z","title":"Lessard, B","venue":null,"work_id":"4c42dec1-d841-4e04-a628-c39cd1cd3e38","year":2016},"citing_paper":{"arxiv_id":"1908.07861","last_updated":"2020-09-01T13:06:57Z","snapshot_observed_at":"2026-08-15T20:33:15.859436Z","submitted_at":"2019-08-21T13:25:31Z","title":"Nesterov's method with decreasing learning rate leads to accelerated stochastic gradient descent","version":5},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-14T12:17:28.964159Z"},"links":{"citing_paper":"/paper/1908.07861"},"observation_digest":"sha256:0eaccaf0b0477fe599376c225c89d168fda76accc4677f4a91bfff5e58a30025","observation_id":"2657d5f0-1f83-4097-bbeb-d2c97dd465da","resolution":{"observed_at":"2026-08-14T12:17:29.718357Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:17:29.692770Z","title":null,"venue":null,"work_id":"03ff65be-f709-4a14-9b3f-3c8936ccd8a4","year":2015},"citing_paper":{"arxiv_id":"1908.07861","last_updated":"2020-09-01T13:06:57Z","snapshot_observed_at":"2026-08-15T20:33:15.859436Z","submitted_at":"2019-08-21T13:25:31Z","title":"Nesterov's method with decreasing learning rate leads to accelerated stochastic gradient descent","version":5},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-14T12:17:28.971817Z"},"links":{"citing_paper":"/paper/1908.07861"},"observation_digest":"sha256:c412ec70347f1589a18e64c0be2c3bf74b8bcecb3039921f7f5dcef4ca3baf01","observation_id":"5715b5c8-94ac-4162-87ca-a4b586b0d249","resolution":{"observed_at":"2026-08-14T12:17:29.699143Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:17:28.979795Z","title":"Nemirovski, A","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"1908.07861","last_updated":"2020-09-01T13:06:57Z","snapshot_observed_at":"2026-08-15T20:33:15.859436Z","submitted_at":"2019-08-21T13:25:31Z","title":"Nesterov's method with decreasing learning rate leads to accelerated stochastic gradient descent","version":5},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-14T12:17:28.979795Z"},"links":{"citing_paper":"/paper/1908.07861"},"observation_digest":"sha256:3d4995315b84361b4c3cdcdd747eeba759f8914d28100a0338ad323cd9e43d81","observation_id":"890a77e8-e1fa-4e0a-a380-cbca0b6844c6","resolution":{"observed_at":"2026-08-14T12:17:28.979795Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:17:29.658167Z","title":"Nesterov","venue":null,"work_id":"2f5b3e91-1d68-4624-a779-5ab7c822dec6","year":null},"citing_paper":{"arxiv_id":"1908.07861","last_updated":"2020-09-01T13:06:57Z","snapshot_observed_at":"2026-08-15T20:33:15.859436Z","submitted_at":"2019-08-21T13:25:31Z","title":"Nesterov's method with decreasing learning rate leads to accelerated stochastic gradient descent","version":5},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-14T12:17:28.987480Z"},"links":{"citing_paper":"/paper/1908.07861"},"observation_digest":"sha256:80a44f8dd7ee999e152ae0cd122aefdae8f1bf8a923b43ec0cd49723113d53e3","observation_id":"0f8c8b02-32a3-4c16-beed-0f890461f6da","resolution":{"observed_at":"2026-08-14T12:17:29.663883Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:17:28.995246Z","title":"Nesterov","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"1908.07861","last_updated":"2020-09-01T13:06:57Z","snapshot_observed_at":"2026-08-15T20:33:15.859436Z","submitted_at":"2019-08-21T13:25:31Z","title":"Nesterov's method with decreasing learning rate leads to accelerated stochastic gradient descent","version":5},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-14T12:17:28.995246Z"},"links":{"citing_paper":"/paper/1908.07861"},"observation_digest":"sha256:38095bac7d9d2b6d0f40a28af5d18691bbf22d32327665944cdfd28fdd5ce6dc","observation_id":"9f839157-5439-4752-945b-3a827ea7bdae","resolution":{"observed_at":"2026-08-14T12:17:28.995246Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1903.08688","last_updated":"2019-07-11T18:35:09Z","snapshot_observed_at":"2026-08-14T16:59:13.010762Z","submitted_at":"2019-03-20T18:33:11Z","title":"Stochastic Gradient Descent with Polyak's Learning Rate","version":2},"cited_work":{"arxiv_id":"1903.08688","doi":null,"metadata_source":"pith","pith_arxiv_id":"1903.08688","snapshot_observed_at":"2026-08-14T12:17:29.344484Z","title":"Stochastic Gradient Descent with Polyak's Learning Rate","venue":"math.OC","work_id":"7ecd56de-5dcd-4920-a720-7bdd613b9ae8","year":2019},"citing_paper":{"arxiv_id":"1908.07861","last_updated":"2020-09-01T13:06:57Z","snapshot_observed_at":"2026-08-15T20:33:15.859436Z","submitted_at":"2019-08-21T13:25:31Z","title":"Nesterov's method with decreasing learning rate leads to accelerated stochastic gradient descent","version":5},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-14T12:17:29.000961Z"},"links":{"cited_paper":"/paper/1903.08688","citing_paper":"/paper/1908.07861"},"observation_digest":"sha256:0178dbe1f20c6628c60c1f9eed8ed22f4e3b238f06bf3bd7f83eaa98391e780b","observation_id":"346b5b35-34b1-46dc-8818-dc110d04c16d","resolution":{"observed_at":"2026-08-14T12:17:29.351129Z","resolver_source":"local_arxiv","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:17:29.612734Z","title":null,"venue":null,"work_id":"ca5d801d-e9d7-43d0-8a24-308e17fd13c4","year":1964},"citing_paper":{"arxiv_id":"1908.07861","last_updated":"2020-09-01T13:06:57Z","snapshot_observed_at":"2026-08-15T20:33:15.859436Z","submitted_at":"2019-08-21T13:25:31Z","title":"Nesterov's method with decreasing learning rate leads to accelerated stochastic gradient descent","version":5},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-14T12:17:29.016532Z"},"links":{"citing_paper":"/paper/1908.07861"},"observation_digest":"sha256:f24a251318ccf78d6580a72dcd6c1eadb14cc6225462179c151d7993ab912726","observation_id":"4c55c8d4-6c8b-41df-b48f-db31518addef","resolution":{"observed_at":"2026-08-14T12:17:29.620679Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:17:29.022284Z","title":null,"venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"1908.07861","last_updated":"2020-09-01T13:06:57Z","snapshot_observed_at":"2026-08-15T20:33:15.859436Z","submitted_at":"2019-08-21T13:25:31Z","title":"Nesterov's method with decreasing learning rate leads to accelerated stochastic gradient descent","version":5},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-14T12:17:29.022284Z"},"links":{"citing_paper":"/paper/1908.07861"},"observation_digest":"sha256:5a7f93b7f47c13f73bf3499fe014abdf090d3d400242a97837678875dbbf228c","observation_id":"cb66bda5-fad3-42b0-a654-9b6c48507ee9","resolution":{"observed_at":"2026-08-14T12:17:29.022284Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:17:29.589077Z","title":null,"venue":null,"work_id":"6d0002e3-d4d1-4130-ac2d-2415babdb65c","year":2019},"citing_paper":{"arxiv_id":"1908.07861","last_updated":"2020-09-01T13:06:57Z","snapshot_observed_at":"2026-08-15T20:33:15.859436Z","submitted_at":"2019-08-21T13:25:31Z","title":"Nesterov's method with decreasing learning rate leads to accelerated stochastic gradient descent","version":5},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-14T12:17:29.034260Z"},"links":{"citing_paper":"/paper/1908.07861"},"observation_digest":"sha256:caab51eafb87d761e5f728da1e6975bb4afd55f14f681f9469db29dbbeae63a5","observation_id":"08833009-23c1-4ebd-9226-279126338622","resolution":{"observed_at":"2026-08-14T12:17:29.595274Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:17:29.567715Z","title":"Rakhlin, O","venue":null,"work_id":"6b89aea7-9baf-4fa0-a125-dcfb9345eb29","year":2012},"citing_paper":{"arxiv_id":"1908.07861","last_updated":"2020-09-01T13:06:57Z","snapshot_observed_at":"2026-08-15T20:33:15.859436Z","submitted_at":"2019-08-21T13:25:31Z","title":"Nesterov's method with decreasing learning rate leads to accelerated stochastic gradient descent","version":5},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-14T12:17:29.039621Z"},"links":{"citing_paper":"/paper/1908.07861"},"observation_digest":"sha256:8648e558b6605437c7fa6502d92b7f891bf19b19f705a3950cc02f400696146e","observation_id":"1a90e2d0-a667-4413-8ecd-fd0a712bd228","resolution":{"observed_at":"2026-08-14T12:17:29.574397Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:17:29.546841Z","title":"Schmidt, N","venue":null,"work_id":"3789a51d-f131-41c2-a19a-bc69896cd77c","year":2011},"citing_paper":{"arxiv_id":"1908.07861","last_updated":"2020-09-01T13:06:57Z","snapshot_observed_at":"2026-08-15T20:33:15.859436Z","submitted_at":"2019-08-21T13:25:31Z","title":"Nesterov's method with decreasing learning rate leads to accelerated stochastic gradient descent","version":5},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-14T12:17:29.046154Z"},"links":{"citing_paper":"/paper/1908.07861"},"observation_digest":"sha256:d0354cbd28166719210ab0edad6558a5c2749d02e54fbcb6a0db1042619ce755","observation_id":"b9811eb4-a703-40b4-b54a-7d8f70c47cc5","resolution":{"observed_at":"2026-08-14T12:17:29.553452Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:17:29.521504Z","title":"Schmidt, N","venue":null,"work_id":"17bba7f3-2211-496d-9424-ffdc74fc250f","year":2017},"citing_paper":{"arxiv_id":"1908.07861","last_updated":"2020-09-01T13:06:57Z","snapshot_observed_at":"2026-08-15T20:33:15.859436Z","submitted_at":"2019-08-21T13:25:31Z","title":"Nesterov's method with decreasing learning rate leads to accelerated stochastic gradient descent","version":5},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-14T12:17:29.054247Z"},"links":{"citing_paper":"/paper/1908.07861"},"observation_digest":"sha256:9b230d7976edcf4fd1d4c5e7de166b4e7f431e68d25a20ac75ab4d78ce72a41e","observation_id":"6169cda0-b6d4-412f-9bcb-81de4ec25bbc","resolution":{"observed_at":"2026-08-14T12:17:29.531977Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"1805.10579","last_updated":"2019-11-05T19:18:43Z","snapshot_observed_at":"2026-08-14T19:10:43.727436Z","submitted_at":"2018-05-27T04:22:14Z","title":"Robust Accelerated Gradient Methods for Smooth Strongly Convex Functions","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1805.10579","snapshot_observed_at":"2026-08-14T12:17:29.060963Z","title":"Serhat Aybat , A","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"1908.07861","last_updated":"2020-09-01T13:06:57Z","snapshot_observed_at":"2026-08-15T20:33:15.859436Z","submitted_at":"2019-08-21T13:25:31Z","title":"Nesterov's method with decreasing learning rate leads to accelerated stochastic gradient descent","version":5},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-14T12:17:29.060963Z"},"links":{"cited_paper":"/paper/1805.10579","citing_paper":"/paper/1908.07861"},"observation_digest":"sha256:c7697d920371343acf8d41a313e979667eab4740612608a6c7fc9f34d3e87676","observation_id":"3f7df756-6868-4ce7-9dd8-85bcf623dc95","resolution":{"observed_at":"2026-08-14T12:17:29.060963Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:17:29.491418Z","title":"Shamir and T","venue":null,"work_id":"89c5a5fc-7e35-4614-96fd-20fd5f4be7aa","year":2013},"citing_paper":{"arxiv_id":"1908.07861","last_updated":"2020-09-01T13:06:57Z","snapshot_observed_at":"2026-08-15T20:33:15.859436Z","submitted_at":"2019-08-21T13:25:31Z","title":"Nesterov's method with decreasing learning rate leads to accelerated stochastic gradient descent","version":5},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-14T12:17:29.069598Z"},"links":{"citing_paper":"/paper/1908.07861"},"observation_digest":"sha256:488ffda2612ed9ce2b5edcf6e2b4ed6dc3b3f527b942ce7fabb92291da8914cf","observation_id":"de952472-207f-4b26-87e7-d34fc9a467f1","resolution":{"observed_at":"2026-08-14T12:17:29.505258Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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.08907","last_updated":"2018-11-01T19:10:45Z","snapshot_observed_at":"2026-08-14T18:11:40.432959Z","submitted_at":"2018-10-21T07:34:09Z","title":"Understanding the Acceleration Phenomenon via High-Resolution Differential Equations","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.08907","snapshot_observed_at":"2026-08-14T12:17:29.082768Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.07861","last_updated":"2020-09-01T13:06:57Z","snapshot_observed_at":"2026-08-15T20:33:15.859436Z","submitted_at":"2019-08-21T13:25:31Z","title":"Nesterov's method with decreasing learning rate leads to accelerated stochastic gradient descent","version":5},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-14T12:17:29.082768Z"},"links":{"cited_paper":"/paper/1810.08907","citing_paper":"/paper/1908.07861"},"observation_digest":"sha256:77847df122fc4799b5c2393d0a726247e7f61e2de9f2afa51636b3bb2ea0b899","observation_id":"998f22b3-6c7b-4870-aced-ef417b262182","resolution":{"observed_at":"2026-08-14T12:17:29.082768Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:17:29.467183Z","title":null,"venue":null,"work_id":"bccb8a89-a592-4751-baca-2b0302c28b45","year":2014},"citing_paper":{"arxiv_id":"1908.07861","last_updated":"2020-09-01T13:06:57Z","snapshot_observed_at":"2026-08-15T20:33:15.859436Z","submitted_at":"2019-08-21T13:25:31Z","title":"Nesterov's method with decreasing learning rate leads to accelerated stochastic gradient descent","version":5},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-14T12:17:29.091137Z"},"links":{"citing_paper":"/paper/1908.07861"},"observation_digest":"sha256:213c24728fb3ae1f607ca4f70c3e74cc848945e76597bf6fccedc32b051ee012","observation_id":"a8e9760e-1dc3-420d-bacf-7a9b7ed72d71","resolution":{"observed_at":"2026-08-14T12:17:29.474438Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:17:29.447354Z","title":"Wibisono, A","venue":null,"work_id":"d1f04c82-969e-46fc-b195-3f87876f89c5","year":2016},"citing_paper":{"arxiv_id":"1908.07861","last_updated":"2020-09-01T13:06:57Z","snapshot_observed_at":"2026-08-15T20:33:15.859436Z","submitted_at":"2019-08-21T13:25:31Z","title":"Nesterov's method with decreasing learning rate leads to accelerated stochastic gradient descent","version":5},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-14T12:17:29.098475Z"},"links":{"citing_paper":"/paper/1908.07861"},"observation_digest":"sha256:fca5ccf94556d9177f41e4729266599cf31a4960995bb142a5e0f53350a7d7c8","observation_id":"0134d034-8fe2-4210-9fdf-01396b6e0f76","resolution":{"observed_at":"2026-08-14T12:17:29.453994Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"1902.08825","last_updated":"2020-01-04T19:26:03Z","snapshot_observed_at":"2026-08-16T07:10:24.787257Z","submitted_at":"2019-02-23T18:35:49Z","title":"Accelerating Rescaled Gradient Descent: Fast Optimization of Smooth Functions","version":3},"cited_work":{"arxiv_id":"1902.08825","doi":null,"metadata_source":"pith","pith_arxiv_id":"1902.08825","snapshot_observed_at":"2026-08-14T12:17:29.233617Z","title":"Accelerating Rescaled Gradient Descent: Fast Optimization of Smooth Functions","venue":"math.OC","work_id":"359cdc41-3d57-4f40-b08c-7c101ed5c961","year":2019},"citing_paper":{"arxiv_id":"1908.07861","last_updated":"2020-09-01T13:06:57Z","snapshot_observed_at":"2026-08-15T20:33:15.859436Z","submitted_at":"2019-08-21T13:25:31Z","title":"Nesterov's method with decreasing learning rate leads to accelerated stochastic gradient descent","version":5},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-14T12:17:29.105973Z"},"links":{"cited_paper":"/paper/1902.08825","citing_paper":"/paper/1908.07861"},"observation_digest":"sha256:a0e364ffc0ac2a01b8fd017b6dcab693310d10c70bcef0fd0762afde64ca189d","observation_id":"b4c713e5-e4a6-42eb-8312-e746e5e622b2","resolution":{"observed_at":"2026-08-14T12:17:29.244946Z","resolver_source":"local_arxiv","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":"1611.02635","last_updated":"2018-03-12T04:20:12Z","snapshot_observed_at":"2026-08-14T21:31:22.903309Z","submitted_at":"2016-11-08T17:55:21Z","title":"A Lyapunov Analysis of Momentum Methods in Optimization","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.02635","snapshot_observed_at":"2026-08-14T12:17:29.112066Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.07861","last_updated":"2020-09-01T13:06:57Z","snapshot_observed_at":"2026-08-15T20:33:15.859436Z","submitted_at":"2019-08-21T13:25:31Z","title":"Nesterov's method with decreasing learning rate leads to accelerated stochastic gradient descent","version":5},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-14T12:17:29.112066Z"},"links":{"cited_paper":"/paper/1611.02635","citing_paper":"/paper/1908.07861"},"observation_digest":"sha256:dfa9f246759fade66854f5462985e0b42d5309e31a4d657ced32367b1194d710","observation_id":"916a5a60-18e7-46d8-8d81-eac3d2bdda74","resolution":{"observed_at":"2026-08-14T12:17:29.112066Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"1908.07861","last_updated":"2020-09-01T13:06:57Z","latest_version":5,"primary_category":"math.OC","snapshot_observed_at":"2026-08-15T20:33:15.859436Z","submitted_at":"2019-08-21T13:25:31Z","title":"Nesterov's method with decreasing learning rate leads to accelerated stochastic gradient descent"},"reference_resolution":{"displayed":40,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":18,"verified_exact":2,"verified_fuzzy":20},"total_outbound_references":40},"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 40 of 40 outbound references and 0 inbound Pith citation observations for arXiv:1908.07861."}