{"as_of":"2026-08-10T06:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4c5a1ebe3f5661602adaed8189989af35b8d979444e49211489dab0b4064a833","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-10T06:31:04.303077+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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:c746babcca2e5699d489957384ad2ce7bca9a60e2fd2148a23d582f33259ca87","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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:2c70b6b34272d4d06e38cd7b13ccabc5a9bc53f049a793d93a56f8dfc7333884","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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:ab89b962454775c5caa301f51c7f5ac4bf3f948fe942f36a7a257ee17352ea1d","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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:e7ddf16a7bb3def46b48a77fdb35f6ed455ccf2aec9c5c489c5c7711dfda8214","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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:24dd20f27365eb8168c502b0e00effd8affeccd38e6d3db489d5e714efcd5f47","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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:bfc89b4596e225d3924b84e254efc9483525401f492b9ad953c809690ce6be7c","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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:cc849516bb694783f5104877a4a6506368af667f211c1cfdcee24c6c436956a9","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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:08003895a8414639d76c6e8babf307925bbac9d340eb0f5839d553b750361775","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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":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:7235db6777c96635ba49aa9fc2a834418f8de9e9d8e839f2b2a056c424184c03","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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:f3227cf890d132e288fdadde64d50f80eec3a6e886392df0e5ad3f89ad841b54","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-08-07T15:44:31.705808Z","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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":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:f9255b8439f3793e2cbc144209144c5ac5bd7028f11f5e2b85f8037fe8103222","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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":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:431ae516cf705552afb3ad284592e4d6fe3dfd5024115634b24f7dec89991225","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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":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:ccc50882f8c0d06d4bb47cadcd0413532c1c7d835d9e59bbeb8127614870f03c","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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:0aacd14727fabf5fb88f7eaa9bf68deca564428efeb0e7c4d4cd161d2923cffa","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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:41987b41c666d741784d127e8b620d74c5e0f43e049395c47212df1194757efd","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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:c840ffff1e9614ea437b358bc382b86294e301de0836f3cc736185b977967867","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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":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:e7cb93aadef8752d62f3bc9e22737f70d6ef029f800c660c66bae5942ca30a19","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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":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:cb4f0920bcf2498f83233e4e54df1ceddf1fa0302b78d950207b52aa5adb5a56","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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":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:c60cbff0ec20ecd0c3727530dee2b7eee936175e51be1f76913333443b062e25","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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":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:409e821d6e638f29f96cd899637f1d461e9d82497b29f053bcc54bd29f0b54cb","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-09T11:05:20.331803Z","submitted_at":"2025-07-13T23:07:45Z","title":"Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.09823","snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"Nesterov finds graal: Optimal and adaptive gradient method for convex optimization.arXiv preprint arXiv:2507.09823, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11878","last_updated":"2026-07-13T17:57:45Z","snapshot_observed_at":"2026-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"cited_paper":"/paper/2507.09823","citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:e3e81776dddca29f9f1c39c07c763061ed92691f0fe3b2e50e4b3cae93b27620","observation_id":"beff8048-984b-4cdb-adc0-e7124c25b11e","resolution":{"observed_at":"2026-07-14T02:28:43.704810Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:b458da38f19d56a5b11c00656cfd2a8db99f86b23f5f1ad6fec234162d2ba473","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-08T12:57:13.685018Z","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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":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:561d9d3b53b0166c58efea2efd03ac6d7c8b516edf848e807da62afce0c47c67","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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":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:998c3ade7f977f1147ca3eb6ba51d6e9889b460c4a762d674be46b8e3fb328ee","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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:7a5e6bebe43f8b773abaa8997e6a80c7e621eee5295cf5dbdfc0bbd7f291c08f","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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:302fb8cfc1c5bd1c4d8c5a7616468f5e7ab7b6850f5d4783f8d643cef06dedb8","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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:8e878f2dc50751f5d5607b2f0644455c488d81ebc0f8a4a531eacff6d95c4065","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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:9dd33987c577fcc8ef220d99647bd8edbc765b8412db7c1b0ffd42a15fb36b4a","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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:3ed6b6ef5cacf6091b38e10b3da6ed6d9ab9fdbf99bf756da9d6a454f3e4d298","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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:f9dff008d3fcd8e44f9e86ca7d6c833dad2619d5907f50034b7f35fa340f6a91","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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:989ff32a5a285cec2cc20212be894ccad0a313c3af63273b915c4097e1de1727","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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:a3a26b17b4e098ddb9116dc464491beaf0ce208d4f4042c0496d0ed91351750f","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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:9f61c0ed55244789be8c6f46a040d172141c7cfaa16e8bc6fedbac53e2c0f77c","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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:7a471fbe4cf862d179b0e0fbedf61e5e25b660a76241a73420a6e099b130c0f2","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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":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:fd71b0890664dc02cd86bf5c89ffbab7e10c00489603f53f9e56fec19ff88124","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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:3a98b1a1537c7d8970f190cc9f406902c5c816329f8647a2fbf5ab5e566f5aca","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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:accee5403af3b52ce906525fc9eb76e6409f66dae262008c1677ad0791223826","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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:7ef49b5a0f7e376520b1d4e68de250f2999d1429564420b70bab0403390dd7c5","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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:a20a2c0f3a1fd8032751909d40bd0d559f316f5a8e2d9485cb6133ef83c6d847","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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:d54bb3b50ac9c18e793c93594542649a07b3a9277099bf9422f0c514e25b46ab","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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:ba3cbd008275d049b0b4a6e3f642feb4def7734dbef953815394a6aba1e54ca4","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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:822126f720a687ff7449f075a7f638c30d2265f3aa2eef5d6fbaebebbddd6a88","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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:af01c67be8a572c21fe9782a365aa2783e5c2cf58a9a0a836e3147c94a09997c","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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:f0a4737fe7ca58425bcb7734ec8ecedb3e61b83f8880990efa5ce70a2e5ba7bb","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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:c73243b67706232cc1fdcaa83acbacfc16d8498498a214699d4c53ce6c00124a","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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:6a7fdacbee0048ccc32953d71b4867c791c7a366dcc2ffbce34727b7cf00f6e4","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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:05ce5dcc629567a75a5e20a64723e6b00f522c7694c39428731009285fa7ed9f","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-08-07T15:48:01.784842Z","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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":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:0982b484878080caf861dfd8590a9745593568b864c6bf123d4c097f8fd608f2","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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":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:b640c93c9b0f9eedcfa63149c68c07b10a8236c325ba3a563f7c90ee980f13af","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-10T00:17:40.274611Z","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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":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:ec39744c99ec0b2bc50e74ecb1e30fe009a81ea62fb537afdc8bbbb428e0edcd","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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:5f4e2c5efc48fd815bc73609956b871711535d1d8d3d27aa513b170334dd569e","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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:e5277bff15060d63b2b911dfceb31bfbfd18e374e0737e500fbd6da6ecb474fb","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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:a1581471e80ea5607cd4eddbe645b353321f2a3b3baa7c2d8dedc3583fe8739d","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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:d93eff515f60098b057d2d7679ce24ae420aff174172698a8a165420b45ea4b9","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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":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:629afb23d9bcd993ad9e43ce7234fb3546f1c124ae222dfb41ff02ebefaaacf7","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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:7ac05e611042165c9f037e9e6265f370986e1b30fe2b90dba557398de97c6c48","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-08-09T23:38:25.595702Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 56 of 56 outbound references and 0 inbound Pith citation observations for arXiv:2607.11878."}