{"as_of":"2026-08-07T15:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f945b67e1c20a798497017eb80cebf867609d41cee802d7b6a7955b3768a0d0b","coverage":[{"denominator":56,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":56,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-14T02:28:43.704810Z","state":"measured"},{"denominator":56,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":56,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2607.11878/citation-record","integrity":"/paper/2607.11878/integrity","json":"/paper/2607.11878/citation-record.json","paper":"/paper/2607.11878"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"Nemirovsky and D.B","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2607.11878","last_updated":"2026-07-13T17:57:45Z","snapshot_observed_at":"2026-07-29T20:59:50.579430Z","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":1,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:f5d7bc126daf306d0947c0c30722d76ab042e1b6ee6d65a8957866cd10ee2e67","observation_id":"010d9615-a538-4f1e-bae4-f2c45ca9b38c","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization.Mathematical Programming, 149(1):1–45, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.11878","last_updated":"2026-07-13T17:57:45Z","snapshot_observed_at":"2026-07-29T20:59:50.579430Z","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":2,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:9c5f16bb43514394a205b7abdc80b07764dba61d7e1b674a7fdfc622bde41f40","observation_id":"80812b7c-f77b-4355-b734-cf7d8ab47d53","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"Universal gradient methods for convex optimization problems.Mathematical Programming, 152(1):381–404, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.11878","last_updated":"2026-07-13T17:57:45Z","snapshot_observed_at":"2026-07-29T20:59:50.579430Z","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":3,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:7ade2e3a827a1b0f17c241925a18fdc7141e4db641ad022f1fc67991802a0c96","observation_id":"ec2d179c-1cbd-4a9a-bb67-9b55df0f8e88","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"A simple uniformly optimal method without line search for convex optimization.Mathematical Programming, 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-07-29T20:59:50.579430Z","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":4,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:1c06838b5433cbf9172479cca135d0b04f064ea01a3f71f5dbd39244284e102c","observation_id":"097a4566-c860-433d-b592-e19b938473bf","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"The lojasiewicz inequality for nonsmooth subanalytic functions with applications to subgradient dynamical systems.SIAM Journal on Optimization, 17(4):1205–1223, 2007","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.11878","last_updated":"2026-07-13T17:57:45Z","snapshot_observed_at":"2026-07-29T20:59:50.579430Z","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":5,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:80616cc474ee116ed5459d530e30f7254c6d0ea9dd29b5245b2f9b2c6b15cb83","observation_id":"57179c8d-0660-44c0-a211-27b1ed82fe84","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"Convex optimization: Algorithms and complexity.Foundations and Trends®in Machine Learning, 8(3-4):231–357, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.11878","last_updated":"2026-07-13T17:57:45Z","snapshot_observed_at":"2026-07-29T20:59:50.579430Z","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":6,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:a33fe3571a326aee5d55ae9f0287096929e9ba03a747ca66de5d561aab657c57","observation_id":"912f3f1c-2025-4cf6-b0f5-595fc422e6bc","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"Universal complexity bounds for universal gradient methods in nonlinear optimization, 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-07-29T20:59:50.579430Z","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":7,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:c2d69153d126cead16c40a7f78419603318234bf129f2f2daa160acdb0172272","observation_id":"160f7c6f-16ec-41f5-a86c-4ea6b365af7a","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"New variants of bundle methods","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2607.11878","last_updated":"2026-07-13T17:57:45Z","snapshot_observed_at":"2026-07-29T20:59:50.579430Z","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":8,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:b2f729a4f6ad5c0ec576119fa62a5252a4021258f1a28e850d7d76076bc9f843","observation_id":"637a8b37-e5e0-4000-adc5-b415ca54bfdb","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"}},{"citation":{"cited_paper":{"arxiv_id":"1803.08832","last_updated":"2019-05-24T08:55:52Z","snapshot_observed_at":"2026-08-07T01:16:45.713000Z","submitted_at":"2018-03-23T15:21:16Z","title":"Golden Ratio Algorithms for Variational Inequalities","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.08832","snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"Golden ratio algorithms for variational inequalities.arXiv preprint arXiv:1803.08832, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.11878","last_updated":"2026-07-13T17:57:45Z","snapshot_observed_at":"2026-07-29T20:59:50.579430Z","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":9,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"cited_paper":"/paper/1803.08832","citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:243ad8837765c95c41ace1165068362d563f82e4f57eaeda738f445284cb98c1","observation_id":"531f8556-6ac8-4797-830d-1a3f62e1485e","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"Adabb: Adaptive barzilai-borwein method for convex optimization.Mathematics of Operations Research, 51(1):715–745, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.11878","last_updated":"2026-07-13T17:57:45Z","snapshot_observed_at":"2026-07-29T20:59:50.579430Z","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":10,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:071cb1143cd869afffe90cf35fe299f46604b4e36870830a8d3669f47e70e9a4","observation_id":"5a6cd344-b5a3-42da-93bf-37baf66b8398","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"}},{"citation":{"cited_paper":{"arxiv_id":"2505.11670","last_updated":"2025-05-16T20:10:03Z","snapshot_observed_at":"2026-07-06T21:25:18.082290Z","submitted_at":"2025-05-16T20:10:03Z","title":"An Adaptive and Parameter-Free Nesterov's Accelerated Gradient Method for Convex Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.11670","snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"An adaptive and parameter-free nesterov’s accelerated gradient method for convex optimization.arXiv preprint arXiv:2505.11670, 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-07-29T20:59:50.579430Z","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":11,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"cited_paper":"/paper/2505.11670","citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:71bd88c44504a43024b2ba3afb6e65f6de8b60ca98d07325d5f4c6095e273744","observation_id":"f51df9a8-62ef-4923-92b1-6e9b35a593bc","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"}},{"citation":{"cited_paper":{"arxiv_id":"2410.01979","last_updated":"2024-10-02T19:36:09Z","snapshot_observed_at":"2026-08-04T22:02:57.965705Z","submitted_at":"2024-10-02T19:36:09Z","title":"Auto-conditioned primal-dual hybrid gradient method and alternating direction method of multipliers","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.01979","snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"Auto-conditioned primal-dual hybrid gradient method and alternating direction method of multipliers.arXiv preprint arXiv:2410.01979, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.11878","last_updated":"2026-07-13T17:57:45Z","snapshot_observed_at":"2026-07-29T20:59:50.579430Z","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":12,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"cited_paper":"/paper/2410.01979","citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:7fa2d145382acef74e549e09becf4423cb9b02ae06edbe17b9774ed5d3614b37","observation_id":"2b5c3f1b-dc3f-49a1-a068-83cb551afff8","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"}},{"citation":{"cited_paper":{"arxiv_id":"2412.14291","last_updated":"2026-05-14T16:58:17Z","snapshot_observed_at":"2026-07-06T20:09:33.491422Z","submitted_at":"2024-12-18T19:34:16Z","title":"Projected gradient methods for nonconvex and stochastic smooth optimization: new complexities and auto-conditioned stepsizes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.14291","snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"Projected gradient methods for nonconvex and stochastic optimization: new complexities and auto-conditioned stepsizes.arXiv preprint arXiv:2412.14291, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.11878","last_updated":"2026-07-13T17:57:45Z","snapshot_observed_at":"2026-07-29T20:59:50.579430Z","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":13,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"cited_paper":"/paper/2412.14291","citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:a1363011aaa5dd97244e2f6514d4fd1b40f1b3b827e0ac3832521f7b942ae74a","observation_id":"f9e22197-d29c-43f7-8741-7d7bd7c5a59d","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"Uniformly optimal and parameter-free first-order methods for convex and function-constrained optimization.INFORMS Journal on Computing, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.11878","last_updated":"2026-07-13T17:57:45Z","snapshot_observed_at":"2026-07-29T20:59:50.579430Z","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":14,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:d0f8568f1cb7f3b22451c540c340024d25691f62b0e840cecb36a838b2a52e57","observation_id":"890ab74f-9ca3-47ac-9d4c-bfe25f01e53b","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"Simple linesearch-free first-order methods for nonconvex optimization.arXiv preprint arXiv:2509.14670, 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-07-29T20:59:50.579430Z","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":15,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:14ec0ae37102c278d0b9e2fdaff879b4ed4586e8cc9d5f2e2db3b21dcba3e2b9","observation_id":"336819ad-e6af-4084-9385-94a477998581","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"A simple adaptive proximal gradient method for nonconvex optimization.arXiv preprint arXiv:2510.06079, 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-07-29T20:59:50.579430Z","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":16,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:e3ff9c0e49fea60c8508aa4c9096a95292955387ff60a7e06efe454cc0b70b0d","observation_id":"b1f9c39f-1aa2-48bb-96a7-55e518a08905","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"}},{"citation":{"cited_paper":{"arxiv_id":"2605.15512","last_updated":"2026-05-28T00:40:19Z","snapshot_observed_at":"2026-07-06T23:26:46.595393Z","submitted_at":"2026-05-15T01:12:32Z","title":"Auto-Conditioned Frank-Wolfe Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.15512","snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"Auto-conditioned frank- wolfe algorithms.arXiv preprint arXiv:2605.15512, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.11878","last_updated":"2026-07-13T17:57:45Z","snapshot_observed_at":"2026-07-29T20:59:50.579430Z","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":17,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"cited_paper":"/paper/2605.15512","citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:0360f375701aaaaa5fc437f94a47634820fe609f803c9ba76bf62a21ba235a57","observation_id":"fe8ffa09-ea52-43bb-b2ef-df19cf84980e","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"}},{"citation":{"cited_paper":{"arxiv_id":"2604.06525","last_updated":"2026-04-14T04:56:12Z","snapshot_observed_at":"2026-08-02T21:35:49.903063Z","submitted_at":"2026-04-07T23:43:48Z","title":"Stochastic Auto-conditioned Fast Gradient Methods with Optimal Rates","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2604.06525","snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"Stochastic auto-conditioned fast gradient methods with optimal rates.arXiv preprint arXiv:2604.06525, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.11878","last_updated":"2026-07-13T17:57:45Z","snapshot_observed_at":"2026-07-29T20:59:50.579430Z","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":18,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"cited_paper":"/paper/2604.06525","citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:f4ff9a42c45a479b8972f6fac78335dbcd094c3f66bc684db85b994bb447c458","observation_id":"866132f3-86f6-46d3-afd3-a9fa6f40b23c","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"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2603.23492","snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"Universal and parameter-free gradient sliding for composite optimization.arXiv preprint arXiv:2603.23492, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.11878","last_updated":"2026-07-13T17:57:45Z","snapshot_observed_at":"2026-07-29T20:59:50.579430Z","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":19,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"cited_paper":"/paper/2603.23492","citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:35043b917d28d244cddc8b771d264ba1233fa01d3af890710de6619d200db51c","observation_id":"ee5974df-ca83-4749-8eaa-3df6a081e143","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"}},{"citation":{"cited_paper":{"arxiv_id":"2402.08821","last_updated":"2024-02-13T22:04:42Z","snapshot_observed_at":"2026-07-06T17:29:47.564468Z","submitted_at":"2024-02-13T22:04:42Z","title":"Problem-Parameter-Free Decentralized Nonconvex Stochastic Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.08821","snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"Problem-parameter-free decentralized nonconvex stochastic optimization.arXiv preprint arXiv:2402.08821, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.11878","last_updated":"2026-07-13T17:57:45Z","snapshot_observed_at":"2026-07-29T20:59:50.579430Z","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":20,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"cited_paper":"/paper/2402.08821","citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:a2b57c14088eb6df4412d44ba34aaca429bd671c610b69de4e047932f571c9ac","observation_id":"dd11c576-d90a-4549-917e-b1f6f05233ef","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"}},{"citation":{"cited_paper":{"arxiv_id":"2507.09823","last_updated":"2025-08-29T15:15:31Z","snapshot_observed_at":"2026-08-06T17:44:16.269487Z","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-07-29T20:59:50.579430Z","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:395e38eca4e1dea2df8572db777bac3cde8fbf061ef6dd93d08086babc70cfa2","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"Universal subgradient and proximal bundle methods for convex and strongly convex hybrid composite optimization","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.11878","last_updated":"2026-07-13T17:57:45Z","snapshot_observed_at":"2026-07-29T20:59:50.579430Z","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":22,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:d5c4d13a44e32675533b66c5c5bcd0772f60ad34219546f3a9cca421feb47e9c","observation_id":"3e464d5a-3f4b-400e-b496-912185aef546","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"}},{"citation":{"cited_paper":{"arxiv_id":"2402.03210","last_updated":"2024-07-11T15:42:09Z","snapshot_observed_at":"2026-08-07T15:26:11.356646Z","submitted_at":"2024-02-05T17:22:34Z","title":"Universal Gradient Methods for Stochastic Convex Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.03210","snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"Universal gradient methods for stochastic convex optimization.arXiv preprint arXiv:2402.03210, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.11878","last_updated":"2026-07-13T17:57:45Z","snapshot_observed_at":"2026-07-29T20:59:50.579430Z","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":23,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"cited_paper":"/paper/2402.03210","citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:ab6bbd154d721c56e02f427e9efbab993e42cf7ede8a95184a61e91094de55a3","observation_id":"2153a497-2af4-4661-a315-6047d2b1d8bd","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"}},{"citation":{"cited_paper":{"arxiv_id":"2508.01353","last_updated":"2026-06-05T04:43:06Z","snapshot_observed_at":"2026-08-06T23:46:01.620072Z","submitted_at":"2025-08-02T13:00:08Z","title":"Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.01353","snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"Linesearch-free adaptive bregman proximal gradient for convex minimization without relative smoothness.arXiv preprint arXiv:2508.01353, 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-07-29T20:59:50.579430Z","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":24,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"cited_paper":"/paper/2508.01353","citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:97eb869ff4639a4c25a0f33c3ba32a8ded07ce8010314ca89a987f326751133f","observation_id":"4897920e-2656-43a9-81e5-613a406f6ce0","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"Parameter-free accelerated gradient descent for nonconvex minimization.SIAM Journal on Optimization, 34(2):2093–2120, 2024","venue":null,"work_id":null,"year":2093},"citing_paper":{"arxiv_id":"2607.11878","last_updated":"2026-07-13T17:57:45Z","snapshot_observed_at":"2026-07-29T20:59:50.579430Z","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":25,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:87241704801f71f0065ac250a50f2bd405fea7b3e0032ecc54fe2261fe42f445","observation_id":"3a98fe69-7eef-4437-b24c-8bb3b74a0648","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"Adaptive gradient descent without descent","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.11878","last_updated":"2026-07-13T17:57:45Z","snapshot_observed_at":"2026-07-29T20:59:50.579430Z","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":26,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:f9b0b4fcd1c6fc0f448ec03673377d8f192f4b576fe9b62c7f554ccf4517e6c3","observation_id":"7f928086-f1f0-45d0-89e2-2f5b400a73d7","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"Optimal and parameter-free gradient minimization methods for convex and nonconvex optimization.Mathematical Programming, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.11878","last_updated":"2026-07-13T17:57:45Z","snapshot_observed_at":"2026-07-29T20:59:50.579430Z","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":27,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:468f4de9b5582c30f25d7cb9cdad539652778e410e9434a24e4632f6f2c4e2a7","observation_id":"9c66fc3b-0b43-489c-b0bc-354edb12cf58","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization.Computational Optimization and Applications, 60(3):633–674, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.11878","last_updated":"2026-07-13T17:57:45Z","snapshot_observed_at":"2026-07-29T20:59:50.579430Z","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":28,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:84338b3f607aa858bb820f5361442a01f5c9f0f91cdce6c6e9e5be9ab0b13881","observation_id":"081f4542-572b-4f60-9a3b-96dea2553048","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"Adaptive restart of accelerated gradient methods under local quadratic growth condition.IMA Journal of Numerical Analysis, 39(4):2069–2095, 2019","venue":null,"work_id":null,"year":2069},"citing_paper":{"arxiv_id":"2607.11878","last_updated":"2026-07-13T17:57:45Z","snapshot_observed_at":"2026-07-29T20:59:50.579430Z","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":29,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:e7b47b7c903be0354ab11787272667f779484d06e23b306db8404848d0a41772","observation_id":"7116bb77-e151-4584-9548-942b797c54e4","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"Adaptive accelerated gradient converging methods under H¨ olderian error bound condition","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.11878","last_updated":"2026-07-13T17:57:45Z","snapshot_observed_at":"2026-07-29T20:59:50.579430Z","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":30,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:4a185cbf26f9063eb2b05a0d82576d9e05591dfd506d6ec0ec4ce0978359f8a1","observation_id":"d354634e-0ca4-498b-b252-e59b19b9a74d","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"Sharpness, restart, and acceleration.SIAM Journal on Optimization, 30(1):262–289, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.11878","last_updated":"2026-07-13T17:57:45Z","snapshot_observed_at":"2026-07-29T20:59:50.579430Z","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":31,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:1c5772b95868e924c1ca5b219fb5b465f1af32a85486e6abf95c202baad3b115","observation_id":"8c9908f5-54dd-4e0a-af50-4f3f21a9f1bd","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"A simple nearly-optimal restart scheme for speeding- up first order methods.Foundations of Computational Mathematics, 22(1):211–256, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.11878","last_updated":"2026-07-13T17:57:45Z","snapshot_observed_at":"2026-07-29T20:59:50.579430Z","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":32,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:e398a23c0359b9a6d7d7d0a0e3c3e3f55dbfcffc48fb3ea4d774365448232155","observation_id":"fe06f2ee-90e7-47a0-9180-e33066b00e36","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"Efficient parameter-free restarted accelerated gradient methods for convex and strongly convex optimization: A","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11878","last_updated":"2026-07-13T17:57:45Z","snapshot_observed_at":"2026-07-29T20:59:50.579430Z","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":33,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:dbf6e4769b4193ae3b9b66db87a14db84385d7b3494333c1b17bd9560f786763","observation_id":"6084d4c2-7f21-41aa-b9af-29630d031684","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.11878","last_updated":"2026-07-13T17:57:45Z","snapshot_observed_at":"2026-07-29T20:59:50.579430Z","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":34,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:edb8e52e5aadede3e0c6d5ab83e53b72b832d97985186bd87b5b748a8d84c9f3","observation_id":"4250574c-77b2-4354-92d1-ef48377af182","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"}},{"citation":{"cited_paper":{"arxiv_id":"2605.30502","last_updated":"2026-05-28T19:36:26Z","snapshot_observed_at":"2026-08-03T17:53:27.655831Z","submitted_at":"2026-05-28T19:36:26Z","title":"A Parameter-Free Restart Scheme with Only a Parallelizable $\\log\\log(1/\\epsilon)$ Overhead","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.30502","snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"A parameter-free restart scheme with only a parallelizable log log(1/ϵ) overhead.arXiv preprint arXiv:2605.30502, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.11878","last_updated":"2026-07-13T17:57:45Z","snapshot_observed_at":"2026-07-29T20:59:50.579430Z","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":35,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"cited_paper":"/paper/2605.30502","citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:dcb9fba0f7b11550babd057321a1dbef0e015e278391f0fc601b2e85962cf801","observation_id":"51caff89-c5d4-4b0b-b425-a40da59a0b8d","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"Burke and Michael C","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2607.11878","last_updated":"2026-07-13T17:57:45Z","snapshot_observed_at":"2026-07-29T20:59:50.579430Z","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":36,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:ccc3d78d1048d49cc1722c7396e504081dcf705b7cbc94f7bb9ebd5ed563a184","observation_id":"af6f45eb-5a5b-4bdf-9daa-fdee03387f36","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"Generic minimizing behavior in semialgebraic optimization.SIAM Journal on Optimization, 26(1):513–534, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.11878","last_updated":"2026-07-13T17:57:45Z","snapshot_observed_at":"2026-07-29T20:59:50.579430Z","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":37,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:8284c55fc0657fbb989dbbe4b99abe124f5537c2a351499f7bcd9b21d1a38686","observation_id":"67eedbf2-123e-4e5a-80b2-c3fd717ae253","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.11878","last_updated":"2026-07-13T17:57:45Z","snapshot_observed_at":"2026-07-29T20:59:50.579430Z","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":38,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:63ca702243cf06cb95c1ce71840bf547936e15e5dd183cc9368f77d957f35562","observation_id":"2687089b-7a97-479f-b25c-f3b852a979d3","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"From error bounds to the complexity of first-order descent methods for convex functions.Mathematical Programming, 165(2):471–507, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.11878","last_updated":"2026-07-13T17:57:45Z","snapshot_observed_at":"2026-07-29T20:59:50.579430Z","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":39,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:6ae252d55db96b276e22666aba5abc5e154f6c348a73326cc490e6fc95396b90","observation_id":"961408c4-5d01-42a9-8aa6-69be06d5b967","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"Linear convergence of gradient and proximal- gradient methods under the polyak- lojasiewicz condition","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.11878","last_updated":"2026-07-13T17:57:45Z","snapshot_observed_at":"2026-07-29T20:59:50.579430Z","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":40,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:01486889b11f0c447b32edd1eb51061ca5dad9b67d21cd3e5281cc51c86ac3ba","observation_id":"e2422e61-913a-4fc8-9804-4fa2c4de32c1","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"Gradient descent with adaptive stepsize converges (nearly) linearly under fourth-order growth: D","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11878","last_updated":"2026-07-13T17:57:45Z","snapshot_observed_at":"2026-07-29T20:59:50.579430Z","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":41,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:f39480437a9606ea2cf21431f737ebc7a98b4c4b8bcc3b28d2ac7c4748be01e1","observation_id":"79444afe-d97f-42b8-8edb-4937722119b1","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"MacPhee, and Courtney Paquette","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.11878","last_updated":"2026-07-13T17:57:45Z","snapshot_observed_at":"2026-07-29T20:59:50.579430Z","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":42,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:e1ff4381a599bf0468c116eb95b32e9568773df2099bf738da6e4617bb4f1edf","observation_id":"d7d71476-3aa1-4c5b-ae26-e9c41b902deb","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"Stochastic algorithms with geometric step decay converge linearly on sharp functions.Mathematical Programming, 207(1):145–190, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.11878","last_updated":"2026-07-13T17:57:45Z","snapshot_observed_at":"2026-07-29T20:59:50.579430Z","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":43,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:f8b26af9bb4ae9b50ee111ecf54b9576ad76b6a58ca011976d845d7804a5c7f5","observation_id":"7521413d-2e68-4ae8-9334-e8efe72164ef","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"A superlinearly convergent subgradient method for sharp semismooth problems.Mathematics of Operations Research, 49(3):1678–1709, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.11878","last_updated":"2026-07-13T17:57:45Z","snapshot_observed_at":"2026-07-29T20:59:50.579430Z","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":44,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:eba1bd92e6fe47b9b680634b8527928f52a618cb8e8d8eb717d8d02aed660a8d","observation_id":"9e0ccbc5-24f6-429c-a25d-4b95972382d1","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"Survey descent: A multipoint generalization of gradient descent for nonsmooth optimization.SIAM Journal on Optimization, 33(1):36–62, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.11878","last_updated":"2026-07-13T17:57:45Z","snapshot_observed_at":"2026-07-29T20:59:50.579430Z","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":45,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:621ca591dcaa28feebc6ea11c6dff06dbb89bbaa6e9427a5e96e257dfb578a4d","observation_id":"f81294b5-1979-4672-9db6-ab90ce335188","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"A local nearly linearly convergent first-order method for nonsmooth functions with quadratic growth.Foundations of Computational Mathematics, 25(3):943–1024, 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-07-29T20:59:50.579430Z","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":46,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:2e6a42a3e666030c44a05b19b10431531af42a68f8541f3425b07e35617a94bb","observation_id":"ff1b8d8f-91d9-49a6-9c38-d0a8e355c137","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"Lipschitz minimization and the goldstein modulus: S","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11878","last_updated":"2026-07-13T17:57:45Z","snapshot_observed_at":"2026-07-29T20:59:50.579430Z","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":47,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:f6cfc2ceb62eaffe1cc1c91eafd4cadf9fb04387575c7011e08a1beb648b114f","observation_id":"54d7e3a9-90d3-416a-91c3-f3efcdc2b178","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"}},{"citation":{"cited_paper":{"arxiv_id":"2505.07143","last_updated":"2025-05-11T23:03:45Z","snapshot_observed_at":"2026-07-06T21:22:17.145779Z","submitted_at":"2025-05-11T23:03:45Z","title":"Subgradient Regularization: A Descent-Oriented Subgradient Method for Nonsmooth Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.07143","snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"Subgradient regularization: A descent-oriented subgradient method for nonsmooth optimization.arXiv preprint arXiv:2505.07143, 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-07-29T20:59:50.579430Z","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":48,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"cited_paper":"/paper/2505.07143","citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:814fedacb3f2e2e2b61c31ad607d724d69ed0d8361d4db73e28cf307a3ce1516","observation_id":"f2df2f9c-cf3d-4f3a-9485-491485d70129","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"}},{"citation":{"cited_paper":{"arxiv_id":"2507.19465","last_updated":"2025-07-25T17:50:43Z","snapshot_observed_at":"2026-08-06T14:13:44.482561Z","submitted_at":"2025-07-25T17:50:43Z","title":"Linearly Convergent Algorithms for Nonsmooth Problems with Unknown Smooth Pieces","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.19465","snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"Linearly convergent algorithms for nonsmooth problems with unknown smooth pieces.arXiv preprint arXiv:2507.19465, 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-07-29T20:59:50.579430Z","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":49,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"cited_paper":"/paper/2507.19465","citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:4128e2272d5c1ff6a72f92e7bd1a1e652f8920e54aac2af7b246ddaa79ded10b","observation_id":"c74d5c47-bd34-4d59-b317-6bbada407cde","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"}},{"citation":{"cited_paper":{"arxiv_id":"2601.14680","last_updated":"2026-06-02T02:28:42Z","snapshot_observed_at":"2026-08-05T07:22:40.350255Z","submitted_at":"2026-01-21T05:51:32Z","title":"Accelerated Prox-Level Methods for Unknown Piecewise-Smooth Optimization I: Convex Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2601.14680","snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"Accelerated prox-level methods for unknown piecewise-smooth optimization I: Convex optimization.arXiv preprint arXiv:2601.14680, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.11878","last_updated":"2026-07-13T17:57:45Z","snapshot_observed_at":"2026-07-29T20:59:50.579430Z","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":50,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"cited_paper":"/paper/2601.14680","citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:2d425dde4f94cd88e997ab3e7d2b620023bba5d4dc5c80519ac44636bc2c2513","observation_id":"fd14b02e-4fec-4b21-892b-995726864822","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"Springer, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.11878","last_updated":"2026-07-13T17:57:45Z","snapshot_observed_at":"2026-07-29T20:59:50.579430Z","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":51,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:9e4feb9e082e2d64a4062d17b0b04a5dd3fe6242fa047c4db6018a2ae2b94b35","observation_id":"13d3c675-a10c-4715-90d2-6de37e7dcb1e","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"Dual subgradient algorithms for large- scale nonsmooth learning problems.Mathematical Programming, 148(1-2):143–180, December 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.11878","last_updated":"2026-07-13T17:57:45Z","snapshot_observed_at":"2026-07-29T20:59:50.579430Z","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":52,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:283738f360630b8598af781e14dbad325f9ce26abeaa61aa605a55815f52e6a8","observation_id":"7a79a6ce-b8db-4380-bce5-857510c015d5","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"Springer Science & Business Media, 2003","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.11878","last_updated":"2026-07-13T17:57:45Z","snapshot_observed_at":"2026-07-29T20:59:50.579430Z","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":53,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:9dbcd2112635767647d54e16216710bfd6d4795382c41669e92c2b7dde04a464","observation_id":"f3d23c75-a184-46c5-b0e9-dca8b228065f","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"Lower complexity bounds for minimizing regularized functions.Optimization Letters, 19(9):1759–1778, 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-07-29T20:59:50.579430Z","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":54,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:e8be3e8262ee0fa9e369729d1dc1936c8af253f712033efbe86347fa299d2018","observation_id":"28f32cff-9d33-45d8-92fe-ccfcbc8d77a4","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"}},{"citation":{"cited_paper":{"arxiv_id":"2104.10196","last_updated":"2023-01-08T17:19:41Z","snapshot_observed_at":"2026-07-06T11:02:11.424356Z","submitted_at":"2021-04-20T18:31:22Z","title":"General Holder Smooth Convergence Rates Follow From Specialized Rates Assuming Growth Bounds","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.10196","snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"General H¨ older smooth convergence rates follow from specialized rates assuming growth bounds.arXiv preprint arXiv:2104.10196, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.11878","last_updated":"2026-07-13T17:57:45Z","snapshot_observed_at":"2026-07-29T20:59:50.579430Z","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":55,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"cited_paper":"/paper/2104.10196","citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:85cad28ce80ecea71325c8b32ef04ef1828eb44cee7548b130856a7cdbb6474d","observation_id":"d26bafff-2018-45af-8e69-18fe05b37503","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"Linearly convergent algorithms for nonsmooth problems with unknown smooth pieces, 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-07-29T20:59:50.579430Z","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":56,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:112929b5222a3493243a872856c24dd00a7fe425c5f08202cd6aebd0d72188ca","observation_id":"3f30fd27-c506-44e8-80cd-81aa000fa17c","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"}}],"paper":{"arxiv_id":"2607.11878","last_updated":"2026-07-13T17:57:45Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-07-29T20:59:50.579430Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness"},"reference_resolution":{"displayed":56,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":56,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":56},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 56 of 56 outbound references and 0 inbound Pith citation observations for arXiv:2607.11878."}