{"as_of":"2026-08-18T22:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a760e602c1395e240ae631f97f2210cf7e903099db1488dc8f0f2440f1ad7a7c","coverage":[{"denominator":21,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T12:37:36.765372Z","state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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/2504.12601/citation-record","integrity":"/paper/2504.12601/integrity","json":"/paper/2504.12601/citation-record.json","paper":"/paper/2504.12601"},"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-16T12:37:37.055117Z","title":"Toward a precise smoothness hypothesis in sard’s theorem","venue":null,"work_id":"517090f3-792d-4d4c-99d7-8448fe8dc24a","year":1993},"citing_paper":{"arxiv_id":"2504.12601","last_updated":"2025-04-17T02:56:20Z","snapshot_observed_at":"2026-08-16T12:25:32.852543Z","submitted_at":"2025-04-17T02:56:20Z","title":"Stochastic Gradient Descent in Non-Convex Problems: Asymptotic Convergence with Relaxed Step-Size via Stopping Time Methods","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-16T12:37:36.680857Z"},"links":{"citing_paper":"/paper/2504.12601"},"observation_digest":"sha256:f84b34767777efccdd25f4125dc3a88ab5d9e01da0f50e28bedc5c539baa8a52","observation_id":"ad16737a-cded-4dfa-a108-7969deca011b","resolution":{"observed_at":"2026-08-16T12:37:37.060743Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T12:37:36.686294Z","title":"Dynamics of stochastic approximation algorithms","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2504.12601","last_updated":"2025-04-17T02:56:20Z","snapshot_observed_at":"2026-08-16T12:25:32.852543Z","submitted_at":"2025-04-17T02:56:20Z","title":"Stochastic Gradient Descent in Non-Convex Problems: Asymptotic Convergence with Relaxed Step-Size via Stopping Time Methods","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-16T12:37:36.686294Z"},"links":{"citing_paper":"/paper/2504.12601"},"observation_digest":"sha256:64234a27a92f23ee74fa1e41a5651a1ca054a0eb132f27dff8fb39bf7ca7b04d","observation_id":"a3c84275-9805-4fb6-a377-40e8437ace07","resolution":{"observed_at":"2026-08-16T12:37:36.686294Z","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-16T12:37:37.027300Z","title":"Adaptive algorithms and stochastic approximations, volume 22","venue":null,"work_id":"f7612d1b-e3d8-45ed-93d5-1c297fc230ec","year":2012},"citing_paper":{"arxiv_id":"2504.12601","last_updated":"2025-04-17T02:56:20Z","snapshot_observed_at":"2026-08-16T12:25:32.852543Z","submitted_at":"2025-04-17T02:56:20Z","title":"Stochastic Gradient Descent in Non-Convex Problems: Asymptotic Convergence with Relaxed Step-Size via Stopping Time Methods","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-16T12:37:36.690765Z"},"links":{"citing_paper":"/paper/2504.12601"},"observation_digest":"sha256:c5fde327417c026eabaab375e55cf1ff923aabdf52418440594ab6b438d580a1","observation_id":"c0e12b06-60b1-4c05-9ee9-ff2df867ec9e","resolution":{"observed_at":"2026-08-16T12:37:37.032434Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T12:37:37.010901Z","title":"Stochastic approximation: a dynamical systems viewpoint, volume 9","venue":null,"work_id":"75ae2f92-82f0-4e46-aa39-fb91f48b81cb","year":2008},"citing_paper":{"arxiv_id":"2504.12601","last_updated":"2025-04-17T02:56:20Z","snapshot_observed_at":"2026-08-16T12:25:32.852543Z","submitted_at":"2025-04-17T02:56:20Z","title":"Stochastic Gradient Descent in Non-Convex Problems: Asymptotic Convergence with Relaxed Step-Size via Stopping Time Methods","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-16T12:37:36.695539Z"},"links":{"citing_paper":"/paper/2504.12601"},"observation_digest":"sha256:660335d3c95e390cce6eb83dcaa81059815441e40391b532486a2d8a55f19dfe","observation_id":"8ad73e9d-1faf-4805-a1f0-a5e2cff48bd4","resolution":{"observed_at":"2026-08-16T12:37:37.016164Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T12:37:36.699940Z","title":"Large-scale machine learning with stochastic gradient descent","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2504.12601","last_updated":"2025-04-17T02:56:20Z","snapshot_observed_at":"2026-08-16T12:25:32.852543Z","submitted_at":"2025-04-17T02:56:20Z","title":"Stochastic Gradient Descent in Non-Convex Problems: Asymptotic Convergence with Relaxed Step-Size via Stopping Time Methods","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-16T12:37:36.699940Z"},"links":{"citing_paper":"/paper/2504.12601"},"observation_digest":"sha256:311f7026ca1d93a95d204fecb8b1fe7c1fac9f053b6aca0f1ac1301753593937","observation_id":"11e81e78-91ae-4474-8095-497837fd4097","resolution":{"observed_at":"2026-08-16T12:37:36.699940Z","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-16T12:37:36.704089Z","title":"Optimization methods for large-scale machine learning","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2504.12601","last_updated":"2025-04-17T02:56:20Z","snapshot_observed_at":"2026-08-16T12:25:32.852543Z","submitted_at":"2025-04-17T02:56:20Z","title":"Stochastic Gradient Descent in Non-Convex Problems: Asymptotic Convergence with Relaxed Step-Size via Stopping Time Methods","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-16T12:37:36.704089Z"},"links":{"citing_paper":"/paper/2504.12601"},"observation_digest":"sha256:67559d9a4e20fba838f913970fea603f81ca4288749478ebb7d8fbc936540a83","observation_id":"fca6afb9-02df-460c-97ae-c0e1489d6f8e","resolution":{"observed_at":"2026-08-16T12:37:36.704089Z","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-16T12:37:36.708429Z","title":"Stochastic first-and zeroth-order methods for nonconvex stochastic programming","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2504.12601","last_updated":"2025-04-17T02:56:20Z","snapshot_observed_at":"2026-08-16T12:25:32.852543Z","submitted_at":"2025-04-17T02:56:20Z","title":"Stochastic Gradient Descent in Non-Convex Problems: Asymptotic Convergence with Relaxed Step-Size via Stopping Time Methods","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-16T12:37:36.708429Z"},"links":{"citing_paper":"/paper/2504.12601"},"observation_digest":"sha256:8857d9817afec87029bc3e55151b2d1ec477eae9b0fe643fce6ce24f89b23bd5","observation_id":"002d177c-764d-40ed-9ed0-3e1f89377a83","resolution":{"observed_at":"2026-08-16T12:37:36.708429Z","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-16T12:37:36.967633Z","title":"Understanding the role of momentum in stochastic gradient methods","venue":null,"work_id":"c2a9ec94-6ef5-4193-a4de-acc116ef190a","year":2019},"citing_paper":{"arxiv_id":"2504.12601","last_updated":"2025-04-17T02:56:20Z","snapshot_observed_at":"2026-08-16T12:25:32.852543Z","submitted_at":"2025-04-17T02:56:20Z","title":"Stochastic Gradient Descent in Non-Convex Problems: Asymptotic Convergence with Relaxed Step-Size via Stopping Time Methods","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-16T12:37:36.712084Z"},"links":{"citing_paper":"/paper/2504.12601"},"observation_digest":"sha256:ba1528e3ca1ca1d694973b5cf6c417ed77fd55957fae1aa804621eeacb83b404","observation_id":"d513c6a4-7326-4e7e-a660-5475d0811232","resolution":{"observed_at":"2026-08-16T12:37:36.972062Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T12:37:36.951771Z","title":"A practical guide to training restricted boltzmann machines","venue":null,"work_id":"a431ba10-bf03-486c-8fac-bcc951f5c59e","year":2012},"citing_paper":{"arxiv_id":"2504.12601","last_updated":"2025-04-17T02:56:20Z","snapshot_observed_at":"2026-08-16T12:25:32.852543Z","submitted_at":"2025-04-17T02:56:20Z","title":"Stochastic Gradient Descent in Non-Convex Problems: Asymptotic Convergence with Relaxed Step-Size via Stopping Time Methods","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-16T12:37:36.715850Z"},"links":{"citing_paper":"/paper/2504.12601"},"observation_digest":"sha256:56d00de0e111667cb71c74bb9148fa131da2f032e4da469f28ab2144a67c3e06","observation_id":"c6283f2f-2bec-416e-bc75-b3c0d95d26a7","resolution":{"observed_at":"2026-08-16T12:37:36.957461Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T12:37:36.935644Z","title":"Revisit last-iterate convergence of msgd under milder requirement on step size","venue":null,"work_id":"4e3a8ad0-c0d9-4a74-a214-e0dec9105b0f","year":2022},"citing_paper":{"arxiv_id":"2504.12601","last_updated":"2025-04-17T02:56:20Z","snapshot_observed_at":"2026-08-16T12:25:32.852543Z","submitted_at":"2025-04-17T02:56:20Z","title":"Stochastic Gradient Descent in Non-Convex Problems: Asymptotic Convergence with Relaxed Step-Size via Stopping Time Methods","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-16T12:37:36.719571Z"},"links":{"citing_paper":"/paper/2504.12601"},"observation_digest":"sha256:747dc8cc8423c5df21752a9d231e76484f0f43819db72290e2b05e1e056a613c","observation_id":"d328f59f-7448-4f8a-b2d9-dfe8e45dda1c","resolution":{"observed_at":"2026-08-16T12:37:36.940505Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-08-17T19:26:44.032537Z","submitted_at":"2014-12-22T13:54:29Z","title":"Adam: A Method for Stochastic Optimization","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6980","snapshot_observed_at":"2026-08-16T12:37:36.723282Z","title":"Adam: A method for stochastic optimization","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2504.12601","last_updated":"2025-04-17T02:56:20Z","snapshot_observed_at":"2026-08-16T12:25:32.852543Z","submitted_at":"2025-04-17T02:56:20Z","title":"Stochastic Gradient Descent in Non-Convex Problems: Asymptotic Convergence with Relaxed Step-Size via Stopping Time Methods","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-16T12:37:36.723282Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/2504.12601"},"observation_digest":"sha256:446d0aab7aef8fb635871182e7e3ef336fe063f005fb5874b442b551e8a72f56","observation_id":"ffe37b04-a244-4cc4-9f85-0c0137c06fbb","resolution":{"observed_at":"2026-08-16T12:37:36.723282Z","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-16T12:37:36.920976Z","title":"Stochastic approximation algorithms and applications, vol","venue":null,"work_id":"fd8ca941-e0fa-4e5f-a566-9705b19bba1e","year":1997},"citing_paper":{"arxiv_id":"2504.12601","last_updated":"2025-04-17T02:56:20Z","snapshot_observed_at":"2026-08-16T12:25:32.852543Z","submitted_at":"2025-04-17T02:56:20Z","title":"Stochastic Gradient Descent in Non-Convex Problems: Asymptotic Convergence with Relaxed Step-Size via Stopping Time Methods","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-16T12:37:36.727516Z"},"links":{"citing_paper":"/paper/2504.12601"},"observation_digest":"sha256:c9ea0def918fcca74d541313da4dc732a1fce0630576c49a7712b56fbef0e1d8","observation_id":"3c0be079-5477-4c21-8773-463515ecb030","resolution":{"observed_at":"2026-08-16T12:37:36.925690Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T12:37:36.731738Z","title":"Efficient backprop","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2504.12601","last_updated":"2025-04-17T02:56:20Z","snapshot_observed_at":"2026-08-16T12:25:32.852543Z","submitted_at":"2025-04-17T02:56:20Z","title":"Stochastic Gradient Descent in Non-Convex Problems: Asymptotic Convergence with Relaxed Step-Size via Stopping Time Methods","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-16T12:37:36.731738Z"},"links":{"citing_paper":"/paper/2504.12601"},"observation_digest":"sha256:3cb225d935bc638efca00cd1ae7b9202232078066add415485bdc648fb3eee47","observation_id":"6801d40d-3544-4b8b-ad7e-180ce3aed144","resolution":{"observed_at":"2026-08-16T12:37:36.731738Z","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-16T12:37:36.897231Z","title":"Analysis of recursive stochastic algorithms","venue":null,"work_id":"6f521802-d49e-45ca-aef9-b064a61909ec","year":1977},"citing_paper":{"arxiv_id":"2504.12601","last_updated":"2025-04-17T02:56:20Z","snapshot_observed_at":"2026-08-16T12:25:32.852543Z","submitted_at":"2025-04-17T02:56:20Z","title":"Stochastic Gradient Descent in Non-Convex Problems: Asymptotic Convergence with Relaxed Step-Size via Stopping Time Methods","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-16T12:37:36.735847Z"},"links":{"citing_paper":"/paper/2504.12601"},"observation_digest":"sha256:beba9d8ed747d763529ecc299cf4d7df9090f3f73c339e314d7b0228770a7dec","observation_id":"e37a25b5-ae56-4d27-b78a-9675600675ad","resolution":{"observed_at":"2026-08-16T12:37:36.902301Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T12:37:36.739942Z","title":"Theory for the user","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2504.12601","last_updated":"2025-04-17T02:56:20Z","snapshot_observed_at":"2026-08-16T12:25:32.852543Z","submitted_at":"2025-04-17T02:56:20Z","title":"Stochastic Gradient Descent in Non-Convex Problems: Asymptotic Convergence with Relaxed Step-Size via Stopping Time Methods","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-16T12:37:36.739942Z"},"links":{"citing_paper":"/paper/2504.12601"},"observation_digest":"sha256:838d759651db050670d953e54bef2580cd15ed32076fc6737ab2f76b33f9a2fb","observation_id":"2af8d2bf-16a6-4f7c-8c7f-fc89415b4905","resolution":{"observed_at":"2026-08-16T12:37:36.739942Z","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-16T12:37:36.744307Z","title":"On the almost sure convergence of stochastic gradient descent in non-convex problems","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2504.12601","last_updated":"2025-04-17T02:56:20Z","snapshot_observed_at":"2026-08-16T12:25:32.852543Z","submitted_at":"2025-04-17T02:56:20Z","title":"Stochastic Gradient Descent in Non-Convex Problems: Asymptotic Convergence with Relaxed Step-Size via Stopping Time Methods","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-16T12:37:36.744307Z"},"links":{"citing_paper":"/paper/2504.12601"},"observation_digest":"sha256:7f8adb93e2d18fb30aa0399b86e006397b363db5e2ad3c20c049279d9976b095","observation_id":"00d02dbf-34da-4c26-9f20-722dd2d0047f","resolution":{"observed_at":"2026-08-16T12:37:36.744307Z","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-16T12:37:36.864579Z","title":"Sgd and hogwild! convergence without the bounded gradients assumption","venue":null,"work_id":"3b2638b0-0fb2-4905-b374-5395c54bf9b1","year":2018},"citing_paper":{"arxiv_id":"2504.12601","last_updated":"2025-04-17T02:56:20Z","snapshot_observed_at":"2026-08-16T12:25:32.852543Z","submitted_at":"2025-04-17T02:56:20Z","title":"Stochastic Gradient Descent in Non-Convex Problems: Asymptotic Convergence with Relaxed Step-Size via Stopping Time Methods","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-16T12:37:36.748365Z"},"links":{"citing_paper":"/paper/2504.12601"},"observation_digest":"sha256:b045972380a3c8108c475903cd2f862662bd66b5a07fd08741a51bd3deb717af","observation_id":"ddd4fb53-eb3d-401a-8665-6cae6c948be8","resolution":{"observed_at":"2026-08-16T12:37:36.869337Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T12:37:36.849611Z","title":"A stochastic approximation method","venue":null,"work_id":"a269e02b-5866-4142-9db5-11778ff1f8c0","year":1951},"citing_paper":{"arxiv_id":"2504.12601","last_updated":"2025-04-17T02:56:20Z","snapshot_observed_at":"2026-08-16T12:25:32.852543Z","submitted_at":"2025-04-17T02:56:20Z","title":"Stochastic Gradient Descent in Non-Convex Problems: Asymptotic Convergence with Relaxed Step-Size via Stopping Time Methods","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-16T12:37:36.752329Z"},"links":{"citing_paper":"/paper/2504.12601"},"observation_digest":"sha256:36098c5e47a1d7ae16ad38af26b4c2b8cc4d0b5b939fc3eb970b880e7bf88f6c","observation_id":"a3717365-5f8b-4440-9f82-b1e436342ac0","resolution":{"observed_at":"2026-08-16T12:37:36.854640Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1609.04747","last_updated":"2017-06-15T13:21:04Z","snapshot_observed_at":"2026-08-15T03:49:17.013617Z","submitted_at":"2016-09-15T17:32:34Z","title":"An overview of gradient descent optimization algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.04747","snapshot_observed_at":"2026-08-16T12:37:36.756445Z","title":"An overview of gradient descent optimization algorithms","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2504.12601","last_updated":"2025-04-17T02:56:20Z","snapshot_observed_at":"2026-08-16T12:25:32.852543Z","submitted_at":"2025-04-17T02:56:20Z","title":"Stochastic Gradient Descent in Non-Convex Problems: Asymptotic Convergence with Relaxed Step-Size via Stopping Time Methods","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-16T12:37:36.756445Z"},"links":{"cited_paper":"/paper/1609.04747","citing_paper":"/paper/2504.12601"},"observation_digest":"sha256:14e11df3fae8c88f794430fd8f5a8b60d606ac31da6aab8f63572964beb30e11","observation_id":"fd54b708-b542-408c-b768-f6b058eb735d","resolution":{"observed_at":"2026-08-16T12:37:36.756445Z","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-16T12:37:36.832013Z","title":"The measure of the critical values of differentiable maps","venue":null,"work_id":"ad87330a-a1ce-42ac-bfe1-ad8f0741284f","year":1942},"citing_paper":{"arxiv_id":"2504.12601","last_updated":"2025-04-17T02:56:20Z","snapshot_observed_at":"2026-08-16T12:25:32.852543Z","submitted_at":"2025-04-17T02:56:20Z","title":"Stochastic Gradient Descent in Non-Convex Problems: Asymptotic Convergence with Relaxed Step-Size via Stopping Time Methods","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-16T12:37:36.760985Z"},"links":{"citing_paper":"/paper/2504.12601"},"observation_digest":"sha256:4f3673484940d85a4dbfda9906286820a8f0802ec921887addbf00b91e6cdc1c","observation_id":"445941a5-35eb-4f51-ac1f-dd8cd7f3e7a9","resolution":{"observed_at":"2026-08-16T12:37:36.839647Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T12:37:36.765372Z","title":"Towards theoretically understanding why sgd generalizes better than adam in deep learning","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2504.12601","last_updated":"2025-04-17T02:56:20Z","snapshot_observed_at":"2026-08-16T12:25:32.852543Z","submitted_at":"2025-04-17T02:56:20Z","title":"Stochastic Gradient Descent in Non-Convex Problems: Asymptotic Convergence with Relaxed Step-Size via Stopping Time Methods","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-16T12:37:36.765372Z"},"links":{"citing_paper":"/paper/2504.12601"},"observation_digest":"sha256:874e476edfef91aca8b740d9a28dddabd8b4faa4abb4317a11e02940d25a2226","observation_id":"57d7a1c1-0859-4513-8ef1-d053fd785028","resolution":{"observed_at":"2026-08-16T12:37:36.765372Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2504.12601","last_updated":"2025-04-17T02:56:20Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T12:25:32.852543Z","submitted_at":"2025-04-17T02:56:20Z","title":"Stochastic Gradient Descent in Non-Convex Problems: Asymptotic Convergence with Relaxed Step-Size via Stopping Time Methods"},"reference_resolution":{"displayed":21,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":10,"verified_exact":0,"verified_fuzzy":11},"total_outbound_references":21},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 0 inbound Pith citation observations for arXiv:2504.12601."}