{"as_of":"2026-08-17T22:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:40a99a85ec8e2e7c33247d31d3a45ab71cff1f24fa61bbb824dbf33cf5f7365e","coverage":[{"denominator":48,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":48,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T14:46:01.083324Z","state":"measured"},{"denominator":48,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":48,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+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.04884/citation-record","integrity":"/paper/2608.04884/integrity","json":"/paper/2608.04884/citation-record.json","paper":"/paper/2608.04884"},"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:46:02.100450Z","title":", title =","venue":null,"work_id":"d4ebe604-76a4-4504-9b8c-f0c1a53410ba","year":null},"citing_paper":{"arxiv_id":"2608.04884","last_updated":"2026-08-05T14:09:13Z","snapshot_observed_at":"2026-08-16T22:38:49.123989Z","submitted_at":"2026-08-05T14:09:13Z","title":"A Few Accelerated Algorithms for Convex Optimization under $(H_0,H_1)$-Smoothness","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-15T14:46:00.806176Z"},"links":{"citing_paper":"/paper/2608.04884"},"observation_digest":"sha256:acfe9c76de95428be18470e5ee08a4a3436ecd0c02231c8dbcd7020e35614363","observation_id":"87c2ebcb-bf82-4161-b4d6-cb22f53f827c","resolution":{"observed_at":"2026-08-15T14:46:02.106376Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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:46:00.813716Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04884","last_updated":"2026-08-05T14:09:13Z","snapshot_observed_at":"2026-08-16T22:38:49.123989Z","submitted_at":"2026-08-05T14:09:13Z","title":"A Few Accelerated Algorithms for Convex Optimization under $(H_0,H_1)$-Smoothness","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-15T14:46:00.813716Z"},"links":{"citing_paper":"/paper/2608.04884"},"observation_digest":"sha256:f7cdbbaa071c80e9c2581474fae434a53118654e0def1772f4dc22c2ebc7d7e3","observation_id":"85ebdbc2-b242-49a6-a24c-08c9e2ed4c69","resolution":{"observed_at":"2026-08-15T14:46:00.813716Z","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-15T14:46:00.819125Z","title":"2006 , publisher=","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2608.04884","last_updated":"2026-08-05T14:09:13Z","snapshot_observed_at":"2026-08-16T22:38:49.123989Z","submitted_at":"2026-08-05T14:09:13Z","title":"A Few Accelerated Algorithms for Convex Optimization under $(H_0,H_1)$-Smoothness","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-15T14:46:00.819125Z"},"links":{"citing_paper":"/paper/2608.04884"},"observation_digest":"sha256:38311528283f0b8a626a1defe83c4f27d29fb2d514594be1260b3c7b50b001f6","observation_id":"e59992bf-e75c-489f-bcb5-8a20dd59b75f","resolution":{"observed_at":"2026-08-15T14:46:00.819125Z","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:46:02.055594Z","title":"SIAM Journal on Optimization , volume =","venue":null,"work_id":"e0fe9c66-ec51-47ff-8805-e9d0468b3129","year":null},"citing_paper":{"arxiv_id":"2608.04884","last_updated":"2026-08-05T14:09:13Z","snapshot_observed_at":"2026-08-16T22:38:49.123989Z","submitted_at":"2026-08-05T14:09:13Z","title":"A Few Accelerated Algorithms for Convex Optimization under $(H_0,H_1)$-Smoothness","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-15T14:46:00.824031Z"},"links":{"citing_paper":"/paper/2608.04884"},"observation_digest":"sha256:17754648d261c7b4df2a97c6a854e5150a9950f276c26de1c25603afa714701e","observation_id":"841cc7ce-bc00-4e8b-bdff-0b4fcf3894a9","resolution":{"observed_at":"2026-08-15T14:46:02.062805Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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:46:02.036337Z","title":"Mathematical Programming , volume =","venue":null,"work_id":"6e2f6d4a-ca10-4a4f-b7e8-c931f227ec26","year":null},"citing_paper":{"arxiv_id":"2608.04884","last_updated":"2026-08-05T14:09:13Z","snapshot_observed_at":"2026-08-16T22:38:49.123989Z","submitted_at":"2026-08-05T14:09:13Z","title":"A Few Accelerated Algorithms for Convex Optimization under $(H_0,H_1)$-Smoothness","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-15T14:46:00.829178Z"},"links":{"citing_paper":"/paper/2608.04884"},"observation_digest":"sha256:1a57a0135d9a2f8af1523ade87a1dacb9f7dcc0c9909cc65e70d8bd555a83327","observation_id":"46bacbb5-6e3a-49c8-bf11-abb69fb4db0d","resolution":{"observed_at":"2026-08-15T14:46:02.041657Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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:46:02.017839Z","title":"SIAM Journal on Optimization , volume =","venue":null,"work_id":"4a6d5967-4c2c-41b6-84ff-73f178b299ea","year":null},"citing_paper":{"arxiv_id":"2608.04884","last_updated":"2026-08-05T14:09:13Z","snapshot_observed_at":"2026-08-16T22:38:49.123989Z","submitted_at":"2026-08-05T14:09:13Z","title":"A Few Accelerated Algorithms for Convex Optimization under $(H_0,H_1)$-Smoothness","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-15T14:46:00.833992Z"},"links":{"citing_paper":"/paper/2608.04884"},"observation_digest":"sha256:0e0b050ca96f026018ee01a342095f43c09e87bf82533da2c171ea9722d9483e","observation_id":"c56332e2-5042-4d10-a18b-2d85d6a86669","resolution":{"observed_at":"2026-08-15T14:46:02.023917Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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:46:01.995513Z","title":"Proceedings of the 33rd International Conference on Machine Learning , year =","venue":null,"work_id":"0339ff13-e1f0-4faf-b8ab-26461e97cf60","year":null},"citing_paper":{"arxiv_id":"2608.04884","last_updated":"2026-08-05T14:09:13Z","snapshot_observed_at":"2026-08-16T22:38:49.123989Z","submitted_at":"2026-08-05T14:09:13Z","title":"A Few Accelerated Algorithms for Convex Optimization under $(H_0,H_1)$-Smoothness","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-15T14:46:00.838919Z"},"links":{"citing_paper":"/paper/2608.04884"},"observation_digest":"sha256:e5f4d438dd32ff421c8a58c3f9e1e50199d69c08ef54da4f760373d13a297994","observation_id":"0ca55dba-ec8b-479a-8bd0-b7afb1787648","resolution":{"observed_at":"2026-08-15T14:46:02.003985Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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:46:00.844424Z","title":"Optimization Methods for Large-Scale Machine Learning , journal =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04884","last_updated":"2026-08-05T14:09:13Z","snapshot_observed_at":"2026-08-16T22:38:49.123989Z","submitted_at":"2026-08-05T14:09:13Z","title":"A Few Accelerated Algorithms for Convex Optimization under $(H_0,H_1)$-Smoothness","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-15T14:46:00.844424Z"},"links":{"citing_paper":"/paper/2608.04884"},"observation_digest":"sha256:84a4edfcfc3287816214dfb70ca3c8f8c3e1cab3cd00d415d9ca40efa380b899","observation_id":"f29681c8-cc71-41e1-83bd-4a9e8e30e9f9","resolution":{"observed_at":"2026-08-15T14:46:00.844424Z","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-15T14:46:00.849947Z","title":"Journal of Machine Learning Research , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04884","last_updated":"2026-08-05T14:09:13Z","snapshot_observed_at":"2026-08-16T22:38:49.123989Z","submitted_at":"2026-08-05T14:09:13Z","title":"A Few Accelerated Algorithms for Convex Optimization under $(H_0,H_1)$-Smoothness","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-15T14:46:00.849947Z"},"links":{"citing_paper":"/paper/2608.04884"},"observation_digest":"sha256:7b58e1390f1abdaba10b0d0c57d03fce19c7942db370b49b6d2f66efdaccb649","observation_id":"a0aa7950-4e13-402f-84d1-83ff6fa4e41c","resolution":{"observed_at":"2026-08-15T14:46:00.849947Z","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-15T14:46:00.855272Z","title":"and Ba, Jimmy , title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04884","last_updated":"2026-08-05T14:09:13Z","snapshot_observed_at":"2026-08-16T22:38:49.123989Z","submitted_at":"2026-08-05T14:09:13Z","title":"A Few Accelerated Algorithms for Convex Optimization under $(H_0,H_1)$-Smoothness","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-15T14:46:00.855272Z"},"links":{"citing_paper":"/paper/2608.04884"},"observation_digest":"sha256:88abb4c942a802fa8b790a37e4b7035669a95adcc99c10df439478d25ea16c5c","observation_id":"77d0ad47-ccd5-4438-9748-8e15026494b1","resolution":{"observed_at":"2026-08-15T14:46:00.855272Z","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-15T14:46:00.860817Z","title":"International Conference on Learning Representations , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04884","last_updated":"2026-08-05T14:09:13Z","snapshot_observed_at":"2026-08-16T22:38:49.123989Z","submitted_at":"2026-08-05T14:09:13Z","title":"A Few Accelerated Algorithms for Convex Optimization under $(H_0,H_1)$-Smoothness","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-15T14:46:00.860817Z"},"links":{"citing_paper":"/paper/2608.04884"},"observation_digest":"sha256:41764fe86bcdcb88673ea7cc915d4801755e01d033e296b4bb9622a781d95c2d","observation_id":"cbb3b5ce-f769-477f-89b3-c595f24c96bd","resolution":{"observed_at":"2026-08-15T14:46:00.860817Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.16982","last_updated":"2025-02-24T09:12:29Z","snapshot_observed_at":"2026-08-16T22:48:15.725816Z","submitted_at":"2025-02-24T09:12:29Z","title":"Muon is Scalable for LLM Training","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.16982","snapshot_observed_at":"2026-08-15T14:46:00.868661Z","title":"arXiv preprint arXiv:2502.16982 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04884","last_updated":"2026-08-05T14:09:13Z","snapshot_observed_at":"2026-08-16T22:38:49.123989Z","submitted_at":"2026-08-05T14:09:13Z","title":"A Few Accelerated Algorithms for Convex Optimization under $(H_0,H_1)$-Smoothness","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-15T14:46:00.868661Z"},"links":{"cited_paper":"/paper/2502.16982","citing_paper":"/paper/2608.04884"},"observation_digest":"sha256:a3d9d5b1e6cf3d81d8ad733ce41ac951368d9faeb5b1f5f121a93532eedb0a5b","observation_id":"069f34d6-6414-4aa1-9701-7b71e88d5c3f","resolution":{"observed_at":"2026-08-15T14:46:00.868661Z","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:46:01.910551Z","title":"Proceedings of the 30th International Conference on Machine Learning , pages =","venue":null,"work_id":"19f77dec-92ee-4b24-b3d4-dd5afb94e41a","year":null},"citing_paper":{"arxiv_id":"2608.04884","last_updated":"2026-08-05T14:09:13Z","snapshot_observed_at":"2026-08-16T22:38:49.123989Z","submitted_at":"2026-08-05T14:09:13Z","title":"A Few Accelerated Algorithms for Convex Optimization under $(H_0,H_1)$-Smoothness","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-15T14:46:00.877239Z"},"links":{"citing_paper":"/paper/2608.04884"},"observation_digest":"sha256:cf0aa27bdcfd88e613d82a01c36b10fce95950915cb6e5b65c26d4fd80067670","observation_id":"da46ace2-2029-4ea1-9578-9c294ffeb7d6","resolution":{"observed_at":"2026-08-15T14:46:01.915978Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1706.02677","last_updated":"2018-04-30T21:53:41Z","snapshot_observed_at":"2026-08-09T05:23:26.365677Z","submitted_at":"2017-06-08T16:51:53Z","title":"Accurate, Large Minibatch SGD: Training ImageNet in 1 Hour","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.02677","snapshot_observed_at":"2026-08-15T14:46:00.883015Z","title":"arXiv preprint arXiv:1706.02677 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04884","last_updated":"2026-08-05T14:09:13Z","snapshot_observed_at":"2026-08-16T22:38:49.123989Z","submitted_at":"2026-08-05T14:09:13Z","title":"A Few Accelerated Algorithms for Convex Optimization under $(H_0,H_1)$-Smoothness","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-15T14:46:00.883015Z"},"links":{"cited_paper":"/paper/1706.02677","citing_paper":"/paper/2608.04884"},"observation_digest":"sha256:3e4205bc909ad2a9241c26833a9961c5365bbf37c7c481efa5895f0c175ca8b0","observation_id":"9dcaa4be-dc89-4d22-a024-d2bddddfb335","resolution":{"observed_at":"2026-08-15T14:46:00.883015Z","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-15T14:46:00.889518Z","title":"and Kaiser, Lukasz and Polosukhin, Illia , title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04884","last_updated":"2026-08-05T14:09:13Z","snapshot_observed_at":"2026-08-16T22:38:49.123989Z","submitted_at":"2026-08-05T14:09:13Z","title":"A Few Accelerated Algorithms for Convex Optimization under $(H_0,H_1)$-Smoothness","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-15T14:46:00.889518Z"},"links":{"citing_paper":"/paper/2608.04884"},"observation_digest":"sha256:bc59dc7b78404068fcb5aed994401b537108353e714dc94ab2f8663ae9423edc","observation_id":"9e4ebaec-02db-4daa-839d-7fd7b0e1b4de","resolution":{"observed_at":"2026-08-15T14:46:00.889518Z","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:46:01.866492Z","title":null,"venue":null,"work_id":"ce018694-b866-4609-8937-0a6826608e67","year":null},"citing_paper":{"arxiv_id":"2608.04884","last_updated":"2026-08-05T14:09:13Z","snapshot_observed_at":"2026-08-16T22:38:49.123989Z","submitted_at":"2026-08-05T14:09:13Z","title":"A Few Accelerated Algorithms for Convex Optimization under $(H_0,H_1)$-Smoothness","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-15T14:46:00.895610Z"},"links":{"citing_paper":"/paper/2608.04884"},"observation_digest":"sha256:138e485b643be6231eecc16b5526df7377927f898fc108fa141dd39d0bca0869","observation_id":"160139e5-1105-479e-b434-72dd833e7754","resolution":{"observed_at":"2026-08-15T14:46:01.872790Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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:46:01.840059Z","title":"International Conference on Learning Representations , year =","venue":null,"work_id":"4465f35d-703e-4e07-98bf-d7641b0ab8a0","year":null},"citing_paper":{"arxiv_id":"2608.04884","last_updated":"2026-08-05T14:09:13Z","snapshot_observed_at":"2026-08-16T22:38:49.123989Z","submitted_at":"2026-08-05T14:09:13Z","title":"A Few Accelerated Algorithms for Convex Optimization under $(H_0,H_1)$-Smoothness","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-15T14:46:00.903122Z"},"links":{"citing_paper":"/paper/2608.04884"},"observation_digest":"sha256:cd2534816c8d47ea4d5b7fe6dcf7cdfff525ca9232c6d46c55267bb196581795","observation_id":"ad35f849-71a3-4ac5-87c5-98b8e431a537","resolution":{"observed_at":"2026-08-15T14:46:01.849179Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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:46:01.819712Z","title":"Advances in Neural Information Processing Systems , year =","venue":null,"work_id":"c6e02a1f-7371-44f3-ae07-3527bc1f73f0","year":null},"citing_paper":{"arxiv_id":"2608.04884","last_updated":"2026-08-05T14:09:13Z","snapshot_observed_at":"2026-08-16T22:38:49.123989Z","submitted_at":"2026-08-05T14:09:13Z","title":"A Few Accelerated Algorithms for Convex Optimization under $(H_0,H_1)$-Smoothness","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-15T14:46:00.909271Z"},"links":{"citing_paper":"/paper/2608.04884"},"observation_digest":"sha256:d14c9de6a8baaf6679463621d60bfa3a21c4dd438598fb01a223171d30de476d","observation_id":"eba498a0-0ba5-45db-a405-a3d19ab08ed3","resolution":{"observed_at":"2026-08-15T14:46:01.825268Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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:46:01.802513Z","title":"Advances in Neural Information Processing Systems , year =","venue":null,"work_id":"71b019a8-9475-4aa3-8f71-504c1d3837c2","year":null},"citing_paper":{"arxiv_id":"2608.04884","last_updated":"2026-08-05T14:09:13Z","snapshot_observed_at":"2026-08-16T22:38:49.123989Z","submitted_at":"2026-08-05T14:09:13Z","title":"A Few Accelerated Algorithms for Convex Optimization under $(H_0,H_1)$-Smoothness","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-15T14:46:00.915096Z"},"links":{"citing_paper":"/paper/2608.04884"},"observation_digest":"sha256:23d3d5ec997668f1a7cda96c0b26092c7e5764260862e4b7fdaaee0eea2e0cb7","observation_id":"7a603c76-b61e-48f0-b347-d7038fcd42d9","resolution":{"observed_at":"2026-08-15T14:46:01.808195Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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:46:01.783684Z","title":"International Conference on Machine Learning , year =","venue":null,"work_id":"6aa4fa33-e9ff-4d7b-a452-76426b70a595","year":null},"citing_paper":{"arxiv_id":"2608.04884","last_updated":"2026-08-05T14:09:13Z","snapshot_observed_at":"2026-08-16T22:38:49.123989Z","submitted_at":"2026-08-05T14:09:13Z","title":"A Few Accelerated Algorithms for Convex Optimization under $(H_0,H_1)$-Smoothness","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-15T14:46:00.921115Z"},"links":{"citing_paper":"/paper/2608.04884"},"observation_digest":"sha256:c04ba8332b60d970eb66e7d1aefd44f148010edef66d1e5672589220cc193991","observation_id":"1282613a-5198-4498-a01b-c8859691ff99","resolution":{"observed_at":"2026-08-15T14:46:01.789513Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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:46:01.763463Z","title":"Conference on Learning Theory , year =","venue":null,"work_id":"e5cfad80-f529-48ca-a22c-1a04ac4f7828","year":null},"citing_paper":{"arxiv_id":"2608.04884","last_updated":"2026-08-05T14:09:13Z","snapshot_observed_at":"2026-08-16T22:38:49.123989Z","submitted_at":"2026-08-05T14:09:13Z","title":"A Few Accelerated Algorithms for Convex Optimization under $(H_0,H_1)$-Smoothness","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-15T14:46:00.926552Z"},"links":{"citing_paper":"/paper/2608.04884"},"observation_digest":"sha256:cf6fff2d999892d4d99b1ee632e7fbe1962a86fc0b390b712d5aec607f68b7b0","observation_id":"615741af-000a-4a40-bf2c-8a05f479b5a1","resolution":{"observed_at":"2026-08-15T14:46:01.770374Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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:46:01.743646Z","title":", title =","venue":null,"work_id":"e6ed62e0-87db-4adf-bb00-4f18b059242f","year":null},"citing_paper":{"arxiv_id":"2608.04884","last_updated":"2026-08-05T14:09:13Z","snapshot_observed_at":"2026-08-16T22:38:49.123989Z","submitted_at":"2026-08-05T14:09:13Z","title":"A Few Accelerated Algorithms for Convex Optimization under $(H_0,H_1)$-Smoothness","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-15T14:46:00.932100Z"},"links":{"citing_paper":"/paper/2608.04884"},"observation_digest":"sha256:05637945e3fd9867f3a10832b4ba00deef431f493cee3a63bf88bd87cb42a8f8","observation_id":"cef57a9a-5519-4125-ae6c-e4c9700d0d6e","resolution":{"observed_at":"2026-08-15T14:46:01.749309Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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:46:01.725070Z","title":"Advances in Neural Information Processing Systems , year =","venue":null,"work_id":"178fa174-7ec5-4342-898c-d38cbb11c822","year":null},"citing_paper":{"arxiv_id":"2608.04884","last_updated":"2026-08-05T14:09:13Z","snapshot_observed_at":"2026-08-16T22:38:49.123989Z","submitted_at":"2026-08-05T14:09:13Z","title":"A Few Accelerated Algorithms for Convex Optimization under $(H_0,H_1)$-Smoothness","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-15T14:46:00.937799Z"},"links":{"citing_paper":"/paper/2608.04884"},"observation_digest":"sha256:f4383ee6a7f360e4fc97d06bff56085ce90aee88cdb84e0f02a3dc96b1645c92","observation_id":"0af4a439-91ac-409f-a8ca-9e7f2e715c8f","resolution":{"observed_at":"2026-08-15T14:46:01.731338Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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:46:01.708472Z","title":"Parameter-Agnostic Optimization under Relaxed Smoothness , booktitle =","venue":null,"work_id":"0ae5a1fb-195d-49d8-9b2a-ee8a3a9cd0b8","year":null},"citing_paper":{"arxiv_id":"2608.04884","last_updated":"2026-08-05T14:09:13Z","snapshot_observed_at":"2026-08-16T22:38:49.123989Z","submitted_at":"2026-08-05T14:09:13Z","title":"A Few Accelerated Algorithms for Convex Optimization under $(H_0,H_1)$-Smoothness","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-15T14:46:00.945297Z"},"links":{"citing_paper":"/paper/2608.04884"},"observation_digest":"sha256:6e25b071ee6fddaa38d83ce178adb5804174a2e8369fc9abbf3f594cd6928dc7","observation_id":"22d7623b-b457-42a8-87ee-faee713de0aa","resolution":{"observed_at":"2026-08-15T14:46:01.713629Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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:46:01.690797Z","title":"Advances in Neural Information Processing Systems , year =","venue":null,"work_id":"c206f8b7-e870-447e-877b-5243d3864a35","year":null},"citing_paper":{"arxiv_id":"2608.04884","last_updated":"2026-08-05T14:09:13Z","snapshot_observed_at":"2026-08-16T22:38:49.123989Z","submitted_at":"2026-08-05T14:09:13Z","title":"A Few Accelerated Algorithms for Convex Optimization under $(H_0,H_1)$-Smoothness","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-15T14:46:00.950648Z"},"links":{"citing_paper":"/paper/2608.04884"},"observation_digest":"sha256:89b17f1d89e02191f3a8b00be07d79b1ad520d0d7eb629e62bc1f75515a90288","observation_id":"09026e7f-3061-4f39-abce-a482167574bd","resolution":{"observed_at":"2026-08-15T14:46:01.696211Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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:46:01.672248Z","title":"International Conference on Learning Representations , volume=","venue":null,"work_id":"9de7c20f-b21b-4c6f-aa9c-486c704d3ee7","year":null},"citing_paper":{"arxiv_id":"2608.04884","last_updated":"2026-08-05T14:09:13Z","snapshot_observed_at":"2026-08-16T22:38:49.123989Z","submitted_at":"2026-08-05T14:09:13Z","title":"A Few Accelerated Algorithms for Convex Optimization under $(H_0,H_1)$-Smoothness","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-15T14:46:00.956140Z"},"links":{"citing_paper":"/paper/2608.04884"},"observation_digest":"sha256:d4efc1b7b9f5e227cf0c09bfc8889016d4f1eae7a5a43d78f8793835342be52a","observation_id":"0adaa648-1082-443d-9b6c-1df1ff8dd6a6","resolution":{"observed_at":"2026-08-15T14:46:01.677815Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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:46:00.962006Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04884","last_updated":"2026-08-05T14:09:13Z","snapshot_observed_at":"2026-08-16T22:38:49.123989Z","submitted_at":"2026-08-05T14:09:13Z","title":"A Few Accelerated Algorithms for Convex Optimization under $(H_0,H_1)$-Smoothness","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-15T14:46:00.962006Z"},"links":{"citing_paper":"/paper/2608.04884"},"observation_digest":"sha256:bf2001f2722c7916fa6beb188445d8a24d1383af9d3a3c148536609f266cf667","observation_id":"75c53e6a-1e69-4ea5-917f-77d131f19fd6","resolution":{"observed_at":"2026-08-15T14:46:00.962006Z","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:46:01.642416Z","title":", title =","venue":null,"work_id":"ac88f004-a367-422f-b4eb-6ef977eb6c59","year":null},"citing_paper":{"arxiv_id":"2608.04884","last_updated":"2026-08-05T14:09:13Z","snapshot_observed_at":"2026-08-16T22:38:49.123989Z","submitted_at":"2026-08-05T14:09:13Z","title":"A Few Accelerated Algorithms for Convex Optimization under $(H_0,H_1)$-Smoothness","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-15T14:46:00.970086Z"},"links":{"citing_paper":"/paper/2608.04884"},"observation_digest":"sha256:996b4d8c03210fe0905c3c653b388a286ffda95ef2b7f91039fc36c5c462b048","observation_id":"6a6d8664-6826-456c-8b8b-49a2a565cbaa","resolution":{"observed_at":"2026-08-15T14:46:01.648234Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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:46:01.625692Z","title":"Optimization Methods and Software , volume =","venue":null,"work_id":"f2c81aa7-7148-41a5-b506-18fdaec95dab","year":null},"citing_paper":{"arxiv_id":"2608.04884","last_updated":"2026-08-05T14:09:13Z","snapshot_observed_at":"2026-08-16T22:38:49.123989Z","submitted_at":"2026-08-05T14:09:13Z","title":"A Few Accelerated Algorithms for Convex Optimization under $(H_0,H_1)$-Smoothness","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-15T14:46:00.975164Z"},"links":{"citing_paper":"/paper/2608.04884"},"observation_digest":"sha256:bd832ff94fb17a8077fc722caf7a29247e30304cba533b8e3c0a6a684561d676","observation_id":"0590ac44-af79-48a1-8736-339e3cfa80f0","resolution":{"observed_at":"2026-08-15T14:46:01.630983Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.11773","last_updated":"2025-06-27T06:34:09Z","snapshot_observed_at":"2026-08-13T08:19:14.013569Z","submitted_at":"2024-12-16T13:46:02Z","title":"Toward a Unified Theory of Gradient Descent under Generalized Smoothness","version":2},"cited_work":{"arxiv_id":"2412.11773","doi":null,"metadata_source":"pith","pith_arxiv_id":"2412.11773","snapshot_observed_at":"2026-08-15T14:46:01.413229Z","title":"Toward a Unified Theory of Gradient Descent under Generalized Smoothness","venue":"math.OC","work_id":"06cc8c2c-3172-4ef8-b04b-9a5b8c2186ea","year":2024},"citing_paper":{"arxiv_id":"2608.04884","last_updated":"2026-08-05T14:09:13Z","snapshot_observed_at":"2026-08-16T22:38:49.123989Z","submitted_at":"2026-08-05T14:09:13Z","title":"A Few Accelerated Algorithms for Convex Optimization under $(H_0,H_1)$-Smoothness","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-15T14:46:00.979837Z"},"links":{"cited_paper":"/paper/2412.11773","citing_paper":"/paper/2608.04884"},"observation_digest":"sha256:98e4d85d5a6fe2b2f8993c35cf0e7fa866df62e4086900a9c4f431cbc72bc3dd","observation_id":"520b9d01-111f-4ab0-9ad5-527b2001e49e","resolution":{"observed_at":"2026-08-15T14:46:01.418931Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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:46:01.608314Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":"e79e3cd4-c043-4a42-9bc3-00294e7a7b6e","year":null},"citing_paper":{"arxiv_id":"2608.04884","last_updated":"2026-08-05T14:09:13Z","snapshot_observed_at":"2026-08-16T22:38:49.123989Z","submitted_at":"2026-08-05T14:09:13Z","title":"A Few Accelerated Algorithms for Convex Optimization under $(H_0,H_1)$-Smoothness","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-15T14:46:00.986313Z"},"links":{"citing_paper":"/paper/2608.04884"},"observation_digest":"sha256:e124e3656d71bbf478788cff91c799fc1471b44368ad5ab8106126f3a884e64c","observation_id":"c7ed8135-a221-4fe8-b5a5-a79f9574c339","resolution":{"observed_at":"2026-08-15T14:46:01.613994Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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:46:01.589764Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":"f9196f05-d2e6-467a-8f10-770932bb7b0a","year":null},"citing_paper":{"arxiv_id":"2608.04884","last_updated":"2026-08-05T14:09:13Z","snapshot_observed_at":"2026-08-16T22:38:49.123989Z","submitted_at":"2026-08-05T14:09:13Z","title":"A Few Accelerated Algorithms for Convex Optimization under $(H_0,H_1)$-Smoothness","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-15T14:46:00.991208Z"},"links":{"citing_paper":"/paper/2608.04884"},"observation_digest":"sha256:c4f1acb878f14578de81102beceb783911b9bb70e44ad44f34f9c439fd99256b","observation_id":"622c98a3-23da-4052-b015-9c335163c5e1","resolution":{"observed_at":"2026-08-15T14:46:01.595950Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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:46:00.996948Z","title":"and Leike, Jan and Brown, Tom and Martic, Miljan and Legg, Shane and Amodei, Dario , title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04884","last_updated":"2026-08-05T14:09:13Z","snapshot_observed_at":"2026-08-16T22:38:49.123989Z","submitted_at":"2026-08-05T14:09:13Z","title":"A Few Accelerated Algorithms for Convex Optimization under $(H_0,H_1)$-Smoothness","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-15T14:46:00.996948Z"},"links":{"citing_paper":"/paper/2608.04884"},"observation_digest":"sha256:e683846b99a6d6356a44925f1001d7d0f76eb7402fad26b737330383a0ecb26e","observation_id":"25d27d7d-96d0-4f2d-8204-2e445bb46675","resolution":{"observed_at":"2026-08-15T14:46:00.996948Z","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-15T14:46:01.003693Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04884","last_updated":"2026-08-05T14:09:13Z","snapshot_observed_at":"2026-08-16T22:38:49.123989Z","submitted_at":"2026-08-05T14:09:13Z","title":"A Few Accelerated Algorithms for Convex Optimization under $(H_0,H_1)$-Smoothness","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-15T14:46:01.003693Z"},"links":{"citing_paper":"/paper/2608.04884"},"observation_digest":"sha256:47e12fbf9d474fd817274c98922cb2a9ecfc1cec0c3b82cfc00d1ec425f33f52","observation_id":"8828731e-8777-41ef-8e0e-4f920d98b6fc","resolution":{"observed_at":"2026-08-15T14:46:01.003693Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2509.07972","last_updated":"2025-09-09T17:56:03Z","snapshot_observed_at":"2026-08-14T14:52:33.672293Z","submitted_at":"2025-09-09T17:56:03Z","title":"Theoretical Analysis on how Learning Rate Warmup Accelerates Convergence","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2509.07972","snapshot_observed_at":"2026-08-15T14:46:01.008817Z","title":"arXiv preprint arXiv:2509.07972 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04884","last_updated":"2026-08-05T14:09:13Z","snapshot_observed_at":"2026-08-16T22:38:49.123989Z","submitted_at":"2026-08-05T14:09:13Z","title":"A Few Accelerated Algorithms for Convex Optimization under $(H_0,H_1)$-Smoothness","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-15T14:46:01.008817Z"},"links":{"cited_paper":"/paper/2509.07972","citing_paper":"/paper/2608.04884"},"observation_digest":"sha256:90f9cfa96fd8f429a7f273dccd066a4c896542b6c2d214dca92374304feb048f","observation_id":"22e57482-75f2-4b7e-b7ed-99c2f982a226","resolution":{"observed_at":"2026-08-15T14:46:01.008817Z","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-15T14:46:01.014059Z","title":"arXiv preprint arXiv:2503.00229 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04884","last_updated":"2026-08-05T14:09:13Z","snapshot_observed_at":"2026-08-16T22:38:49.123989Z","submitted_at":"2026-08-05T14:09:13Z","title":"A Few Accelerated Algorithms for Convex Optimization under $(H_0,H_1)$-Smoothness","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-15T14:46:01.014059Z"},"links":{"citing_paper":"/paper/2608.04884"},"observation_digest":"sha256:444d3c11c1e9a9dc2a759c54aaa592a975c85777bcb60e352b3d85b775258aa6","observation_id":"7417aead-5069-42fe-aba2-52ab10a492a2","resolution":{"observed_at":"2026-08-15T14:46:01.014059Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2510.03164","last_updated":"2026-06-28T16:14:54Z","snapshot_observed_at":"2026-08-14T12:29:49.923863Z","submitted_at":"2025-10-03T16:35:56Z","title":"Why Do We Need Warm-up? A Theoretical Perspective","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2510.03164","snapshot_observed_at":"2026-08-15T14:46:01.019419Z","title":"arXiv preprint arXiv:2510.03164 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04884","last_updated":"2026-08-05T14:09:13Z","snapshot_observed_at":"2026-08-16T22:38:49.123989Z","submitted_at":"2026-08-05T14:09:13Z","title":"A Few Accelerated Algorithms for Convex Optimization under $(H_0,H_1)$-Smoothness","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-15T14:46:01.019419Z"},"links":{"cited_paper":"/paper/2510.03164","citing_paper":"/paper/2608.04884"},"observation_digest":"sha256:2855111e2de7fbd124d9acadc5a897afe3865f27f0ece0582f5734e36e686c14","observation_id":"d3283704-689e-48ec-b504-70b5cb3a74ae","resolution":{"observed_at":"2026-08-15T14:46:01.019419Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2605.30648","last_updated":"2026-05-28T23:05:45Z","snapshot_observed_at":"2026-07-06T23:39:53.132531Z","submitted_at":"2026-05-28T23:05:45Z","title":"Convergence of Steepest Descent and Adam under Non-Uniform Smoothness","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.30648","snapshot_observed_at":"2026-08-15T14:46:01.024805Z","title":"arXiv preprint arXiv:2605.30648 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04884","last_updated":"2026-08-05T14:09:13Z","snapshot_observed_at":"2026-08-16T22:38:49.123989Z","submitted_at":"2026-08-05T14:09:13Z","title":"A Few Accelerated Algorithms for Convex Optimization under $(H_0,H_1)$-Smoothness","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-15T14:46:01.024805Z"},"links":{"cited_paper":"/paper/2605.30648","citing_paper":"/paper/2608.04884"},"observation_digest":"sha256:cd31a5d737e220ae9652826f4c7427f68d9a28a0baa94bc202ffde2b37fefd5c","observation_id":"b8c32449-7195-46de-bb2d-a52ef2528df6","resolution":{"observed_at":"2026-08-15T14:46:01.024805Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2605.14800","last_updated":"2026-05-26T16:52:56Z","snapshot_observed_at":"2026-08-07T17:02:01.604438Z","submitted_at":"2026-05-14T13:09:48Z","title":"Avoiding Bias in Clipped SGD for Overparameterized Models under Generalized Smoothness","version":2},"cited_work":{"arxiv_id":"2605.14800","doi":null,"metadata_source":"pith","pith_arxiv_id":"2605.14800","snapshot_observed_at":"2026-08-15T14:46:01.194781Z","title":"Avoiding Bias in Clipped SGD for Overparameterized Models under Generalized Smoothness","venue":"math.OC","work_id":"0e68a552-0595-42d6-8600-d3ca5f70bb7e","year":2026},"citing_paper":{"arxiv_id":"2608.04884","last_updated":"2026-08-05T14:09:13Z","snapshot_observed_at":"2026-08-16T22:38:49.123989Z","submitted_at":"2026-08-05T14:09:13Z","title":"A Few Accelerated Algorithms for Convex Optimization under $(H_0,H_1)$-Smoothness","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-15T14:46:01.030227Z"},"links":{"cited_paper":"/paper/2605.14800","citing_paper":"/paper/2608.04884"},"observation_digest":"sha256:948b15115fe3ba069428ddda73c9ad6fed7c22c6f2ce1c7cc0abc18dde595e99","observation_id":"d95696ca-f60c-4dbf-bf82-2b5f8cec386e","resolution":{"observed_at":"2026-08-15T14:46:01.200298Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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:46:01.548112Z","title":"SIAM Journal on Optimization , volume=","venue":null,"work_id":"e08f700d-56a8-4d2c-9f5d-afeb266e0205","year":2017},"citing_paper":{"arxiv_id":"2608.04884","last_updated":"2026-08-05T14:09:13Z","snapshot_observed_at":"2026-08-16T22:38:49.123989Z","submitted_at":"2026-08-05T14:09:13Z","title":"A Few Accelerated Algorithms for Convex Optimization under $(H_0,H_1)$-Smoothness","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-15T14:46:01.035416Z"},"links":{"citing_paper":"/paper/2608.04884"},"observation_digest":"sha256:250dec1f6449e09ea775ebe2b4139b7ad257241433107b7e4acf9a6866de99a3","observation_id":"7d691c97-ab30-4596-a4d0-8882f94b1b13","resolution":{"observed_at":"2026-08-15T14:46:01.554651Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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:46:01.530145Z","title":"Computational Optimization and Applications , volume=","venue":null,"work_id":"4441be37-f40e-4582-84b3-9a7c8e451668","year":2018},"citing_paper":{"arxiv_id":"2608.04884","last_updated":"2026-08-05T14:09:13Z","snapshot_observed_at":"2026-08-16T22:38:49.123989Z","submitted_at":"2026-08-05T14:09:13Z","title":"A Few Accelerated Algorithms for Convex Optimization under $(H_0,H_1)$-Smoothness","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-15T14:46:01.041235Z"},"links":{"citing_paper":"/paper/2608.04884"},"observation_digest":"sha256:f9da2bf845e724d8da88bd70310c7c7ad6e282555ce55dfc6ae9c3779d36b9b7","observation_id":"cc235f14-d1a1-4987-9b12-345b35049744","resolution":{"observed_at":"2026-08-15T14:46:01.535540Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.17050","last_updated":"2025-02-19T10:15:02Z","snapshot_observed_at":"2026-08-16T22:38:23.790622Z","submitted_at":"2024-12-22T15:00:32Z","title":"Linear Convergence Rate in Convex Setup is Possible! Gradient Descent Method Variants under $(L_0,L_1)$-Smoothness","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.17050","snapshot_observed_at":"2026-08-15T14:46:01.047421Z","title":"arXiv preprint arXiv:2412.17050 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04884","last_updated":"2026-08-05T14:09:13Z","snapshot_observed_at":"2026-08-16T22:38:49.123989Z","submitted_at":"2026-08-05T14:09:13Z","title":"A Few Accelerated Algorithms for Convex Optimization under $(H_0,H_1)$-Smoothness","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-15T14:46:01.047421Z"},"links":{"cited_paper":"/paper/2412.17050","citing_paper":"/paper/2608.04884"},"observation_digest":"sha256:4412811439e34df15b4a15a9fb09d24e570a62d968a615d4a7423eebc64549a0","observation_id":"512fd8d2-e093-4fa2-92d0-e973e97ba553","resolution":{"observed_at":"2026-08-15T14:46:01.047421Z","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:46:01.512953Z","title":"ACM Transactions on Intelligent Systems and Technology , volume =","venue":null,"work_id":"32148536-cb02-4bc0-9561-7a064a196f5d","year":null},"citing_paper":{"arxiv_id":"2608.04884","last_updated":"2026-08-05T14:09:13Z","snapshot_observed_at":"2026-08-16T22:38:49.123989Z","submitted_at":"2026-08-05T14:09:13Z","title":"A Few Accelerated Algorithms for Convex Optimization under $(H_0,H_1)$-Smoothness","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-15T14:46:01.053592Z"},"links":{"citing_paper":"/paper/2608.04884"},"observation_digest":"sha256:823ad6c55dea3de9ceb4e15f20c6fca9bce15b1509e6e30c9d5ce7e5175a98de","observation_id":"22102cbd-5736-4fc5-bf28-1bdbd619946c","resolution":{"observed_at":"2026-08-15T14:46:01.518776Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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:46:01.059550Z","title":"and Nocedal, Jorge , title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04884","last_updated":"2026-08-05T14:09:13Z","snapshot_observed_at":"2026-08-16T22:38:49.123989Z","submitted_at":"2026-08-05T14:09:13Z","title":"A Few Accelerated Algorithms for Convex Optimization under $(H_0,H_1)$-Smoothness","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-15T14:46:01.059550Z"},"links":{"citing_paper":"/paper/2608.04884"},"observation_digest":"sha256:4c5e6336b3e05267f8dcaff2cbb33657108110ffad3102e15838095faf5e60a7","observation_id":"655cd83c-1df7-451b-a722-49d363860f92","resolution":{"observed_at":"2026-08-15T14:46:01.059550Z","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:46:01.483138Z","title":"and Sekhari, Ayush and Shamir, Ohad and Srebro, Nathan and Sridharan, Karthik and Woodworth, Blake , title =","venue":null,"work_id":"87e63426-eab8-421f-8045-21c32f4a2442","year":null},"citing_paper":{"arxiv_id":"2608.04884","last_updated":"2026-08-05T14:09:13Z","snapshot_observed_at":"2026-08-16T22:38:49.123989Z","submitted_at":"2026-08-05T14:09:13Z","title":"A Few Accelerated Algorithms for Convex Optimization under $(H_0,H_1)$-Smoothness","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-15T14:46:01.064612Z"},"links":{"citing_paper":"/paper/2608.04884"},"observation_digest":"sha256:eaace6aac4e8e6213af1e72ca78d057838c736f898c3d94d18385b27f82b36fa","observation_id":"22383fbf-139e-4ae3-812d-bdc776fd91f9","resolution":{"observed_at":"2026-08-15T14:46:01.488804Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.18198","last_updated":"2025-05-22T18:06:06Z","snapshot_observed_at":"2026-08-17T21:14:16.630912Z","submitted_at":"2025-01-30T08:34:04Z","title":"Power of Generalized Smoothness in Stochastic Convex Optimization: First- and Zero-Order Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.18198","snapshot_observed_at":"2026-08-15T14:46:01.070957Z","title":"arXiv preprint arXiv:2501.18198 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04884","last_updated":"2026-08-05T14:09:13Z","snapshot_observed_at":"2026-08-16T22:38:49.123989Z","submitted_at":"2026-08-05T14:09:13Z","title":"A Few Accelerated Algorithms for Convex Optimization under $(H_0,H_1)$-Smoothness","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-15T14:46:01.070957Z"},"links":{"cited_paper":"/paper/2501.18198","citing_paper":"/paper/2608.04884"},"observation_digest":"sha256:d10601f5825071d59b25fab8d1379fe62a6da1a21c914ab26ebbaa798ddd4d2b","observation_id":"c4699237-76ed-42dd-a5ca-1138a0f1bb91","resolution":{"observed_at":"2026-08-15T14:46:01.070957Z","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:46:01.464883Z","title":"International Conference on Learning Representations , volume=","venue":null,"work_id":"c4e063de-723a-4b40-b843-edef4d214509","year":null},"citing_paper":{"arxiv_id":"2608.04884","last_updated":"2026-08-05T14:09:13Z","snapshot_observed_at":"2026-08-16T22:38:49.123989Z","submitted_at":"2026-08-05T14:09:13Z","title":"A Few Accelerated Algorithms for Convex Optimization under $(H_0,H_1)$-Smoothness","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-15T14:46:01.077263Z"},"links":{"citing_paper":"/paper/2608.04884"},"observation_digest":"sha256:0c99cb9a6a83a32afb9fcc6395e798dfe442ce269b9592c48717a0b4cf8fa63e","observation_id":"62eb67f3-b7e9-4dda-80f5-d594f776dd3e","resolution":{"observed_at":"2026-08-15T14:46:01.470704Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.06884","last_updated":"2026-05-21T04:59:24Z","snapshot_observed_at":"2026-08-05T10:48:53.557039Z","submitted_at":"2025-08-09T08:28:06Z","title":"Near-Optimal Convergence of Accelerated Gradient Methods under Generalized and $(L_0, L_1)$-Smoothness","version":2},"cited_work":{"arxiv_id":"2508.06884","doi":null,"metadata_source":"pith","pith_arxiv_id":"2508.06884","snapshot_observed_at":"2026-08-15T14:46:01.130082Z","title":"Near-Optimal Convergence of Accelerated Gradient Methods under Generalized and $(L_0, L_1)$-Smoothness","venue":"math.OC","work_id":"8d407855-1b6a-4f3d-89ce-67b252ae008f","year":2025},"citing_paper":{"arxiv_id":"2608.04884","last_updated":"2026-08-05T14:09:13Z","snapshot_observed_at":"2026-08-16T22:38:49.123989Z","submitted_at":"2026-08-05T14:09:13Z","title":"A Few Accelerated Algorithms for Convex Optimization under $(H_0,H_1)$-Smoothness","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-15T14:46:01.083324Z"},"links":{"cited_paper":"/paper/2508.06884","citing_paper":"/paper/2608.04884"},"observation_digest":"sha256:d856a9152daa0325bd7b6d6415cc0690b8c4845273cc82b1a39943384c10804b","observation_id":"251c60b2-0020-48ff-8fbd-d100e39924b1","resolution":{"observed_at":"2026-08-15T14:46:01.138352Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.04884","last_updated":"2026-08-05T14:09:13Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-16T22:38:49.123989Z","submitted_at":"2026-08-05T14:09:13Z","title":"A Few Accelerated Algorithms for Convex Optimization under $(H_0,H_1)$-Smoothness"},"reference_resolution":{"displayed":48,"state_counts":{"malformed_identifier":0,"metadata_mismatch":3,"parse_uncertain":0,"unresolved":20,"verified_exact":0,"verified_fuzzy":25},"total_outbound_references":48},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 48 of 48 outbound references and 0 inbound Pith citation observations for arXiv:2608.04884."}