{"as_of":"2026-08-19T16:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:32ba8786218d63020d9606231e3ecbcc9ad509f2892b44d844b9b7810c7662fc","coverage":[{"denominator":12,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T16:28:45.790771Z","state":"measured"},{"denominator":17,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":17,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T17:43:48.412070Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-06-28T23:22:46.684996Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.13711","last_updated":"2024-11-20T21:09:09Z","snapshot_observed_at":"2026-08-16T16:35:14.214681Z","submitted_at":"2024-11-20T21:09:09Z","title":"Almost Sure Convergence Rates and Concentration of Stochastic Approximation and Reinforcement Learning with Markovian Noise","version":1},"cited_work":{"arxiv_id":"2411.13711","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.13711","snapshot_observed_at":"2026-06-28T23:22:46.684996Z","title":"arXiv preprint arXiv:2411.13711 , year=","venue":null,"work_id":"625ef552-f185-41ba-ba82-e223ba169a4b","year":2024},"citing_paper":{"arxiv_id":"2504.18743","last_updated":"2026-04-05T13:54:13Z","snapshot_observed_at":"2026-08-17T11:51:06.893835Z","submitted_at":"2025-04-25T23:41:14Z","title":"From Set Convergence to Pointwise Convergence: Finite-Time Guarantees for Average-Reward Q-Learning with Adaptive Stepsizes","version":2},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-05-22T17:34:49.191496Z"},"links":{"cited_paper":"/paper/2411.13711","citing_paper":"/paper/2504.18743"},"observation_digest":"sha256:c9c618697ea29fc30d0775e5a3ac391870cfaceaff54a2bac55cd5667372ed7a","observation_id":"46969412-f26c-42cc-86e3-e8d8dc8a448a","resolution":{"observed_at":"2026-05-22T17:35:00.886167Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.13711","last_updated":"2024-11-20T21:09:09Z","snapshot_observed_at":"2026-08-16T16:35:14.214681Z","submitted_at":"2024-11-20T21:09:09Z","title":"Almost Sure Convergence Rates and Concentration of Stochastic Approximation and Reinforcement Learning with Markovian Noise","version":1},"cited_work":{"arxiv_id":"2411.13711","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.13711","snapshot_observed_at":"2026-06-28T23:22:46.684996Z","title":"arXiv preprint arXiv:2411.13711 , year=","venue":null,"work_id":"625ef552-f185-41ba-ba82-e223ba169a4b","year":2024},"citing_paper":{"arxiv_id":"2605.20999","last_updated":"2026-05-20T10:38:08Z","snapshot_observed_at":"2026-08-14T13:37:46.693147Z","submitted_at":"2026-05-20T10:38:08Z","title":"Concentration of General Stochastic Approximation Under Heavy-Tailed Markovian Noise","version":1},"reference_index":189,"source":"arxiv_source","source_observed_at":"2026-05-21T02:27:24.989781Z"},"links":{"cited_paper":"/paper/2411.13711","citing_paper":"/paper/2605.20999"},"observation_digest":"sha256:1da8becd48c98ca91fa975864a03f483d11fb57c52c1c9202b822a8eab62d7a2","observation_id":"37d4a5d2-ea98-4e26-b95b-3f9da7b8d639","resolution":{"observed_at":"2026-05-21T02:29:25.120406Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.13711","last_updated":"2024-11-20T21:09:09Z","snapshot_observed_at":"2026-08-16T16:35:14.214681Z","submitted_at":"2024-11-20T21:09:09Z","title":"Almost Sure Convergence Rates and Concentration of Stochastic Approximation and Reinforcement Learning with Markovian Noise","version":1},"cited_work":{"arxiv_id":"2411.13711","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.13711","snapshot_observed_at":"2026-06-28T23:22:46.684996Z","title":"arXiv preprint arXiv:2411.13711 , year=","venue":null,"work_id":"625ef552-f185-41ba-ba82-e223ba169a4b","year":2024},"citing_paper":{"arxiv_id":"2605.31309","last_updated":"2026-05-29T13:41:01Z","snapshot_observed_at":"2026-08-14T08:51:02.554928Z","submitted_at":"2026-05-29T13:41:01Z","title":"Non-Asymptotic Convergence of Stochastic Iterative Algorithms: A Lyapunov Framework","version":1},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-06-28T23:11:02.699220Z"},"links":{"cited_paper":"/paper/2411.13711","citing_paper":"/paper/2605.31309"},"observation_digest":"sha256:5a8c189b7cd124fa402d3fdc41c8ac19175fefbf9e5170bed93b5123dc0096e7","observation_id":"09600e6d-f149-4f19-8e66-c4adcce72e9a","resolution":{"observed_at":"2026-06-28T23:12:46.708825Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.13711","last_updated":"2024-11-20T21:09:09Z","snapshot_observed_at":"2026-08-16T16:35:14.214681Z","submitted_at":"2024-11-20T21:09:09Z","title":"Almost Sure Convergence Rates and Concentration of Stochastic Approximation and Reinforcement Learning with Markovian Noise","version":1},"cited_work":{"arxiv_id":"2411.13711","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.13711","snapshot_observed_at":"2026-06-28T23:22:46.684996Z","title":"arXiv preprint arXiv:2411.13711 , year=","venue":null,"work_id":"625ef552-f185-41ba-ba82-e223ba169a4b","year":2024},"citing_paper":{"arxiv_id":"2606.00309","last_updated":"2026-05-29T19:34:28Z","snapshot_observed_at":"2026-08-12T22:58:05.468462Z","submitted_at":"2026-05-29T19:34:28Z","title":"Large-scale Uncertainty Quantification for Latent Variable Models Using Subsampling Markov Chain Monte Carlo","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-06-28T23:21:13.128400Z"},"links":{"cited_paper":"/paper/2411.13711","citing_paper":"/paper/2606.00309"},"observation_digest":"sha256:66875c74ffeec60a2e56406df543ea4de13cb3b219a06d8b400f85d5e712efb8","observation_id":"a2d748cd-b955-4d18-a041-7b23109f17d6","resolution":{"observed_at":"2026-06-28T23:22:46.686693Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.13711","last_updated":"2024-11-20T21:09:09Z","snapshot_observed_at":"2026-08-16T16:35:14.214681Z","submitted_at":"2024-11-20T21:09:09Z","title":"Almost Sure Convergence Rates and Concentration of Stochastic Approximation and Reinforcement Learning with Markovian Noise","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.13711","snapshot_observed_at":"2026-08-01T17:43:48.412070Z","title":"Almost sure convergence rates and concentration of stochastic approximation and reinforcement learning with markovian noise","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.17595","last_updated":"2026-07-20T06:27:22Z","snapshot_observed_at":"2026-08-16T02:07:55.474161Z","submitted_at":"2026-07-20T06:27:22Z","title":"Concentration and Mean-Square Bounds for Contractive Stochastic Approximation: A Unified Elementary Approach","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-01T17:43:48.412070Z"},"links":{"cited_paper":"/paper/2411.13711","citing_paper":"/paper/2607.17595"},"observation_digest":"sha256:bee58ccb62eed4fafd804bec394bb9116b2ad91c614be966d416ccacb52f6585","observation_id":"71b9b92d-810f-49c1-8961-216e7c228253","resolution":{"observed_at":"2026-08-01T17:43:48.412070Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2411.13711/citation-record","integrity":"/paper/2411.13711/integrity","json":"/paper/2411.13711/citation-record.json","paper":"/paper/2411.13711"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2405.17834","last_updated":"2025-08-01T23:52:01Z","snapshot_observed_at":"2026-08-19T13:34:07.714508Z","submitted_at":"2024-05-28T05:11:05Z","title":"Revisiting Step-Size Assumptions in Stochastic Approximation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.17834","snapshot_observed_at":"2026-08-12T16:28:45.672894Z","title":"Revisiting step-size assum ptions in stochastic approxi- mation","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.13711","last_updated":"2024-11-20T21:09:09Z","snapshot_observed_at":"2026-08-16T16:35:14.214681Z","submitted_at":"2024-11-20T21:09:09Z","title":"Almost Sure Convergence Rates and Concentration of Stochastic Approximation and Reinforcement Learning with Markovian Noise","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T16:28:45.672894Z"},"links":{"cited_paper":"/paper/2405.17834","citing_paper":"/paper/2411.13711"},"observation_digest":"sha256:b31b265dbc3f506209a272456c6a4c943b363b75ba09e5783d56d7c7f5db135f","observation_id":"a7af71e4-8914-49b6-9e05-64c45cd97d1f","resolution":{"observed_at":"2026-08-12T16:28:45.672894Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1109.5647","last_updated":"2012-12-09T21:19:27Z","snapshot_observed_at":"2026-08-15T04:34:09.911130Z","submitted_at":"2011-09-26T17:24:52Z","title":"Making Gradient Descent Optimal for Strongly Convex Stochastic Optimization","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1109.5647","snapshot_observed_at":"2026-08-12T16:28:45.685956Z","title":"Mak ing gradient descent optimal for strongly convex stochastic optimization","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.13711","last_updated":"2024-11-20T21:09:09Z","snapshot_observed_at":"2026-08-16T16:35:14.214681Z","submitted_at":"2024-11-20T21:09:09Z","title":"Almost Sure Convergence Rates and Concentration of Stochastic Approximation and Reinforcement Learning with Markovian Noise","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T16:28:45.685956Z"},"links":{"cited_paper":"/paper/1109.5647","citing_paper":"/paper/2411.13711"},"observation_digest":"sha256:9cc4aed3105948b319f935cd5568ddc6f357591a411d9deb2e72df7a66e2051f","observation_id":"1ecdfd84-6a8f-4e7d-91e9-1675a1ce3c25","resolution":{"observed_at":"2026-08-12T16:28:45.685956Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1506.08657","last_updated":"2019-03-31T00:11:46Z","snapshot_observed_at":"2026-08-16T16:36:04.026255Z","submitted_at":"2015-06-26T15:34:40Z","title":"A Concentration Bound for Stochastic Approximation via Alekseev's Formula","version":6},"cited_work":{"arxiv_id":"1506.08657","doi":null,"metadata_source":"pith","pith_arxiv_id":"1506.08657","snapshot_observed_at":"2026-08-12T16:28:45.894291Z","title":"A Concentration Bound for Stochastic Approximation via Alekseev's Formula","venue":"math.OC","work_id":"24e6f778-3cba-4591-bca9-95802bb4289e","year":2015},"citing_paper":{"arxiv_id":"2411.13711","last_updated":"2024-11-20T21:09:09Z","snapshot_observed_at":"2026-08-16T16:35:14.214681Z","submitted_at":"2024-11-20T21:09:09Z","title":"Almost Sure Convergence Rates and Concentration of Stochastic Approximation and Reinforcement Learning with Markovian Noise","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T16:28:45.717728Z"},"links":{"cited_paper":"/paper/1506.08657","citing_paper":"/paper/2411.13711"},"observation_digest":"sha256:5b015900bb9ee9667dde685eadce46d15ddaab63b6e0477fa5274a96e134d7c5","observation_id":"62a08250-6b85-424d-a53d-2c42207e67e2","resolution":{"observed_at":"2026-08-12T16:28:45.924261Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T16:28:45.650228Z","title":"A concentration bound for td (0) with function approximation","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.13711","last_updated":"2024-11-20T21:09:09Z","snapshot_observed_at":"2026-08-16T16:35:14.214681Z","submitted_at":"2024-11-20T21:09:09Z","title":"Almost Sure Convergence Rates and Concentration of Stochastic Approximation and Reinforcement Learning with Markovian Noise","version":1},"reference_index":2009,"source":"pdf_text","source_observed_at":"2026-08-12T16:28:45.650228Z"},"links":{"citing_paper":"/paper/2411.13711"},"observation_digest":"sha256:984e5b6465b414892210a1b5d45d1579c85c0141d34b4cc126548ff98d42b734","observation_id":"858de273-6044-4e78-ae29-077b49b5148b","resolution":{"observed_at":"2026-08-12T16:28:45.650228Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2201.08518","last_updated":"2022-11-29T17:06:33Z","snapshot_observed_at":"2026-08-16T17:26:56.932725Z","submitted_at":"2022-01-21T02:46:57Z","title":"Optimal variance-reduced stochastic approximation in Banach spaces","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.08518","snapshot_observed_at":"2026-08-12T16:28:45.681249Z","title":"Optimal variance-reduced stochastic approximati on in banach spaces","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.13711","last_updated":"2024-11-20T21:09:09Z","snapshot_observed_at":"2026-08-16T16:35:14.214681Z","submitted_at":"2024-11-20T21:09:09Z","title":"Almost Sure Convergence Rates and Concentration of Stochastic Approximation and Reinforcement Learning with Markovian Noise","version":1},"reference_index":2011,"source":"pdf_text","source_observed_at":"2026-08-12T16:28:45.681249Z"},"links":{"cited_paper":"/paper/2201.08518","citing_paper":"/paper/2411.13711"},"observation_digest":"sha256:7c2e2dc53e23c7cf1b66885f9898dd831801119c4d2904f83f7fe1c12e92b26a","observation_id":"209a0c69-b10c-497d-8966-ed9f76f9893f","resolution":{"observed_at":"2026-08-12T16:28:45.681249Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.02270","last_updated":"2021-02-17T05:28:51Z","snapshot_observed_at":"2026-07-06T08:42:09.483153Z","submitted_at":"2019-12-04T22:01:44Z","title":"A Unified Switching System Perspective and O.D.E. Analysis of Q-Learning Algorithms","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.02270","snapshot_observed_at":"2026-08-12T16:28:45.677005Z","title":"A unified switching system perspect ive and ode analysis of q-learning algorithms","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2411.13711","last_updated":"2024-11-20T21:09:09Z","snapshot_observed_at":"2026-08-16T16:35:14.214681Z","submitted_at":"2024-11-20T21:09:09Z","title":"Almost Sure Convergence Rates and Concentration of Stochastic Approximation and Reinforcement Learning with Markovian Noise","version":1},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-12T16:28:45.677005Z"},"links":{"cited_paper":"/paper/1912.02270","citing_paper":"/paper/2411.13711"},"observation_digest":"sha256:a28669a3c965b8b907ea09359540b14bbce855d85c026c7ba1950a084e7dc19a","observation_id":"4b728f1b-7855-4b5a-9597-9853f0dbb4b7","resolution":{"observed_at":"2026-08-12T16:28:45.677005Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.00843","last_updated":"2019-09-02T19:47:47Z","snapshot_observed_at":"2026-08-16T01:09:39.771963Z","submitted_at":"2019-09-02T19:47:47Z","title":"Simple and optimal high-probability bounds for strongly-convex stochastic gradient descent","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.00843","snapshot_observed_at":"2026-08-12T16:28:45.668409Z","title":"Simple and optimal high-probability bounds for strongly-convex stochastic g radient descent","venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2411.13711","last_updated":"2024-11-20T21:09:09Z","snapshot_observed_at":"2026-08-16T16:35:14.214681Z","submitted_at":"2024-11-20T21:09:09Z","title":"Almost Sure Convergence Rates and Concentration of Stochastic Approximation and Reinforcement Learning with Markovian Noise","version":1},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-12T16:28:45.668409Z"},"links":{"cited_paper":"/paper/1909.00843","citing_paper":"/paper/2411.13711"},"observation_digest":"sha256:0d8d6be10da81a836c14229acd7aba4d5b8e27aab338f5e80538900d26dea089","observation_id":"5ef20281-605c-4df1-8f02-9745a618e722","resolution":{"observed_at":"2026-08-12T16:28:45.668409Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.14427","last_updated":"2024-11-15T13:34:34Z","snapshot_observed_at":"2026-08-18T17:09:29.842532Z","submitted_at":"2021-10-27T13:38:25Z","title":"The ODE Method for Asymptotic Statistics in Stochastic Approximation and Reinforcement Learning","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.14427","snapshot_observed_at":"2026-08-12T16:28:45.645167Z","title":"The ode method for asymptotic statistics in stochastic approxi mation and reinforcement learn- ing","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.13711","last_updated":"2024-11-20T21:09:09Z","snapshot_observed_at":"2026-08-16T16:35:14.214681Z","submitted_at":"2024-11-20T21:09:09Z","title":"Almost Sure Convergence Rates and Concentration of Stochastic Approximation and Reinforcement Learning with Markovian Noise","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-12T16:28:45.645167Z"},"links":{"cited_paper":"/paper/2110.14427","citing_paper":"/paper/2411.13711"},"observation_digest":"sha256:93c07118e248ffc0283ab315d9a5658531e023967680b92c1a0af6177990b48a","observation_id":"4ce5fb79-b1f8-42f3-b960-8f01125195a1","resolution":{"observed_at":"2026-08-12T16:28:45.645167Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2102.01567","last_updated":"2023-09-04T20:15:15Z","snapshot_observed_at":"2026-08-16T18:48:15.972077Z","submitted_at":"2021-02-02T15:48:19Z","title":"A Lyapunov Theory for Finite-Sample Guarantees of Asynchronous Q-Learning and TD-Learning Variants","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.01567","snapshot_observed_at":"2026-08-12T16:28:45.659398Z","title":"A lyapunov theory for finite-sample guarantees of asynchrono us q-learning and td-learning variants","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.13711","last_updated":"2024-11-20T21:09:09Z","snapshot_observed_at":"2026-08-16T16:35:14.214681Z","submitted_at":"2024-11-20T21:09:09Z","title":"Almost Sure Convergence Rates and Concentration of Stochastic Approximation and Reinforcement Learning with Markovian Noise","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-12T16:28:45.659398Z"},"links":{"cited_paper":"/paper/2102.01567","citing_paper":"/paper/2411.13711"},"observation_digest":"sha256:09029ac37be89305849aa58db7d17d0cc9b60d5a9df33a8986dded49c44326e6","observation_id":"d525b9a2-4279-4cb1-b182-8a632a53c370","resolution":{"observed_at":"2026-08-12T16:28:45.659398Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.15740","last_updated":"2024-09-17T01:23:33Z","snapshot_observed_at":"2026-08-18T13:22:07.750686Z","submitted_at":"2023-03-28T05:32:30Z","title":"Concentration of Contractive Stochastic Approximation: Additive and Multiplicative Noise","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.15740","snapshot_observed_at":"2026-08-12T16:28:45.664062Z","title":"Conc entration of contrac- tive stochastic approximation: Additive and multiplicati ve noise","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.13711","last_updated":"2024-11-20T21:09:09Z","snapshot_observed_at":"2026-08-16T16:35:14.214681Z","submitted_at":"2024-11-20T21:09:09Z","title":"Almost Sure Convergence Rates and Concentration of Stochastic Approximation and Reinforcement Learning with Markovian Noise","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-12T16:28:45.664062Z"},"links":{"cited_paper":"/paper/2303.15740","citing_paper":"/paper/2411.13711"},"observation_digest":"sha256:1b923da918ef959ba633b55b98d880b0808861e1a3087f3e9e9fe894e6ff5a9e","observation_id":"dddba068-43cb-4e21-9dda-2a7ce58eb053","resolution":{"observed_at":"2026-08-12T16:28:45.664062Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.00874","last_updated":"2021-06-30T13:09:14Z","snapshot_observed_at":"2026-08-13T23:36:09.334741Z","submitted_at":"2020-02-03T16:42:01Z","title":"Finite-Sample Analysis of Stochastic Approximation Using Smooth Convex Envelopes","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.00874","snapshot_observed_at":"2026-08-12T16:28:45.654440Z","title":"Finite-sample analysis of contractive stochastic approxi mation using smooth convex en- velopes","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2411.13711","last_updated":"2024-11-20T21:09:09Z","snapshot_observed_at":"2026-08-16T16:35:14.214681Z","submitted_at":"2024-11-20T21:09:09Z","title":"Almost Sure Convergence Rates and Concentration of Stochastic Approximation and Reinforcement Learning with Markovian Noise","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-12T16:28:45.654440Z"},"links":{"cited_paper":"/paper/2002.00874","citing_paper":"/paper/2411.13711"},"observation_digest":"sha256:edd19a689af4b2ec0c97ac0bf87941799103acc1603b1e57af08bf46ffd0de46","observation_id":"d855268a-8c1f-48c5-86cf-b152f17a6e97","resolution":{"observed_at":"2026-08-12T16:28:45.654440Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.06265","last_updated":"2019-06-24T17:09:55Z","snapshot_observed_at":"2026-08-19T13:37:53.419070Z","submitted_at":"2019-05-15T16:06:30Z","title":"Stochastic approximation with cone-contractive operators: Sharp $\\ell_\\infty$-bounds for $Q$-learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.06265","snapshot_observed_at":"2026-08-12T16:28:45.790771Z","title":"Stochastic approximation with cone-c ontractive operators: Sharp l ∞-bounds for q-learning","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2411.13711","last_updated":"2024-11-20T21:09:09Z","snapshot_observed_at":"2026-08-16T16:35:14.214681Z","submitted_at":"2024-11-20T21:09:09Z","title":"Almost Sure Convergence Rates and Concentration of Stochastic Approximation and Reinforcement Learning with Markovian Noise","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-12T16:28:45.790771Z"},"links":{"cited_paper":"/paper/1905.06265","citing_paper":"/paper/2411.13711"},"observation_digest":"sha256:6728278c5c5e9b1e37b3171b24d8f7bcb0247b188ef4bb679d1071afb939c46d","observation_id":"1fc03eb2-5d19-4bfe-81a9-8fec8f1e403d","resolution":{"observed_at":"2026-08-12T16:28:45.790771Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2411.13711","last_updated":"2024-11-20T21:09:09Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T16:35:14.214681Z","submitted_at":"2024-11-20T21:09:09Z","title":"Almost Sure Convergence Rates and Concentration of Stochastic Approximation and Reinforcement Learning with Markovian Noise"},"reference_resolution":{"displayed":12,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":11,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":12},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 12 of 12 outbound references and 5 inbound Pith citation observations for arXiv:2411.13711."}