{"as_of":"2026-08-07T16:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4bef99487c561dc52ad3e49310e4b419524f9a487f23b2b441cbd6f11dce93a9","coverage":[{"denominator":36,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":36,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-13T04:58:09.207999Z","state":"measured"},{"denominator":36,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":36,"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.09167/citation-record","integrity":"/paper/2607.09167/integrity","json":"/paper/2607.09167/citation-record.json","paper":"/paper/2607.09167"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T04:58:09.207999Z","title":"The exact worst-case conver- gence rate of the gradient method with fixed step lengths for L-smooth functions.Optimization Letters, 16(6):1649–1661, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.09167","last_updated":"2026-07-10T07:52:01Z","snapshot_observed_at":"2026-08-07T12:16:39.890395Z","submitted_at":"2026-07-10T07:52:01Z","title":"Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-13T04:58:09.207999Z"},"links":{"citing_paper":"/paper/2607.09167"},"observation_digest":"sha256:809b6e97531b1cb60cdd21c03c5c837239a958416e2fd5470febef366ed40079","observation_id":"3c1445de-4521-41e0-81cc-2a0d2450a764","resolution":{"observed_at":"2026-07-13T04:58:09.207999Z","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-13T04:58:09.207999Z","title":"General framework for online-to- nonconvex conversion: Schedule-free SGD is also effective for nonconvex optimization","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.09167","last_updated":"2026-07-10T07:52:01Z","snapshot_observed_at":"2026-08-07T12:16:39.890395Z","submitted_at":"2026-07-10T07:52:01Z","title":"Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-13T04:58:09.207999Z"},"links":{"citing_paper":"/paper/2607.09167"},"observation_digest":"sha256:309be39db947493d8991b39df4be7ae54a32c74fae165c743fbdf3c4eeba1c05","observation_id":"41479527-9518-4b55-af31-fa113d60fd6d","resolution":{"observed_at":"2026-07-13T04:58:09.207999Z","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-13T04:58:09.207999Z","title":"Duchi, Dylan J","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.09167","last_updated":"2026-07-10T07:52:01Z","snapshot_observed_at":"2026-08-07T12:16:39.890395Z","submitted_at":"2026-07-10T07:52:01Z","title":"Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-13T04:58:09.207999Z"},"links":{"citing_paper":"/paper/2607.09167"},"observation_digest":"sha256:9bf298e837bea2c01af58b797e95dce5e446f9ba63803056a6c7299b0811264d","observation_id":"465627dc-a41f-490e-b7d4-061a583e1176","resolution":{"observed_at":"2026-07-13T04:58:09.207999Z","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-13T04:58:09.207999Z","title":"Analysis of Schedule-Free non-convex optimiza- tion","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.09167","last_updated":"2026-07-10T07:52:01Z","snapshot_observed_at":"2026-08-07T12:16:39.890395Z","submitted_at":"2026-07-10T07:52:01Z","title":"Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-13T04:58:09.207999Z"},"links":{"citing_paper":"/paper/2607.09167"},"observation_digest":"sha256:72df49b29c3e005edcca9760cf90dc0610f4959f0e580c6a6eee40a28981640a","observation_id":"1b545073-6859-45b1-a418-8b10236c7caa","resolution":{"observed_at":"2026-07-13T04:58:09.207999Z","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-13T04:58:09.207999Z","title":"Duchi, Oliver Hinder, and Aaron Sidford","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.09167","last_updated":"2026-07-10T07:52:01Z","snapshot_observed_at":"2026-08-07T12:16:39.890395Z","submitted_at":"2026-07-10T07:52:01Z","title":"Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-13T04:58:09.207999Z"},"links":{"citing_paper":"/paper/2607.09167"},"observation_digest":"sha256:b8abb2709a51b292707d5d4785ff7d4150e185fe6c986b419f22a95d22ed732c","observation_id":"af6dfdb9-685f-4d43-b04b-f8462807d15f","resolution":{"observed_at":"2026-07-13T04:58:09.207999Z","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-13T04:58:09.207999Z","title":"Zico Kolter, and Ameet Talwalkar","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.09167","last_updated":"2026-07-10T07:52:01Z","snapshot_observed_at":"2026-08-07T12:16:39.890395Z","submitted_at":"2026-07-10T07:52:01Z","title":"Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-13T04:58:09.207999Z"},"links":{"citing_paper":"/paper/2607.09167"},"observation_digest":"sha256:df82dfc22acb53f846e06ed410975ed21b1dd33055567f524b042f123115c367","observation_id":"b8a6ef9d-b4cd-47d1-9490-54f466866382","resolution":{"observed_at":"2026-07-13T04:58:09.207999Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.07179","last_updated":"2025-06-18T11:00:36Z","snapshot_observed_at":"2026-07-06T15:41:35.923624Z","submitted_at":"2023-06-12T15:21:02Z","title":"Benchmarking Neural Network Training Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.07179","snapshot_observed_at":"2026-07-13T04:58:09.207999Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.09167","last_updated":"2026-07-10T07:52:01Z","snapshot_observed_at":"2026-08-07T12:16:39.890395Z","submitted_at":"2026-07-10T07:52:01Z","title":"Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-13T04:58:09.207999Z"},"links":{"cited_paper":"/paper/2306.07179","citing_paper":"/paper/2607.09167"},"observation_digest":"sha256:a072570e765aea48a346593cad07b8229a07b5b5d277bf4cb1ab091a184042fc","observation_id":"0a55b7ef-b1d6-4535-8ab8-e35fd122714c","resolution":{"observed_at":"2026-07-13T04:58:09.207999Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2010.00406","last_updated":"2021-06-01T17:53:38Z","snapshot_observed_at":"2026-08-05T12:04:05.058060Z","submitted_at":"2020-10-01T13:46:32Z","title":"Momentum via Primal Averaging: Theoretical Insights and Learning Rate Schedules for Non-Convex Optimization","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.00406","snapshot_observed_at":"2026-07-13T04:58:09.207999Z","title":"Momentum via primal averaging: Theoretical insights and learning rate schedules for non-convex optimization.arXiv preprint arXiv:2010.00406, 2020","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.09167","last_updated":"2026-07-10T07:52:01Z","snapshot_observed_at":"2026-08-07T12:16:39.890395Z","submitted_at":"2026-07-10T07:52:01Z","title":"Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-13T04:58:09.207999Z"},"links":{"cited_paper":"/paper/2010.00406","citing_paper":"/paper/2607.09167"},"observation_digest":"sha256:cc1ba74771178858a012d430d2948148f8621092a506a4f5ecfb479ed2ffacda","observation_id":"0f0c96b3-181e-48ca-b41a-c414d3cbe6b2","resolution":{"observed_at":"2026-07-13T04:58:09.207999Z","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-13T04:58:09.207999Z","title":"The road less scheduled.Advances in Neural Information Processing Systems, 37, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.09167","last_updated":"2026-07-10T07:52:01Z","snapshot_observed_at":"2026-08-07T12:16:39.890395Z","submitted_at":"2026-07-10T07:52:01Z","title":"Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-13T04:58:09.207999Z"},"links":{"citing_paper":"/paper/2607.09167"},"observation_digest":"sha256:c6c4d03ad2055880d8bf0f6c8d1110822efa410ef8504d73ddb06c83dc22dac2","observation_id":"5ba1628b-61c0-4694-8078-7a87494d7d61","resolution":{"observed_at":"2026-07-13T04:58:09.207999Z","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-13T04:58:09.207999Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.09167","last_updated":"2026-07-10T07:52:01Z","snapshot_observed_at":"2026-08-07T12:16:39.890395Z","submitted_at":"2026-07-10T07:52:01Z","title":"Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-13T04:58:09.207999Z"},"links":{"citing_paper":"/paper/2607.09167"},"observation_digest":"sha256:c7b711b983fe0627e88d3ce2b1ef9283263db4176a5af52bfa94dd89e8a55ddf","observation_id":"772e9ccb-e639-4ea7-9e2a-e448f82fe6d2","resolution":{"observed_at":"2026-07-13T04:58:09.207999Z","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-13T04:58:09.207999Z","title":"The complexity of finding stationary points with stochastic gradient descent","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.09167","last_updated":"2026-07-10T07:52:01Z","snapshot_observed_at":"2026-08-07T12:16:39.890395Z","submitted_at":"2026-07-10T07:52:01Z","title":"Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-13T04:58:09.207999Z"},"links":{"citing_paper":"/paper/2607.09167"},"observation_digest":"sha256:4ada0bcfdb521a5bd3197bee7511522b7eb69fc95c770e65d1bb1d4db76f28a7","observation_id":"912dba95-d907-42ef-9fb8-959781bf570a","resolution":{"observed_at":"2026-07-13T04:58:09.207999Z","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-13T04:58:09.207999Z","title":"Performance of first-order methods for smooth convex mini- mization: a novel approach.Mathematical Programming, 145(1):451–482, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.09167","last_updated":"2026-07-10T07:52:01Z","snapshot_observed_at":"2026-08-07T12:16:39.890395Z","submitted_at":"2026-07-10T07:52:01Z","title":"Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-13T04:58:09.207999Z"},"links":{"citing_paper":"/paper/2607.09167"},"observation_digest":"sha256:b62b3473335864617fac384cecf5408868a959d163257e4cd90f92467b5da3b9","observation_id":"631b0d67-d679-4b1c-a18b-929372b79b12","resolution":{"observed_at":"2026-07-13T04:58:09.207999Z","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-13T04:58:09.207999Z","title":"Stochastic first-and zeroth-order methods for nonconvex stochastic programming.SIAM Journal on Optimization, 23(4):2341–2368, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.09167","last_updated":"2026-07-10T07:52:01Z","snapshot_observed_at":"2026-08-07T12:16:39.890395Z","submitted_at":"2026-07-10T07:52:01Z","title":"Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-13T04:58:09.207999Z"},"links":{"citing_paper":"/paper/2607.09167"},"observation_digest":"sha256:fa4b1a137065353d72740eb37cecb401b885cc9a787f505be42529026ef3da27","observation_id":"4d582068-8d61-4301-91f7-7af178250786","resolution":{"observed_at":"2026-07-13T04:58:09.207999Z","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-13T04:58:09.207999Z","title":"Hendrickx, Adrien B","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.09167","last_updated":"2026-07-10T07:52:01Z","snapshot_observed_at":"2026-08-07T12:16:39.890395Z","submitted_at":"2026-07-10T07:52:01Z","title":"Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-13T04:58:09.207999Z"},"links":{"citing_paper":"/paper/2607.09167"},"observation_digest":"sha256:a171f49f6fd4f362eb0cca80bd2a2a09d581d76ac53560b7f4b95025a2f74c8f","observation_id":"8a5f73ef-244b-4caf-9ba3-a16d0e554f5e","resolution":{"observed_at":"2026-07-13T04:58:09.207999Z","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-13T04:58:09.207999Z","title":"Vetrov, and Andrew Gordon Wilson","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.09167","last_updated":"2026-07-10T07:52:01Z","snapshot_observed_at":"2026-08-07T12:16:39.890395Z","submitted_at":"2026-07-10T07:52:01Z","title":"Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-13T04:58:09.207999Z"},"links":{"citing_paper":"/paper/2607.09167"},"observation_digest":"sha256:18388b732adc65ae22bafb846a01b128354ac60066809090d4975cf57fcb7c42","observation_id":"c55cb825-b2df-4d6e-94fd-7d9cd02d74d5","resolution":{"observed_at":"2026-07-13T04:58:09.207999Z","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-13T04:58:09.207999Z","title":"Better theory for SGD in the nonconvex world.Transactions on Machine Learning Research, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.09167","last_updated":"2026-07-10T07:52:01Z","snapshot_observed_at":"2026-08-07T12:16:39.890395Z","submitted_at":"2026-07-10T07:52:01Z","title":"Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-13T04:58:09.207999Z"},"links":{"citing_paper":"/paper/2607.09167"},"observation_digest":"sha256:70a85fbe182651194c75bc04d07d3a7f49f7cd16fd7724405cce3ab9fe14488d","observation_id":"af612877-dc38-4ff5-b2f1-94a9a45d802d","resolution":{"observed_at":"2026-07-13T04:58:09.207999Z","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-13T04:58:09.207999Z","title":"Kingma and Jimmy Lei Ba","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.09167","last_updated":"2026-07-10T07:52:01Z","snapshot_observed_at":"2026-08-07T12:16:39.890395Z","submitted_at":"2026-07-10T07:52:01Z","title":"Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-13T04:58:09.207999Z"},"links":{"citing_paper":"/paper/2607.09167"},"observation_digest":"sha256:75e3bbc09acc821b0749844e939a3e49ec0cb9d073c59841a11b1ecdeaab75c9","observation_id":"0cb09fa6-2767-4607-9500-9f7ab67cf4cd","resolution":{"observed_at":"2026-07-13T04:58:09.207999Z","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-13T04:58:09.207999Z","title":"Lee, Ioannis Panageas, Georgios Piliouras, Max Simchowitz, Michael I","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.09167","last_updated":"2026-07-10T07:52:01Z","snapshot_observed_at":"2026-08-07T12:16:39.890395Z","submitted_at":"2026-07-10T07:52:01Z","title":"Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-13T04:58:09.207999Z"},"links":{"citing_paper":"/paper/2607.09167"},"observation_digest":"sha256:e8d262e9a2c0755399efe06c1a3df5a1d52f8522af2577bcf6c37e6f1c00a2ab","observation_id":"94d87cd3-11e9-47f4-ba0c-3063bff34bd9","resolution":{"observed_at":"2026-07-13T04:58:09.207999Z","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-13T04:58:09.207999Z","title":"Loss landscapes and optimization in over- parameterized non-linear systems and neural networks.Applied and Computational Harmonic Analysis, 59:85–116, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.09167","last_updated":"2026-07-10T07:52:01Z","snapshot_observed_at":"2026-08-07T12:16:39.890395Z","submitted_at":"2026-07-10T07:52:01Z","title":"Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-13T04:58:09.207999Z"},"links":{"citing_paper":"/paper/2607.09167"},"observation_digest":"sha256:20b63ea7014a8f71f608aac9ad404d586db4a790f23aeb61a088f249e5db2183","observation_id":"97cb24f2-0bb1-4df1-b79f-3fb33fb1a605","resolution":{"observed_at":"2026-07-13T04:58:09.207999Z","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-13T04:58:09.207999Z","title":"Decoupled weight decay regularization","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.09167","last_updated":"2026-07-10T07:52:01Z","snapshot_observed_at":"2026-08-07T12:16:39.890395Z","submitted_at":"2026-07-10T07:52:01Z","title":"Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-13T04:58:09.207999Z"},"links":{"citing_paper":"/paper/2607.09167"},"observation_digest":"sha256:53eb20b6d818e5543ecd262aa9d18fed7a86cefe6f1697ebb64a84917446e174","observation_id":"ee9fdcaa-e780-4f8b-994a-2c83bb3d3b60","resolution":{"observed_at":"2026-07-13T04:58:09.207999Z","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-13T04:58:09.207999Z","title":"Exponential moving average of weights in deep learning: Dynamics and benefits.Transactions on Machine Learning Research, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.09167","last_updated":"2026-07-10T07:52:01Z","snapshot_observed_at":"2026-08-07T12:16:39.890395Z","submitted_at":"2026-07-10T07:52:01Z","title":"Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-13T04:58:09.207999Z"},"links":{"citing_paper":"/paper/2607.09167"},"observation_digest":"sha256:8fb7d5b93b599551a5110af56619ad01be1bd6ebaeae9a5b876b90e8bb4dabb4","observation_id":"68135acb-3b5d-47ec-840b-ce8077fd8788","resolution":{"observed_at":"2026-07-13T04:58:09.207999Z","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-13T04:58:09.207999Z","title":"Connections between Schedule- Free optimizers and accelerated SGD variants","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.09167","last_updated":"2026-07-10T07:52:01Z","snapshot_observed_at":"2026-08-07T12:16:39.890395Z","submitted_at":"2026-07-10T07:52:01Z","title":"Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-13T04:58:09.207999Z"},"links":{"citing_paper":"/paper/2607.09167"},"observation_digest":"sha256:66eef7532c12fa64736cdde2ebb98c973bb2bdad7a937774569beb15ec94d71c","observation_id":"fb99c1f4-ee91-4d45-b5bb-1f7c028d55d8","resolution":{"observed_at":"2026-07-13T04:58:09.207999Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2603.02782","last_updated":"2026-05-04T09:06:30Z","snapshot_observed_at":"2026-07-06T22:47:37.679205Z","submitted_at":"2026-03-03T09:21:00Z","title":"A non-autonomous center-stable set theorem for saddle avoidance in optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2603.02782","snapshot_observed_at":"2026-07-13T04:58:09.207999Z","title":"A non-autonomous center-stable set theorem for saddle avoidance in optimization.arXiv preprint arXiv:2603.02782, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.09167","last_updated":"2026-07-10T07:52:01Z","snapshot_observed_at":"2026-08-07T12:16:39.890395Z","submitted_at":"2026-07-10T07:52:01Z","title":"Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-13T04:58:09.207999Z"},"links":{"cited_paper":"/paper/2603.02782","citing_paper":"/paper/2607.09167"},"observation_digest":"sha256:72b29602fe08f87fde3f2db960731dee17aae5df1aaec0c770d5a23fc2b7b483","observation_id":"ccfaa9d3-95ab-4baa-8c94-73276766c525","resolution":{"observed_at":"2026-07-13T04:58:09.207999Z","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-13T04:58:09.207999Z","title":"Quasi-monotone subgradient methods for nonsmooth convex minimization.Journal of Optimization Theory and Applications, 165(3):917–940, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.09167","last_updated":"2026-07-10T07:52:01Z","snapshot_observed_at":"2026-08-07T12:16:39.890395Z","submitted_at":"2026-07-10T07:52:01Z","title":"Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-13T04:58:09.207999Z"},"links":{"citing_paper":"/paper/2607.09167"},"observation_digest":"sha256:869461b665aa9f3154e8fced3cf1a37d74a4db97a2d64bf6fb2fe3e3f1b8a349","observation_id":"9c7faeb9-82cf-417f-983d-15e2cdd21695","resolution":{"observed_at":"2026-07-13T04:58:09.207999Z","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-13T04:58:09.207999Z","title":"Iterate averaging as regularization for stochastic gradient descent","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.09167","last_updated":"2026-07-10T07:52:01Z","snapshot_observed_at":"2026-08-07T12:16:39.890395Z","submitted_at":"2026-07-10T07:52:01Z","title":"Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-13T04:58:09.207999Z"},"links":{"citing_paper":"/paper/2607.09167"},"observation_digest":"sha256:eab87441628db34cb229349477bab221d8a02a99d25918195c77ee8d69263562","observation_id":"9fd86724-a89d-4b26-adcd-12c498091e13","resolution":{"observed_at":"2026-07-13T04:58:09.207999Z","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-13T04:58:09.207999Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.09167","last_updated":"2026-07-10T07:52:01Z","snapshot_observed_at":"2026-08-07T12:16:39.890395Z","submitted_at":"2026-07-10T07:52:01Z","title":"Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-13T04:58:09.207999Z"},"links":{"citing_paper":"/paper/2607.09167"},"observation_digest":"sha256:1be6d792f0c9325c7fbb321f3d6e3591d6f744ccfe25f9b901ab888a9453b8b6","observation_id":"b38c2ee9-8195-421a-898d-c7a3749540b8","resolution":{"observed_at":"2026-07-13T04:58:09.207999Z","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-13T04:58:09.207999Z","title":null,"venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2607.09167","last_updated":"2026-07-10T07:52:01Z","snapshot_observed_at":"2026-08-07T12:16:39.890395Z","submitted_at":"2026-07-10T07:52:01Z","title":"Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-13T04:58:09.207999Z"},"links":{"citing_paper":"/paper/2607.09167"},"observation_digest":"sha256:371ed7aabdaaa96402019b0af70ff0e6745419bce314c2e2015894e65e2bcbee","observation_id":"5744f804-8a3c-4483-9e81-5624d6be56df","resolution":{"observed_at":"2026-07-13T04:58:09.207999Z","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-13T04:58:09.207999Z","title":"Efficient estimations from a slowly convergent Robbins–Monro process","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2607.09167","last_updated":"2026-07-10T07:52:01Z","snapshot_observed_at":"2026-08-07T12:16:39.890395Z","submitted_at":"2026-07-10T07:52:01Z","title":"Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-13T04:58:09.207999Z"},"links":{"citing_paper":"/paper/2607.09167"},"observation_digest":"sha256:e38f68c7471242f22399f8d4ad44fe981cd5a4ce972c5de6270437e35614d4a1","observation_id":"fe1f2437-f245-44a7-88ce-a4f842e8e417","resolution":{"observed_at":"2026-07-13T04:58:09.207999Z","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-13T04:58:09.207999Z","title":"Ryu, Adrien B","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.09167","last_updated":"2026-07-10T07:52:01Z","snapshot_observed_at":"2026-08-07T12:16:39.890395Z","submitted_at":"2026-07-10T07:52:01Z","title":"Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-13T04:58:09.207999Z"},"links":{"citing_paper":"/paper/2607.09167"},"observation_digest":"sha256:689e09add6f3e191b24b491de2519ccae352920c6f07d56ac5ba415201baf4f8","observation_id":"bd12b555-936e-479e-9df5-d67b62d0c8c7","resolution":{"observed_at":"2026-07-13T04:58:09.207999Z","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-13T04:58:09.207999Z","title":"Through the river: Under- standing the benefit of Schedule-Free methods for language model training.Advances in Neural Information Processing Systems, 38, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.09167","last_updated":"2026-07-10T07:52:01Z","snapshot_observed_at":"2026-08-07T12:16:39.890395Z","submitted_at":"2026-07-10T07:52:01Z","title":"Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-13T04:58:09.207999Z"},"links":{"citing_paper":"/paper/2607.09167"},"observation_digest":"sha256:df40345af32035c769a046edb756fcca8d068b5249cc364f7229710006e61ad8","observation_id":"13f3c193-2cd5-4927-82e5-044b1efca981","resolution":{"observed_at":"2026-07-13T04:58:09.207999Z","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-13T04:58:09.207999Z","title":"Primal averaging: A new gradient evaluation step to attain the optimal individual convergence.IEEE Transactions on Cybernetics, 50(2): 835–845, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.09167","last_updated":"2026-07-10T07:52:01Z","snapshot_observed_at":"2026-08-07T12:16:39.890395Z","submitted_at":"2026-07-10T07:52:01Z","title":"Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-13T04:58:09.207999Z"},"links":{"citing_paper":"/paper/2607.09167"},"observation_digest":"sha256:73589938bf26becb35037e81e8e56b2f43b9942b49062b0ee5404c4c60605d0d","observation_id":"b2147132-18b8-4771-a8c5-dfbfca01a72e","resolution":{"observed_at":"2026-07-13T04:58:09.207999Z","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-13T04:58:09.207999Z","title":"Taylor, Julien M","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.09167","last_updated":"2026-07-10T07:52:01Z","snapshot_observed_at":"2026-08-07T12:16:39.890395Z","submitted_at":"2026-07-10T07:52:01Z","title":"Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-13T04:58:09.207999Z"},"links":{"citing_paper":"/paper/2607.09167"},"observation_digest":"sha256:542351cc4a9e852954cd18b7775e88a3f806a2e98c6dc46a7ba095f7ee9c4faf","observation_id":"a0478881-c227-4f56-8687-b9086f3d91d1","resolution":{"observed_at":"2026-07-13T04:58:09.207999Z","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-13T04:58:09.207999Z","title":"Understanding warmup-stable-decay learning rates: A river valley loss landscape view","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.09167","last_updated":"2026-07-10T07:52:01Z","snapshot_observed_at":"2026-08-07T12:16:39.890395Z","submitted_at":"2026-07-10T07:52:01Z","title":"Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-13T04:58:09.207999Z"},"links":{"citing_paper":"/paper/2607.09167"},"observation_digest":"sha256:af36741c8a2e51c7ac2c6cbfffa0be20cfab88ec56be88c2a73f3a41c6933ba0","observation_id":"d048f239-426b-4751-8d73-45a822c5cb91","resolution":{"observed_at":"2026-07-13T04:58:09.207999Z","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-13T04:58:09.207999Z","title":"fast” variable zk and the “slow","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.09167","last_updated":"2026-07-10T07:52:01Z","snapshot_observed_at":"2026-08-07T12:16:39.890395Z","submitted_at":"2026-07-10T07:52:01Z","title":"Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-13T04:58:09.207999Z"},"links":{"citing_paper":"/paper/2607.09167"},"observation_digest":"sha256:b857fef68c39464af73091722c840579729a90edd6ef88caae8826e89701033e","observation_id":"730d4f6c-5460-4d2f-9d60-1918272ab2a1","resolution":{"observed_at":"2026-07-13T04:58:09.207999Z","resolver_source":null,"status":"malformed_identifier"},"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-13T04:58:09.207999Z","title":"Limitations","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09167","last_updated":"2026-07-10T07:52:01Z","snapshot_observed_at":"2026-08-07T12:16:39.890395Z","submitted_at":"2026-07-10T07:52:01Z","title":"Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-13T04:58:09.207999Z"},"links":{"citing_paper":"/paper/2607.09167"},"observation_digest":"sha256:87853a0e793ed17ce58fdb16069762938c876598342a89795b5e9c5187ee409d","observation_id":"5651ca7f-1ce2-4372-ad71-26ad000f1ea0","resolution":{"observed_at":"2026-07-13T04:58:09.207999Z","resolver_source":null,"status":"malformed_identifier"},"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-13T04:58:09.207999Z","title":"Guidelines: • The answer [N/A] means that the paper does not involve crowdsourcing nor research with human subjects","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09167","last_updated":"2026-07-10T07:52:01Z","snapshot_observed_at":"2026-08-07T12:16:39.890395Z","submitted_at":"2026-07-10T07:52:01Z","title":"Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-13T04:58:09.207999Z"},"links":{"citing_paper":"/paper/2607.09167"},"observation_digest":"sha256:da9e1ca149d392a4875bb1627dc9e9f0458521113d096c7d48ec3e633adba218","observation_id":"e744d2b6-04dc-49db-964d-6393943220eb","resolution":{"observed_at":"2026-07-13T04:58:09.207999Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.09167","last_updated":"2026-07-10T07:52:01Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T12:16:39.890395Z","submitted_at":"2026-07-10T07:52:01Z","title":"Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles"},"reference_resolution":{"displayed":36,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":34,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":36},"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 36 of 36 outbound references and 0 inbound Pith citation observations for arXiv:2607.09167."}