{"as_of":"2026-08-10T06:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:41deea160a265ba80b5644b089c5cc379ca006c173e23864790877908963ab47","coverage":[{"denominator":61,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":61,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T06:04:35.304379Z","state":"measured"},{"denominator":61,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":61,"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/2506.06606/citation-record","integrity":"/paper/2506.06606/integrity","json":"/paper/2506.06606/citation-record.json","paper":"/paper/2506.06606"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:04:34.945040Z","title":"Convex optimization with p -norm oracles","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:34.945040Z"},"links":{"citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:151d6992b0ab7ea62f91afdd98b07a90b19927d381b91b3a5eb6a45683bead20","observation_id":"60651609-461d-43fb-bb89-d2d24c632291","resolution":{"observed_at":"2026-08-07T06:04:34.945040Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.09201","last_updated":"2020-09-28T11:38:58Z","snapshot_observed_at":"2026-08-09T18:42:26.134438Z","submitted_at":"2019-05-22T15:45:24Z","title":"Adaptive norms for deep learning with regularized Newton methods","version":4},"cited_work":{"arxiv_id":"1905.09201","doi":null,"metadata_source":"pith","pith_arxiv_id":"1905.09201","snapshot_observed_at":"2026-08-07T06:04:35.410445Z","title":"Adaptive norms for deep learning with regularized Newton methods","venue":"cs.LG","work_id":"15e32a0f-360b-40c8-b7d8-052e4c6c33e8","year":2019},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.008446Z"},"links":{"cited_paper":"/paper/1905.09201","citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:be705160215543145c410a2ae473de690a1af19a931f3f55c90c63e89ea17fc7","observation_id":"f990c311-f84e-470e-8010-9bc933cf9828","resolution":{"observed_at":"2026-08-07T06:04:35.414165Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:04:36.004934Z","title":"J., Bartlett, P., and Ravikumar, P","venue":null,"work_id":"28b7d7bd-eab9-442b-964c-2bb18bf9d65c","year":2009},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.075331Z"},"links":{"citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:fb9b78de3b7f2799824016cd6bd8c682d9567f23dd41aafc4675adba0bf65dac","observation_id":"b58885f7-d044-4010-a398-2ee3875d6c7e","resolution":{"observed_at":"2026-08-07T06:04:36.008542Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:04:35.995522Z","title":"and Orecchia, L","venue":null,"work_id":"20ea6a96-1694-40f0-9d2a-69fa28061fa7","year":2017},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.106264Z"},"links":{"citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:f7b080ce810682c9100a7124cbad6295e31ba4acb4fc6b2ac6a1b99b26895bd5","observation_id":"f1f79f4d-32e0-4c1b-90ab-16af679b99b6","resolution":{"observed_at":"2026-08-07T06:04:35.998593Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:04:35.986080Z","title":"C., Foster, D","venue":null,"work_id":"a2d91818-2cb1-49d6-9668-04baa4485fd9","year":2023},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.122189Z"},"links":{"citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:8b15bd721b12553ee420b498ce4cf3366816e1ea82b7099747cd5e2bdc260f5a","observation_id":"aa510232-17ac-4a73-bd4f-2df933badee6","resolution":{"observed_at":"2026-08-07T06:04:35.989315Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.19200","last_updated":"2025-06-17T01:17:38Z","snapshot_observed_at":"2026-08-09T18:42:28.164906Z","submitted_at":"2024-09-28T01:21:03Z","title":"Faster Acceleration for Steepest Descent","version":3},"cited_work":{"arxiv_id":"2409.19200","doi":null,"metadata_source":"pith","pith_arxiv_id":"2409.19200","snapshot_observed_at":"2026-08-07T06:04:35.395034Z","title":"Faster Acceleration for Steepest Descent","venue":"math.OC","work_id":"d12407b1-fdac-4062-8ad5-bc576c1d5c2e","year":2024},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.125904Z"},"links":{"cited_paper":"/paper/2409.19200","citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:1e83082f164a8d7cc97eae615ac427f46bbd706a465ddf88c38f3f4f3f81fd17","observation_id":"099a6b8e-fdda-4629-bcbd-42390cfaa152","resolution":{"observed_at":"2026-08-07T06:04:35.399225Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:04:35.977175Z","title":"and Bullins, B","venue":null,"work_id":"fc0960b5-9ad3-47d2-8866-7d1cf44ffacc","year":2024},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.129525Z"},"links":{"citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:3f8ff56af171c2f8e36f742fcefc85d24afb9756fdef1486669b6569678fb973","observation_id":"d2ec0f4f-2c40-4161-b450-199ac84c6050","resolution":{"observed_at":"2026-08-07T06:04:35.980026Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:04:35.968024Z","title":"and Bullins, B","venue":null,"work_id":"d37f4c8b-d348-4213-86f9-6edb7a25bcbe","year":2025},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.132642Z"},"links":{"citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:4317fb62beab189c033d45aa6d1bec18939939d337daebd4f6866937adaae26d","observation_id":"1323b7c8-4786-407b-b3a8-2f663a4f5d93","resolution":{"observed_at":"2026-08-07T06:04:35.970860Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.08056","last_updated":"2020-02-19T08:45:54Z","snapshot_observed_at":"2026-08-09T23:45:52.241190Z","submitted_at":"2020-02-19T08:45:54Z","title":"The Geometry of Sign Gradient Descent","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.08056","snapshot_observed_at":"2026-08-07T06:04:35.135917Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.135917Z"},"links":{"cited_paper":"/paper/2002.08056","citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:ff718cd06f88b37b609def7a6e1225a203ea0a7e772ac30a08f167ed5d7488d8","observation_id":"8a7a798b-7578-496f-9e38-1b29fce794a4","resolution":{"observed_at":"2026-08-07T06:04:35.135917Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:04:35.958108Z","title":"signsgd: Compressed optimisation for non-convex problems","venue":null,"work_id":"1a9fe169-cc77-4955-9e94-255b4231805f","year":2018},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.139076Z"},"links":{"citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:91b4a0f52e22974685c6d3c3b8ebba4ca9833a40e1d6576c508df56c974fcaad","observation_id":"8d70d616-00c5-4b18-a506-685960d78b14","resolution":{"observed_at":"2026-08-07T06:04:35.961158Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:04:35.948528Z","title":"Highly smooth minimization of non-smooth problems","venue":null,"work_id":"57191189-9630-4c2b-89a0-74ee5f40eee8","year":2020},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.142733Z"},"links":{"citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:ad886bcc9c78d0a4e1bd13776f0be138e026e884f8d86045d6cc329f4f501e2e","observation_id":"88789d4c-dad6-4ebf-96bf-7547a746ee5e","resolution":{"observed_at":"2026-08-07T06:04:35.952035Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:04:35.939266Z","title":"Convex until proven guilty","venue":null,"work_id":"9c97f183-5322-4ccb-9e3e-d18449a407e3","year":2017},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.146069Z"},"links":{"citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:4e239c994bd36de9e2bb04f06b9351519075a588566e22b3c41d6401e4d078fb","observation_id":"4383bcfd-9de3-4bcc-8a14-5ba7a49b2c4a","resolution":{"observed_at":"2026-08-07T06:04:35.942386Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:04:35.930182Z","title":"Lion secretly solves a constrained optimization: As lyapunov predicts","venue":null,"work_id":"94179784-1813-48dd-903c-23e833dc85b8","year":2024},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.149496Z"},"links":{"citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:78f3062239a666d10307fb3ecabe187b8218bebe861d27f34bea479d8afbc53d","observation_id":"c0e099f5-b9c5-4dc6-a9d4-2bc89d9e5e7d","resolution":{"observed_at":"2026-08-07T06:04:35.933395Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:04:35.920530Z","title":"Symbolic discovery of optimization algorithms","venue":null,"work_id":"a7ae38a7-fd9d-42e6-8609-f591807d7404","year":2023},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.152493Z"},"links":{"citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:9b465221db1b4e8208a185c19d7e0b0759a10f6e15302b56e0e62f896365e2d6","observation_id":"8aa5925c-8a3e-4125-8755-68182e7f90e2","resolution":{"observed_at":"2026-08-07T06:04:35.923669Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:04:35.912000Z","title":"Z., and Talwalkar, A","venue":null,"work_id":"7962d12e-3192-484e-9287-11b2fe66b6c8","year":2021},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.155286Z"},"links":{"citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:08919cd835cc095c3efb7ad57885f3132676b97c99700d1cf91dbd5734f9db77","observation_id":"5dc4fbe6-e680-40ab-869a-1369a0424cba","resolution":{"observed_at":"2026-08-07T06:04:35.914989Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.08987","last_updated":"2025-02-06T13:58:38Z","snapshot_observed_at":"2026-07-06T19:50:01.724540Z","submitted_at":"2024-11-13T19:22:34Z","title":"Non-Euclidean High-Order Smooth Convex Optimization","version":2},"cited_work":{"arxiv_id":"2411.08987","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.08987","snapshot_observed_at":"2026-08-07T06:04:35.365718Z","title":"Non-Euclidean High-Order Smooth Convex Optimization","venue":"math.OC","work_id":"bdb6f5fb-67cd-47cb-9125-c024deec5d0c","year":2024},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.157999Z"},"links":{"cited_paper":"/paper/2411.08987","citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:2019c8856a20300ae82169c8eab746548abe28685ebe0598cd422f01cd9ce4ae","observation_id":"cbf2be42-3c36-46ad-a2ee-e619f210bcc9","resolution":{"observed_at":"2026-08-07T06:04:35.371066Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:04:35.902550Z","title":"The road less scheduled","venue":null,"work_id":"6c55aad7-7d01-4786-9e1b-3b7ca45c5d02","year":2024},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.161381Z"},"links":{"citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:559f777f2b234a401453fcd67275d771a98366e4fb535be42b2884f9d6f81780","observation_id":"402d6a1e-bb38-4d0e-8c9c-a38280f1eddb","resolution":{"observed_at":"2026-08-07T06:04:35.905674Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:04:35.892262Z","title":"A guide through the zoo of biased SGD","venue":null,"work_id":"f299dd8e-ce99-4486-b2bf-42f4164b0c77","year":2023},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.164583Z"},"links":{"citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:5d1218d5902192a311fd9a3a2078a371dbca143dea1e887cf76f9ab2d9e452e9","observation_id":"921698a9-4587-49a3-99be-58cb1da2d7e8","resolution":{"observed_at":"2026-08-07T06:04:35.895530Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:04:35.882498Z","title":"Imagenet: A large-scale hierarchical image database","venue":null,"work_id":"db9fcf70-39fa-493b-9af5-87b750a0f884","year":2009},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.167762Z"},"links":{"citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:f00119c6f95978e9e03b88dfa4589310b987012e0d3b944787a9040dfe678a53","observation_id":"14ae2d36-e11e-4b0f-bbde-77c06dd50227","resolution":{"observed_at":"2026-08-07T06:04:35.885923Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:04:35.872326Z","title":"and Guzm \\'a n, C","venue":null,"work_id":"1f9db10a-5ff9-44fe-bea9-a704df19586b","year":2024},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.171923Z"},"links":{"citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:850e1c56a7a0ea304d52ba893c46d8f49fd43b0ee84a94fa8ed8b1a45799f585","observation_id":"d6aa6c0a-d9f1-40bc-985e-49c89620ead0","resolution":{"observed_at":"2026-08-07T06:04:35.875649Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:04:35.862001Z","title":"and Orecchia, L","venue":null,"work_id":"877c4346-6ffc-4cb1-8c0f-90965101fbba","year":2019},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.175014Z"},"links":{"citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:01556c4816aa15ef5bc9a13fbb6bd21abd33551a4b37c36b3f603968862a847f","observation_id":"12ce543b-8ebc-4c40-b18a-800146c62d0b","resolution":{"observed_at":"2026-08-07T06:04:35.865332Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:04:35.851402Z","title":"Adaptive subgradient methods for online learning and stochastic optimization","venue":null,"work_id":"f0292a37-5046-4944-b174-07dc7511e541","year":2011},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.178115Z"},"links":{"citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:f6c579ba544a3c958cc808aeede402d0079e605bfabab5e493c09fdacbaf1332","observation_id":"feab8490-90b0-4bef-98d6-6303a1b23b18","resolution":{"observed_at":"2026-08-07T06:04:35.854825Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:04:35.839310Z","title":"C., Agarwal, A., and Wainwright, M","venue":null,"work_id":"19dee052-3932-48e0-b7ce-a3037c33ea6c","year":2011},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.181200Z"},"links":{"citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:0a1651986dc911f9d4b8591933021f41b22103df578621e528fd9a8a71649af5","observation_id":"0270bbe8-a269-4612-96ec-3345119c5e42","resolution":{"observed_at":"2026-08-07T06:04:35.843222Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:04:35.828909Z","title":"and Lan, G","venue":null,"work_id":"34fd8284-ccbc-4b9b-ad70-05daafa4a4d1","year":2013},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.184762Z"},"links":{"citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:19603565bf916d4568770f016484c9212d6f46cd1a11cc2be7c093f125bb6e0b","observation_id":"0c1f9e28-dfe0-4ae0-aedf-407b3f198b19","resolution":{"observed_at":"2026-08-07T06:04:35.832240Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:04:35.818995Z","title":"An investigation into neural net optimization via Hessian eigenvalue density","venue":null,"work_id":"358e7a4b-51c6-4be1-82a2-fa47f532aa1f","year":2019},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.187720Z"},"links":{"citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:9a0b603aa23403149cfc4f42d942bdcba40f45fb0a5b829d8f1daeab641efb10","observation_id":"b9f7176e-3f71-4e48-9a1c-0dde27b94149","resolution":{"observed_at":"2026-08-07T06:04:35.822616Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:04:35.809071Z","title":"Shampoo: Preconditioned stochastic tensor optimization","venue":null,"work_id":"3b3a038b-62e1-4b4f-a85c-bd6383a426e1","year":2018},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.190634Z"},"links":{"citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:eb4645008f17eee0da67482843a8ea9abb9dd8034f101fb8656ef17fea2df050","observation_id":"6955f429-2fc1-4ef5-9ad9-e3695fd28dfc","resolution":{"observed_at":"2026-08-07T06:04:35.812646Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:04:35.799441Z","title":"and Nemirovski, A","venue":null,"work_id":"1fa290ab-409a-4079-801b-617b7244289a","year":2015},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.193585Z"},"links":{"citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:d5235831961b2f8e2a268a072393183824411d254cba06193210decc5b8b8a9a","observation_id":"8e58107f-e6e8-48d4-94da-f331639884e9","resolution":{"observed_at":"2026-08-07T06:04:35.802487Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:04:35.197079Z","title":"Deep residual learning for image recognition","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.197079Z"},"links":{"citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:3b862e7bb23eadb579400f8375a1de3f309a01382be619441608482bd95f701d","observation_id":"f6a1e80f-cdaa-433f-9d4f-41b25f799194","resolution":{"observed_at":"2026-08-07T06:04:35.197079Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:04:35.782673Z","title":"and Cutkosky, A","venue":null,"work_id":"26027fde-230a-4a4c-a5fa-d3d9d72e45d8","year":2022},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.200639Z"},"links":{"citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:580336e45ed6d6f0248a233bc3838ee39a012dd2e8822be0eaa9432057800397","observation_id":"c7d6d43b-3083-4698-be0f-20e5b41c87f1","resolution":{"observed_at":"2026-08-07T06:04:35.785812Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:04:35.773312Z","title":"A direct O (1/ ) iteration parallel algorithm for optimal transport","venue":null,"work_id":"d6197c4c-5c23-4d3f-b1f3-b2436e6d7b6c","year":2019},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.203553Z"},"links":{"citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:7935d3d5254e1f0253e63aee2daa178f560dc6a17a9055483edce331f6651d79","observation_id":"2c0f48b4-9c0e-43f0-a78b-57ca361b3a95","resolution":{"observed_at":"2026-08-07T06:04:35.776707Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:04:35.763687Z","title":"How does adaptive optimization impact local neural network geometry? Advances in Neural Information Processing Systems, 36, 2024","venue":null,"work_id":"b1c527c4-4f0a-4a63-8227-816ba278db43","year":2024},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.206436Z"},"links":{"citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:91fd08962f991c5da4c61d4c172dc8e13c96d7084e2dd88a7ebafdd23fae9929","observation_id":"53d53431-06af-4aec-aaf2-9c6da5a8d747","resolution":{"observed_at":"2026-08-07T06:04:35.766886Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:04:35.754358Z","title":"M., and Jordan, M","venue":null,"work_id":"f5760dbd-5833-468a-a56a-e9e7b36bcfb3","year":2017},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.209519Z"},"links":{"citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:24192bf0a33a136c9af52a2e527651b93d08f3d8835547b9ac784fea7df812b9","observation_id":"255c8b81-b2a5-4cde-a4d9-429bf5d73e10","resolution":{"observed_at":"2026-08-07T06:04:35.757392Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:04:35.743742Z","title":"Linear convergence of gradient and proximal-gradient methods under the Polyak- ojasiewicz condition","venue":null,"work_id":"443ad18c-8531-4ca3-a14e-e3f5c3cc2155","year":2016},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.212671Z"},"links":{"citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:f757d8a5d9462d2e5e3c1ba9a54d16d13958ff4d02b8fa953ee01ed86ff793be","observation_id":"f149260f-1521-4a93-9760-f51309cdb3d3","resolution":{"observed_at":"2026-08-07T06:04:35.747609Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:04:35.733999Z","title":"A., Lee, Y","venue":null,"work_id":"512282c2-0ef5-45c7-b6d1-66d492c31a11","year":2014},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.215753Z"},"links":{"citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:0a0f4841b9c10ac28a31556fec6d761064ad9585cdcde9e176212221eb937e2e","observation_id":"7f4741d9-762c-4203-92ee-5b9835a66d65","resolution":{"observed_at":"2026-08-07T06:04:35.737142Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:04:35.724442Z","title":null,"venue":null,"work_id":"ad19cd39-6e85-48ee-ade4-333dedb5a80e","year":2015},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.219166Z"},"links":{"citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:d42fa897adc590ca4df8e5b65aa7e8a26215d86d310fac0bb573bd5dc5e96d50","observation_id":"365bef21-bb34-4895-b755-512461a5e25d","resolution":{"observed_at":"2026-08-07T06:04:35.727407Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:04:35.714618Z","title":"Learning multiple layers of features from tiny images","venue":null,"work_id":"c34a61b1-0da3-44c2-888b-06368bb320c8","year":2009},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.222415Z"},"links":{"citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:de164f642474f1c0aa6908c463b5eb5391e08e924da19d030f3ea940edbb4f1f","observation_id":"cd596182-18ad-4fa5-ac01-8fcd0f68960b","resolution":{"observed_at":"2026-08-07T06:04:35.718063Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:04:35.704305Z","title":"Hessian based analysis of sgd for deep nets: Dynamics and generalization","venue":null,"work_id":"3615bb52-b12f-4316-b4e6-0ae6c9bdd71e","year":2020},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.225476Z"},"links":{"citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:031a07747f298b254dcefd5a462a1ca2624ead6662639538da1c10ad1c8907ee","observation_id":"5f1b2234-4014-4bd5-aab5-58d3dc9a2cd0","resolution":{"observed_at":"2026-08-07T06:04:35.708168Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:04:35.694305Z","title":"On the convergence of fedavg on non-iid data","venue":null,"work_id":"4f2060ba-f363-43f2-a1a3-19367a1c9bd5","year":2020},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.228819Z"},"links":{"citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:b0b38aabd771efee3a24ba12ae50ae85031be9d096aec5c8d86282531386cf87","observation_id":"9ca21d37-c99e-4247-b1e0-d92f98b5bb54","resolution":{"observed_at":"2026-08-07T06:04:35.697305Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:04:35.684450Z","title":null,"venue":null,"work_id":"29bc7fde-dad1-41ba-87a5-148db35bd6ee","year":2024},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.231935Z"},"links":{"citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:5a6c4b685a2449788170cc37af4db9bb20d9ee08e75978735c1f7b3220e281c6","observation_id":"f58c6554-7f13-4ae0-8d88-0c0a4b61efc7","resolution":{"observed_at":"2026-08-07T06:04:35.687314Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:04:35.234987Z","title":"and Hutter, F","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.234987Z"},"links":{"citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:10be5dca4a5ea0f0b13dbcfbec8b1146fb4b64c516feb2a7295e1048fec06a16","observation_id":"9fbade51-4825-4dab-9690-c77cc0b9d49a","resolution":{"observed_at":"2026-08-07T06:04:35.234987Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:04:35.668104Z","title":"and Grosse, R","venue":null,"work_id":"7399a8c8-11ed-4697-8612-d520a74c9a79","year":2015},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.238238Z"},"links":{"citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:a48bc3f7025e1f564ae9f266ad109c7500822e648221febf058cb8bf0ac3a5cd","observation_id":"dc40dbd6-ee00-431b-a983-6d0f1ad0b1d9","resolution":{"observed_at":"2026-08-07T06:04:35.671288Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:04:35.657487Z","title":"M., and Janson, L","venue":null,"work_id":"4d7f5213-12f2-4a5c-a787-6ed444be05e6","year":2025},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.241158Z"},"links":{"citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:d06c62ca70a454f3c40fb9db033634215eb82fd2048635af1cc881e5030e973b","observation_id":"d8e20d20-04e7-4005-9dcc-11387c1d8f0b","resolution":{"observed_at":"2026-08-07T06:04:35.661274Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:04:35.647447Z","title":null,"venue":null,"work_id":"17fb7bf8-ef25-45a8-8abe-5d793fd903c6","year":1985},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.244880Z"},"links":{"citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:60fdb5e71cb113aa4c5ccd355901ebafa194afe7275de9962e7a8d007dc98e16","observation_id":"a0a34c60-c280-43e8-bd73-99d75d227310","resolution":{"observed_at":"2026-08-07T06:04:35.650833Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:04:35.638163Z","title":null,"venue":null,"work_id":"4f0d3adf-9269-4beb-87d1-08a81362809a","year":1983},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.248110Z"},"links":{"citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:8ef27fc3961201f9ff898365c99710b58f5a4d179228e4dce8df07b392dc8f26","observation_id":"7a8c86ac-16db-4812-b63e-54329f0bc262","resolution":{"observed_at":"2026-08-07T06:04:35.641404Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:04:35.628453Z","title":"A method for solving the convex programming problem with convergence rate O (1/k2)","venue":null,"work_id":"962b786c-5487-4c94-b986-776c92ab1ff1","year":1983},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.251344Z"},"links":{"citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:a0c0df9622a29fa1c276fcdc2809082cb1212e09a4dfe2579a3fd53dda178553","observation_id":"74752cb3-1e5d-4fae-96f1-b0faed0035f2","resolution":{"observed_at":"2026-08-07T06:04:35.631591Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:04:35.618544Z","title":"Smooth minimization of non-smooth functions","venue":null,"work_id":"42108a2d-bbdb-431c-8d38-7ca7a14ee52f","year":2005},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.254760Z"},"links":{"citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:810c6620254c12d54320edd442378ddb8a848efdc1b6a4f8cad841b35adf6af4","observation_id":"02721d1e-55de-48cf-abb8-b0eeeddaca71","resolution":{"observed_at":"2026-08-07T06:04:35.621852Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:04:35.258248Z","title":"Lectures on convex optimization, volume 137","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.258248Z"},"links":{"citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:ea5930ea7ad177af938ad31ad172f6fe5086164919bab80704b4264a4cb579b5","observation_id":"466ec72b-f4dd-47c7-835a-39a2773b9c8a","resolution":{"observed_at":"2026-08-07T06:04:35.258248Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1811.07062","last_updated":"2019-06-03T01:12:42Z","snapshot_observed_at":"2026-07-06T07:15:19.493472Z","submitted_at":"2018-11-16T23:22:37Z","title":"The Full Spectrum of Deepnet Hessians at Scale: Dynamics with SGD Training and Sample Size","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.07062","snapshot_observed_at":"2026-08-07T06:04:35.261505Z","title":"The full spectrum of deepnet Hessians at scale: Dynamics with sgd training and sample size","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.261505Z"},"links":{"cited_paper":"/paper/1811.07062","citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:123216e4b25584a4f40f0aa59bb8f17c10d3822a19f48d83e24ed7bed2e16260","observation_id":"0762f298-235b-473b-a344-9395c7cea0cb","resolution":{"observed_at":"2026-08-07T06:04:35.261505Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:04:35.602189Z","title":null,"venue":null,"work_id":"19bae155-65d2-453a-b041-a7c70253bfbd","year":1964},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.265022Z"},"links":{"citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:a3bef82514ca094bc7a68f73636caba211a117ed30fc6e19cd0ad0f348dd95db","observation_id":"7f58e3c3-bf05-424f-9e6c-3c0656e693b5","resolution":{"observed_at":"2026-08-07T06:04:35.605147Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:04:35.592702Z","title":"and Monro, S","venue":null,"work_id":"da654916-2668-4dc4-97be-47f669049760","year":1951},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.268313Z"},"links":{"citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:f74dc6b1628a888497eeb275d77ce09a3e3f966f925c2debd3eca00b322a121c","observation_id":"343b527d-945b-44f5-80f2-fd9b993613d3","resolution":{"observed_at":"2026-08-07T06:04:35.595636Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:04:35.582621Z","title":"Area-convexity, _ regularization, and undirected multicommodity flow","venue":null,"work_id":"c5284670-0b7a-4da5-bf4b-d9b266f660e3","year":2017},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.272105Z"},"links":{"citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:4c24489412176ff625a57b3384509baa4bd4277feab324e2e9f806fab35a38a1","observation_id":"50a5aba2-f852-4477-b04c-f0a7fd38a77e","resolution":{"observed_at":"2026-08-07T06:04:35.586237Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:04:35.572185Z","title":"and Tian, K","venue":null,"work_id":"8cfc0bdd-ee2e-4eca-86f9-720b2e9125eb","year":2018},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.276400Z"},"links":{"citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:0c88e0247074053739565eb1af7fdd944937025f1a70afffa96b52892b4c6fe7","observation_id":"098a4cd2-138a-4038-b2a0-66c2e162a90b","resolution":{"observed_at":"2026-08-07T06:04:35.575362Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:04:35.561692Z","title":"Unified acceleration of high-order algorithms under general holder continuity","venue":null,"work_id":"adcb87e1-4d5c-4429-8665-014b23de54e4","year":2021},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.279775Z"},"links":{"citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:3f6d3d204fb5cca819d29181da3e146c635dfc53a57f3056c8ffd16a85df8718","observation_id":"171f3570-88b7-4b6a-ae15-ee2ad0ab68d4","resolution":{"observed_at":"2026-08-07T06:04:35.565418Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2008.00051","last_updated":"2021-05-09T19:49:46Z","snapshot_observed_at":"2026-07-06T09:43:35.929296Z","submitted_at":"2020-07-31T19:37:59Z","title":"On the Convergence of SGD with Biased Gradients","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2008.00051","snapshot_observed_at":"2026-08-07T06:04:35.283217Z","title":null,"venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.283217Z"},"links":{"cited_paper":"/paper/2008.00051","citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:4025747a59ba2cf7a1173674cc6cbc2979e1aadb46459d9d99cc74c2dac42fa1","observation_id":"6e0e1739-bfa8-4629-b538-6d058bbd41d2","resolution":{"observed_at":"2026-08-07T06:04:35.283217Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:04:35.551571Z","title":"On the importance of initialization and momentum in deep learning","venue":null,"work_id":"d5f8a5e9-6cde-4b19-abfc-2a6d71d200b1","year":2013},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.286580Z"},"links":{"citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:3554624feb3630c6213740ac3b50df52ab387b47d7d3c1aac730a1206fd8c7c2","observation_id":"a754414f-f34c-4fbc-a64c-8892d14ec245","resolution":{"observed_at":"2026-08-07T06:04:35.554752Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.13971","last_updated":"2023-02-27T17:11:15Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-02-27T17:11:15Z","title":"LLaMA: Open and Efficient Foundation Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.13971","snapshot_observed_at":"2026-08-07T06:04:35.289701Z","title":"Llama: Open and efficient foundation language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.289701Z"},"links":{"cited_paper":"/paper/2302.13971","citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:1345e8a825e209762eee1f17a8d2f005852aad44a912e94b835f59c8e6506984","observation_id":"26288e25-d832-47ab-bafe-588299f603c2","resolution":{"observed_at":"2026-08-07T06:04:35.289701Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:04:35.542095Z","title":null,"venue":null,"work_id":"04888290-471d-4538-8344-edba53b7828b","year":2025},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.292536Z"},"links":{"citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:03fde2f96d824ba0d59b8976c073a256c70e65f23ec47916ba608650d2f49bc6","observation_id":"bfca2cc4-d108-4d7d-93d5-a55e51f4526e","resolution":{"observed_at":"2026-08-07T06:04:35.545195Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:04:35.530707Z","title":"X., and Liu, H","venue":null,"work_id":"deaa4d0a-37b1-4f76-98e9-28c5df7d3a86","year":2017},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.295365Z"},"links":{"citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:ba4b57ca66c0134c4e11f11f95438c26cdb1de8f4b40f88b935db0fcba29f513","observation_id":"90a2c239-5c03-4bb4-931b-5fe92dfa3a92","resolution":{"observed_at":"2026-08-07T06:04:35.534227Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:04:35.520797Z","title":"Online composite optimization between stochastic and adversarial environments","venue":null,"work_id":"a7f43805-2319-4c5b-b41c-527513c46eac","year":2024},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.298421Z"},"links":{"citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:0a2ab48c464ad367c4cfe6a15d3cb0c0adad77de0047f584b04f66601d7e7195","observation_id":"c5fa2aee-1c51-4610-a1ef-2fc3356c36ac","resolution":{"observed_at":"2026-08-07T06:04:35.524081Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:04:35.509764Z","title":"Federated composite optimization","venue":null,"work_id":"82abc1aa-157f-46a0-b84a-a55af51b7d70","year":2021},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.301646Z"},"links":{"citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:a4daa1c5950251761ae177c2319aeb67ca2955c01f30728038d2e3fef7285982","observation_id":"5ff4c722-7974-42b8-b8d5-d28f354c69a0","resolution":{"observed_at":"2026-08-07T06:04:35.513288Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:04:35.304379Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-07T06:04:35.304379Z"},"links":{"citing_paper":"/paper/2506.06606"},"observation_digest":"sha256:6491f2520ad78370a6b33ae4e8b1c3f220b879fab187afbfd225d8ac591b7804","observation_id":"8c43af32-e61f-4092-8a32-714912283217","resolution":{"observed_at":"2026-08-07T06:04:35.304379Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.06606","last_updated":"2025-06-07T00:47:07Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T18:41:53.384740Z","submitted_at":"2025-06-07T00:47:07Z","title":"Stacey: Promoting Stochastic Steepest Descent via Accelerated $\\ell_p$-Smooth Nonconvex Optimization"},"reference_resolution":{"displayed":61,"state_counts":{"malformed_identifier":0,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":15,"verified_exact":1,"verified_fuzzy":43},"total_outbound_references":61},"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 61 of 61 outbound references and 0 inbound Pith citation observations for arXiv:2506.06606."}