{"as_of":"2026-08-08T20:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:afbc582a209c16eb357804f0e0487f069d5a3521bdd9d42e005c08fb87a6c9be","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-06T16:12:08.589422Z","state":"measured"},{"denominator":46,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":46,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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/2507.14479/citation-record","integrity":"/paper/2507.14479/integrity","json":"/paper/2507.14479/citation-record.json","paper":"/paper/2507.14479"},"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-06T16:12:16.688120Z","title":"Lower bounds for non-convex stochastic optimization","venue":null,"work_id":"c1f3eb3c-fc51-406c-b43e-611895d42c2b","year":2023},"citing_paper":{"arxiv_id":"2507.14479","last_updated":"2025-07-19T04:30:33Z","snapshot_observed_at":"2026-08-06T15:52:26.601428Z","submitted_at":"2025-07-19T04:30:33Z","title":"On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T16:12:02.059059Z"},"links":{"citing_paper":"/paper/2507.14479"},"observation_digest":"sha256:fa9b9d2f01ebb354bdff94e8b061487aab9dc6132e43e52010fca292212a8a0d","observation_id":"a560cc1b-cc96-4aaa-9452-6f540644c607","resolution":{"observed_at":"2026-08-06T16:12:16.804730Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T16:12:16.536713Z","title":"Fixed-point algorithms for inverse problems in science and engineering , volume 49","venue":null,"work_id":"7ff38f90-afa5-4936-b545-6fb20b606ba7","year":2011},"citing_paper":{"arxiv_id":"2507.14479","last_updated":"2025-07-19T04:30:33Z","snapshot_observed_at":"2026-08-06T15:52:26.601428Z","submitted_at":"2025-07-19T04:30:33Z","title":"On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T16:12:02.169592Z"},"links":{"citing_paper":"/paper/2507.14479"},"observation_digest":"sha256:3ef631150e1057178ec41cb7ec127bea5e34ce8b871d2706de4a5ea9dbc16867","observation_id":"539e3140-8f3d-4697-82b4-1f4243111f5f","resolution":{"observed_at":"2026-08-06T16:12:16.617165Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T16:12:16.336597Z","title":"A fast iterative shrinkage-thresholding algorithm for linear inverse problems","venue":null,"work_id":"3185492b-df0d-4adc-aa3b-903a383429da","year":2009},"citing_paper":{"arxiv_id":"2507.14479","last_updated":"2025-07-19T04:30:33Z","snapshot_observed_at":"2026-08-06T15:52:26.601428Z","submitted_at":"2025-07-19T04:30:33Z","title":"On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T16:12:02.324578Z"},"links":{"citing_paper":"/paper/2507.14479"},"observation_digest":"sha256:b33d7a2c1e71019f47ea15868908aec20cbffd8c6bae9b8fd8cdfd4c1bf5dcf4","observation_id":"3773ff04-eb07-4abf-b182-44b4d098ca6e","resolution":{"observed_at":"2026-08-06T16:12:16.442326Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T16:12:16.159158Z","title":"Adaptive sampling strategies for risk-averse stochastic optimization with constraints","venue":null,"work_id":"155227b4-6aa5-46d3-8265-0dae012ca451","year":2023},"citing_paper":{"arxiv_id":"2507.14479","last_updated":"2025-07-19T04:30:33Z","snapshot_observed_at":"2026-08-06T15:52:26.601428Z","submitted_at":"2025-07-19T04:30:33Z","title":"On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T16:12:02.477978Z"},"links":{"citing_paper":"/paper/2507.14479"},"observation_digest":"sha256:00e3b9f1f24aab0b71f29844fe331a66f47e7f90c95b2a8c87aa241acf69b2e2","observation_id":"686a8dcc-b5b9-4c52-a7fb-0062071aebb5","resolution":{"observed_at":"2026-08-06T16:12:16.268350Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T16:12:15.954321Z","title":"Convex optimization algorithms","venue":null,"work_id":"533d5e2e-8f43-4ab1-bcae-032d5f4737ea","year":2015},"citing_paper":{"arxiv_id":"2507.14479","last_updated":"2025-07-19T04:30:33Z","snapshot_observed_at":"2026-08-06T15:52:26.601428Z","submitted_at":"2025-07-19T04:30:33Z","title":"On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T16:12:02.639870Z"},"links":{"citing_paper":"/paper/2507.14479"},"observation_digest":"sha256:2000b1397e9cd3f88b6762d53de248ac8ffb7505806d4a5f77f9dbba450b4fd1","observation_id":"d8e92fc2-dd7b-4fd4-a682-449c5e796a17","resolution":{"observed_at":"2026-08-06T16:12:16.067009Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T16:12:15.772348Z","title":"Adaptive sampling strategies for stochastic optimization","venue":null,"work_id":"6249d2c7-ba84-4d61-b92b-7bd129aee305","year":2018},"citing_paper":{"arxiv_id":"2507.14479","last_updated":"2025-07-19T04:30:33Z","snapshot_observed_at":"2026-08-06T15:52:26.601428Z","submitted_at":"2025-07-19T04:30:33Z","title":"On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T16:12:02.764039Z"},"links":{"citing_paper":"/paper/2507.14479"},"observation_digest":"sha256:0956ef308d30db8359de987d922521b1b4392c05ceee575a2c6a819fb601abec","observation_id":"d0de0dc3-46dc-4197-a0c2-0314730dd094","resolution":{"observed_at":"2026-08-06T16:12:15.871782Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T16:12:15.617260Z","title":"Inertial variable metric tech- niques for the inexact forward–backward algorithm","venue":null,"work_id":"4a641cf7-f16a-4a0f-850b-dfcd49d5082e","year":2018},"citing_paper":{"arxiv_id":"2507.14479","last_updated":"2025-07-19T04:30:33Z","snapshot_observed_at":"2026-08-06T15:52:26.601428Z","submitted_at":"2025-07-19T04:30:33Z","title":"On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T16:12:02.915436Z"},"links":{"citing_paper":"/paper/2507.14479"},"observation_digest":"sha256:b8932e516f07d65486e7e136d29730319a0116603ea04e8c9206ba27f98360b5","observation_id":"0a61f800-7e12-4262-8428-2de682ce672f","resolution":{"observed_at":"2026-08-06T16:12:15.690351Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T16:12:15.466756Z","title":"Sample size selection in optimization methods for machine learning","venue":null,"work_id":"888d00a6-6970-48c0-a2cc-8f1f7686270a","year":2012},"citing_paper":{"arxiv_id":"2507.14479","last_updated":"2025-07-19T04:30:33Z","snapshot_observed_at":"2026-08-06T15:52:26.601428Z","submitted_at":"2025-07-19T04:30:33Z","title":"On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T16:12:02.994946Z"},"links":{"citing_paper":"/paper/2507.14479"},"observation_digest":"sha256:c01892509ce2fefe0590bb53490c2cdf6b9ca8aa1aaa5659d89d067dcfbb86f6","observation_id":"82748300-4cc5-49f4-a960-8f76b5099ea3","resolution":{"observed_at":"2026-08-06T16:12:15.566641Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T16:12:15.303859Z","title":"Lower bounds for finding stationary points i","venue":null,"work_id":"7ee948a8-5118-4066-9ecd-09edca7d56a0","year":2020},"citing_paper":{"arxiv_id":"2507.14479","last_updated":"2025-07-19T04:30:33Z","snapshot_observed_at":"2026-08-06T15:52:26.601428Z","submitted_at":"2025-07-19T04:30:33Z","title":"On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T16:12:03.114890Z"},"links":{"citing_paper":"/paper/2507.14479"},"observation_digest":"sha256:31ebba47bf69150edfea8e8bf8e9410517107a8fa2a8a465d58298f1dc984aad","observation_id":"90f32612-7d36-443a-a2e4-85f48d6df01a","resolution":{"observed_at":"2026-08-06T16:12:15.378503Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T16:12:15.118920Z","title":"Lower bounds for finding stationary points ii: first-order methods","venue":null,"work_id":"58053f4c-5c85-4128-8d54-879e9dbb00c4","year":2021},"citing_paper":{"arxiv_id":"2507.14479","last_updated":"2025-07-19T04:30:33Z","snapshot_observed_at":"2026-08-06T15:52:26.601428Z","submitted_at":"2025-07-19T04:30:33Z","title":"On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T16:12:03.271290Z"},"links":{"citing_paper":"/paper/2507.14479"},"observation_digest":"sha256:026b460d369c4322437c092ae00e58379899e3ecde60ec11a738500f87bb31a3","observation_id":"556049b1-412f-4816-b462-90d9adcd74b5","resolution":{"observed_at":"2026-08-06T16:12:15.196792Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T16:12:14.982756Z","title":"On the global convergence of trust region algorithms using inexact gradient information","venue":null,"work_id":"f4aea008-a774-48b3-8e1f-e2587f1a720b","year":1991},"citing_paper":{"arxiv_id":"2507.14479","last_updated":"2025-07-19T04:30:33Z","snapshot_observed_at":"2026-08-06T15:52:26.601428Z","submitted_at":"2025-07-19T04:30:33Z","title":"On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T16:12:03.417034Z"},"links":{"citing_paper":"/paper/2507.14479"},"observation_digest":"sha256:b08e3c92a365b34104e319e7f99c6e608498c651159a08b3d12c0a30160ccb94","observation_id":"52a2494f-da95-4113-a3b4-325b4cba1e60","resolution":{"observed_at":"2026-08-06T16:12:15.064289Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T16:12:14.804295Z","title":"LIBSVM: A library for support vector machines","venue":null,"work_id":"26d3e4e3-1ef8-4e24-bc6a-42b79032d954","year":2011},"citing_paper":{"arxiv_id":"2507.14479","last_updated":"2025-07-19T04:30:33Z","snapshot_observed_at":"2026-08-06T15:52:26.601428Z","submitted_at":"2025-07-19T04:30:33Z","title":"On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T16:12:03.637473Z"},"links":{"citing_paper":"/paper/2507.14479"},"observation_digest":"sha256:701465598f235fa8caef7b3bdb8c04b39c211226c6a1777ea5838837bdaf7b0f","observation_id":"12f2661b-3e17-4a0f-9d54-4a2b094a44ba","resolution":{"observed_at":"2026-08-06T16:12:14.886105Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1005.3579","last_updated":"2010-05-20T01:59:42Z","snapshot_observed_at":"2026-07-06T02:10:43.328032Z","submitted_at":"2010-05-20T01:59:42Z","title":"Graph-Structured Multi-task Regression and an Efficient Optimization Method for General Fused Lasso","version":1},"cited_work":{"arxiv_id":"1005.3579","doi":null,"metadata_source":"pith","pith_arxiv_id":"1005.3579","snapshot_observed_at":"2026-08-06T16:12:09.238201Z","title":"Graph-Structured Multi-task Regression and an Efficient Optimization Method for General Fused Lasso","venue":"stat.ML","work_id":"59db4977-8e30-4b4d-b6c1-1b2c2bef3509","year":2010},"citing_paper":{"arxiv_id":"2507.14479","last_updated":"2025-07-19T04:30:33Z","snapshot_observed_at":"2026-08-06T15:52:26.601428Z","submitted_at":"2025-07-19T04:30:33Z","title":"On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T16:12:03.809294Z"},"links":{"cited_paper":"/paper/1005.3579","citing_paper":"/paper/2507.14479"},"observation_digest":"sha256:8485dc5d94dd87f87a308c36966d289e3a167c796aeca7d694d7a7f1125b30a4","observation_id":"16e57dbd-e63d-407a-862a-ea542a14dec7","resolution":{"observed_at":"2026-08-06T16:12:09.310017Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T16:12:14.615416Z","title":"Composite objective mirror descent","venue":null,"work_id":"f001a90f-5064-4267-97f9-01276108279b","year":2010},"citing_paper":{"arxiv_id":"2507.14479","last_updated":"2025-07-19T04:30:33Z","snapshot_observed_at":"2026-08-06T15:52:26.601428Z","submitted_at":"2025-07-19T04:30:33Z","title":"On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T16:12:03.983305Z"},"links":{"citing_paper":"/paper/2507.14479"},"observation_digest":"sha256:3f9e3e4e3b6e8e420832123df7d15d366d10476f3826cc50e9bb79d4e0d5ff98","observation_id":"46f38fc8-93e1-4f9f-a0e8-c613882163e5","resolution":{"observed_at":"2026-08-06T16:12:14.711564Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T16:12:14.371618Z","title":"Total variation projection with first order schemes","venue":null,"work_id":"1a7b03d7-5480-4e3c-b7c3-74546f063773","year":2010},"citing_paper":{"arxiv_id":"2507.14479","last_updated":"2025-07-19T04:30:33Z","snapshot_observed_at":"2026-08-06T15:52:26.601428Z","submitted_at":"2025-07-19T04:30:33Z","title":"On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T16:12:04.172244Z"},"links":{"citing_paper":"/paper/2507.14479"},"observation_digest":"sha256:2014a2c6494e3d012cc0a6b8f2583b023e392a4344c516249c5177857105d1e2","observation_id":"63abf915-c7d6-4caa-8b17-e3da767288d0","resolution":{"observed_at":"2026-08-06T16:12:14.493399Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T16:12:14.226926Z","title":"Optimal stochastic approximation algorithms for strongly convex stochastic composite optimization i: A generic algorithmic framework","venue":null,"work_id":"534b021c-6cb0-4fb5-a4db-6057ca9aed20","year":2012},"citing_paper":{"arxiv_id":"2507.14479","last_updated":"2025-07-19T04:30:33Z","snapshot_observed_at":"2026-08-06T15:52:26.601428Z","submitted_at":"2025-07-19T04:30:33Z","title":"On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T16:12:04.378144Z"},"links":{"citing_paper":"/paper/2507.14479"},"observation_digest":"sha256:357465505918a536b6af611414d9ec0c6bfd85791114e35ec9ad460dbcf25152","observation_id":"1c2d886a-4a79-4a28-b14d-e58d36a8daa4","resolution":{"observed_at":"2026-08-06T16:12:14.290143Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T16:12:14.115570Z","title":"Accelerated gradient methods for nonconvex nonlinear and stochastic programming","venue":null,"work_id":"03c478c5-3f68-43e3-a69d-d8348eb4f77e","year":2016},"citing_paper":{"arxiv_id":"2507.14479","last_updated":"2025-07-19T04:30:33Z","snapshot_observed_at":"2026-08-06T15:52:26.601428Z","submitted_at":"2025-07-19T04:30:33Z","title":"On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T16:12:04.598920Z"},"links":{"citing_paper":"/paper/2507.14479"},"observation_digest":"sha256:4b88c958cd9078225dc851f4a021377582a16d8700fc81e694240ca6b0b957d9","observation_id":"23cca260-dee0-4b4f-ab18-a162133bcfd5","resolution":{"observed_at":"2026-08-06T16:12:14.168191Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T16:12:13.852835Z","title":"Deblurring images: matrices, spectra, and filtering","venue":null,"work_id":"a48240d0-479f-40a9-902d-63a208ecf09f","year":2006},"citing_paper":{"arxiv_id":"2507.14479","last_updated":"2025-07-19T04:30:33Z","snapshot_observed_at":"2026-08-06T15:52:26.601428Z","submitted_at":"2025-07-19T04:30:33Z","title":"On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T16:12:04.779105Z"},"links":{"citing_paper":"/paper/2507.14479"},"observation_digest":"sha256:96bf7baff322c494e48aa152c53b65cb8cfecdfc39e0683bf84bea70a8e800a0","observation_id":"d2369d7d-eda1-44d3-8d07-06768a1e3409","resolution":{"observed_at":"2026-08-06T16:12:14.007913Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T16:12:13.585948Z","title":"Accelerated gradient methods for stochastic optimization and online learning","venue":null,"work_id":"96e29f7a-eef2-4594-bfe7-9d7a5037de8b","year":2009},"citing_paper":{"arxiv_id":"2507.14479","last_updated":"2025-07-19T04:30:33Z","snapshot_observed_at":"2026-08-06T15:52:26.601428Z","submitted_at":"2025-07-19T04:30:33Z","title":"On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T16:12:04.933327Z"},"links":{"citing_paper":"/paper/2507.14479"},"observation_digest":"sha256:906e91dad15c25aa0e291e7b00ff091f9f9053b2e159142b802cb5f864ea2ece","observation_id":"4c77048d-7914-4ab2-9604-230201804fc9","resolution":{"observed_at":"2026-08-06T16:12:13.707326Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T16:12:13.420235Z","title":"Proximal stochastic methods for nonsmooth nonconvex finite-sum optimization","venue":null,"work_id":"7e92aaf1-4a29-4675-bf15-67958492f39a","year":2016},"citing_paper":{"arxiv_id":"2507.14479","last_updated":"2025-07-19T04:30:33Z","snapshot_observed_at":"2026-08-06T15:52:26.601428Z","submitted_at":"2025-07-19T04:30:33Z","title":"On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T16:12:05.093623Z"},"links":{"citing_paper":"/paper/2507.14479"},"observation_digest":"sha256:4ee1c686e8f5255b9499d2a3842bdf2706651dd0c0b6ed30d50a3b9bfb7d9a9f","observation_id":"530c7242-c4b4-4a80-ab7d-b8a01d69d1e1","resolution":{"observed_at":"2026-08-06T16:12:13.503953Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T16:12:13.254382Z","title":"Smoothed variable sample-size accelerated proximal methods for nonsmooth stochastic convex programs","venue":null,"work_id":"5412fb8e-7b73-4245-8deb-646779fa70fe","year":2022},"citing_paper":{"arxiv_id":"2507.14479","last_updated":"2025-07-19T04:30:33Z","snapshot_observed_at":"2026-08-06T15:52:26.601428Z","submitted_at":"2025-07-19T04:30:33Z","title":"On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T16:12:05.269083Z"},"links":{"citing_paper":"/paper/2507.14479"},"observation_digest":"sha256:9939ba92326a87582fe6e87a868d5702dff4deb8f7828fc7c498fbc52c5408f1","observation_id":"b3631ee6-3556-425a-afe4-be9c0b4e1f4d","resolution":{"observed_at":"2026-08-06T16:12:13.362447Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T16:12:13.084368Z","title":"Proximal meth- ods for sparse hierarchical dictionary learning","venue":null,"work_id":"ce660758-9032-4d44-b32f-bf126a1de1a8","year":2010},"citing_paper":{"arxiv_id":"2507.14479","last_updated":"2025-07-19T04:30:33Z","snapshot_observed_at":"2026-08-06T15:52:26.601428Z","submitted_at":"2025-07-19T04:30:33Z","title":"On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T16:12:05.447195Z"},"links":{"citing_paper":"/paper/2507.14479"},"observation_digest":"sha256:899b97eebf549d5284bc86df3ab4ac1b8676fcd9f80bd01afd7122c6bf51e7a3","observation_id":"498ff812-16f4-4d96-9688-f1f5109e5af2","resolution":{"observed_at":"2026-08-06T16:12:13.135723Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T16:12:12.859427Z","title":"A generic acceleration framework for stochastic com- posite optimization","venue":null,"work_id":"61882fe6-69d8-42ba-a89c-8518c41ebd21","year":2019},"citing_paper":{"arxiv_id":"2507.14479","last_updated":"2025-07-19T04:30:33Z","snapshot_observed_at":"2026-08-06T15:52:26.601428Z","submitted_at":"2025-07-19T04:30:33Z","title":"On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T16:12:05.592920Z"},"links":{"citing_paper":"/paper/2507.14479"},"observation_digest":"sha256:60537012e444d6e718a293b4520ed132e152c3a9d9d402deb88ac3daa7eb12e4","observation_id":"25693dbe-e04b-45e9-84e3-edbcd09bf03e","resolution":{"observed_at":"2026-08-06T16:12:12.981716Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T16:12:12.578400Z","title":"An optimal method for stochastic composite optimization","venue":null,"work_id":"c214e7fc-c1c5-40f9-8247-ff5e9ceb9231","year":2012},"citing_paper":{"arxiv_id":"2507.14479","last_updated":"2025-07-19T04:30:33Z","snapshot_observed_at":"2026-08-06T15:52:26.601428Z","submitted_at":"2025-07-19T04:30:33Z","title":"On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T16:12:05.710557Z"},"links":{"citing_paper":"/paper/2507.14479"},"observation_digest":"sha256:0a8c44134e095d3e905df9d6c3aa3bdbdfceac7c0fea337bac782756c0482336","observation_id":"65efc038-b5de-4595-8e12-c2fa6fb4bdf4","resolution":{"observed_at":"2026-08-06T16:12:12.731895Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.02189","last_updated":"2020-06-25T06:45:52Z","snapshot_observed_at":"2026-08-06T15:26:37.394053Z","submitted_at":"2019-07-04T02:04:56Z","title":"On the Convergence of FedAvg on Non-IID Data","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.02189","snapshot_observed_at":"2026-08-06T16:12:05.881035Z","title":"On the conver- gence of fedavg on non-iid data","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2507.14479","last_updated":"2025-07-19T04:30:33Z","snapshot_observed_at":"2026-08-06T15:52:26.601428Z","submitted_at":"2025-07-19T04:30:33Z","title":"On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T16:12:05.881035Z"},"links":{"cited_paper":"/paper/1907.02189","citing_paper":"/paper/2507.14479"},"observation_digest":"sha256:1a36c3e0b94f829be206df63ae4cc95ac04b469fda27a3b8fc7c1b8b6e61b2f2","observation_id":"02cdf4fd-4b7e-4c24-a8c9-9d00e5ae82b2","resolution":{"observed_at":"2026-08-06T16:12:05.881035Z","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-06T16:12:12.223310Z","title":"A simple proximal stochastic gradient method for nonsmooth nonconvex optimization","venue":null,"work_id":"7184ca2f-6c01-42a9-882f-fe0d34f12957","year":2018},"citing_paper":{"arxiv_id":"2507.14479","last_updated":"2025-07-19T04:30:33Z","snapshot_observed_at":"2026-08-06T15:52:26.601428Z","submitted_at":"2025-07-19T04:30:33Z","title":"On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T16:12:05.989637Z"},"links":{"citing_paper":"/paper/2507.14479"},"observation_digest":"sha256:53ee53250b1afbedb1ebf43ed10ecc5e93c6fc9b91cfc5a48a129d9cf2638a9f","observation_id":"b1a543aa-fc70-450e-9d46-4ee580d56781","resolution":{"observed_at":"2026-08-06T16:12:12.417789Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T16:12:06.069007Z","title":"Zeroth-order gradient and quasi-newton methods for nonsmooth nonconvex stochastic optimization","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.14479","last_updated":"2025-07-19T04:30:33Z","snapshot_observed_at":"2026-08-06T15:52:26.601428Z","submitted_at":"2025-07-19T04:30:33Z","title":"On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T16:12:06.069007Z"},"links":{"citing_paper":"/paper/2507.14479"},"observation_digest":"sha256:82aeace80eeee1648e7aef74973802a435fbbca8fc1cdda273ca7b8f76f68fb8","observation_id":"3f9cc921-34df-4d79-a739-c97f175cca9a","resolution":{"observed_at":"2026-08-06T16:12:06.069007Z","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-06T16:12:11.950341Z","title":"Network newton distributed optimization methods","venue":null,"work_id":"0aedc153-9782-4400-8a5d-446fa108a451","year":2016},"citing_paper":{"arxiv_id":"2507.14479","last_updated":"2025-07-19T04:30:33Z","snapshot_observed_at":"2026-08-06T15:52:26.601428Z","submitted_at":"2025-07-19T04:30:33Z","title":"On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T16:12:06.241727Z"},"links":{"citing_paper":"/paper/2507.14479"},"observation_digest":"sha256:9ee88995e39e11bfbfb73bc63138d18e91fe0963e85e85e9d6584b615bc8d541","observation_id":"ac6f836f-df3b-49b3-b9c2-0db743d54606","resolution":{"observed_at":"2026-08-06T16:12:12.077558Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T16:12:11.758146Z","title":"Gradient methods for minimizing composite functions","venue":null,"work_id":"0a763542-d7fc-4cc7-b23f-12d183ba0d48","year":2013},"citing_paper":{"arxiv_id":"2507.14479","last_updated":"2025-07-19T04:30:33Z","snapshot_observed_at":"2026-08-06T15:52:26.601428Z","submitted_at":"2025-07-19T04:30:33Z","title":"On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T16:12:06.380830Z"},"links":{"citing_paper":"/paper/2507.14479"},"observation_digest":"sha256:af8e7f5df24a09ff6b8e0f7416cded218f22f7baf47cf5cf9ec786ad0ee4ff21","observation_id":"3a84a541-685a-412b-a4d0-dd901857da15","resolution":{"observed_at":"2026-08-06T16:12:11.855162Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T16:12:11.624036Z","title":"A method for unconstrained convex minimization problem with the rate of convergence o (1/k2)","venue":null,"work_id":"ef347727-f59a-4724-880c-367b463e58ae","year":1983},"citing_paper":{"arxiv_id":"2507.14479","last_updated":"2025-07-19T04:30:33Z","snapshot_observed_at":"2026-08-06T15:52:26.601428Z","submitted_at":"2025-07-19T04:30:33Z","title":"On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T16:12:06.549485Z"},"links":{"citing_paper":"/paper/2507.14479"},"observation_digest":"sha256:1ce1c85092ab65b8a37c4720dffc9b9a170dabffe53ccc7fb25fd7627c93ae55","observation_id":"87fae0f0-6429-47eb-8d80-5437662b459c","resolution":{"observed_at":"2026-08-06T16:12:11.688002Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T16:12:06.667285Z","title":"Lectures on convex optimization , volume 137","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.14479","last_updated":"2025-07-19T04:30:33Z","snapshot_observed_at":"2026-08-06T15:52:26.601428Z","submitted_at":"2025-07-19T04:30:33Z","title":"On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T16:12:06.667285Z"},"links":{"citing_paper":"/paper/2507.14479"},"observation_digest":"sha256:7bb8012b0415340cd6be72c9b3b91fc3204ee9bc8c9691b6237ae1c277feaaf1","observation_id":"7c918581-6a40-4ba8-a6ad-0cc5b17405f7","resolution":{"observed_at":"2026-08-06T16:12:06.667285Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.15646","last_updated":"2025-02-13T04:24:32Z","snapshot_observed_at":"2026-08-07T17:02:29.798956Z","submitted_at":"2024-02-23T23:07:59Z","title":"Stochastic ISTA/FISTA Adaptive Step Search Algorithms for Convex Composite Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.15646","snapshot_observed_at":"2026-08-06T16:12:06.783864Z","title":"Stochastic ista/fista adaptive step search algorithms for convex composite optimization","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.14479","last_updated":"2025-07-19T04:30:33Z","snapshot_observed_at":"2026-08-06T15:52:26.601428Z","submitted_at":"2025-07-19T04:30:33Z","title":"On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T16:12:06.783864Z"},"links":{"cited_paper":"/paper/2402.15646","citing_paper":"/paper/2507.14479"},"observation_digest":"sha256:25a7d62ec5f3abcaad1c594bf44f59e49d2ae3c9650bbee67aa70bed880d4d08","observation_id":"3677e9bf-1c6d-4879-b32c-1c420f913b9d","resolution":{"observed_at":"2026-08-06T16:12:06.783864Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.07268","last_updated":"2024-08-14T03:27:48Z","snapshot_observed_at":"2026-08-06T04:58:32.625477Z","submitted_at":"2024-08-14T03:27:48Z","title":"Fast Unconstrained Optimization via Hessian Averaging and Adaptive Gradient Sampling Methods","version":1},"cited_work":{"arxiv_id":"2408.07268","doi":null,"metadata_source":"pith","pith_arxiv_id":"2408.07268","snapshot_observed_at":"2026-08-06T16:12:08.927508Z","title":"Fast Unconstrained Optimization via Hessian Averaging and Adaptive Gradient Sampling Methods","venue":"math.OC","work_id":"e23dbce2-d095-4551-b9bb-84c646dba113","year":2024},"citing_paper":{"arxiv_id":"2507.14479","last_updated":"2025-07-19T04:30:33Z","snapshot_observed_at":"2026-08-06T15:52:26.601428Z","submitted_at":"2025-07-19T04:30:33Z","title":"On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T16:12:06.916260Z"},"links":{"cited_paper":"/paper/2408.07268","citing_paper":"/paper/2507.14479"},"observation_digest":"sha256:303cfa443947b61c15aff2b6715c91852c21e2831d7247082a41419ec24a70eb","observation_id":"280ebcfc-e85c-4036-b722-96a1d56c7574","resolution":{"observed_at":"2026-08-06T16:12:09.026281Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T16:12:11.412738Z","title":"Proxsarah: An efficient algorithmic framework for stochastic composite nonconvex optimization","venue":null,"work_id":"d1929b27-e5c0-4f36-b709-b20909e83bca","year":2020},"citing_paper":{"arxiv_id":"2507.14479","last_updated":"2025-07-19T04:30:33Z","snapshot_observed_at":"2026-08-06T15:52:26.601428Z","submitted_at":"2025-07-19T04:30:33Z","title":"On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T16:12:07.125745Z"},"links":{"citing_paper":"/paper/2507.14479"},"observation_digest":"sha256:908c7ec7afe42e74ecaf04b384cfb2c36541ee34d258454df5ca563313ff85c2","observation_id":"f9389878-b2f9-4842-9021-8e95bbfd231c","resolution":{"observed_at":"2026-08-06T16:12:11.520363Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T16:12:11.146021Z","title":"Scaled, inexact, and adaptive generalized fista for strongly convex optimization","venue":null,"work_id":"911914a8-5eef-4cf7-9a89-ccd3418119f5","year":2022},"citing_paper":{"arxiv_id":"2507.14479","last_updated":"2025-07-19T04:30:33Z","snapshot_observed_at":"2026-08-06T15:52:26.601428Z","submitted_at":"2025-07-19T04:30:33Z","title":"On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T16:12:07.263989Z"},"links":{"citing_paper":"/paper/2507.14479"},"observation_digest":"sha256:0bdfc617ec64a62a65f9252205f6c855796e2d2113c181a445713ba0e7aac1b1","observation_id":"829f6a09-138f-4e53-a84f-f7f287a3783e","resolution":{"observed_at":"2026-08-06T16:12:11.273406Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T16:12:10.978106Z","title":"Fast first-order methods for composite con- vex optimization with backtracking","venue":null,"work_id":"9022247a-32d8-4744-93fa-e81211609211","year":2014},"citing_paper":{"arxiv_id":"2507.14479","last_updated":"2025-07-19T04:30:33Z","snapshot_observed_at":"2026-08-06T15:52:26.601428Z","submitted_at":"2025-07-19T04:30:33Z","title":"On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T16:12:07.366452Z"},"links":{"citing_paper":"/paper/2507.14479"},"observation_digest":"sha256:f695f9fd07e3e29c8f23857549a4b2a3236f1215d37befd639c1bcf7c7564019","observation_id":"f8376bfb-19d1-47a6-b940-d994716254b7","resolution":{"observed_at":"2026-08-06T16:12:11.044462Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T16:12:10.773441Z","title":"Convergence rates of inexact proximal- gradient methods for convex optimization","venue":null,"work_id":"d098fc47-6472-4659-9f15-71f825c88aae","year":2011},"citing_paper":{"arxiv_id":"2507.14479","last_updated":"2025-07-19T04:30:33Z","snapshot_observed_at":"2026-08-06T15:52:26.601428Z","submitted_at":"2025-07-19T04:30:33Z","title":"On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T16:12:07.484476Z"},"links":{"citing_paper":"/paper/2507.14479"},"observation_digest":"sha256:64a5073b1dd2554d9f6b91bb7acda9e3b70665ca95f1dae9c611f0f6c9fb0598","observation_id":"0f4141f6-7655-417f-96a7-71f5e37c2419","resolution":{"observed_at":"2026-08-06T16:12:10.884503Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T16:12:07.568408Z","title":"Practical bayesian optimization of machine learning algorithms","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2507.14479","last_updated":"2025-07-19T04:30:33Z","snapshot_observed_at":"2026-08-06T15:52:26.601428Z","submitted_at":"2025-07-19T04:30:33Z","title":"On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T16:12:07.568408Z"},"links":{"citing_paper":"/paper/2507.14479"},"observation_digest":"sha256:20e92c4025a92f6716d5d5c9ec63fe443459e1569af8ff06f5a90dd7461e3600","observation_id":"885336c7-c77b-41be-988b-c94c68a82cd7","resolution":{"observed_at":"2026-08-06T16:12:07.568408Z","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-06T16:12:10.515162Z","title":"Convergence rates of accelerated proximal gradient algorithms under independent noise","venue":null,"work_id":"f6d30cb6-4338-45b9-a345-8cc2eff9923b","year":2019},"citing_paper":{"arxiv_id":"2507.14479","last_updated":"2025-07-19T04:30:33Z","snapshot_observed_at":"2026-08-06T15:52:26.601428Z","submitted_at":"2025-07-19T04:30:33Z","title":"On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T16:12:07.650797Z"},"links":{"citing_paper":"/paper/2507.14479"},"observation_digest":"sha256:833b4ba458b234413fdc602299cb9d542ece05dc0b70acddb9231d9746734e31","observation_id":"9259dce0-ec2f-4e5d-b44f-55c64a6943be","resolution":{"observed_at":"2026-08-06T16:12:10.605068Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T16:12:10.364538Z","title":"Conditional convergence of infinite products","venue":null,"work_id":"4b75f948-5848-4be6-b2c6-ae613401dbfe","year":1999},"citing_paper":{"arxiv_id":"2507.14479","last_updated":"2025-07-19T04:30:33Z","snapshot_observed_at":"2026-08-06T15:52:26.601428Z","submitted_at":"2025-07-19T04:30:33Z","title":"On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T16:12:07.839179Z"},"links":{"citing_paper":"/paper/2507.14479"},"observation_digest":"sha256:d8267c1694cd72d13912adfaeb11bac7a27c8df12b43a4bb968f530dad06c0d7","observation_id":"3a6eccf2-2a75-4911-9f74-d653228ed81a","resolution":{"observed_at":"2026-08-06T16:12:10.429418Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T16:12:07.972251Z","title":"Computational methods for sparse solution of linear inverse problems","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2507.14479","last_updated":"2025-07-19T04:30:33Z","snapshot_observed_at":"2026-08-06T15:52:26.601428Z","submitted_at":"2025-07-19T04:30:33Z","title":"On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T16:12:07.972251Z"},"links":{"citing_paper":"/paper/2507.14479"},"observation_digest":"sha256:f2365746682732c117bd0b7dc8aba344002555870c9fee0bd408fdf0922754e4","observation_id":"cbd4589e-6f75-4e67-adb0-302b575e005d","resolution":{"observed_at":"2026-08-06T16:12:07.972251Z","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-06T16:12:10.180531Z","title":null,"venue":null,"work_id":"d0e2cd45-ed0a-46fb-9e51-e752bcd41de6","year":2023},"citing_paper":{"arxiv_id":"2507.14479","last_updated":"2025-07-19T04:30:33Z","snapshot_observed_at":"2026-08-06T15:52:26.601428Z","submitted_at":"2025-07-19T04:30:33Z","title":"On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T16:12:08.097762Z"},"links":{"citing_paper":"/paper/2507.14479"},"observation_digest":"sha256:5704950920ae012277a07516d3ea74a8dffaf44bdc9431aff9e16abc884ec9d0","observation_id":"bd906b24-1ef9-49c5-bbde-29b3a79159c1","resolution":{"observed_at":"2026-08-06T16:12:10.276600Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T16:12:09.914974Z","title":"Constrained and com- posite optimization via adaptive sampling methods","venue":null,"work_id":"c5ed5f4d-e52a-4a2a-a07d-05d2d0546115","year":2024},"citing_paper":{"arxiv_id":"2507.14479","last_updated":"2025-07-19T04:30:33Z","snapshot_observed_at":"2026-08-06T15:52:26.601428Z","submitted_at":"2025-07-19T04:30:33Z","title":"On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T16:12:08.205815Z"},"links":{"citing_paper":"/paper/2507.14479"},"observation_digest":"sha256:c6b43ab1c1fc80d01b4da7ca8d6299e58b11a3fe4c0c695072a528ad94e33be7","observation_id":"4274457e-67e6-45bd-a73d-2e95a56e3f47","resolution":{"observed_at":"2026-08-06T16:12:10.038096Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.19579","last_updated":"2024-06-27T23:57:01Z","snapshot_observed_at":"2026-07-06T18:38:13.900206Z","submitted_at":"2024-06-27T23:57:01Z","title":"Private Zeroth-Order Nonsmooth Nonconvex Optimization","version":1},"cited_work":{"arxiv_id":"2406.19579","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.19579","snapshot_observed_at":"2026-08-06T16:12:08.740196Z","title":"Private Zeroth-Order Nonsmooth Nonconvex Optimization","venue":"math.OC","work_id":"f374228d-6da2-482d-9a15-dfea6a149a6c","year":2024},"citing_paper":{"arxiv_id":"2507.14479","last_updated":"2025-07-19T04:30:33Z","snapshot_observed_at":"2026-08-06T15:52:26.601428Z","submitted_at":"2025-07-19T04:30:33Z","title":"On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T16:12:08.304151Z"},"links":{"cited_paper":"/paper/2406.19579","citing_paper":"/paper/2507.14479"},"observation_digest":"sha256:812b3ca911982ccb514d51f62e93c5b455277c929c94696f4ef2195bee50e76b","observation_id":"2aa7faa2-60a2-4783-8f8e-8454faac1bb2","resolution":{"observed_at":"2026-08-06T16:12:08.823184Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T16:12:09.653673Z","title":null,"venue":null,"work_id":"c3718e22-b857-4e79-b9cf-89cd1427950b","year":null},"citing_paper":{"arxiv_id":"2507.14479","last_updated":"2025-07-19T04:30:33Z","snapshot_observed_at":"2026-08-06T15:52:26.601428Z","submitted_at":"2025-07-19T04:30:33Z","title":"On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T16:12:08.477165Z"},"links":{"citing_paper":"/paper/2507.14479"},"observation_digest":"sha256:b265b5dda4a56b3109f560f332092f08fe86693eaf0c2b14f6eaf1f32b33b768","observation_id":"774b13c2-8afd-4a07-a0c3-4dfc706cb9ed","resolution":{"observed_at":"2026-08-06T16:12:09.741778Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T16:12:09.404712Z","title":"Determin- istic","venue":null,"work_id":"b6994c5a-dc41-4245-b822-ede4a7338c42","year":null},"citing_paper":{"arxiv_id":"2507.14479","last_updated":"2025-07-19T04:30:33Z","snapshot_observed_at":"2026-08-06T15:52:26.601428Z","submitted_at":"2025-07-19T04:30:33Z","title":"On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T16:12:08.589422Z"},"links":{"citing_paper":"/paper/2507.14479"},"observation_digest":"sha256:24dca37d1e8da859f60b11eeb4e30028c130a80384206e40ee3aec34edae0a64","observation_id":"368b5e01-d52d-4739-a5ff-989efab808e6","resolution":{"observed_at":"2026-08-06T16:12:09.522303Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.14479","last_updated":"2025-07-19T04:30:33Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-06T15:52:26.601428Z","submitted_at":"2025-07-19T04:30:33Z","title":"On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation"},"reference_resolution":{"displayed":46,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":8,"verified_exact":2,"verified_fuzzy":35},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 46 of 46 outbound references and 0 inbound Pith citation observations for arXiv:2507.14479."}