{"as_of":"2026-08-16T18:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2bb3c9c15a243daf7268095dbb5c01f61e262ee8b19c03b04ed41572485d2788","coverage":[{"denominator":23,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":23,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T00:07:41.894418Z","state":"measured"},{"denominator":23,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":23,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/2505.03222/citation-record","integrity":"/paper/2505.03222/integrity","json":"/paper/2505.03222/citation-record.json","paper":"/paper/2505.03222"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1811.02564","last_updated":"2018-11-06T00:05:00Z","snapshot_observed_at":"2026-08-16T13:40:20.718757Z","submitted_at":"2018-11-06T00:05:00Z","title":"On exponential convergence of SGD in non-convex over-parametrized learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.02564","snapshot_observed_at":"2026-08-16T00:07:41.780521Z","title":"On exponential convergence of sgd in non-convex over-parametrized learning","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.03222","last_updated":"2025-08-04T15:01:04Z","snapshot_observed_at":"2026-08-16T13:40:20.439103Z","submitted_at":"2025-05-06T06:29:06Z","title":"A Stochastic Gradient Descent Method for Globally Minimizing Nearly Convex Functions","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-16T00:07:41.780521Z"},"links":{"cited_paper":"/paper/1811.02564","citing_paper":"/paper/2505.03222"},"observation_digest":"sha256:848c82af287c2ef93ea06120212fddf8da67afab8f117528b3ddc4c028718938","observation_id":"073db737-bd19-4aed-a78f-a34f4cfa0527","resolution":{"observed_at":"2026-08-16T00:07:41.780521Z","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-16T00:07:42.285851Z","title":"Large-scale machine learning with stochastic gradient descent","venue":null,"work_id":"f0d7e3c0-4725-4d37-b2ee-5b957f79364d","year":2010},"citing_paper":{"arxiv_id":"2505.03222","last_updated":"2025-08-04T15:01:04Z","snapshot_observed_at":"2026-08-16T13:40:20.439103Z","submitted_at":"2025-05-06T06:29:06Z","title":"A Stochastic Gradient Descent Method for Globally Minimizing Nearly Convex Functions","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-16T00:07:41.786386Z"},"links":{"citing_paper":"/paper/2505.03222"},"observation_digest":"sha256:43c5c39668ab19389c882df0b328927d86c8516d2b153a054151448bf91b68bb","observation_id":"3424f3c6-bf3c-492d-be29-f22b3a4af1f4","resolution":{"observed_at":"2026-08-16T00:07:42.291069Z","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-16T00:07:42.268911Z","title":"Diffusion for global optimization in Rn","venue":null,"work_id":"b70de0bf-5bbf-4f7d-86db-dbb244b072d4","year":1987},"citing_paper":{"arxiv_id":"2505.03222","last_updated":"2025-08-04T15:01:04Z","snapshot_observed_at":"2026-08-16T13:40:20.439103Z","submitted_at":"2025-05-06T06:29:06Z","title":"A Stochastic Gradient Descent Method for Globally Minimizing Nearly Convex Functions","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-16T00:07:41.791423Z"},"links":{"citing_paper":"/paper/2505.03222"},"observation_digest":"sha256:63f148e2d51cd832b5112936f2885402b6c6e95e315060366185db49bc84f254","observation_id":"90034790-a1ff-4e57-96fa-c61d36ea1bbd","resolution":{"observed_at":"2026-08-16T00:07:42.273728Z","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-16T00:07:42.253008Z","title":"Large Deviations Techniques and Applications","venue":null,"work_id":"1ba7f23a-38a4-40da-8f87-6df8b892d88e","year":2009},"citing_paper":{"arxiv_id":"2505.03222","last_updated":"2025-08-04T15:01:04Z","snapshot_observed_at":"2026-08-16T13:40:20.439103Z","submitted_at":"2025-05-06T06:29:06Z","title":"A Stochastic Gradient Descent Method for Globally Minimizing Nearly Convex Functions","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-16T00:07:41.798246Z"},"links":{"citing_paper":"/paper/2505.03222"},"observation_digest":"sha256:ebd2ea621f360e28d9c3c7edc698601f6a061993a3c1745928b6b972c2c98936","observation_id":"94d32fed-e136-4479-afb1-414be8349355","resolution":{"observed_at":"2026-08-16T00:07:42.257954Z","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":"2204.05923","last_updated":"2025-02-05T18:22:44Z","snapshot_observed_at":"2026-08-16T17:07:24.692788Z","submitted_at":"2022-04-12T16:27:49Z","title":"An Algebraically Converging Stochastic Gradient Descent Algorithm for Global Optimization","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2204.05923","snapshot_observed_at":"2026-08-16T00:07:41.803566Z","title":"An algebraically converging stochastic gradient descent algorithm for global optimization","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.03222","last_updated":"2025-08-04T15:01:04Z","snapshot_observed_at":"2026-08-16T13:40:20.439103Z","submitted_at":"2025-05-06T06:29:06Z","title":"A Stochastic Gradient Descent Method for Globally Minimizing Nearly Convex Functions","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-16T00:07:41.803566Z"},"links":{"cited_paper":"/paper/2204.05923","citing_paper":"/paper/2505.03222"},"observation_digest":"sha256:6f609c2eb042a4b5fe17b61ce5dc0e76b9b1a90d25a97a2ea65ddf2868de3816","observation_id":"be787f06-8f7f-4554-be59-de0d3cc0f291","resolution":{"observed_at":"2026-08-16T00:07:41.803566Z","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-16T00:07:42.237738Z","title":"Adaptive state-dependent diffusion for derivative-free optimization","venue":null,"work_id":"7040a49a-739f-455d-9d70-c2a21633fa00","year":2024},"citing_paper":{"arxiv_id":"2505.03222","last_updated":"2025-08-04T15:01:04Z","snapshot_observed_at":"2026-08-16T13:40:20.439103Z","submitted_at":"2025-05-06T06:29:06Z","title":"A Stochastic Gradient Descent Method for Globally Minimizing Nearly Convex Functions","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-16T00:07:41.809021Z"},"links":{"citing_paper":"/paper/2505.03222"},"observation_digest":"sha256:40f27bb98494279f3e7b81bdb74fca480ee753c26defffd907cb0d816c606fb2","observation_id":"2607c26d-d29d-45f4-b1ce-e02782f48422","resolution":{"observed_at":"2026-08-16T00:07:42.242638Z","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-16T00:07:42.222290Z","title":"Escaping from saddle points — online stochastic gradient for tensor decomposition","venue":null,"work_id":"d9ffef31-1c38-487e-9ace-eebb0f2cc807","year":2015},"citing_paper":{"arxiv_id":"2505.03222","last_updated":"2025-08-04T15:01:04Z","snapshot_observed_at":"2026-08-16T13:40:20.439103Z","submitted_at":"2025-05-06T06:29:06Z","title":"A Stochastic Gradient Descent Method for Globally Minimizing Nearly Convex Functions","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-16T00:07:41.814509Z"},"links":{"citing_paper":"/paper/2505.03222"},"observation_digest":"sha256:d11239f2895648c49bdb68468db54d2625d59988a79437cfb57084963267950f","observation_id":"9b6f47ca-27ba-4832-8324-59c58ab9bf55","resolution":{"observed_at":"2026-08-16T00:07:42.227313Z","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-16T00:07:42.205892Z","title":"Recursive stochastic algorithms for global optimization in Rd","venue":null,"work_id":"f043da42-d711-4c78-92be-96ae8a78f6bb","year":1991},"citing_paper":{"arxiv_id":"2505.03222","last_updated":"2025-08-04T15:01:04Z","snapshot_observed_at":"2026-08-16T13:40:20.439103Z","submitted_at":"2025-05-06T06:29:06Z","title":"A Stochastic Gradient Descent Method for Globally Minimizing Nearly Convex Functions","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-16T00:07:41.819428Z"},"links":{"citing_paper":"/paper/2505.03222"},"observation_digest":"sha256:b03d568860967b58d7d7d8a273b48686045ce65c13927274c1c1db161235b451","observation_id":"8a36b9f4-6ac5-4727-9aa0-14b7745f3a08","resolution":{"observed_at":"2026-08-16T00:07:42.211188Z","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-16T00:07:41.823964Z","title":"Diffusions for global optimization","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2505.03222","last_updated":"2025-08-04T15:01:04Z","snapshot_observed_at":"2026-08-16T13:40:20.439103Z","submitted_at":"2025-05-06T06:29:06Z","title":"A Stochastic Gradient Descent Method for Globally Minimizing Nearly Convex Functions","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-16T00:07:41.823964Z"},"links":{"citing_paper":"/paper/2505.03222"},"observation_digest":"sha256:77be8061eb46e150387cd293904185fd126326db729b2796510f163eca8efcce","observation_id":"07785418-4fd6-48f0-af34-8cf29999a109","resolution":{"observed_at":"2026-08-16T00:07:41.823964Z","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-16T00:07:42.179499Z","title":"Gradient descent is optimal under lower restricted secant inequality and upper error bound","venue":null,"work_id":"c5513cc3-d1f2-46a3-93dc-720f843a2562","year":2022},"citing_paper":{"arxiv_id":"2505.03222","last_updated":"2025-08-04T15:01:04Z","snapshot_observed_at":"2026-08-16T13:40:20.439103Z","submitted_at":"2025-05-06T06:29:06Z","title":"A Stochastic Gradient Descent Method for Globally Minimizing Nearly Convex Functions","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-16T00:07:41.829116Z"},"links":{"citing_paper":"/paper/2505.03222"},"observation_digest":"sha256:60f319331fb6aedb95482a282ce9049eb922471e874e4fc1f9a550fa0642c10e","observation_id":"3b260996-e200-43da-ba61-0e3714040455","resolution":{"observed_at":"2026-08-16T00:07:42.185026Z","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-16T00:07:42.161675Z","title":"Large-time behavior of perturbed diffusion markov pro- cesses with applications to the second eigenvalue problem for fokker-planck operators and simulated annealing","venue":null,"work_id":"f6d1bafa-60bc-434f-a815-91ef014e0339","year":1990},"citing_paper":{"arxiv_id":"2505.03222","last_updated":"2025-08-04T15:01:04Z","snapshot_observed_at":"2026-08-16T13:40:20.439103Z","submitted_at":"2025-05-06T06:29:06Z","title":"A Stochastic Gradient Descent Method for Globally Minimizing Nearly Convex Functions","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-16T00:07:41.834468Z"},"links":{"citing_paper":"/paper/2505.03222"},"observation_digest":"sha256:d8f0fd5e19920a4f2a18954704b21eb004f6bd007864792afe2937123710dcf5","observation_id":"5632c56d-be87-4c82-a82e-9ac0e8962c1e","resolution":{"observed_at":"2026-08-16T00:07:42.167859Z","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-16T00:07:42.143495Z","title":"Kakade, and Michael I","venue":null,"work_id":"86040bcd-e49a-4542-b48b-fa33ba97d74f","year":2017},"citing_paper":{"arxiv_id":"2505.03222","last_updated":"2025-08-04T15:01:04Z","snapshot_observed_at":"2026-08-16T13:40:20.439103Z","submitted_at":"2025-05-06T06:29:06Z","title":"A Stochastic Gradient Descent Method for Globally Minimizing Nearly Convex Functions","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-16T00:07:41.839701Z"},"links":{"citing_paper":"/paper/2505.03222"},"observation_digest":"sha256:c55b19a9fd7cca26ac2597a59756a62bfb319a1087019f4408f01b7771e4084c","observation_id":"efeb3e14-d6a6-4bb1-807b-b18a2619d78b","resolution":{"observed_at":"2026-08-16T00:07:42.148603Z","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-16T00:07:42.124905Z","title":"Linear convergence of gradient and proximal- gradient methods under the polyak-/suppress lojasiewicz condition","venue":null,"work_id":"c7a93de3-56a6-49f7-a0ac-64eb69637ce3","year":2016},"citing_paper":{"arxiv_id":"2505.03222","last_updated":"2025-08-04T15:01:04Z","snapshot_observed_at":"2026-08-16T13:40:20.439103Z","submitted_at":"2025-05-06T06:29:06Z","title":"A Stochastic Gradient Descent Method for Globally Minimizing Nearly Convex Functions","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-16T00:07:41.844540Z"},"links":{"citing_paper":"/paper/2505.03222"},"observation_digest":"sha256:c0093bf3cc5acc885b9b992b0920ad58c9390cfe8199b77a67ddf9eab96df4b3","observation_id":"a7123591-272f-4a71-938e-5d5628a4f157","resolution":{"observed_at":"2026-08-16T00:07:42.130661Z","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-16T00:07:42.107427Z","title":null,"venue":null,"work_id":"de60bc31-e81a-49cd-ae35-2956bbc75cfa","year":2018},"citing_paper":{"arxiv_id":"2505.03222","last_updated":"2025-08-04T15:01:04Z","snapshot_observed_at":"2026-08-16T13:40:20.439103Z","submitted_at":"2025-05-06T06:29:06Z","title":"A Stochastic Gradient Descent Method for Globally Minimizing Nearly Convex Functions","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-16T00:07:41.849194Z"},"links":{"citing_paper":"/paper/2505.03222"},"observation_digest":"sha256:5249776b010ed303fdde365cf8a804295548fa478028c2b64cef866c95fce5d6","observation_id":"b8cfde17-fbf5-44df-88f5-468938bc14fd","resolution":{"observed_at":"2026-08-16T00:07:42.113008Z","resolver_source":"raw_fallback","status":"unresolved"},"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-16T00:07:42.091044Z","title":"Asymptotic global behavior for stochastic approximation and diffusions with slowly decreasing noise effects: global minimization via monte carlo","venue":null,"work_id":"d84053fd-51e9-4080-80ad-e7a1b504f119","year":1987},"citing_paper":{"arxiv_id":"2505.03222","last_updated":"2025-08-04T15:01:04Z","snapshot_observed_at":"2026-08-16T13:40:20.439103Z","submitted_at":"2025-05-06T06:29:06Z","title":"A Stochastic Gradient Descent Method for Globally Minimizing Nearly Convex Functions","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-16T00:07:41.853939Z"},"links":{"citing_paper":"/paper/2505.03222"},"observation_digest":"sha256:3f32035271dc9d2813ad324e7c81182997c069638d645d39d523b1fb9497603e","observation_id":"6899d11f-6967-4c2a-9f1a-b09480b1096c","resolution":{"observed_at":"2026-08-16T00:07:42.096313Z","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-16T00:07:42.074309Z","title":"Error bounds, PL condition, and quadratic growth for weakly convex functions, and linear convergences of proximal point methods","venue":null,"work_id":"77899c9d-cd13-4cf0-ab2d-f9b885656035","year":2024},"citing_paper":{"arxiv_id":"2505.03222","last_updated":"2025-08-04T15:01:04Z","snapshot_observed_at":"2026-08-16T13:40:20.439103Z","submitted_at":"2025-05-06T06:29:06Z","title":"A Stochastic Gradient Descent Method for Globally Minimizing Nearly Convex Functions","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-16T00:07:41.858691Z"},"links":{"citing_paper":"/paper/2505.03222"},"observation_digest":"sha256:8da750f0aa648257a86e6edfa912630da493684461489b8bd9d3534af77535fd","observation_id":"10212a4c-708d-4afe-a932-80044a62df70","resolution":{"observed_at":"2026-08-16T00:07:42.079551Z","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-16T00:07:41.863592Z","title":"SGDR: Stochastic gradient descent with warm restarts","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.03222","last_updated":"2025-08-04T15:01:04Z","snapshot_observed_at":"2026-08-16T13:40:20.439103Z","submitted_at":"2025-05-06T06:29:06Z","title":"A Stochastic Gradient Descent Method for Globally Minimizing Nearly Convex Functions","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-16T00:07:41.863592Z"},"links":{"citing_paper":"/paper/2505.03222"},"observation_digest":"sha256:236e13de310167cf5aa45dea695d57c571df14fbd790908fd8913f21526d3e3c","observation_id":"263e51fe-eeb6-49ad-8961-53f46a61cf9a","resolution":{"observed_at":"2026-08-16T00:07:41.863592Z","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-16T00:07:42.047258Z","title":"Linear convergence of first order methods for non-strongly convex optimization","venue":null,"work_id":"5bbcfec3-9966-478d-a798-c0eda9de2ddf","year":2019},"citing_paper":{"arxiv_id":"2505.03222","last_updated":"2025-08-04T15:01:04Z","snapshot_observed_at":"2026-08-16T13:40:20.439103Z","submitted_at":"2025-05-06T06:29:06Z","title":"A Stochastic Gradient Descent Method for Globally Minimizing Nearly Convex Functions","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-16T00:07:41.868661Z"},"links":{"citing_paper":"/paper/2505.03222"},"observation_digest":"sha256:09962f9741aa528a4b6c455d1799a187a0ba390e30e852b663dcb2ae55ab3925","observation_id":"68cb8f6b-8a9d-42d9-addc-863c69f85778","resolution":{"observed_at":"2026-08-16T00:07:42.052868Z","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-16T00:07:42.029069Z","title":"Gradient methods for the minimisation of functionals","venue":null,"work_id":"7b23ef86-27f4-45bc-b4ae-6dd786490cad","year":1963},"citing_paper":{"arxiv_id":"2505.03222","last_updated":"2025-08-04T15:01:04Z","snapshot_observed_at":"2026-08-16T13:40:20.439103Z","submitted_at":"2025-05-06T06:29:06Z","title":"A Stochastic Gradient Descent Method for Globally Minimizing Nearly Convex Functions","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-16T00:07:41.873622Z"},"links":{"citing_paper":"/paper/2505.03222"},"observation_digest":"sha256:5a95a46cb5346d0e43829a394a257093f770d0d258cc311d53930c3859e8d813","observation_id":"5dc3c59e-abd3-4c76-960b-694bc8fab350","resolution":{"observed_at":"2026-08-16T00:07:42.034954Z","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-16T00:07:42.012137Z","title":"Systems of extremal control","venue":null,"work_id":"1fdb06b3-a801-4e1e-9195-cb784fdbc903","year":1974},"citing_paper":{"arxiv_id":"2505.03222","last_updated":"2025-08-04T15:01:04Z","snapshot_observed_at":"2026-08-16T13:40:20.439103Z","submitted_at":"2025-05-06T06:29:06Z","title":"A Stochastic Gradient Descent Method for Globally Minimizing Nearly Convex Functions","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-16T00:07:41.878839Z"},"links":{"citing_paper":"/paper/2505.03222"},"observation_digest":"sha256:add4f6105b98e2f54f34e72ba1da8481e17e137ea4589fe554818d46d235f5ec","observation_id":"51e3f478-fcde-46cb-9b80-1e66e6255cd1","resolution":{"observed_at":"2026-08-16T00:07:42.017529Z","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-16T00:07:41.993305Z","title":"Stochastic convex optimization","venue":null,"work_id":"b59915c8-ae9f-420d-a831-88910107d2d1","year":2009},"citing_paper":{"arxiv_id":"2505.03222","last_updated":"2025-08-04T15:01:04Z","snapshot_observed_at":"2026-08-16T13:40:20.439103Z","submitted_at":"2025-05-06T06:29:06Z","title":"A Stochastic Gradient Descent Method for Globally Minimizing Nearly Convex Functions","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-16T00:07:41.884232Z"},"links":{"citing_paper":"/paper/2505.03222"},"observation_digest":"sha256:242f59deed6e9aa27a7252acb1952ba8014c7795b2f373f1a381e216127e219a","observation_id":"9b5d14b6-f0e5-4727-bbda-921f901e171d","resolution":{"observed_at":"2026-08-16T00:07:41.999819Z","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":"1908.01878","last_updated":"2019-09-26T06:53:59Z","snapshot_observed_at":"2026-08-16T13:39:42.695026Z","submitted_at":"2019-08-05T21:56:41Z","title":"How Does Learning Rate Decay Help Modern Neural Networks?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.01878","snapshot_observed_at":"2026-08-16T00:07:41.889133Z","title":"How does learning rate decay help modern neural networks? arXiv preprint arXiv:1908.01878 , 2019","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2505.03222","last_updated":"2025-08-04T15:01:04Z","snapshot_observed_at":"2026-08-16T13:40:20.439103Z","submitted_at":"2025-05-06T06:29:06Z","title":"A Stochastic Gradient Descent Method for Globally Minimizing Nearly Convex Functions","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-16T00:07:41.889133Z"},"links":{"cited_paper":"/paper/1908.01878","citing_paper":"/paper/2505.03222"},"observation_digest":"sha256:b7699d8a720630816ae4400ca1d1744d07547d0796265c109d735d4b94334dcd","observation_id":"96f8e17c-1694-4974-88b7-58127b83d702","resolution":{"observed_at":"2026-08-16T00:07:41.889133Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1303.4645","last_updated":"2013-09-08T01:17:22Z","snapshot_observed_at":"2026-08-15T00:24:38.854006Z","submitted_at":"2013-03-19T16:03:17Z","title":"Gradient methods for convex minimization: better rates under weaker conditions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1303.4645","snapshot_observed_at":"2026-08-16T00:07:41.894418Z","title":"Gradient methods for convex minimization: better rates under weaker conditions","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2505.03222","last_updated":"2025-08-04T15:01:04Z","snapshot_observed_at":"2026-08-16T13:40:20.439103Z","submitted_at":"2025-05-06T06:29:06Z","title":"A Stochastic Gradient Descent Method for Globally Minimizing Nearly Convex Functions","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-16T00:07:41.894418Z"},"links":{"cited_paper":"/paper/1303.4645","citing_paper":"/paper/2505.03222"},"observation_digest":"sha256:ea8ab33c9f665b499574ea9849a8e8963ac1d3450e197bbb399cd65e482ba903","observation_id":"d281af61-3670-485f-8d33-5eaf11f39ad8","resolution":{"observed_at":"2026-08-16T00:07:41.894418Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.03222","last_updated":"2025-08-04T15:01:04Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-16T13:40:20.439103Z","submitted_at":"2025-05-06T06:29:06Z","title":"A Stochastic Gradient Descent Method for Globally Minimizing Nearly Convex Functions"},"reference_resolution":{"displayed":23,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":0,"verified_fuzzy":16},"total_outbound_references":23},"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 23 of 23 outbound references and 0 inbound Pith citation observations for arXiv:2505.03222."}