{"as_of":"2026-08-16T20:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fff521d41cc3c1cddeb4851060a5458df73a9e9f47dab5c88214875a04d25aec","coverage":[{"denominator":46,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":46,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T17:22:55.406150Z","state":"measured"},{"denominator":48,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":48,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T08:14:26.959505Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2508.13496","last_updated":"2025-09-09T02:01:10Z","snapshot_observed_at":"2026-08-15T17:11:19.805810Z","submitted_at":"2025-08-19T04:10:38Z","title":"Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.13496","snapshot_observed_at":"2026-08-01T08:14:26.959505Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.21258","last_updated":"2026-07-23T12:30:39Z","snapshot_observed_at":"2026-08-14T20:42:54.132624Z","submitted_at":"2026-07-23T12:30:39Z","title":"A Gaussian smoothing-based zeroth-order method for Goldstein second-order stationarity","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-01T08:14:26.959505Z"},"links":{"cited_paper":"/paper/2508.13496","citing_paper":"/paper/2607.21258"},"observation_digest":"sha256:04153822465715bc4a4cfc9cba1d2e5652d26a15d49cfa04d1b09562aff94d77","observation_id":"4ec8d98b-b6b8-406e-93bb-722986c67a1f","resolution":{"observed_at":"2026-08-01T08:14:26.959505Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.13496","last_updated":"2025-09-09T02:01:10Z","snapshot_observed_at":"2026-08-15T17:11:19.805810Z","submitted_at":"2025-08-19T04:10:38Z","title":"Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.13496","snapshot_observed_at":"2026-07-31T23:09:58.904284Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.24122","last_updated":"2026-07-27T08:01:40Z","snapshot_observed_at":"2026-08-16T15:52:25.103064Z","submitted_at":"2026-07-27T08:01:40Z","title":"On computing Goldstein approximate second-order stationary points of structured nonsmooth nonconvex programs","version":1},"reference_index":101,"source":"pdf_text","source_observed_at":"2026-07-31T23:09:58.904284Z"},"links":{"cited_paper":"/paper/2508.13496","citing_paper":"/paper/2607.24122"},"observation_digest":"sha256:b761803c9b881671719f1a6e75f1b59d9de1e6bfa711153b964f5cdd479c31e0","observation_id":"1819be72-41a8-4f76-ba85-964bae6e0706","resolution":{"observed_at":"2026-07-31T23:09:58.904284Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2508.13496/citation-record","integrity":"/paper/2508.13496/integrity","json":"/paper/2508.13496/citation-record.json","paper":"/paper/2508.13496"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:22:56.063715Z","title":"Variance reduction for faster non-convex optimization","venue":null,"work_id":"89a119bc-1fc3-4ad5-bbbf-a68d52f2096c","year":2016},"citing_paper":{"arxiv_id":"2508.13496","last_updated":"2025-09-09T02:01:10Z","snapshot_observed_at":"2026-08-15T17:11:19.805810Z","submitted_at":"2025-08-19T04:10:38Z","title":"Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity","version":3},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-15T17:22:55.235312Z"},"links":{"citing_paper":"/paper/2508.13496"},"observation_digest":"sha256:d423331ec07ae04af3610ad9b388f9b0b2d1b80407851f08ff86acf9bc8c3f26","observation_id":"547547e3-d054-4f34-aa02-b9c53ed5fa89","resolution":{"observed_at":"2026-08-15T17:22:56.067482Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:22:56.052102Z","title":"Introduction to Nonsmooth Optimization: theory, practice and software, volume 12","venue":null,"work_id":"c8d4627a-d739-4b72-ad23-aa81882c993f","year":2014},"citing_paper":{"arxiv_id":"2508.13496","last_updated":"2025-09-09T02:01:10Z","snapshot_observed_at":"2026-08-15T17:11:19.805810Z","submitted_at":"2025-08-19T04:10:38Z","title":"Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity","version":3},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-15T17:22:55.239833Z"},"links":{"citing_paper":"/paper/2508.13496"},"observation_digest":"sha256:7ce594ef1cf6e7ccbd7dcb2bf01b090d6ab1950c2537dacf45234e3b77031d46","observation_id":"7bbd674a-2d85-4511-9452-c417abb78ab6","resolution":{"observed_at":"2026-08-15T17:22:56.056654Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:22:56.040873Z","title":"Zeroth-order nonconvex stochastic optimization: Handling constraints, high dimensionality, and saddle points","venue":null,"work_id":"4aaba04a-2433-4580-948e-abb71b642901","year":2022},"citing_paper":{"arxiv_id":"2508.13496","last_updated":"2025-09-09T02:01:10Z","snapshot_observed_at":"2026-08-15T17:11:19.805810Z","submitted_at":"2025-08-19T04:10:38Z","title":"Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity","version":3},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-15T17:22:55.243945Z"},"links":{"citing_paper":"/paper/2508.13496"},"observation_digest":"sha256:bee765daa292571841d8a991affec82a95e7e4821f7756a7037a8f8f01d517b0","observation_id":"2ec30681-73ef-4447-a18b-bdb2ce55bafe","resolution":{"observed_at":"2026-08-15T17:22:56.044898Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:22:56.028434Z","title":"Faster gradient-free algorithms for nonsmooth nonconvex stochastic optimization","venue":null,"work_id":"a52bc7eb-2bf4-485b-9371-d15b33f2ff91","year":2023},"citing_paper":{"arxiv_id":"2508.13496","last_updated":"2025-09-09T02:01:10Z","snapshot_observed_at":"2026-08-15T17:11:19.805810Z","submitted_at":"2025-08-19T04:10:38Z","title":"Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity","version":3},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-15T17:22:55.248386Z"},"links":{"citing_paper":"/paper/2508.13496"},"observation_digest":"sha256:26f79e865d5a8090a7999350beae3989eeace8abb7d0d3d3ec185283b1327ba7","observation_id":"60ca1a4f-bc35-4751-a663-8ee35284a022","resolution":{"observed_at":"2026-08-15T17:22:56.033054Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:22:56.014538Z","title":"Zoo: Zeroth order optimization based black-box attacks to deep neural networks without training substitute models","venue":null,"work_id":"94845e21-41b9-4b83-ad20-743543f9722e","year":2017},"citing_paper":{"arxiv_id":"2508.13496","last_updated":"2025-09-09T02:01:10Z","snapshot_observed_at":"2026-08-15T17:11:19.805810Z","submitted_at":"2025-08-19T04:10:38Z","title":"Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity","version":3},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-15T17:22:55.253077Z"},"links":{"citing_paper":"/paper/2508.13496"},"observation_digest":"sha256:7fa8563f49872e64f38559dce92e4ca59c10b2711b983fa0aeb40e3b409768f2","observation_id":"968ec6a8-fc59-48e3-9c32-be339a5a69df","resolution":{"observed_at":"2026-08-15T17:22:56.018848Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:22:56.000412Z","title":"Generalized-smooth nonconvex optimization is as efficient as smooth nonconvex optimization","venue":null,"work_id":"6d87d74d-c7a1-4bbc-8924-b88326ba64c7","year":2023},"citing_paper":{"arxiv_id":"2508.13496","last_updated":"2025-09-09T02:01:10Z","snapshot_observed_at":"2026-08-15T17:11:19.805810Z","submitted_at":"2025-08-19T04:10:38Z","title":"Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity","version":3},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-15T17:22:55.257206Z"},"links":{"citing_paper":"/paper/2508.13496"},"observation_digest":"sha256:44e9685b49dbcf26953def41bca853e298fd7b4b9d6e6b4cc2b424ddd5cd3c27","observation_id":"41af593f-ce2b-4365-ac8f-9ed14944647c","resolution":{"observed_at":"2026-08-15T17:22:56.005562Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.04443","last_updated":"2025-08-14T11:55:47Z","snapshot_observed_at":"2026-08-16T13:45:22.998875Z","submitted_at":"2024-06-06T18:49:10Z","title":"Clipping Improves Adam-Norm and AdaGrad-Norm when the Noise Is Heavy-Tailed","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.04443","snapshot_observed_at":"2026-08-15T17:22:55.261906Z","title":"Gradient clipping improves adagrad when the noise is heavy-tailed","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.13496","last_updated":"2025-09-09T02:01:10Z","snapshot_observed_at":"2026-08-15T17:11:19.805810Z","submitted_at":"2025-08-19T04:10:38Z","title":"Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity","version":3},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-15T17:22:55.261906Z"},"links":{"cited_paper":"/paper/2406.04443","citing_paper":"/paper/2508.13496"},"observation_digest":"sha256:bfebe1fe45f2c0e1eee3484f6766102d8b3babec3e6d364199a67dd89b62956d","observation_id":"a4c66f04-72d1-458b-a203-4591b4e8a257","resolution":{"observed_at":"2026-08-15T17:22:55.261906Z","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-15T17:22:55.988059Z","title":"Optimization and nonsmooth analysis","venue":null,"work_id":"09afea86-f21b-4a89-b34d-96d434e173c7","year":1990},"citing_paper":{"arxiv_id":"2508.13496","last_updated":"2025-09-09T02:01:10Z","snapshot_observed_at":"2026-08-15T17:11:19.805810Z","submitted_at":"2025-08-19T04:10:38Z","title":"Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity","version":3},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-15T17:22:55.266498Z"},"links":{"citing_paper":"/paper/2508.13496"},"observation_digest":"sha256:52be58fe4bf48415e7248750c9acd13559d53ee15c855d42e196c82a3f13928e","observation_id":"e9da7c31-af9e-46f0-941d-737b43eab801","resolution":{"observed_at":"2026-08-15T17:22:55.991982Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:22:55.976628Z","title":"Complexity guarantees for an implicit smoothing-enabled method for stochastic mpecs","venue":null,"work_id":"e053cc31-ea0a-4cdf-894f-7404768a4aa9","year":2023},"citing_paper":{"arxiv_id":"2508.13496","last_updated":"2025-09-09T02:01:10Z","snapshot_observed_at":"2026-08-15T17:11:19.805810Z","submitted_at":"2025-08-19T04:10:38Z","title":"Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity","version":3},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-15T17:22:55.270635Z"},"links":{"citing_paper":"/paper/2508.13496"},"observation_digest":"sha256:6984e1d9d84a35dbea5b134fb1c88de4745fbfba3e87cd5b74befdd058802ffa","observation_id":"7fa2eda4-ef38-43f8-addf-33e559ca7e35","resolution":{"observed_at":"2026-08-15T17:22:55.980675Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:22:55.965459Z","title":"Modern nonconvex nondifferentiable optimization","venue":null,"work_id":"b793e881-2045-4a8c-a2aa-54c3f5fbc9d9","year":2021},"citing_paper":{"arxiv_id":"2508.13496","last_updated":"2025-09-09T02:01:10Z","snapshot_observed_at":"2026-08-15T17:11:19.805810Z","submitted_at":"2025-08-19T04:10:38Z","title":"Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity","version":3},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-15T17:22:55.274858Z"},"links":{"citing_paper":"/paper/2508.13496"},"observation_digest":"sha256:4bf35a6ad15a3daa5b461264c31dfaae4312ca2fa4fc0b4c60fba339af828d87","observation_id":"4de9a7c4-ef2c-432e-bdb4-72c37f3dad27","resolution":{"observed_at":"2026-08-15T17:22:55.969218Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:22:55.278976Z","title":"Momentum improves normalized sgd","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2508.13496","last_updated":"2025-09-09T02:01:10Z","snapshot_observed_at":"2026-08-15T17:11:19.805810Z","submitted_at":"2025-08-19T04:10:38Z","title":"Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity","version":3},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-15T17:22:55.278976Z"},"links":{"citing_paper":"/paper/2508.13496"},"observation_digest":"sha256:5dd6e59cdb18a9845727958ddf49d25e690347fce5556d122aed7063fd988f8d","observation_id":"88be8a71-0d62-4b5a-b5e2-82e798a9a514","resolution":{"observed_at":"2026-08-15T17:22:55.278976Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:22:55.282983Z","title":"Momentum-based variance reduction in non-convex sgd","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2508.13496","last_updated":"2025-09-09T02:01:10Z","snapshot_observed_at":"2026-08-15T17:11:19.805810Z","submitted_at":"2025-08-19T04:10:38Z","title":"Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity","version":3},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-15T17:22:55.282983Z"},"links":{"citing_paper":"/paper/2508.13496"},"observation_digest":"sha256:65e2b1d0fd983ff63e16b276e96fb1d0dcf537ceef1cf6f9462b6efa2e6ade51","observation_id":"87853885-b3e6-46ed-bddc-965fc2522a10","resolution":{"observed_at":"2026-08-15T17:22:55.282983Z","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-15T17:22:55.941664Z","title":"Randomized smoothing for stochastic optimization","venue":null,"work_id":"04fb4512-3b2e-400f-83c4-16df1f58ec1b","year":2012},"citing_paper":{"arxiv_id":"2508.13496","last_updated":"2025-09-09T02:01:10Z","snapshot_observed_at":"2026-08-15T17:11:19.805810Z","submitted_at":"2025-08-19T04:10:38Z","title":"Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity","version":3},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-15T17:22:55.286477Z"},"links":{"citing_paper":"/paper/2508.13496"},"observation_digest":"sha256:74592a632ba741bff77bde836ccc49c92310bf81f38a53216a2f5ccd0c9fa4ff","observation_id":"bfb7bbcc-6537-43b7-89e1-12821c9aed73","resolution":{"observed_at":"2026-08-15T17:22:55.945503Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:22:55.290349Z","title":"Spider: Near-optimal non-convex optimization via stochastic path-integrated differential estimator","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2508.13496","last_updated":"2025-09-09T02:01:10Z","snapshot_observed_at":"2026-08-15T17:11:19.805810Z","submitted_at":"2025-08-19T04:10:38Z","title":"Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity","version":3},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-15T17:22:55.290349Z"},"links":{"citing_paper":"/paper/2508.13496"},"observation_digest":"sha256:f134a4e588a2c83f77e74b665d0470bb0e4e9f8c3bb6184b2b44ee5f78bbf902","observation_id":"5f47eb6a-cb10-452c-8433-bb37f4cae635","resolution":{"observed_at":"2026-08-15T17:22:55.290349Z","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-15T17:22:55.921801Z","title":"Online convex optimization in the bandit setting: gradient descent without a gradient","venue":null,"work_id":"74aacfe4-1750-4ec0-844b-562ae166720b","year":2005},"citing_paper":{"arxiv_id":"2508.13496","last_updated":"2025-09-09T02:01:10Z","snapshot_observed_at":"2026-08-15T17:11:19.805810Z","submitted_at":"2025-08-19T04:10:38Z","title":"Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity","version":3},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-15T17:22:55.294241Z"},"links":{"citing_paper":"/paper/2508.13496"},"observation_digest":"sha256:bb62f121530c9d0394cc144aaa88a9b917c8124da2ce548549acd80598ccb90b","observation_id":"2b388982-6df4-416a-a860-5c4479812eb6","resolution":{"observed_at":"2026-08-15T17:22:55.926152Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.13971","last_updated":"2024-11-05T22:41:13Z","snapshot_observed_at":"2026-08-16T14:24:39.912103Z","submitted_at":"2024-01-25T06:06:31Z","title":"Stochastic Weakly Convex Optimization Beyond Lipschitz Continuity","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.13971","snapshot_observed_at":"2026-08-15T17:22:55.297697Z","title":"Stochastic weakly convex optimization beyond lipschitz continuity","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.13496","last_updated":"2025-09-09T02:01:10Z","snapshot_observed_at":"2026-08-15T17:11:19.805810Z","submitted_at":"2025-08-19T04:10:38Z","title":"Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity","version":3},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-15T17:22:55.297697Z"},"links":{"cited_paper":"/paper/2401.13971","citing_paper":"/paper/2508.13496"},"observation_digest":"sha256:dc4c0b26b2b4e404a3e2a03a6f8250c323b4132686b3c1eeee65ef107de880a3","observation_id":"54ca4277-3ad7-4597-bed8-c264eaa71a7f","resolution":{"observed_at":"2026-08-15T17:22:55.297697Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:22:55.301903Z","title":"Stochastic first-and zeroth-order methods for nonconvex stochastic programming","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2508.13496","last_updated":"2025-09-09T02:01:10Z","snapshot_observed_at":"2026-08-15T17:11:19.805810Z","submitted_at":"2025-08-19T04:10:38Z","title":"Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity","version":3},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-15T17:22:55.301903Z"},"links":{"citing_paper":"/paper/2508.13496"},"observation_digest":"sha256:b5cf1ba3e73563038c3a325acad5d2a3a0abc0de11a266a9d1324025d8b4e5ee","observation_id":"2d815806-0e36-44f5-8077-a69703f3b43b","resolution":{"observed_at":"2026-08-15T17:22:55.301903Z","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-15T17:22:55.901063Z","title":"Convergence rates for deterministic and stochastic subgradient methods without lipschitz continuity","venue":null,"work_id":"851b2afb-a5a2-4b69-9986-100931141790","year":2019},"citing_paper":{"arxiv_id":"2508.13496","last_updated":"2025-09-09T02:01:10Z","snapshot_observed_at":"2026-08-15T17:11:19.805810Z","submitted_at":"2025-08-19T04:10:38Z","title":"Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity","version":3},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-15T17:22:55.305260Z"},"links":{"citing_paper":"/paper/2508.13496"},"observation_digest":"sha256:5157d134aeb6a243beee71a3f1742477b18cd3fa74b8e1e481c87fdf79f44621","observation_id":"cbcfa1b7-26a2-449b-995a-9e91896987f0","resolution":{"observed_at":"2026-08-15T17:22:55.905309Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.13849","last_updated":"2025-07-09T12:01:30Z","snapshot_observed_at":"2026-08-16T13:08:17.690651Z","submitted_at":"2024-10-17T17:59:01Z","title":"From Gradient Clipping to Normalization for Heavy Tailed SGD","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.13849","snapshot_observed_at":"2026-08-15T17:22:55.309009Z","title":"From gradient clipping to normalization for heavy tailed sgd","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.13496","last_updated":"2025-09-09T02:01:10Z","snapshot_observed_at":"2026-08-15T17:11:19.805810Z","submitted_at":"2025-08-19T04:10:38Z","title":"Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity","version":3},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-15T17:22:55.309009Z"},"links":{"cited_paper":"/paper/2410.13849","citing_paper":"/paper/2508.13496"},"observation_digest":"sha256:f85a1e16d7503ab7aa2d85a40167665fd93e901be609851c95d56deeadfd36ca","observation_id":"c4673db0-a62e-4e43-acf8-e8effabf85cb","resolution":{"observed_at":"2026-08-15T17:22:55.309009Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:22:55.313101Z","title":"Non-convex optimization for machine learning","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2508.13496","last_updated":"2025-09-09T02:01:10Z","snapshot_observed_at":"2026-08-15T17:11:19.805810Z","submitted_at":"2025-08-19T04:10:38Z","title":"Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity","version":3},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-15T17:22:55.313101Z"},"links":{"citing_paper":"/paper/2508.13496"},"observation_digest":"sha256:7604e13a3293da7ac3cc83dc8e21fa0b1182fbffde2626bef31ceb7d79fec644","observation_id":"9fd9b5b4-0127-4034-a0fc-7710fc925a64","resolution":{"observed_at":"2026-08-15T17:22:55.313101Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.04504","last_updated":"2024-04-15T12:26:40Z","snapshot_observed_at":"2026-08-16T15:17:29.751508Z","submitted_at":"2023-07-10T11:56:04Z","title":"An Algorithm with Optimal Dimension-Dependence for Zero-Order Nonsmooth Nonconvex Stochastic Optimization","version":3},"cited_work":{"arxiv_id":"2307.04504","doi":null,"metadata_source":"pith","pith_arxiv_id":"2307.04504","snapshot_observed_at":"2026-08-15T17:22:55.688732Z","title":"An Algorithm with Optimal Dimension-Dependence for Zero-Order Nonsmooth Nonconvex Stochastic Optimization","venue":"math.OC","work_id":"ea303df5-33cd-4a3c-9ef5-440d7f2cb8f8","year":2023},"citing_paper":{"arxiv_id":"2508.13496","last_updated":"2025-09-09T02:01:10Z","snapshot_observed_at":"2026-08-15T17:11:19.805810Z","submitted_at":"2025-08-19T04:10:38Z","title":"Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity","version":3},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-15T17:22:55.316515Z"},"links":{"cited_paper":"/paper/2307.04504","citing_paper":"/paper/2508.13496"},"observation_digest":"sha256:2b724d6e0560898e2bc7291850699814af2f9428b360da9f3a97be6c25abf3ca","observation_id":"4a867eb0-bb35-4621-9d90-1fcbe192ce38","resolution":{"observed_at":"2026-08-15T17:22:55.694448Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:22:55.881930Z","title":"Derivative-free optimization methods","venue":null,"work_id":"115b2685-e465-4ffa-ae85-5a301e495794","year":2019},"citing_paper":{"arxiv_id":"2508.13496","last_updated":"2025-09-09T02:01:10Z","snapshot_observed_at":"2026-08-15T17:11:19.805810Z","submitted_at":"2025-08-19T04:10:38Z","title":"Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity","version":3},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-15T17:22:55.320564Z"},"links":{"citing_paper":"/paper/2508.13496"},"observation_digest":"sha256:faebf6dec6064e80e644f210472680627986b84cc8bf78edf7fdba7e9d18c5fe","observation_id":"f830227d-bc9b-4cd2-b4b0-f079bfe195a0","resolution":{"observed_at":"2026-08-15T17:22:55.886423Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.04150","last_updated":"2025-03-17T01:50:18Z","snapshot_observed_at":"2026-08-16T13:54:45.715963Z","submitted_at":"2024-05-07T09:39:52Z","title":"Subdifferentially polynomially bounded functions and Gaussian smoothing-based zeroth-order optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.04150","snapshot_observed_at":"2026-08-15T17:22:55.323899Z","title":"Subdifferentially polynomially bounded functions and gaussian smoothing-based zeroth-order optimization","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.13496","last_updated":"2025-09-09T02:01:10Z","snapshot_observed_at":"2026-08-15T17:11:19.805810Z","submitted_at":"2025-08-19T04:10:38Z","title":"Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity","version":3},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-15T17:22:55.323899Z"},"links":{"cited_paper":"/paper/2405.04150","citing_paper":"/paper/2508.13496"},"observation_digest":"sha256:318354b4cfd694814977adff6ad4ceb49f4c04209a58cf0b151e7dbc963e3e9d","observation_id":"e1d2b60c-68a1-4092-b331-4b91ce73f0f6","resolution":{"observed_at":"2026-08-15T17:22:55.323899Z","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-15T17:22:55.869878Z","title":"Convex and non-convex optimization under generalized smoothness","venue":null,"work_id":"60a9de9d-9f54-4b89-ac45-bc175dc20a92","year":2024},"citing_paper":{"arxiv_id":"2508.13496","last_updated":"2025-09-09T02:01:10Z","snapshot_observed_at":"2026-08-15T17:11:19.805810Z","submitted_at":"2025-08-19T04:10:38Z","title":"Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity","version":3},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-15T17:22:55.327607Z"},"links":{"citing_paper":"/paper/2508.13496"},"observation_digest":"sha256:f10b5e5409095bb1fcc3684d8e2623acd82dd0720e1bfacb50f1e04c30211df6","observation_id":"97fa64fe-d81c-459a-a85d-7fc038093086","resolution":{"observed_at":"2026-08-15T17:22:55.874013Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:22:55.858051Z","title":"Gradient-free methods for deterministic and stochastic nonsmooth nonconvex optimization","venue":null,"work_id":"795d7188-3b53-4b0a-afc9-3f6aa6d4b3da","year":2022},"citing_paper":{"arxiv_id":"2508.13496","last_updated":"2025-09-09T02:01:10Z","snapshot_observed_at":"2026-08-15T17:11:19.805810Z","submitted_at":"2025-08-19T04:10:38Z","title":"Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity","version":3},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-15T17:22:55.331086Z"},"links":{"citing_paper":"/paper/2508.13496"},"observation_digest":"sha256:1b91a4b8063ab9a2863baec904ba4cfd4b2371f0972392969f7d9c3cfa85474b","observation_id":"e79f4d92-3206-43c6-bafd-763b222c32a7","resolution":{"observed_at":"2026-08-15T17:22:55.862079Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:22:55.844818Z","title":"Decentralized gradient-free methods for stochastic non-smooth non-convex optimization","venue":null,"work_id":"345be1dc-2f38-454d-b1b7-37cf457180ee","year":2024},"citing_paper":{"arxiv_id":"2508.13496","last_updated":"2025-09-09T02:01:10Z","snapshot_observed_at":"2026-08-15T17:11:19.805810Z","submitted_at":"2025-08-19T04:10:38Z","title":"Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity","version":3},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-15T17:22:55.334451Z"},"links":{"citing_paper":"/paper/2508.13496"},"observation_digest":"sha256:087093022fcdc7c0c9217e5749206fdf81a7b3f629414ec142f19708a4fd9143","observation_id":"eb7e2883-35ce-40a2-b415-be9c4363643c","resolution":{"observed_at":"2026-08-15T17:22:55.849173Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:22:55.337936Z","title":"A primer on zeroth-order optimization in signal processing and machine learning: Principals, recent advances, and applications","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2508.13496","last_updated":"2025-09-09T02:01:10Z","snapshot_observed_at":"2026-08-15T17:11:19.805810Z","submitted_at":"2025-08-19T04:10:38Z","title":"Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity","version":3},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-15T17:22:55.337936Z"},"links":{"citing_paper":"/paper/2508.13496"},"observation_digest":"sha256:5fa402b3b184a73b27befcb3b861a8bbed6e8165c890d9dd97d3c3337ab07632","observation_id":"917d6242-eb44-4906-94dd-9b89152b541b","resolution":{"observed_at":"2026-08-15T17:22:55.337936Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.19529","last_updated":"2025-05-29T03:42:49Z","snapshot_observed_at":"2026-08-13T13:41:32.875170Z","submitted_at":"2024-12-27T08:46:46Z","title":"Nonconvex Stochastic Optimization under Heavy-Tailed Noises: Optimal Convergence without Gradient Clipping","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.19529","snapshot_observed_at":"2026-08-15T17:22:55.341832Z","title":"Nonconvex stochastic optimization under heavy-tailed noises: Optimal convergence without gradient clipping","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.13496","last_updated":"2025-09-09T02:01:10Z","snapshot_observed_at":"2026-08-15T17:11:19.805810Z","submitted_at":"2025-08-19T04:10:38Z","title":"Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity","version":3},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-15T17:22:55.341832Z"},"links":{"cited_paper":"/paper/2412.19529","citing_paper":"/paper/2508.13496"},"observation_digest":"sha256:ace9c131e851bc0533ca6cffe06808348228b9c0d7e4badb9f4747e8beec6308","observation_id":"587bb326-e20d-4e63-b705-90653988a7e6","resolution":{"observed_at":"2026-08-15T17:22:55.341832Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.06032","last_updated":"2023-10-28T03:26:32Z","snapshot_observed_at":"2026-08-16T15:55:54.208188Z","submitted_at":"2023-02-13T00:22:28Z","title":"Near-Optimal Non-Convex Stochastic Optimization under Generalized Smoothness","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.06032","snapshot_observed_at":"2026-08-15T17:22:55.345806Z","title":"Near-optimal non-convex stochastic optimization under generalized smoothness","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.13496","last_updated":"2025-09-09T02:01:10Z","snapshot_observed_at":"2026-08-15T17:11:19.805810Z","submitted_at":"2025-08-19T04:10:38Z","title":"Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity","version":3},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-15T17:22:55.345806Z"},"links":{"cited_paper":"/paper/2302.06032","citing_paper":"/paper/2508.13496"},"observation_digest":"sha256:ec994fdf646b4ced913d4ad1d21ff4d0ff5e825ec510b552324feca922029dd7","observation_id":"37e6d7b0-7275-4b33-b8f4-913f61e80fb0","resolution":{"observed_at":"2026-08-15T17:22:55.345806Z","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-15T17:22:55.825366Z","title":"relative continuity","venue":null,"work_id":"7c654af6-573e-4738-9ee3-c55b183a732e","year":2019},"citing_paper":{"arxiv_id":"2508.13496","last_updated":"2025-09-09T02:01:10Z","snapshot_observed_at":"2026-08-15T17:11:19.805810Z","submitted_at":"2025-08-19T04:10:38Z","title":"Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity","version":3},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-15T17:22:55.349770Z"},"links":{"citing_paper":"/paper/2508.13496"},"observation_digest":"sha256:afd6c8cab48cce3a6342709db8cc67c942ca0980779d8735d3878e4fccd10daf","observation_id":"890c420a-4b06-4577-b92a-7f4888a223cf","resolution":{"observed_at":"2026-08-15T17:22:55.828960Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:22:55.353586Z","title":"Stability and convergence of stochastic gradient clipping: Beyond lipschitz continuity and smoothness","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.13496","last_updated":"2025-09-09T02:01:10Z","snapshot_observed_at":"2026-08-15T17:11:19.805810Z","submitted_at":"2025-08-19T04:10:38Z","title":"Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity","version":3},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-15T17:22:55.353586Z"},"links":{"citing_paper":"/paper/2508.13496"},"observation_digest":"sha256:c1bd8482664d34a00225e5bded57f021855d1f57815749a885c69495e35efeec","observation_id":"8c2823ae-8907-40f7-8b5b-ce48ef9cd1ed","resolution":{"observed_at":"2026-08-15T17:22:55.353586Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:22:55.357029Z","title":"Fine-tuning language models with just forward passes","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.13496","last_updated":"2025-09-09T02:01:10Z","snapshot_observed_at":"2026-08-15T17:11:19.805810Z","submitted_at":"2025-08-19T04:10:38Z","title":"Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity","version":3},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-15T17:22:55.357029Z"},"links":{"citing_paper":"/paper/2508.13496"},"observation_digest":"sha256:04db8521a1cf0a14e338f54cf20f892dde5112b2f1cf5b3341e65671c91c2a8c","observation_id":"5384b729-55c6-40e6-b0b1-967d3bcb91db","resolution":{"observed_at":"2026-08-15T17:22:55.357029Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.04081","last_updated":"2025-01-13T23:48:32Z","snapshot_observed_at":"2026-08-16T14:12:09.265851Z","submitted_at":"2024-03-06T22:24:05Z","title":"Directional Smoothness and Gradient Methods: Convergence and Adaptivity","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.04081","snapshot_observed_at":"2026-08-15T17:22:55.360368Z","title":"Directional smoothness and gradient methods: Convergence and adaptivity","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.13496","last_updated":"2025-09-09T02:01:10Z","snapshot_observed_at":"2026-08-15T17:11:19.805810Z","submitted_at":"2025-08-19T04:10:38Z","title":"Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity","version":3},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-15T17:22:55.360368Z"},"links":{"cited_paper":"/paper/2403.04081","citing_paper":"/paper/2508.13496"},"observation_digest":"sha256:e9418e5c4556b30d97083963ee3cde6b276588078714b5fa2f947b28596f4ef8","observation_id":"a054ee6e-bd71-48e7-9655-7b19285acdc9","resolution":{"observed_at":"2026-08-15T17:22:55.360368Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:22:55.363870Z","title":"A simplex method for function minimization","venue":null,"work_id":null,"year":1965},"citing_paper":{"arxiv_id":"2508.13496","last_updated":"2025-09-09T02:01:10Z","snapshot_observed_at":"2026-08-15T17:11:19.805810Z","submitted_at":"2025-08-19T04:10:38Z","title":"Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity","version":3},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-15T17:22:55.363870Z"},"links":{"citing_paper":"/paper/2508.13496"},"observation_digest":"sha256:9517279340c5d888c4f89b07be1c5c90cecc6462024fa8b8195f3417589cbb16","observation_id":"db384065-2148-4943-a3a4-e45b826c61da","resolution":{"observed_at":"2026-08-15T17:22:55.363870Z","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-15T17:22:55.792774Z","title":"Random gradient-free minimization of convex functions","venue":null,"work_id":"aad476d8-1d19-438e-94ec-bc0ca832c07d","year":2017},"citing_paper":{"arxiv_id":"2508.13496","last_updated":"2025-09-09T02:01:10Z","snapshot_observed_at":"2026-08-15T17:11:19.805810Z","submitted_at":"2025-08-19T04:10:38Z","title":"Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity","version":3},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-15T17:22:55.367264Z"},"links":{"citing_paper":"/paper/2508.13496"},"observation_digest":"sha256:d14bd54d507bbac55af38e0fa004fe13312ca6e01cb7fbd2c6cfbd5989fbe6f1","observation_id":"e0e76694-027f-42fd-9199-188013d4efe4","resolution":{"observed_at":"2026-08-15T17:22:55.796556Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:22:55.781740Z","title":"Sum of squares method for sensor network localization","venue":null,"work_id":"5760a661-542b-4ecc-90f1-07bcec1ef675","year":2009},"citing_paper":{"arxiv_id":"2508.13496","last_updated":"2025-09-09T02:01:10Z","snapshot_observed_at":"2026-08-15T17:11:19.805810Z","submitted_at":"2025-08-19T04:10:38Z","title":"Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity","version":3},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-15T17:22:55.371165Z"},"links":{"citing_paper":"/paper/2508.13496"},"observation_digest":"sha256:b534c968b84b9e39aaede77bbbb4fdda7472aa1f392a9abf17c320905683709e","observation_id":"2b36e3b3-2ac1-4763-9dc1-bf017425e2fd","resolution":{"observed_at":"2026-08-15T17:22:55.785492Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.00883","last_updated":"2023-06-02T23:35:16Z","snapshot_observed_at":"2026-08-16T15:51:33.023197Z","submitted_at":"2023-03-02T00:57:38Z","title":"Variance-reduced Clipping for Non-convex Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.00883","snapshot_observed_at":"2026-08-15T17:22:55.374619Z","title":"Variance-reduced clipping for non-convex optimization","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.13496","last_updated":"2025-09-09T02:01:10Z","snapshot_observed_at":"2026-08-15T17:11:19.805810Z","submitted_at":"2025-08-19T04:10:38Z","title":"Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity","version":3},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-15T17:22:55.374619Z"},"links":{"cited_paper":"/paper/2303.00883","citing_paper":"/paper/2508.13496"},"observation_digest":"sha256:4d9326be29d20d00842d7bfe1d92472e625b3580c7524bb600ed5cb8864a4664","observation_id":"267930ab-61af-4287-8bd2-7c05ca38ceab","resolution":{"observed_at":"2026-08-15T17:22:55.374619Z","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-15T17:22:55.770996Z","title":"Simulation and the Monte Carlo method","venue":null,"work_id":"796c8dfe-8983-410b-971b-93d3b56aa826","year":2016},"citing_paper":{"arxiv_id":"2508.13496","last_updated":"2025-09-09T02:01:10Z","snapshot_observed_at":"2026-08-15T17:11:19.805810Z","submitted_at":"2025-08-19T04:10:38Z","title":"Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity","version":3},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-15T17:22:55.378237Z"},"links":{"citing_paper":"/paper/2508.13496"},"observation_digest":"sha256:394256c609ec1cc9a93f49618a51e439bca03096db88a83011e05e8a6eb4855a","observation_id":"d141a0b2-bcff-40ff-9c8e-e4b00445d8f8","resolution":{"observed_at":"2026-08-15T17:22:55.774693Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:22:55.759047Z","title":"An optimal algorithm for bandit and zero-order convex optimization with two-point feedback","venue":null,"work_id":"040f0cda-340e-4e36-b7ed-5d43235dbdab","year":2017},"citing_paper":{"arxiv_id":"2508.13496","last_updated":"2025-09-09T02:01:10Z","snapshot_observed_at":"2026-08-15T17:11:19.805810Z","submitted_at":"2025-08-19T04:10:38Z","title":"Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity","version":3},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-15T17:22:55.382336Z"},"links":{"citing_paper":"/paper/2508.13496"},"observation_digest":"sha256:9ab1d3db08fc8b519e2caa31eddca56da854da8a4733280e8a5c2e7fe0b56706","observation_id":"19dafe36-7da6-4335-8a84-1b3b486ffc31","resolution":{"observed_at":"2026-08-15T17:22:55.763434Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:22:55.385590Z","title":"Gradient normalization with (out) clipping ensures convergence of nonconvex sgd under heavy-tailed noise with improved results","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.13496","last_updated":"2025-09-09T02:01:10Z","snapshot_observed_at":"2026-08-15T17:11:19.805810Z","submitted_at":"2025-08-19T04:10:38Z","title":"Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity","version":3},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-15T17:22:55.385590Z"},"links":{"citing_paper":"/paper/2508.13496"},"observation_digest":"sha256:a7f13f8f6d052db317c9073181d42d6639be0904b50dc05e51b488d71b6165fa","observation_id":"f874df03-a04c-4192-9b18-c7c690f4d14c","resolution":{"observed_at":"2026-08-15T17:22:55.385590Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.11773","last_updated":"2025-06-27T06:34:09Z","snapshot_observed_at":"2026-08-13T08:19:14.013569Z","submitted_at":"2024-12-16T13:46:02Z","title":"Toward a Unified Theory of Gradient Descent under Generalized Smoothness","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.11773","snapshot_observed_at":"2026-08-15T17:22:55.388874Z","title":"Toward a unified theory of gradient descent under generalized smoothness","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.13496","last_updated":"2025-09-09T02:01:10Z","snapshot_observed_at":"2026-08-15T17:11:19.805810Z","submitted_at":"2025-08-19T04:10:38Z","title":"Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity","version":3},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-15T17:22:55.388874Z"},"links":{"cited_paper":"/paper/2412.11773","citing_paper":"/paper/2508.13496"},"observation_digest":"sha256:5ceee03e422ada27a4db8c669ec2cc3b5def59f152a5cbf6f32b37a846bffdc2","observation_id":"39d2a35e-c9bc-46b6-852e-c18080516614","resolution":{"observed_at":"2026-08-15T17:22:55.388874Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:22:55.392361Z","title":"High-dimensional statistics: A non-asymptotic viewpoint, volume 48","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2508.13496","last_updated":"2025-09-09T02:01:10Z","snapshot_observed_at":"2026-08-15T17:11:19.805810Z","submitted_at":"2025-08-19T04:10:38Z","title":"Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity","version":3},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-15T17:22:55.392361Z"},"links":{"citing_paper":"/paper/2508.13496"},"observation_digest":"sha256:6703406d5bfda908443f63ae956aceea13fce86a90de878ab5ac61c6477c4a15","observation_id":"3d274765-3fd8-4c08-906c-208e39f9f79a","resolution":{"observed_at":"2026-08-15T17:22:55.392361Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.11881","last_updated":"2020-02-10T22:58:53Z","snapshot_observed_at":"2026-08-14T16:25:08.350015Z","submitted_at":"2019-05-28T15:23:12Z","title":"Why gradient clipping accelerates training: A theoretical justification for adaptivity","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.11881","snapshot_observed_at":"2026-08-15T17:22:55.395736Z","title":"Why gradient clipping accelerates training: A theoretical justification for adaptivity","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2508.13496","last_updated":"2025-09-09T02:01:10Z","snapshot_observed_at":"2026-08-15T17:11:19.805810Z","submitted_at":"2025-08-19T04:10:38Z","title":"Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity","version":3},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-15T17:22:55.395736Z"},"links":{"cited_paper":"/paper/1905.11881","citing_paper":"/paper/2508.13496"},"observation_digest":"sha256:347f5622b5f89067ad4fcbb01f25d286dd3f6febdf7f38ac04cd9d71421161dc","observation_id":"f2548962-f523-4fd1-82f4-72d874c04d3a","resolution":{"observed_at":"2026-08-15T17:22:55.395736Z","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-15T17:22:55.739072Z","title":"Complexity of finding stationary points of nonconvex nonsmooth functions","venue":null,"work_id":"c3f85fae-f94b-4cbb-bbe8-92e5c3817d30","year":2020},"citing_paper":{"arxiv_id":"2508.13496","last_updated":"2025-09-09T02:01:10Z","snapshot_observed_at":"2026-08-15T17:11:19.805810Z","submitted_at":"2025-08-19T04:10:38Z","title":"Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity","version":3},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-15T17:22:55.399633Z"},"links":{"citing_paper":"/paper/2508.13496"},"observation_digest":"sha256:056228ade9d85b53f6af7ae83ccdfa08b6a0a68b8c9723cdbc7f8e37495cbac1","observation_id":"b0bcfb1f-c738-4bcc-a956-2066a5bbc74a","resolution":{"observed_at":"2026-08-15T17:22:55.743681Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T17:22:55.402698Z","title":"Stochastic nested variance reduction for nonconvex optimization","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2508.13496","last_updated":"2025-09-09T02:01:10Z","snapshot_observed_at":"2026-08-15T17:11:19.805810Z","submitted_at":"2025-08-19T04:10:38Z","title":"Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity","version":3},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-15T17:22:55.402698Z"},"links":{"citing_paper":"/paper/2508.13496"},"observation_digest":"sha256:b76a6a0c12f72ab78b0aa3307e9f1ac7e4716e905241300a6a4e2c394209bc64","observation_id":"ea192730-44e1-41a4-acd7-6ad79189bc79","resolution":{"observed_at":"2026-08-15T17:22:55.402698Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:22:55.406150Z","title":"A unified analysis for the subgradient methods minimizing composite nonconvex, nonsmooth and non-lipschitz functions","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.13496","last_updated":"2025-09-09T02:01:10Z","snapshot_observed_at":"2026-08-15T17:11:19.805810Z","submitted_at":"2025-08-19T04:10:38Z","title":"Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity","version":3},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-15T17:22:55.406150Z"},"links":{"citing_paper":"/paper/2508.13496"},"observation_digest":"sha256:a409db342aabde60d14a02812386c8f595220a61ee9d912c99602e4e91f36379","observation_id":"43e9fb4b-2856-406d-b489-b8c0bba0c9a3","resolution":{"observed_at":"2026-08-15T17:22:55.406150Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2508.13496","last_updated":"2025-09-09T02:01:10Z","latest_version":3,"primary_category":"math.OC","snapshot_observed_at":"2026-08-15T17:11:19.805810Z","submitted_at":"2025-08-19T04:10:38Z","title":"Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity"},"reference_resolution":{"displayed":46,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":23,"verified_exact":1,"verified_fuzzy":22},"total_outbound_references":46},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 46 of 46 outbound references and 2 inbound Pith citation observations for arXiv:2508.13496."}