{"as_of":"2026-08-10T05:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b1585c00740e946d7a56a18478b10c6e225328021d2898ddc24860c79a3b6e7e","coverage":[{"denominator":41,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":41,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T17:59:08.441534Z","state":"measured"},{"denominator":44,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":44,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T22:20:05.462048Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-21T10:30:00.360992Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2507.09823","last_updated":"2025-08-29T15:15:31Z","snapshot_observed_at":"2026-08-09T11:05:20.331803Z","submitted_at":"2025-07-13T23:07:45Z","title":"Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.09823","snapshot_observed_at":"2026-08-03T22:20:05.462048Z","title":"and Kovalev, D","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.11466","last_updated":"2026-06-22T13:35:19Z","snapshot_observed_at":"2026-08-07T16:29:00.257881Z","submitted_at":"2025-11-14T16:38:15Z","title":"Non-Euclidean SGD for Structured Optimization: Unified Analysis and Improved Rates","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-03T22:20:05.462048Z"},"links":{"cited_paper":"/paper/2507.09823","citing_paper":"/paper/2511.11466"},"observation_digest":"sha256:da674ce70ca74bf29409b3eb4c331bb17249b70ccb4d4182d362444f4bfb3ccf","observation_id":"09d11dfc-923e-4bc6-8bcf-52fccc01b5dc","resolution":{"observed_at":"2026-08-03T22:20:05.462048Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.09823","last_updated":"2025-08-29T15:15:31Z","snapshot_observed_at":"2026-08-09T11:05:20.331803Z","submitted_at":"2025-07-13T23:07:45Z","title":"Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization","version":2},"cited_work":{"arxiv_id":"2507.09823","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2507.09823","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Nesterov finds graal: Optimal and adap- tive gradient method for convex optimization","venue":null,"work_id":"42dfb34b-5b8e-48fa-be0b-7a522e8b3e6d","year":2025},"citing_paper":{"arxiv_id":"2603.23492","last_updated":"2026-05-16T02:51:45Z","snapshot_observed_at":"2026-07-06T22:50:23.931381Z","submitted_at":"2026-03-24T17:57:36Z","title":"Universal and Parameter-free Gradient Sliding for Composite Optimization","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-21T10:26:12.965171Z"},"links":{"cited_paper":"/paper/2507.09823","citing_paper":"/paper/2603.23492"},"observation_digest":"sha256:f93bbadf696ca84df080a7e5aadb5c080abd77a3a5b99d260f0f9b987ded693e","observation_id":"b2683b70-c47b-486e-b612-f428ad9effe3","resolution":{"observed_at":"2026-05-21T10:30:00.363440Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.09823","last_updated":"2025-08-29T15:15:31Z","snapshot_observed_at":"2026-08-09T11:05:20.331803Z","submitted_at":"2025-07-13T23:07:45Z","title":"Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.09823","snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"Nesterov finds graal: Optimal and adaptive gradient method for convex optimization.arXiv preprint arXiv:2507.09823, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11878","last_updated":"2026-07-13T17:57:45Z","snapshot_observed_at":"2026-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"cited_paper":"/paper/2507.09823","citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:e3e81776dddca29f9f1c39c07c763061ed92691f0fe3b2e50e4b3cae93b27620","observation_id":"beff8048-984b-4cdb-adc0-e7124c25b11e","resolution":{"observed_at":"2026-07-14T02:28:43.704810Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2507.09823/citation-record","integrity":"/paper/2507.09823/integrity","json":"/paper/2507.09823/citation-record.json","paper":"/paper/2507.09823"},"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-06T17:59:15.382838Z","title":null,"venue":null,"work_id":"7ed1a8ce-bec7-452f-8d52-cc7ddfcc9b3f","year":2023},"citing_paper":{"arxiv_id":"2507.09823","last_updated":"2025-08-29T15:15:31Z","snapshot_observed_at":"2026-08-09T11:05:20.331803Z","submitted_at":"2025-07-13T23:07:45Z","title":"Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-06T17:59:05.196143Z"},"links":{"citing_paper":"/paper/2507.09823"},"observation_digest":"sha256:b9a8be4385edb06fe1ede4613005f760aecc8a81f1eef48a8c61701e55108160","observation_id":"044c71cc-3a61-4d6d-8d08-bbbf4a5d29a9","resolution":{"observed_at":"2026-08-06T17:59:15.452095Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T17:59:15.229226Z","title":null,"venue":null,"work_id":"ebafb5fd-f6cc-4421-a52a-dbff865b3b8b","year":1966},"citing_paper":{"arxiv_id":"2507.09823","last_updated":"2025-08-29T15:15:31Z","snapshot_observed_at":"2026-08-09T11:05:20.331803Z","submitted_at":"2025-07-13T23:07:45Z","title":"Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-06T17:59:05.280898Z"},"links":{"citing_paper":"/paper/2507.09823"},"observation_digest":"sha256:f1dc9e0209cc71a17f5e008319ea26d707fc21bc11aff8d337dd73ea08bc47d0","observation_id":"1a0db8a3-1de6-48e3-bd1c-067fc7a63dff","resolution":{"observed_at":"2026-08-06T17:59:15.297892Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T17:59:15.076321Z","title":"and Borwein, J","venue":null,"work_id":"1c2d596a-bf47-4001-b905-d64e05703303","year":1988},"citing_paper":{"arxiv_id":"2507.09823","last_updated":"2025-08-29T15:15:31Z","snapshot_observed_at":"2026-08-09T11:05:20.331803Z","submitted_at":"2025-07-13T23:07:45Z","title":"Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-06T17:59:05.367724Z"},"links":{"citing_paper":"/paper/2507.09823"},"observation_digest":"sha256:32bbe2109ca2b474fe5fd73c2d0702e266a234e9d98b5645341164eea6a167f8","observation_id":"19e7f568-dec2-4313-b79c-bfc5eeb2241f","resolution":{"observed_at":"2026-08-06T17:59:15.152202Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T17:59:14.957020Z","title":null,"venue":null,"work_id":"460964f2-343d-46e9-be8f-d4571b9a786d","year":2019},"citing_paper":{"arxiv_id":"2507.09823","last_updated":"2025-08-29T15:15:31Z","snapshot_observed_at":"2026-08-09T11:05:20.331803Z","submitted_at":"2025-07-13T23:07:45Z","title":"Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-06T17:59:05.441038Z"},"links":{"citing_paper":"/paper/2507.09823"},"observation_digest":"sha256:1a922fb36bd9c069c5cc6e208294c7bbb1135e4e4b00e3f163e7e48bae900d8d","observation_id":"c9a3aebf-c635-4fe0-bceb-de1e4d14c66e","resolution":{"observed_at":"2026-08-06T17:59:15.005698Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T17:59:14.791170Z","title":null,"venue":null,"work_id":"c7e3d964-d7cf-4e62-9e96-8a9766a64c39","year":2019},"citing_paper":{"arxiv_id":"2507.09823","last_updated":"2025-08-29T15:15:31Z","snapshot_observed_at":"2026-08-09T11:05:20.331803Z","submitted_at":"2025-07-13T23:07:45Z","title":"Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-06T17:59:05.501273Z"},"links":{"citing_paper":"/paper/2507.09823"},"observation_digest":"sha256:601074d7fa5226e7946ac9d8ef903f6d7ef9ebec0465e433389c5faa4034f180","observation_id":"6efaade4-aff6-41dd-8d56-0bd6d6b15f81","resolution":{"observed_at":"2026-08-06T17:59:14.876844Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T17:59:05.573818Z","title":"and Orabona, F","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.09823","last_updated":"2025-08-29T15:15:31Z","snapshot_observed_at":"2026-08-09T11:05:20.331803Z","submitted_at":"2025-07-13T23:07:45Z","title":"Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T17:59:05.573818Z"},"links":{"citing_paper":"/paper/2507.09823"},"observation_digest":"sha256:433524a19151f2cf2804241b79114eaa5195f079c7080d597e8a3de586d062a2","observation_id":"3925a9a6-2eae-4dfb-8e61-972fb5b3054b","resolution":{"observed_at":"2026-08-06T17:59:05.573818Z","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-06T17:59:14.639949Z","title":"and Liao, L.-Z","venue":null,"work_id":"fc1fa8eb-d533-4550-8495-e6dd1da3f612","year":2002},"citing_paper":{"arxiv_id":"2507.09823","last_updated":"2025-08-29T15:15:31Z","snapshot_observed_at":"2026-08-09T11:05:20.331803Z","submitted_at":"2025-07-13T23:07:45Z","title":"Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-06T17:59:05.680858Z"},"links":{"citing_paper":"/paper/2507.09823"},"observation_digest":"sha256:13c5cce8509c081884a8e8bcbe5d5b6006a18cadd2a77c2be71321b47651dcc3","observation_id":"ffa4d961-2441-4238-8b8b-d98db76e63f8","resolution":{"observed_at":"2026-08-06T17:59:14.726776Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1711.00141","last_updated":"2018-02-13T16:33:55Z","snapshot_observed_at":"2026-07-06T06:07:09.962753Z","submitted_at":"2017-10-31T23:09:08Z","title":"Training GANs with Optimism","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.00141","snapshot_observed_at":"2026-08-06T17:59:05.781404Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.09823","last_updated":"2025-08-29T15:15:31Z","snapshot_observed_at":"2026-08-09T11:05:20.331803Z","submitted_at":"2025-07-13T23:07:45Z","title":"Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-06T17:59:05.781404Z"},"links":{"cited_paper":"/paper/1711.00141","citing_paper":"/paper/2507.09823"},"observation_digest":"sha256:ad55ffe6ba5966ecef33e2278f7faa134b5609465babcf79915ac13946861686","observation_id":"5c376bc4-a8c3-4972-8f88-fcfe828d2597","resolution":{"observed_at":"2026-08-06T17:59:05.781404Z","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-06T17:59:14.352491Z","title":"and Mishchenko, K","venue":null,"work_id":"ebbafe25-c13b-499a-9a6f-fa0348f17ecd","year":2023},"citing_paper":{"arxiv_id":"2507.09823","last_updated":"2025-08-29T15:15:31Z","snapshot_observed_at":"2026-08-09T11:05:20.331803Z","submitted_at":"2025-07-13T23:07:45Z","title":"Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-06T17:59:05.876861Z"},"links":{"citing_paper":"/paper/2507.09823"},"observation_digest":"sha256:502f084572a5a1cbaf0a0cca1b2852f28a4c2143b285c80b91d1cb73ae456953","observation_id":"d8bbfa9b-4596-49a9-a71a-a17516db48a5","resolution":{"observed_at":"2026-08-06T17:59:14.486915Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2206.06900","last_updated":"2022-06-14T14:55:27Z","snapshot_observed_at":"2026-07-06T13:20:44.327329Z","submitted_at":"2022-06-14T14:55:27Z","title":"Grad-GradaGrad? A Non-Monotone Adaptive Stochastic Gradient Method","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.06900","snapshot_observed_at":"2026-08-06T17:59:05.969035Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.09823","last_updated":"2025-08-29T15:15:31Z","snapshot_observed_at":"2026-08-09T11:05:20.331803Z","submitted_at":"2025-07-13T23:07:45Z","title":"Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-06T17:59:05.969035Z"},"links":{"cited_paper":"/paper/2206.06900","citing_paper":"/paper/2507.09823"},"observation_digest":"sha256:62d2effe38d23b40a9640e6cdb834fcbbf5cbf89167014cf6b4e239a57747fb3","observation_id":"b02765e2-0a67-433b-861f-fa9c647ec415","resolution":{"observed_at":"2026-08-06T17:59:05.969035Z","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-06T17:59:14.129428Z","title":"and Teboulle, M","venue":null,"work_id":"f0584b4a-0266-4735-af6d-fc6d2a4dfbfa","year":2014},"citing_paper":{"arxiv_id":"2507.09823","last_updated":"2025-08-29T15:15:31Z","snapshot_observed_at":"2026-08-09T11:05:20.331803Z","submitted_at":"2025-07-13T23:07:45Z","title":"Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-06T17:59:06.039096Z"},"links":{"citing_paper":"/paper/2507.09823"},"observation_digest":"sha256:447e1e55de3afde55302c6f9b67d8cdb5c07229780f5c31bdab5627b3533475d","observation_id":"d471d597-6a42-49b3-beb2-bac6db1152a2","resolution":{"observed_at":"2026-08-06T17:59:14.215745Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T17:59:13.936577Z","title":null,"venue":null,"work_id":"858d5d43-68ca-4d19-bef8-48959463576f","year":2011},"citing_paper":{"arxiv_id":"2507.09823","last_updated":"2025-08-29T15:15:31Z","snapshot_observed_at":"2026-08-09T11:05:20.331803Z","submitted_at":"2025-07-13T23:07:45Z","title":"Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-06T17:59:06.088540Z"},"links":{"citing_paper":"/paper/2507.09823"},"observation_digest":"sha256:c55d6597fcac08f13830fe8ff089131f0b1e893e142f805373ad97629b24c4ce","observation_id":"55ba1440-7c3c-46b5-a3de-a1dc51ed830b","resolution":{"observed_at":"2026-08-06T17:59:14.030878Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1604.05275","last_updated":"2017-11-27T14:39:00Z","snapshot_observed_at":"2026-08-06T05:08:56.949625Z","submitted_at":"2016-04-18T18:43:36Z","title":"Universal fast gradient method for stochastic composit optimization problems","version":16},"cited_work":{"arxiv_id":"1604.05275","doi":null,"metadata_source":"pith","pith_arxiv_id":"1604.05275","snapshot_observed_at":"2026-08-06T17:59:08.623179Z","title":"Universal fast gradient method for stochastic composit optimization problems","venue":"math.OC","work_id":"4fc17ec6-8985-4814-b6eb-a3cee2bb9195","year":2016},"citing_paper":{"arxiv_id":"2507.09823","last_updated":"2025-08-29T15:15:31Z","snapshot_observed_at":"2026-08-09T11:05:20.331803Z","submitted_at":"2025-07-13T23:07:45Z","title":"Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-06T17:59:06.173684Z"},"links":{"cited_paper":"/paper/1604.05275","citing_paper":"/paper/2507.09823"},"observation_digest":"sha256:76ca67e1dc8da3f43656a1c230bba3f79e897668dd98be9ff50663366bc71af2","observation_id":"2fd90a81-0e51-439d-bbdb-09633f2b06e5","resolution":{"observed_at":"2026-08-06T17:59:08.683842Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T17:59:13.760395Z","title":null,"venue":null,"work_id":"e4fc5079-ff43-47be-9968-be6752514608","year":1962},"citing_paper":{"arxiv_id":"2507.09823","last_updated":"2025-08-29T15:15:31Z","snapshot_observed_at":"2026-08-09T11:05:20.331803Z","submitted_at":"2025-07-13T23:07:45Z","title":"Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-06T17:59:06.246998Z"},"links":{"citing_paper":"/paper/2507.09823"},"observation_digest":"sha256:5bd4f9b05d9d70c298fdb7adfc038d50ad576484f99968a25005f580401d7fc4","observation_id":"0cddea46-3462-4aa0-9f1d-781f353d6487","resolution":{"observed_at":"2026-08-06T17:59:13.879259Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.00313","last_updated":"2022-08-02T17:48:25Z","snapshot_observed_at":"2026-08-10T00:59:12.777914Z","submitted_at":"2019-05-01T13:47:40Z","title":"Revisiting the Polyak step size","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.00313","snapshot_observed_at":"2026-08-06T17:59:06.331920Z","title":"and Kakade, S","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.09823","last_updated":"2025-08-29T15:15:31Z","snapshot_observed_at":"2026-08-09T11:05:20.331803Z","submitted_at":"2025-07-13T23:07:45Z","title":"Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-06T17:59:06.331920Z"},"links":{"cited_paper":"/paper/1905.00313","citing_paper":"/paper/2507.09823"},"observation_digest":"sha256:eb7f8c49d315bc3e29825ae9aef5e32b8425f9e596db8aa12b3590e052f2bcca","observation_id":"bbd06d20-371f-4e35-8d39-f5a4d6d8f595","resolution":{"observed_at":"2026-08-06T17:59:06.331920Z","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-06T17:59:06.402624Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.09823","last_updated":"2025-08-29T15:15:31Z","snapshot_observed_at":"2026-08-09T11:05:20.331803Z","submitted_at":"2025-07-13T23:07:45Z","title":"Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-06T17:59:06.402624Z"},"links":{"citing_paper":"/paper/2507.09823"},"observation_digest":"sha256:2996c5f08687e6dce96fb1009042bcce477fe7a7439687cea5933bf20a38017d","observation_id":"1bbecc25-87ad-4bd0-9230-f36220adc923","resolution":{"observed_at":"2026-08-06T17:59:06.402624Z","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-06T17:59:13.535270Z","title":"Y., Bach, F., and Cevher, V","venue":null,"work_id":"53cf4530-9d3a-4a76-bd72-15b5f4f100f9","year":2019},"citing_paper":{"arxiv_id":"2507.09823","last_updated":"2025-08-29T15:15:31Z","snapshot_observed_at":"2026-08-09T11:05:20.331803Z","submitted_at":"2025-07-13T23:07:45Z","title":"Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-06T17:59:06.465237Z"},"links":{"citing_paper":"/paper/2507.09823"},"observation_digest":"sha256:f1a53f9dcd6248796caf8148cf2c979e087933e1f7bd2adaa37b531e612ac470","observation_id":"b090e445-d5a3-4a13-b689-640aeeff657f","resolution":{"observed_at":"2026-08-06T17:59:13.633022Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T17:59:13.384266Z","title":null,"venue":null,"work_id":"a595c4c8-8841-44e6-b3db-e1c1c4939456","year":2023},"citing_paper":{"arxiv_id":"2507.09823","last_updated":"2025-08-29T15:15:31Z","snapshot_observed_at":"2026-08-09T11:05:20.331803Z","submitted_at":"2025-07-13T23:07:45Z","title":"Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-06T17:59:06.542919Z"},"links":{"citing_paper":"/paper/2507.09823"},"observation_digest":"sha256:5ef4d9602dc18077b14399966ffb4fe3640fce1dcbb1f1ce0e8eb707edcb6230","observation_id":"68214cc9-cd9c-4f6f-86f5-ab184ba9de51","resolution":{"observed_at":"2026-08-06T17:59:13.445326Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T17:59:13.243272Z","title":null,"venue":null,"work_id":"589815d7-9637-431f-8b0c-f26805bf0982","year":1976},"citing_paper":{"arxiv_id":"2507.09823","last_updated":"2025-08-29T15:15:31Z","snapshot_observed_at":"2026-08-09T11:05:20.331803Z","submitted_at":"2025-07-13T23:07:45Z","title":"Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-06T17:59:06.625472Z"},"links":{"citing_paper":"/paper/2507.09823"},"observation_digest":"sha256:98fda5e5d8abb998be3db9c0d2dea24ff2307b77cf28eea92e8596fa155e2f5e","observation_id":"ae70bb37-29b5-4dae-b62a-9eca1ad615c7","resolution":{"observed_at":"2026-08-06T17:59:13.321314Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.23803","last_updated":"2025-06-30T12:47:10Z","snapshot_observed_at":"2026-08-09T12:25:14.601906Z","submitted_at":"2025-06-30T12:47:10Z","title":"SGD with Adaptive Preconditioning: Unified Analysis and Momentum Acceleration","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.23803","snapshot_observed_at":"2026-08-06T17:59:06.707164Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.09823","last_updated":"2025-08-29T15:15:31Z","snapshot_observed_at":"2026-08-09T11:05:20.331803Z","submitted_at":"2025-07-13T23:07:45Z","title":"Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-06T17:59:06.707164Z"},"links":{"cited_paper":"/paper/2506.23803","citing_paper":"/paper/2507.09823"},"observation_digest":"sha256:83deef0109b728d451bdd305901875de575e4117b9583a9015bd1685960f092b","observation_id":"07235cc9-91c2-4069-b10d-7b69961963f5","resolution":{"observed_at":"2026-08-06T17:59:06.707164Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","snapshot_observed_at":"2026-07-06T19:54:05.139608Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.14601","snapshot_observed_at":"2026-08-06T17:59:06.823782Z","title":"and Borodich, E","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.09823","last_updated":"2025-08-29T15:15:31Z","snapshot_observed_at":"2026-08-09T11:05:20.331803Z","submitted_at":"2025-07-13T23:07:45Z","title":"Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-06T17:59:06.823782Z"},"links":{"cited_paper":"/paper/2411.14601","citing_paper":"/paper/2507.09823"},"observation_digest":"sha256:4b4f8dd17e93a5b3b22e953d823c5044ac005b65338c1575bc385371a13a9392","observation_id":"f9b028b8-6163-4c25-959f-4464acada25d","resolution":{"observed_at":"2026-08-06T17:59:06.823782Z","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-06T17:59:13.077730Z","title":null,"venue":null,"work_id":"be5b434a-96cd-4480-bc28-23b9f5fb70ea","year":2022},"citing_paper":{"arxiv_id":"2507.09823","last_updated":"2025-08-29T15:15:31Z","snapshot_observed_at":"2026-08-09T11:05:20.331803Z","submitted_at":"2025-07-13T23:07:45Z","title":"Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-06T17:59:06.900767Z"},"links":{"citing_paper":"/paper/2507.09823"},"observation_digest":"sha256:87861dc7a896e18f9e088ee794507bef8414b630738a8d1709d637000d81f9c2","observation_id":"09c54d7e-a504-45df-ae67-35141a42d762","resolution":{"observed_at":"2026-08-06T17:59:13.153392Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T17:59:12.815801Z","title":null,"venue":null,"work_id":"5600f333-0cf6-43e0-8dc4-cbc9d5ad0ab6","year":2024},"citing_paper":{"arxiv_id":"2507.09823","last_updated":"2025-08-29T15:15:31Z","snapshot_observed_at":"2026-08-09T11:05:20.331803Z","submitted_at":"2025-07-13T23:07:45Z","title":"Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-06T17:59:06.989147Z"},"links":{"citing_paper":"/paper/2507.09823"},"observation_digest":"sha256:0e5999b052823d8196b492006251dc1a7430561bff350f710e659b1d77550a5e","observation_id":"e1de95b8-eadd-4910-b9f2-2eacfb85e713","resolution":{"observed_at":"2026-08-06T17:59:12.962916Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T17:59:07.100785Z","title":"Y., Yurtsever, A., and Cevher, V","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.09823","last_updated":"2025-08-29T15:15:31Z","snapshot_observed_at":"2026-08-09T11:05:20.331803Z","submitted_at":"2025-07-13T23:07:45Z","title":"Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-06T17:59:07.100785Z"},"links":{"citing_paper":"/paper/2507.09823"},"observation_digest":"sha256:6e67f1ecd286348abadfb834ffc676948caf973f916cbed70a63b27d13cfb68f","observation_id":"7e82e2cd-d841-432e-9282-79973d118361","resolution":{"observed_at":"2026-08-06T17:59:07.100785Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.10082","last_updated":"2024-08-17T03:06:14Z","snapshot_observed_at":"2026-08-09T19:07:35.834810Z","submitted_at":"2023-10-16T05:26:03Z","title":"A simple uniformly optimal method without line search for convex optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.10082","snapshot_observed_at":"2026-08-06T17:59:07.249015Z","title":"and Lan, G","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.09823","last_updated":"2025-08-29T15:15:31Z","snapshot_observed_at":"2026-08-09T11:05:20.331803Z","submitted_at":"2025-07-13T23:07:45Z","title":"Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-06T17:59:07.249015Z"},"links":{"cited_paper":"/paper/2310.10082","citing_paper":"/paper/2507.09823"},"observation_digest":"sha256:dcac6a97f2a8f100ba1f0454c0e80a1b108f4dc669755adce4a46569012b5195","observation_id":"6bfe14ab-f60b-4826-bfc9-c353829fd351","resolution":{"observed_at":"2026-08-06T17:59:07.249015Z","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-06T17:59:12.537142Z","title":"and Orabona, F","venue":null,"work_id":"cb1e1f89-4436-4362-bada-878bc2977e69","year":2019},"citing_paper":{"arxiv_id":"2507.09823","last_updated":"2025-08-29T15:15:31Z","snapshot_observed_at":"2026-08-09T11:05:20.331803Z","submitted_at":"2025-07-13T23:07:45Z","title":"Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-06T17:59:07.386957Z"},"links":{"citing_paper":"/paper/2507.09823"},"observation_digest":"sha256:a06429bc20d63a8000592e18149a5dbe8c7a967e2364e7eac68ca788428ad212","observation_id":"d969ca45-1280-49f0-bfb2-faf0dba2cd95","resolution":{"observed_at":"2026-08-06T17:59:12.687854Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T17:59:12.221064Z","title":null,"venue":null,"work_id":"d5f96aa3-7341-4566-80ef-22214b331297","year":2020},"citing_paper":{"arxiv_id":"2507.09823","last_updated":"2025-08-29T15:15:31Z","snapshot_observed_at":"2026-08-09T11:05:20.331803Z","submitted_at":"2025-07-13T23:07:45Z","title":"Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-06T17:59:07.440911Z"},"links":{"citing_paper":"/paper/2507.09823"},"observation_digest":"sha256:1d788207d325c9123bcea3da0546175f0079f14207d3a013d99a4d3d84e9e5c7","observation_id":"0a7b5ea9-a517-4b25-a8db-f5622747caf9","resolution":{"observed_at":"2026-08-06T17:59:12.394294Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T17:59:11.935738Z","title":"and Mishchenko, K","venue":null,"work_id":"2689c676-3cde-4d41-8e10-ada2512b1979","year":2020},"citing_paper":{"arxiv_id":"2507.09823","last_updated":"2025-08-29T15:15:31Z","snapshot_observed_at":"2026-08-09T11:05:20.331803Z","submitted_at":"2025-07-13T23:07:45Z","title":"Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-06T17:59:07.500335Z"},"links":{"citing_paper":"/paper/2507.09823"},"observation_digest":"sha256:fe6a9f449c7c6ed6cb0fa8bcca5651f625d50b57a7741d515adc5f71c7929bb1","observation_id":"b0f9ed20-c4a7-4a1e-b57c-f2f28bce2681","resolution":{"observed_at":"2026-08-06T17:59:12.054477Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T17:59:11.648782Z","title":"and Tam, M","venue":null,"work_id":"fb529955-99b8-4f59-b5ba-064f3e797eeb","year":2020},"citing_paper":{"arxiv_id":"2507.09823","last_updated":"2025-08-29T15:15:31Z","snapshot_observed_at":"2026-08-09T11:05:20.331803Z","submitted_at":"2025-07-13T23:07:45Z","title":"Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-06T17:59:07.574972Z"},"links":{"citing_paper":"/paper/2507.09823"},"observation_digest":"sha256:1ff914c43c7330cbe3f2968b9fefc71aa38c2d5f126aac07b6608e08485798ba","observation_id":"b516a060-0700-4f86-81f0-571b64b85f5d","resolution":{"observed_at":"2026-08-06T17:59:11.771650Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1002.4908","last_updated":"2010-07-07T19:07:16Z","snapshot_observed_at":"2026-07-06T02:04:37.023313Z","submitted_at":"2010-02-26T01:36:34Z","title":"Adaptive Bound Optimization for Online Convex Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1002.4908","snapshot_observed_at":"2026-08-06T17:59:07.637463Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2507.09823","last_updated":"2025-08-29T15:15:31Z","snapshot_observed_at":"2026-08-09T11:05:20.331803Z","submitted_at":"2025-07-13T23:07:45Z","title":"Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-06T17:59:07.637463Z"},"links":{"cited_paper":"/paper/1002.4908","citing_paper":"/paper/2507.09823"},"observation_digest":"sha256:09dc57944237be132574d0046574cc4f249e5cb111a10870f80dfc0035abdd0f","observation_id":"4784ea8a-5a4d-4ee0-b73c-5f91d8fdee30","resolution":{"observed_at":"2026-08-06T17:59:07.637463Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.06101","last_updated":"2024-03-19T23:01:06Z","snapshot_observed_at":"2026-08-05T09:04:21.780090Z","submitted_at":"2023-06-09T17:59:35Z","title":"Prodigy: An Expeditiously Adaptive Parameter-Free Learner","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.06101","snapshot_observed_at":"2026-08-06T17:59:07.725771Z","title":"and Defazio, A","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.09823","last_updated":"2025-08-29T15:15:31Z","snapshot_observed_at":"2026-08-09T11:05:20.331803Z","submitted_at":"2025-07-13T23:07:45Z","title":"Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-06T17:59:07.725771Z"},"links":{"cited_paper":"/paper/2306.06101","citing_paper":"/paper/2507.09823"},"observation_digest":"sha256:ca795655f4731552c13bfaa436925bcf3d795cee3d14f6cac40d20e896dbe42f","observation_id":"bcfb6263-7dd2-4108-a4cb-1e431886bb11","resolution":{"observed_at":"2026-08-06T17:59:07.725771Z","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-06T17:59:11.421453Z","title":null,"venue":null,"work_id":"7560cd99-0747-43eb-bdda-8cf39ca6126a","year":2020},"citing_paper":{"arxiv_id":"2507.09823","last_updated":"2025-08-29T15:15:31Z","snapshot_observed_at":"2026-08-09T11:05:20.331803Z","submitted_at":"2025-07-13T23:07:45Z","title":"Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-06T17:59:07.826966Z"},"links":{"citing_paper":"/paper/2507.09823"},"observation_digest":"sha256:f2dacfbe0cb41ad49b7cd66dc79370db3a738d3fd59189bf0b596342a09894df","observation_id":"d8b98b4d-e89a-47be-ab97-80c47f017c65","resolution":{"observed_at":"2026-08-06T17:59:11.548068Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T17:59:11.174848Z","title":null,"venue":null,"work_id":"5c0f9776-3f8a-44c0-8ba1-3d16d33085d2","year":1983},"citing_paper":{"arxiv_id":"2507.09823","last_updated":"2025-08-29T15:15:31Z","snapshot_observed_at":"2026-08-09T11:05:20.331803Z","submitted_at":"2025-07-13T23:07:45Z","title":"Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-06T17:59:07.909567Z"},"links":{"citing_paper":"/paper/2507.09823"},"observation_digest":"sha256:f0fa0c4bb301aec9c638092fabefe0cf4a80ac92ab9f556921606c71cc3cdd18","observation_id":"25682c3e-7327-4db8-82f5-85bdae9d6939","resolution":{"observed_at":"2026-08-06T17:59:11.304987Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T17:59:09.971351Z","title":null,"venue":null,"work_id":"6cfa6910-6451-46bc-8baf-356b5da6a893","year":2013},"citing_paper":{"arxiv_id":"2507.09823","last_updated":"2025-08-29T15:15:31Z","snapshot_observed_at":"2026-08-09T11:05:20.331803Z","submitted_at":"2025-07-13T23:07:45Z","title":"Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-06T17:59:07.968258Z"},"links":{"citing_paper":"/paper/2507.09823"},"observation_digest":"sha256:c3a0a2773b24a23124b74c9a7366a10ed05da51ab5c2f36185d6eb9444cfed05","observation_id":"e434bb96-be0e-4350-bf96-9ae683d7be06","resolution":{"observed_at":"2026-08-06T17:59:11.030977Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T17:59:09.307711Z","title":null,"venue":null,"work_id":"2ff4c4f5-d08d-4f6c-be62-c7470b227371","year":2018},"citing_paper":{"arxiv_id":"2507.09823","last_updated":"2025-08-29T15:15:31Z","snapshot_observed_at":"2026-08-09T11:05:20.331803Z","submitted_at":"2025-07-13T23:07:45Z","title":"Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-06T17:59:08.029333Z"},"links":{"citing_paper":"/paper/2507.09823"},"observation_digest":"sha256:c19cdbed1fbc1df5ca6049fb6935ac2c789d008afdaf2f918abaad3044c5226e","observation_id":"5868d419-fb29-4e9c-8d10-e50f0f1d5511","resolution":{"observed_at":"2026-08-06T17:59:09.438200Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.05621","last_updated":"2023-08-10T15:10:08Z","snapshot_observed_at":"2026-07-06T16:04:54.766026Z","submitted_at":"2023-08-10T15:10:08Z","title":"Normalized Gradients for All","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.05621","snapshot_observed_at":"2026-08-06T17:59:08.087181Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.09823","last_updated":"2025-08-29T15:15:31Z","snapshot_observed_at":"2026-08-09T11:05:20.331803Z","submitted_at":"2025-07-13T23:07:45Z","title":"Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-06T17:59:08.087181Z"},"links":{"cited_paper":"/paper/2308.05621","citing_paper":"/paper/2507.09823"},"observation_digest":"sha256:51782ca621526bab87c89892e2b47f6bfacfae3c20b944508b1d5a0badc45fcd","observation_id":"b294c62b-46ac-4af6-8ee9-5afcaa70cf19","resolution":{"observed_at":"2026-08-06T17:59:08.087181Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2102.00236","last_updated":"2021-01-30T15:05:34Z","snapshot_observed_at":"2026-08-09T10:30:00.447486Z","submitted_at":"2021-01-30T15:05:34Z","title":"Parameter-free Stochastic Optimization of Variationally Coherent Functions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.00236","snapshot_observed_at":"2026-08-06T17:59:08.180919Z","title":"and P \\'a l, D","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.09823","last_updated":"2025-08-29T15:15:31Z","snapshot_observed_at":"2026-08-09T11:05:20.331803Z","submitted_at":"2025-07-13T23:07:45Z","title":"Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-06T17:59:08.180919Z"},"links":{"cited_paper":"/paper/2102.00236","citing_paper":"/paper/2507.09823"},"observation_digest":"sha256:6632a1c42cdae94019c42429dd440ca4318e17ac73945cb34739153d442368c2","observation_id":"759e5fa9-11a6-40b7-95f8-b30439309509","resolution":{"observed_at":"2026-08-06T17:59:08.180919Z","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-06T17:59:09.118436Z","title":null,"venue":null,"work_id":"33f3a60f-d540-4808-bc5c-a1a2e7be98bf","year":1963},"citing_paper":{"arxiv_id":"2507.09823","last_updated":"2025-08-29T15:15:31Z","snapshot_observed_at":"2026-08-09T11:05:20.331803Z","submitted_at":"2025-07-13T23:07:45Z","title":"Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-06T17:59:08.242195Z"},"links":{"citing_paper":"/paper/2507.09823"},"observation_digest":"sha256:0318613ec36d3028f02d760c73ed897f0558de189dd8c1d03617737cb4dcfbcd","observation_id":"eefa00d7-bafb-4753-9beb-7b5040da06fb","resolution":{"observed_at":"2026-08-06T17:59:09.184361Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T17:59:08.320093Z","title":null,"venue":null,"work_id":null,"year":1969},"citing_paper":{"arxiv_id":"2507.09823","last_updated":"2025-08-29T15:15:31Z","snapshot_observed_at":"2026-08-09T11:05:20.331803Z","submitted_at":"2025-07-13T23:07:45Z","title":"Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-06T17:59:08.320093Z"},"links":{"citing_paper":"/paper/2507.09823"},"observation_digest":"sha256:ce91aa4f7324785a8491f6beb2e45692b69f998d04520a295134ecaeed143f5d","observation_id":"b7870bed-257b-4f16-870a-7388ef51c533","resolution":{"observed_at":"2026-08-06T17:59:08.320093Z","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-06T17:59:08.904610Z","title":null,"venue":null,"work_id":"b1135d18-b818-4078-a08d-aad2b12e69d6","year":1993},"citing_paper":{"arxiv_id":"2507.09823","last_updated":"2025-08-29T15:15:31Z","snapshot_observed_at":"2026-08-09T11:05:20.331803Z","submitted_at":"2025-07-13T23:07:45Z","title":"Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-06T17:59:08.385895Z"},"links":{"citing_paper":"/paper/2507.09823"},"observation_digest":"sha256:bbb5e8d818971b27d676d93255d7a705fe12a8c03d6f7afd7404570c753d038a","observation_id":"ac619be3-c147-49e5-bbde-bc00a0ddcca1","resolution":{"observed_at":"2026-08-06T17:59:08.995550Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T17:59:08.787994Z","title":null,"venue":null,"work_id":"105f7040-01a6-437e-8836-3efdcad31b9f","year":2024},"citing_paper":{"arxiv_id":"2507.09823","last_updated":"2025-08-29T15:15:31Z","snapshot_observed_at":"2026-08-09T11:05:20.331803Z","submitted_at":"2025-07-13T23:07:45Z","title":"Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-06T17:59:08.441534Z"},"links":{"citing_paper":"/paper/2507.09823"},"observation_digest":"sha256:b6f022fb7a26211fb07e3224d09f5fbf1023643f1636630922a598cd73d5af3d","observation_id":"07688abc-5745-47f8-a6c3-5bc27e5f6aa3","resolution":{"observed_at":"2026-08-06T17:59:08.823723Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.09823","last_updated":"2025-08-29T15:15:31Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-09T11:05:20.331803Z","submitted_at":"2025-07-13T23:07:45Z","title":"Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization"},"reference_resolution":{"displayed":41,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":32,"verified_exact":1,"verified_fuzzy":8},"total_outbound_references":41},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 41 of 41 outbound references and 3 inbound Pith citation observations for arXiv:2507.09823."}