{"as_of":"2026-08-18T08:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:90b16ab93611bec630f3d5d766faebed2e12bb30aae68e03d35d4c17477dd18f","coverage":[{"denominator":33,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":33,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T14:33:51.838528Z","state":"measured"},{"denominator":33,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":33,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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/2608.10418/citation-record","integrity":"/paper/2608.10418/integrity","json":"/paper/2608.10418/citation-record.json","paper":"/paper/2608.10418"},"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-15T14:33:52.303396Z","title":", title =","venue":null,"work_id":"aa24185d-eae5-40ec-9c39-07e5eb9a3352","year":null},"citing_paper":{"arxiv_id":"2608.10418","last_updated":"2026-08-11T03:06:59Z","snapshot_observed_at":"2026-08-16T11:43:52.602813Z","submitted_at":"2026-08-11T03:06:59Z","title":"A lower bound for stepsize-based acceleration of gradient descent","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-15T14:33:51.714908Z"},"links":{"citing_paper":"/paper/2608.10418"},"observation_digest":"sha256:a5563d71f28d233a7f294e4b9b8aa2ce99032f0df9abf7ec1d06c4daff1575bf","observation_id":"6070368c-1366-4894-9d94-97782aaef13c","resolution":{"observed_at":"2026-08-15T14:33:52.306825Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T14:33:51.719509Z","title":"Foundations and trends in Machine Learning , volume=","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2608.10418","last_updated":"2026-08-11T03:06:59Z","snapshot_observed_at":"2026-08-16T11:43:52.602813Z","submitted_at":"2026-08-11T03:06:59Z","title":"A lower bound for stepsize-based acceleration of gradient descent","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-15T14:33:51.719509Z"},"links":{"citing_paper":"/paper/2608.10418"},"observation_digest":"sha256:929a87b051296ba3ead3ca29b4be5c5826e29ca2e99a7bb38f4fcd8b6ab23c2b","observation_id":"10f646b1-6a96-4b58-a257-e88b1120fafc","resolution":{"observed_at":"2026-08-15T14:33:51.719509Z","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-15T14:33:52.286747Z","title":"International Conference on Machine Learning , pages=","venue":null,"work_id":"1eaa58f1-ba6f-48fd-9b6d-2154c47210f4","year":null},"citing_paper":{"arxiv_id":"2608.10418","last_updated":"2026-08-11T03:06:59Z","snapshot_observed_at":"2026-08-16T11:43:52.602813Z","submitted_at":"2026-08-11T03:06:59Z","title":"A lower bound for stepsize-based acceleration of gradient descent","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-15T14:33:51.724556Z"},"links":{"citing_paper":"/paper/2608.10418"},"observation_digest":"sha256:9c00f930aee2c9e09ed59e8ef020e726be2b8f20138b4b7b8b47d95904cd00ac","observation_id":"4ab8bf4c-7d94-4ad0-8fe3-acf704e0bf78","resolution":{"observed_at":"2026-08-15T14:33:52.290343Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T14:33:52.275185Z","title":"Mathematical Programming , volume=","venue":null,"work_id":"36adeae5-9e9e-4736-86d7-b9223991a6ff","year":2014},"citing_paper":{"arxiv_id":"2608.10418","last_updated":"2026-08-11T03:06:59Z","snapshot_observed_at":"2026-08-16T11:43:52.602813Z","submitted_at":"2026-08-11T03:06:59Z","title":"A lower bound for stepsize-based acceleration of gradient descent","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-15T14:33:51.728810Z"},"links":{"citing_paper":"/paper/2608.10418"},"observation_digest":"sha256:12ffb0f3ff7cb5718e4145d2f43efde4f723219db5fc053973a0ac1125292d00","observation_id":"cfc63b1c-548c-4266-b968-d5f7d66aed58","resolution":{"observed_at":"2026-08-15T14:33:52.279129Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T14:33:51.732721Z","title":"Mathematical Programming , volume=","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2608.10418","last_updated":"2026-08-11T03:06:59Z","snapshot_observed_at":"2026-08-16T11:43:52.602813Z","submitted_at":"2026-08-11T03:06:59Z","title":"A lower bound for stepsize-based acceleration of gradient descent","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-15T14:33:51.732721Z"},"links":{"citing_paper":"/paper/2608.10418"},"observation_digest":"sha256:67250c65c7ae622729d7a99f1e55285c9911dfeb055604ef60d3e9339ddc052c","observation_id":"6026e1ee-994b-4b68-901f-b15b2aa37b4d","resolution":{"observed_at":"2026-08-15T14:33:51.732721Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1606.01424","last_updated":"2016-06-04T22:40:47Z","snapshot_observed_at":"2026-08-17T08:49:14.841701Z","submitted_at":"2016-06-04T22:40:47Z","title":"The exact information-based complexity of smooth convex minimization","version":1},"cited_work":{"arxiv_id":"1606.01424","doi":null,"metadata_source":"pith","pith_arxiv_id":"1606.01424","snapshot_observed_at":"2026-08-15T14:33:52.040008Z","title":"The exact information-based complexity of smooth convex minimization","venue":"math.OC","work_id":"cc191911-7f89-4ff6-a475-4464678d62b2","year":2016},"citing_paper":{"arxiv_id":"2608.10418","last_updated":"2026-08-11T03:06:59Z","snapshot_observed_at":"2026-08-16T11:43:52.602813Z","submitted_at":"2026-08-11T03:06:59Z","title":"A lower bound for stepsize-based acceleration of gradient descent","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-15T14:33:51.736499Z"},"links":{"cited_paper":"/paper/1606.01424","citing_paper":"/paper/2608.10418"},"observation_digest":"sha256:d93c6491a52466021400e00e9e3e9ebe6ae9e968255e391253413bc03ba32940","observation_id":"5c1b9dcf-8ce5-4f40-870b-ac6adcaa13c1","resolution":{"observed_at":"2026-08-15T14:33:52.044059Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T14:33:52.258147Z","title":"Master's thesis, Université Catholique de Louvain , year=","venue":null,"work_id":"85235d89-fdcc-4744-a018-401c7c90ca79","year":null},"citing_paper":{"arxiv_id":"2608.10418","last_updated":"2026-08-11T03:06:59Z","snapshot_observed_at":"2026-08-16T11:43:52.602813Z","submitted_at":"2026-08-11T03:06:59Z","title":"A lower bound for stepsize-based acceleration of gradient descent","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-15T14:33:51.740814Z"},"links":{"citing_paper":"/paper/2608.10418"},"observation_digest":"sha256:461e091ee027ad9a940b58901e00afa89c748826e42704a34201c56f18308418","observation_id":"e6cf7bf6-fb42-4091-bae2-cb869f450187","resolution":{"observed_at":"2026-08-15T14:33:52.261759Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T14:33:52.247330Z","title":null,"venue":null,"work_id":"e66fe058-cfab-4304-aedb-d38376f668ad","year":null},"citing_paper":{"arxiv_id":"2608.10418","last_updated":"2026-08-11T03:06:59Z","snapshot_observed_at":"2026-08-16T11:43:52.602813Z","submitted_at":"2026-08-11T03:06:59Z","title":"A lower bound for stepsize-based acceleration of gradient descent","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-15T14:33:51.744523Z"},"links":{"citing_paper":"/paper/2608.10418"},"observation_digest":"sha256:c024b6ad9ab9fcef5ac15f4cf7245400f6ec0d88dd1b913fb7fc7dd1aff48e70","observation_id":"bfc16247-5bf9-4fa0-8691-7aba04a5b648","resolution":{"observed_at":"2026-08-15T14:33:52.251193Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T14:33:52.236047Z","title":"Mathematical programming , volume=","venue":null,"work_id":"237d3b99-d663-45b8-96d8-3d29b97b5c0d","year":2016},"citing_paper":{"arxiv_id":"2608.10418","last_updated":"2026-08-11T03:06:59Z","snapshot_observed_at":"2026-08-16T11:43:52.602813Z","submitted_at":"2026-08-11T03:06:59Z","title":"A lower bound for stepsize-based acceleration of gradient descent","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-15T14:33:51.748320Z"},"links":{"citing_paper":"/paper/2608.10418"},"observation_digest":"sha256:a892d572360e43e3c475ba918b7918b42daf943a3a5be48031b101ecff9d2768","observation_id":"2da8c0dc-1abb-4080-9499-3df621826485","resolution":{"observed_at":"2026-08-15T14:33:52.239896Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T14:33:51.752147Z","title":"2017 , publisher=","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2608.10418","last_updated":"2026-08-11T03:06:59Z","snapshot_observed_at":"2026-08-16T11:43:52.602813Z","submitted_at":"2026-08-11T03:06:59Z","title":"A lower bound for stepsize-based acceleration of gradient descent","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-15T14:33:51.752147Z"},"links":{"citing_paper":"/paper/2608.10418"},"observation_digest":"sha256:8dac809f3f81759147fd946fdfd5d7295b818903362203805d786a9665de3934","observation_id":"6f6e0627-81a4-4051-9690-ba80b0a06cdb","resolution":{"observed_at":"2026-08-15T14:33:51.752147Z","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-15T14:33:52.218257Z","title":"Mathematical Programming , volume=","venue":null,"work_id":"c1528e35-d342-4c79-a70e-fc17ff9fffb0","year":2024},"citing_paper":{"arxiv_id":"2608.10418","last_updated":"2026-08-11T03:06:59Z","snapshot_observed_at":"2026-08-16T11:43:52.602813Z","submitted_at":"2026-08-11T03:06:59Z","title":"A lower bound for stepsize-based acceleration of gradient descent","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-15T14:33:51.756088Z"},"links":{"citing_paper":"/paper/2608.10418"},"observation_digest":"sha256:a0d0fb10932d3694300e56240a0d7f24527de4e81569bdb4a4633601c7eeec5b","observation_id":"44231f8e-6787-46b1-9c7d-4b406e32f23a","resolution":{"observed_at":"2026-08-15T14:33:52.221936Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.20773","last_updated":"2025-07-28T12:35:46Z","snapshot_observed_at":"2026-08-17T08:54:00.656326Z","submitted_at":"2025-07-28T12:35:46Z","title":"Numerical Design of Optimized First-Order Algorithms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.20773","snapshot_observed_at":"2026-08-15T14:33:51.760126Z","title":"arXiv preprint arXiv:2507.20773 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.10418","last_updated":"2026-08-11T03:06:59Z","snapshot_observed_at":"2026-08-16T11:43:52.602813Z","submitted_at":"2026-08-11T03:06:59Z","title":"A lower bound for stepsize-based acceleration of gradient descent","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-15T14:33:51.760126Z"},"links":{"cited_paper":"/paper/2507.20773","citing_paper":"/paper/2608.10418"},"observation_digest":"sha256:7c41259b9200fc1af190a3c54334732707aa14458d5837722e7840d76ee8f445","observation_id":"cf5500cd-c9c8-459b-9b79-a932ba312779","resolution":{"observed_at":"2026-08-15T14:33:51.760126Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.04427","last_updated":"2025-03-26T17:42:07Z","snapshot_observed_at":"2026-08-15T17:59:34.290206Z","submitted_at":"2024-12-05T18:51:26Z","title":"A Proof of the Exact Convergence Rate of Gradient Descent","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.04427","snapshot_observed_at":"2026-08-15T14:33:51.764313Z","title":"arXiv preprint arXiv:2412.04427 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.10418","last_updated":"2026-08-11T03:06:59Z","snapshot_observed_at":"2026-08-16T11:43:52.602813Z","submitted_at":"2026-08-11T03:06:59Z","title":"A lower bound for stepsize-based acceleration of gradient descent","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-15T14:33:51.764313Z"},"links":{"cited_paper":"/paper/2412.04427","citing_paper":"/paper/2608.10418"},"observation_digest":"sha256:5c4f0e60928e26c030b8c51033164595a1652e3335e6469aa5fe31bd7bb17ccb","observation_id":"30e41a81-18a1-492b-b4da-9efabdd2ddd0","resolution":{"observed_at":"2026-08-15T14:33:51.764313Z","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-15T14:33:52.207790Z","title":"Mathematical Programming , pages=","venue":null,"work_id":"22e05d96-253b-4c08-a9eb-2461adc57615","year":2026},"citing_paper":{"arxiv_id":"2608.10418","last_updated":"2026-08-11T03:06:59Z","snapshot_observed_at":"2026-08-16T11:43:52.602813Z","submitted_at":"2026-08-11T03:06:59Z","title":"A lower bound for stepsize-based acceleration of gradient descent","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-15T14:33:51.768447Z"},"links":{"citing_paper":"/paper/2608.10418"},"observation_digest":"sha256:82bb896ca83cda2b1f4aa7534bb4eb61e8b3c687ec8f4325ea878065e7536119","observation_id":"bea637a7-cabb-48cc-97d6-29ddec055a50","resolution":{"observed_at":"2026-08-15T14:33:52.211440Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T14:33:52.197642Z","title":"Optimization Letters , volume=","venue":null,"work_id":"63d95153-0604-4239-9574-8f59fd9bf82a","year":2022},"citing_paper":{"arxiv_id":"2608.10418","last_updated":"2026-08-11T03:06:59Z","snapshot_observed_at":"2026-08-16T11:43:52.602813Z","submitted_at":"2026-08-11T03:06:59Z","title":"A lower bound for stepsize-based acceleration of gradient descent","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-15T14:33:51.772130Z"},"links":{"citing_paper":"/paper/2608.10418"},"observation_digest":"sha256:e026eea7380ab778d62adff82107f0a8cd8b80be81a2de38a10dc9e0464cb6a0","observation_id":"990eedf2-8c6c-43a7-b84a-12b838645c63","resolution":{"observed_at":"2026-08-15T14:33:52.201350Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T14:33:52.187719Z","title":"Journal of the ACM , volume=","venue":null,"work_id":"6b7b500a-b94f-47dc-95de-777ad19af753","year":2025},"citing_paper":{"arxiv_id":"2608.10418","last_updated":"2026-08-11T03:06:59Z","snapshot_observed_at":"2026-08-16T11:43:52.602813Z","submitted_at":"2026-08-11T03:06:59Z","title":"A lower bound for stepsize-based acceleration of gradient descent","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-15T14:33:51.775898Z"},"links":{"citing_paper":"/paper/2608.10418"},"observation_digest":"sha256:6da8ae83fae6d3f3ca6df800f039aed11c9895972d2c74f0980edcbbb9b4ce93","observation_id":"b7bb51a7-4f54-4c5e-b439-ab95f11bcd8f","resolution":{"observed_at":"2026-08-15T14:33:52.191236Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T14:33:52.177398Z","title":"Mathematical Programming , volume=","venue":null,"work_id":"dd06cf37-918c-4ef3-a838-4754c8137c34","year":2025},"citing_paper":{"arxiv_id":"2608.10418","last_updated":"2026-08-11T03:06:59Z","snapshot_observed_at":"2026-08-16T11:43:52.602813Z","submitted_at":"2026-08-11T03:06:59Z","title":"A lower bound for stepsize-based acceleration of gradient descent","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-15T14:33:51.780012Z"},"links":{"citing_paper":"/paper/2608.10418"},"observation_digest":"sha256:2db90656e2bce02274e528143cd3f18c25d905e94fe7c8c104f92e8ebe079909","observation_id":"5799e353-e900-4d66-a1bc-4326ecb9576b","resolution":{"observed_at":"2026-08-15T14:33:52.180974Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T14:33:52.167049Z","title":"SIAM Journal on Optimization , volume=","venue":null,"work_id":"68b9de76-e516-478f-b3e4-35e3b6d09006","year":2024},"citing_paper":{"arxiv_id":"2608.10418","last_updated":"2026-08-11T03:06:59Z","snapshot_observed_at":"2026-08-16T11:43:52.602813Z","submitted_at":"2026-08-11T03:06:59Z","title":"A lower bound for stepsize-based acceleration of gradient descent","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-15T14:33:51.783784Z"},"links":{"citing_paper":"/paper/2608.10418"},"observation_digest":"sha256:e6474bd322ad17c2d5b1680331a4fd6614ce8efbaec5af62ff4f878fc4a88415","observation_id":"1ceacdac-c31d-4d61-981e-d7f20791d336","resolution":{"observed_at":"2026-08-15T14:33:52.170647Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T14:33:52.157248Z","title":", author=","venue":null,"work_id":"e23c0116-45cd-434c-8346-85d689f3cc50","year":null},"citing_paper":{"arxiv_id":"2608.10418","last_updated":"2026-08-11T03:06:59Z","snapshot_observed_at":"2026-08-16T11:43:52.602813Z","submitted_at":"2026-08-11T03:06:59Z","title":"A lower bound for stepsize-based acceleration of gradient descent","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-15T14:33:51.787850Z"},"links":{"citing_paper":"/paper/2608.10418"},"observation_digest":"sha256:46e15d2b5df24c4335aaff767ae5d203ef51346628af9135b1f5d6e97ac69555","observation_id":"2f0a2337-5ac4-4488-97b3-b49fd7d6961a","resolution":{"observed_at":"2026-08-15T14:33:52.160938Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T14:33:52.147152Z","title":"Journal of Mathematics and Physics , volume=","venue":null,"work_id":"6bf93252-8120-4049-82b8-885e09d900e4","year":1953},"citing_paper":{"arxiv_id":"2608.10418","last_updated":"2026-08-11T03:06:59Z","snapshot_observed_at":"2026-08-16T11:43:52.602813Z","submitted_at":"2026-08-11T03:06:59Z","title":"A lower bound for stepsize-based acceleration of gradient descent","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-15T14:33:51.791467Z"},"links":{"citing_paper":"/paper/2608.10418"},"observation_digest":"sha256:cb8a6707ba9d79d0ea4463b48bbfde41fb3d89958d9599f3a521a1061dd19bcd","observation_id":"87285be0-79d0-4acb-ae30-eabf9d1eedc2","resolution":{"observed_at":"2026-08-15T14:33:52.150734Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T14:33:52.136691Z","title":"International Conference on Machine Learning , pages=","venue":null,"work_id":"53f52845-6e4c-4228-8580-48318fe471a9","year":null},"citing_paper":{"arxiv_id":"2608.10418","last_updated":"2026-08-11T03:06:59Z","snapshot_observed_at":"2026-08-16T11:43:52.602813Z","submitted_at":"2026-08-11T03:06:59Z","title":"A lower bound for stepsize-based acceleration of gradient descent","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-15T14:33:51.795052Z"},"links":{"citing_paper":"/paper/2608.10418"},"observation_digest":"sha256:9fdb77451ca063a979ae94418eb22b7a860aecf274b3b46a05722b77ee2e7620","observation_id":"b16286b9-fedb-4c48-bd5c-83c8fea6fcc0","resolution":{"observed_at":"2026-08-15T14:33:52.140133Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T14:33:51.798822Z","title":"arXiv preprint arXiv:2410.12395 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.10418","last_updated":"2026-08-11T03:06:59Z","snapshot_observed_at":"2026-08-16T11:43:52.602813Z","submitted_at":"2026-08-11T03:06:59Z","title":"A lower bound for stepsize-based acceleration of gradient descent","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-15T14:33:51.798822Z"},"links":{"citing_paper":"/paper/2608.10418"},"observation_digest":"sha256:a7c6f4970637800f8ec089d8aced5f20889e442b271c317356ec15ae3819f092","observation_id":"58f78782-f2a9-4579-80ee-1bcdb95a9ef0","resolution":{"observed_at":"2026-08-15T14:33:51.798822Z","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-15T14:33:52.126180Z","title":"Mathematics of Operations Research , year=","venue":null,"work_id":"7559ff53-da56-4df1-aeb8-fbf1664a6f24","year":null},"citing_paper":{"arxiv_id":"2608.10418","last_updated":"2026-08-11T03:06:59Z","snapshot_observed_at":"2026-08-16T11:43:52.602813Z","submitted_at":"2026-08-11T03:06:59Z","title":"A lower bound for stepsize-based acceleration of gradient descent","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-15T14:33:51.802342Z"},"links":{"citing_paper":"/paper/2608.10418"},"observation_digest":"sha256:397ef6059b4c000d2a7d7cbc78a7765af6bf2d230f6fb9276c0fd929afcaca80","observation_id":"6a68d4ed-2865-4dd3-b3b4-0300b9dd0ba3","resolution":{"observed_at":"2026-08-15T14:33:52.129709Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T14:33:52.116186Z","title":"Conference on Learning Theory , pages=","venue":null,"work_id":"4fb7852d-e0b5-407b-8b7d-d7784d41bce6","year":null},"citing_paper":{"arxiv_id":"2608.10418","last_updated":"2026-08-11T03:06:59Z","snapshot_observed_at":"2026-08-16T11:43:52.602813Z","submitted_at":"2026-08-11T03:06:59Z","title":"A lower bound for stepsize-based acceleration of gradient descent","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-15T14:33:51.805685Z"},"links":{"citing_paper":"/paper/2608.10418"},"observation_digest":"sha256:37b89def9529205f05d65f8ec7a72a51a0f0ffb3420c5b8b7a1eebf4bf33db16","observation_id":"387833d1-a3fd-4cea-967e-5b35ffab4829","resolution":{"observed_at":"2026-08-15T14:33:52.119552Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T14:33:52.105644Z","title":"Conference on Learning Theory , pages=","venue":null,"work_id":"1d0be9d4-4578-471d-8d03-300e62ebf391","year":null},"citing_paper":{"arxiv_id":"2608.10418","last_updated":"2026-08-11T03:06:59Z","snapshot_observed_at":"2026-08-16T11:43:52.602813Z","submitted_at":"2026-08-11T03:06:59Z","title":"A lower bound for stepsize-based acceleration of gradient descent","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-15T14:33:51.809279Z"},"links":{"citing_paper":"/paper/2608.10418"},"observation_digest":"sha256:f5b41a79ffdb17f6b1cf4027ac1101730055263316d1d87d893befa2fe62671b","observation_id":"8a10fbeb-b90e-4fa9-94a1-0303a6fbbb95","resolution":{"observed_at":"2026-08-15T14:33:52.109444Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T14:33:52.094994Z","title":"Mathematics of Operations Research , year=","venue":null,"work_id":"19fc3565-f1d4-44e4-91e1-b9b0f2239df4","year":null},"citing_paper":{"arxiv_id":"2608.10418","last_updated":"2026-08-11T03:06:59Z","snapshot_observed_at":"2026-08-16T11:43:52.602813Z","submitted_at":"2026-08-11T03:06:59Z","title":"A lower bound for stepsize-based acceleration of gradient descent","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-15T14:33:51.813045Z"},"links":{"citing_paper":"/paper/2608.10418"},"observation_digest":"sha256:97067f964cdf563196c98d0493e8720e6b97523e32deabd4dba75c00fb7bd082","observation_id":"c0c399cc-9c8f-47ca-b6a3-7bf68aa4dfa6","resolution":{"observed_at":"2026-08-15T14:33:52.098361Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T14:33:52.084690Z","title":"Conference on Learning Theory , pages=","venue":null,"work_id":"110e7fb8-9725-4de4-9b85-c084af51631f","year":null},"citing_paper":{"arxiv_id":"2608.10418","last_updated":"2026-08-11T03:06:59Z","snapshot_observed_at":"2026-08-16T11:43:52.602813Z","submitted_at":"2026-08-11T03:06:59Z","title":"A lower bound for stepsize-based acceleration of gradient descent","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-15T14:33:51.816627Z"},"links":{"citing_paper":"/paper/2608.10418"},"observation_digest":"sha256:a1bcb721597f0e4df6a5b136a6101712bc97e0ab02e4a3f633aae4979c27be9e","observation_id":"305166cc-f566-45ee-8888-b7bb5dda1ffe","resolution":{"observed_at":"2026-08-15T14:33:52.088355Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T14:33:52.073129Z","title":"Conference on Learning Theory , pages=","venue":null,"work_id":"599f1f87-d7ca-496d-b202-34197cf24ca4","year":null},"citing_paper":{"arxiv_id":"2608.10418","last_updated":"2026-08-11T03:06:59Z","snapshot_observed_at":"2026-08-16T11:43:52.602813Z","submitted_at":"2026-08-11T03:06:59Z","title":"A lower bound for stepsize-based acceleration of gradient descent","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-15T14:33:51.820320Z"},"links":{"citing_paper":"/paper/2608.10418"},"observation_digest":"sha256:3708f1f8a78727bfa8fb516a12a967b9901595a5d5de009d18809f489ba4319d","observation_id":"21b58ce0-1d64-46fe-806e-92005380b173","resolution":{"observed_at":"2026-08-15T14:33:52.077653Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2607.02053","last_updated":"2026-07-02T11:29:02Z","snapshot_observed_at":"2026-08-16T12:38:42.522745Z","submitted_at":"2026-07-02T11:29:02Z","title":"Lower Bounds for Anytime Acceleration of Gradient Descent","version":1},"cited_work":{"arxiv_id":"2607.02053","doi":null,"metadata_source":"pith","pith_arxiv_id":"2607.02053","snapshot_observed_at":"2026-08-15T14:33:51.888279Z","title":"Lower Bounds for Anytime Acceleration of Gradient Descent","venue":"math.OC","work_id":"fe54bd48-1002-4e93-b801-2a764d8403ba","year":2026},"citing_paper":{"arxiv_id":"2608.10418","last_updated":"2026-08-11T03:06:59Z","snapshot_observed_at":"2026-08-16T11:43:52.602813Z","submitted_at":"2026-08-11T03:06:59Z","title":"A lower bound for stepsize-based acceleration of gradient descent","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-15T14:33:51.824000Z"},"links":{"cited_paper":"/paper/2607.02053","citing_paper":"/paper/2608.10418"},"observation_digest":"sha256:063181d0bc8d662ec21a6a975ed85ff0ffa0df2739ff6360b6c98ff24526b352","observation_id":"85490f1f-4daa-4d7a-bac6-460a917ab567","resolution":{"observed_at":"2026-08-15T14:33:51.894171Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T14:33:52.062777Z","title":"Journal of machine learning research , volume=","venue":null,"work_id":"7e115739-fb97-4036-a3ee-afa5dd8109e4","year":null},"citing_paper":{"arxiv_id":"2608.10418","last_updated":"2026-08-11T03:06:59Z","snapshot_observed_at":"2026-08-16T11:43:52.602813Z","submitted_at":"2026-08-11T03:06:59Z","title":"A lower bound for stepsize-based acceleration of gradient descent","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-15T14:33:51.827928Z"},"links":{"citing_paper":"/paper/2608.10418"},"observation_digest":"sha256:a39b122210d1540cc9924630a67d9000c360de7fc6ef0fa8c5960b873628e6e2","observation_id":"82d23423-7383-494b-93f6-97b81c05834f","resolution":{"observed_at":"2026-08-15T14:33:52.066111Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T14:33:52.052723Z","title":"International Conference on Machine Learning , pages=","venue":null,"work_id":"b2d3be81-69e0-4fca-9979-5565b228a378","year":null},"citing_paper":{"arxiv_id":"2608.10418","last_updated":"2026-08-11T03:06:59Z","snapshot_observed_at":"2026-08-16T11:43:52.602813Z","submitted_at":"2026-08-11T03:06:59Z","title":"A lower bound for stepsize-based acceleration of gradient descent","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-15T14:33:51.831415Z"},"links":{"citing_paper":"/paper/2608.10418"},"observation_digest":"sha256:71f9c2020a5c486e813859f30f675ceb7e3be5edfcdddb2215c88549ba9c78bc","observation_id":"1f121b74-f162-469a-87fd-c1e10f1b8556","resolution":{"observed_at":"2026-08-15T14:33:52.056181Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.05790","last_updated":"2026-05-29T19:51:57Z","snapshot_observed_at":"2026-08-16T11:42:07.866800Z","submitted_at":"2024-12-08T03:01:34Z","title":"Acceleration by Random Stepsizes: Hedging, Equalization, and the Arcsine Stepsize Schedule","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.05790","snapshot_observed_at":"2026-08-15T14:33:51.834831Z","title":"arXiv preprint arXiv:2412.05790 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.10418","last_updated":"2026-08-11T03:06:59Z","snapshot_observed_at":"2026-08-16T11:43:52.602813Z","submitted_at":"2026-08-11T03:06:59Z","title":"A lower bound for stepsize-based acceleration of gradient descent","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-15T14:33:51.834831Z"},"links":{"cited_paper":"/paper/2412.05790","citing_paper":"/paper/2608.10418"},"observation_digest":"sha256:6f3bbae4a8f1ae4ab26e9ae921ca00d5bda6c485595c4cba9fde5c697d9ed0e2","observation_id":"f4691aee-ec13-4003-8722-1cbc12379a4b","resolution":{"observed_at":"2026-08-15T14:33:51.834831Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.01423","last_updated":"2026-06-28T16:36:22Z","snapshot_observed_at":"2026-08-16T12:37:58.546693Z","submitted_at":"2025-05-02T17:59:46Z","title":"Negative Stepsizes Make Gradient-Descent-Ascent Converge","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.01423","snapshot_observed_at":"2026-08-15T14:33:51.838528Z","title":"arXiv preprint arXiv:2505.01423 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.10418","last_updated":"2026-08-11T03:06:59Z","snapshot_observed_at":"2026-08-16T11:43:52.602813Z","submitted_at":"2026-08-11T03:06:59Z","title":"A lower bound for stepsize-based acceleration of gradient descent","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-15T14:33:51.838528Z"},"links":{"cited_paper":"/paper/2505.01423","citing_paper":"/paper/2608.10418"},"observation_digest":"sha256:cf331bd251ae96d7f28ef8f75cc5192ab0843606847a4d7e3f586322c0ff8a52","observation_id":"293b7d84-1ade-4659-bb7a-ea24c303a1a3","resolution":{"observed_at":"2026-08-15T14:33:51.838528Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2608.10418","last_updated":"2026-08-11T03:06:59Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-16T11:43:52.602813Z","submitted_at":"2026-08-11T03:06:59Z","title":"A lower bound for stepsize-based acceleration of gradient descent"},"reference_resolution":{"displayed":33,"state_counts":{"malformed_identifier":0,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":9,"verified_exact":0,"verified_fuzzy":22},"total_outbound_references":33},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 33 of 33 outbound references and 0 inbound Pith citation observations for arXiv:2608.10418."}