{"as_of":"2026-08-04T17:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0c51fc36f7ff894c41dd43d5e3174f7865d0403e4ab397332076ec152be6a6c4","coverage":[{"denominator":55,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":55,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-10T17:11:48.816106Z","state":"measured"},{"denominator":56,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":56,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-19T22:11:31.021067Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-05-19T22:12:50.628537Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"cited_work":{"arxiv_id":"2604.07323","doi":null,"metadata_source":"pith","pith_arxiv_id":"2604.07323","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Gaussian Approximation for Asynchronous Q-learning","venue":"stat.ML","work_id":"53fe7849-53bb-4b5b-9359-efc1cead6396","year":2026},"citing_paper":{"arxiv_id":"2605.17678","last_updated":"2026-05-17T22:23:25Z","snapshot_observed_at":"2026-07-06T23:28:41.111402Z","submitted_at":"2026-05-17T22:23:25Z","title":"On Gaussian approximation for entropy-regularized Q-learning with function approximation","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-19T22:11:31.021067Z"},"links":{"cited_paper":"/paper/2604.07323","citing_paper":"/paper/2605.17678"},"observation_digest":"sha256:88dbbeaa27915aae11f0da9d3fe95e2c85846612b038b6ad849be861f2e517e7","observation_id":"67ac2044-f6d0-4135-b51c-555c9ef1d1c8","resolution":{"observed_at":"2026-05-19T22:12:50.631664Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2604.07323/citation-record","integrity":"/paper/2604.07323/integrity","json":"/paper/2604.07323/citation-record.json","paper":"/paper/2604.07323"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"a131ed6f-df46-422c-8b2c-7fe319f27bf2","year":2020},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:f7f31f9dfb5aeb76d381263cadac570636006cf4d8f214f7402874abf5726502","observation_id":"17c09e8b-3748-41c0-b2ac-c4d95f901c19","resolution":{"observed_at":"2026-05-17T11:39:32.883783Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Anderson, Peter Hall, and D","venue":null,"work_id":"4117b3b0-6e21-4bf1-911f-465db5d78259","year":1998},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:f26fb307b290885ec2e82651c45d4885f19db1fa8670300cefd27662ed31ace6","observation_id":"efe8ea1e-741d-43a6-8ace-af9725d542ed","resolution":{"observed_at":"2026-05-17T11:39:32.899053Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"bc566d04-1ebc-4da5-82bc-6ab790f45b77","year":2013},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:ce36eeb9a99a1bb807e1d1d3da6e852aa0373d61563421becd0b5e8e35dd6b64","observation_id":"9fc5c279-16ae-42e9-adb5-bb3d4c942863","resolution":{"observed_at":"2026-05-17T11:39:32.850252Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1809.02741","last_updated":"2018-09-08T02:15:18Z","snapshot_observed_at":"2026-07-06T06:59:54.770859Z","submitted_at":"2018-09-08T02:15:18Z","title":"A high dimensional Central Limit Theorem for martingales, with applications to context tree models","version":1},"cited_work":{"arxiv_id":"1809.02741","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1809.02741","snapshot_observed_at":"2026-07-04T23:02:29.699054Z","title":"A high dimensional central limit theorem for martingales, with applications to context tree models","venue":null,"work_id":"6035def9-241d-4a9b-8357-b9f4bbe9dfae","year":2018},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"cited_paper":"/paper/1809.02741","citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:1df32ff1eb19e2adb6dc4aa479446278db621982b0975978c291f332900ff4d5","observation_id":"06a45f65-b833-41e2-9e0a-4604587f2fe3","resolution":{"observed_at":"2026-07-04T23:02:29.699054Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"On the dependence of the Berry–Esseen bound on dimension.Journal of Statistical Planning and Inference, 113(2):385–402","venue":null,"work_id":"6eb4252e-9891-4e44-8698-f27ba2cc8814","year":2003},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:f63a8051568c50c4e9073aaaa6072589ee7f32e41e31ea7f6b022c533bcc1958","observation_id":"f27a4c4f-7c2e-4a61-a8e8-e8f530dde067","resolution":{"observed_at":"2026-05-17T11:39:32.942188Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Bertsekas and John N","venue":null,"work_id":"16043d2a-fad1-4af5-87e2-d17f27834c32","year":1996},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:1bb5bc7429728a03dc4214b5b67c930ece758366df5ccffa530c87d01ede1c6e","observation_id":"07b59856-044a-4407-9677-b4d7d61bedfd","resolution":{"observed_at":"2026-05-17T11:39:32.921555Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Bhattacharya and R","venue":null,"work_id":"637b378b-7b44-4c89-8ab2-a51fe209bbba","year":1976},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:fccbf1349ec9ecaf4b392fca649001bbab0d374e6ae21dbf4ae0f3ab69e1f801","observation_id":"2174a691-2286-45f9-be86-002044e564fa","resolution":{"observed_at":"2026-05-17T11:39:32.914735Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Exact Convergence Rates in Some Martingale Central Limit Theorems.The Annals of Probability, 10(3):672 – 688","venue":null,"work_id":"82609f63-e27c-4f82-b8f4-ef22d464a175","year":1982},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:5d38bf2cae9b577f8197e8e354212d5b615f3fd0894387fab2d054913ccf374f","observation_id":"c8f17ddd-5034-4d22-8544-00d4d0520004","resolution":{"observed_at":"2026-05-17T11:39:32.853698Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2510.12375","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-01T21:46:15.225648Z","title":"and ZHANG, Z.-S","venue":null,"work_id":"9457416c-777d-421b-81d2-ae6266e23491","year":2025},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:5bff082b654abf5490379b9c455f21754d5df38149cf98ef0ca39ff43a22da09","observation_id":"a9fdbf16-8686-48ec-84f9-7bebe742bf42","resolution":{"observed_at":"2026-05-11T07:25:59.869875Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Gaussian approximation for two-timescale linear stochastic approximation","venue":null,"work_id":"650395df-4448-4338-9dbb-5f6b8b6b0155","year":2026},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:4cc828a295757ea1b1c3a7de1d55e6e4b435edf5cd4e116484037c34c1356ab4","observation_id":"2aaa03ba-8897-4945-b536-63505eb44f6d","resolution":{"observed_at":"2026-05-17T11:39:32.891365Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Lee, Xin T","venue":null,"work_id":"2804ebcc-e2d6-4184-a048-32c21803f236","year":2020},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:cc081b9b14f600d8c8ea0d6e22ccd4c89369ce7c6c843f346c561da4cc2d7759","observation_id":"c5bddf65-67f5-4d16-b6df-0f9200439e0f","resolution":{"observed_at":"2026-05-17T11:39:32.870505Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.00874","last_updated":"2021-06-30T13:09:14Z","snapshot_observed_at":"2026-07-06T08:54:34.491642Z","submitted_at":"2020-02-03T16:42:01Z","title":"Finite-Sample Analysis of Stochastic Approximation Using Smooth Convex Envelopes","version":6},"cited_work":{"arxiv_id":"2002.00874","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2002.00874","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Finite-sample analysis of stochastic approximation using smooth convex envelopes.arXiv Preprint, arXiv:2002.00874","venue":null,"work_id":"0cb132a4-33bb-4e99-a1ea-a703c22dcca4","year":2002},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"cited_paper":"/paper/2002.00874","citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:064d5c31c9371d7b713f05999323cf4e807b2f7736cc3ca38f9b6d328b335ae6","observation_id":"72a8ec33-9485-47f9-a6f5-d188f4513004","resolution":{"observed_at":"2026-05-11T07:25:59.819891Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"40978c20-238e-4504-8341-3bb85a070823","year":2021},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:866be6c4ce36df906ddc74149719a2cec5ea552fe7724fd9b6e003d68ef53f94","observation_id":"fcae7216-0bbc-402d-aa0d-7970ebaa2483","resolution":{"observed_at":"2026-05-17T11:39:32.873543Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Gaussian approximations and multiplier bootstrap for maxima of sums of high-dimensional random vectors.The Annals of Statistics, 41(6):2786– 2819","venue":null,"work_id":"4ffa6c13-1013-42e2-923b-05541bf38dc4","year":2013},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:d74ff5da1facc237400874dc506c6c5130e9f028ff465126ce2ec0a7ad801476","observation_id":"27a3e51e-bbdd-4927-a4f1-643f37723253","resolution":{"observed_at":"2026-05-17T11:39:32.895420Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Central limit theorems and bootstrap in high dimensions.The Annals of Probability, 45(4):2309–2352","venue":null,"work_id":"c38dc9ed-eaaa-4abb-b7b6-752dae9c5106","year":2017},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:78cc8a1094b21b9350f9e1a7b3aa549fc2a704e682d65043f9de5c142a8e45be","observation_id":"f48ccc8a-f047-44f6-8f11-41b400e51b32","resolution":{"observed_at":"2026-05-17T11:39:32.880693Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1711.10696","last_updated":"2017-11-29T06:28:41Z","snapshot_observed_at":"2026-07-06T06:11:44.900667Z","submitted_at":"2017-11-29T06:28:41Z","title":"Detailed proof of Nazarov's inequality","version":1},"cited_work":{"arxiv_id":"1711.10696","doi":null,"metadata_source":"pith","pith_arxiv_id":"1711.10696","snapshot_observed_at":"2026-06-29T09:13:16.242464Z","title":"Detailed proof of Nazarov's inequality","venue":"math.ST","work_id":"9cdd7365-d272-4fd1-982a-ec4bf4caa862","year":2017},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"cited_paper":"/paper/1711.10696","citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:2a9f2ac9d68bb009fcdfb0342f0016d6259399ffa0aaa694618365456d429f2f","observation_id":"e7971aeb-b4c2-424d-a8cc-5e70df9f0ee2","resolution":{"observed_at":"2026-05-11T07:25:59.884874Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Improved central limit theorem and bootstrap approximations in high dimensions.The Annals of Statistics, 50(5):2562–2586","venue":null,"work_id":"2193d232-86e4-4781-b817-02e39be26f4a","year":2022},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:a0a087e549e5855f8a72159cef7004c3c70d3a896933c3c060d856d99d7be0a3","observation_id":"cc2cc32a-19fd-46d1-8f93-ceec902ebe3c","resolution":{"observed_at":"2026-05-17T11:39:32.867384Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Springer Series in Operations Research and Financial Engineering","venue":null,"work_id":"1f5ec696-5faa-478f-9116-107998239d41","year":2018},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:2039a6d1f969840bd3d51f9ee18ba5fa59144cc213233e80fc44a923a280bf87","observation_id":"e36df762-04ac-4fc7-a38a-45963a3e7690","resolution":{"observed_at":"2026-05-17T11:39:32.918303Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Learning rates for q-learning.Journal of Machine Learning Research, 5:1–25","venue":null,"work_id":"7d4a211b-b5a6-4e6d-9640-fb8a2748e9c3","year":2003},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:b7c6f4b86d6af50d27cd14ee0c643e5d8ef5c9b089b7627f1d574b3116419459","observation_id":"7311112f-070b-465b-85d7-47e360a6be1b","resolution":{"observed_at":"2026-05-17T11:39:32.856953Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Exact rates of convergence in some martingale central limit theorems.Journal of Mathematical Analysis and Applications, 469(2):1028–1044","venue":null,"work_id":"1baa134a-9ba4-457f-91cd-da4e93de5503","year":2019},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:23e58266caee494a1fba11121f45cf7cddd0a3c93e4ba5d7b5c8afa1f20caea6","observation_id":"a9e0d51c-4f39-4081-9dc9-1d9a44def023","resolution":{"observed_at":"2026-05-17T11:39:32.935428Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"High-dimensional central limit theorems by Stein’s method.The Annals of Applied Probability, 31(4):1660 – 1686","venue":null,"work_id":"f64aba83-1612-4563-a0e7-fb456b8f6ce7","year":2021},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:744b6435f246d4f519550e911355955f5d38d62c4265b3db916ca89174a25aba","observation_id":"dc18fa01-dca7-4698-a6e6-fc4a7a2a7122","resolution":{"observed_at":"2026-05-17T11:39:32.925102Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Online bootstrap confidence intervals for the stochastic gradient descent estimator.Journal of Machine Learning Research, 19(78):1–21","venue":null,"work_id":"6e3bcbdf-c27f-4d3c-aee5-619fdad0c064","year":2018},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:8ef60d7579882488a513ac0c1efd4ba29ca7a87e193cc378d5b57e379b27c25b","observation_id":"0db6baa1-7a9e-4fe1-b0f4-ff81f6943846","resolution":{"observed_at":"2026-05-17T11:39:32.863805Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1805.01720","last_updated":"2018-05-04T11:45:23Z","snapshot_observed_at":"2026-07-06T06:37:23.588751Z","submitted_at":"2018-05-04T11:45:23Z","title":"Regularity of solutions of the Stein equation and rates in the multivariate central limit theorem","version":1},"cited_work":{"arxiv_id":"1805.01720","doi":null,"metadata_source":"pith","pith_arxiv_id":"1805.01720","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Regularity of solutions of the Stein equation and rates in the multivariate central limit theorem","venue":"math.PR","work_id":"d9bd3440-6a23-4f21-a61b-21d1b4f9103e","year":2018},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"cited_paper":"/paper/1805.01720","citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:00dbed2c306d76e1811a994a41754b8bf8812a34b3c0dcb80006cdeb1755d9ec","observation_id":"34191e91-74e2-4349-90cb-9360d19a440b","resolution":{"observed_at":"2026-05-11T07:25:59.923408Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"On the rate of convergence in the multivariate CLT.The Annals of Probability, 19(2):724–739, April 1991","venue":null,"work_id":"37e8dd23-7e1c-4108-b063-4d2ab8c2723f","year":1991},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:b1fe5fa218288ae17f764726bcaa4e5842e12bf3e3690d343b128c33920061f9","observation_id":"ffc5f95e-91e7-475e-a207-56f8c07a08ed","resolution":{"observed_at":"2026-05-17T11:39:32.887791Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Efficiently solving mdps with stochastic mirror descent","venue":null,"work_id":"f3991847-f0f2-4351-9555-92c4422238be","year":2020},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:7bcf0f3905c157107d829fa9ad7a78a7d9d234421a1da00650344d77b435a2ad","observation_id":"b3e73703-63a4-4355-b1ff-935134e12368","resolution":{"observed_at":"2026-05-17T11:39:32.847171Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"A Berry–Esseen bound for vector-valued martingales.Statistics & Probability Letters, 186:109448","venue":null,"work_id":"a75f9302-fbea-4873-9785-6e8a0ab8a895","year":2022},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:198621a98069359d5bb3331c2c785821275f408df7a2355e0187ed5ddd01d2a3","observation_id":"e9081292-1292-497b-93fb-dcd0daebc499","resolution":{"observed_at":"2026-05-17T11:39:32.843899Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2502.09884","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Nonasymptotic clt and error bounds for two-time-scale stochastic approximation.arXiv preprint arXiv:2502.09884","venue":null,"work_id":"17173444-6dd0-41f2-ab30-6b2447d27230","year":2025},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:a0b71dfdf284171933ee63429467efdaa86313374e57806868f0f8c19167fc85","observation_id":"206d7ba6-c205-48c4-9e9d-618f05477532","resolution":{"observed_at":"2026-05-11T07:25:59.844874Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2009.13673","last_updated":"2020-09-28T22:52:32Z","snapshot_observed_at":"2026-08-04T15:44:45.656363Z","submitted_at":"2020-09-28T22:52:32Z","title":"High-dimensional CLT for Sums of Non-degenerate Random Vectors: $n^{-1/2}$-rate","version":1},"cited_work":{"arxiv_id":"2009.13673","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2009.13673","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"High-dimensional CLT for Sums of Non-degenerate Random Vectors: n^","venue":null,"work_id":"4a02612c-f323-4bab-832a-a0f4c9667d58","year":2009},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"cited_paper":"/paper/2009.13673","citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:4879b65dbe4aa50ab1f772cac19e46758f292c88b57a845fe29e9ffcc5166e9a","observation_id":"dc46c60d-a818-43cc-8323-20572b31ec99","resolution":{"observed_at":"2026-05-11T07:25:59.893122Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Is q-learning minimax optimal? a tight sample complexity analysis.Operations Research, 72(1):222–236","venue":null,"work_id":"983e5789-d1c4-476e-909d-abe3bda970be","year":2024},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:d87989b8c8bfc2ad79fdc8633e5efb5ebf2ffd186790ad70e69742e57ed7c8dc","observation_id":"d00910a6-1cc3-4709-8ee1-f0a50e193307","resolution":{"observed_at":"2026-05-17T11:39:32.860373Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Breaking the sample size barrier in model-based reinforcement learning with a generative model","venue":null,"work_id":"0776874e-c1a9-4f38-90ea-f885a0f929bb","year":2020},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:1f4a4220005206c7a0b307705120d6b47c8c549bfe87988c9eb714c89485a740","observation_id":"af963faf-d7a2-4f0c-b76e-2b2471a5953b","resolution":{"observed_at":"2026-05-17T11:39:32.903243Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Is q-learning minimax optimal? a tight sample complexity analysis.Operations Research, 72(1):222–236","venue":null,"work_id":"29eed8df-dcc0-4f1e-ba7f-cbcc7f638803","year":2024},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:6a95801a26ca1b5679d416fa5a31a9f07da2c2d46b4f00c425bf970333f412ba","observation_id":"1dd25054-6c7f-4863-9902-cc358a299641","resolution":{"observed_at":"2026-05-17T11:39:32.911573Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.07434","last_updated":"2024-09-11T17:28:38Z","snapshot_observed_at":"2026-07-06T19:13:50.684379Z","submitted_at":"2024-09-11T17:28:38Z","title":"Asymptotics of Stochastic Gradient Descent with Dropout Regularization in Linear Models","version":1},"cited_work":{"arxiv_id":"2409.07434","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2409.07434","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Asymptotics of Stochastic Gradient Descent with Dropout Regularization in Linear Models","venue":null,"work_id":"a430e98a-0521-4ff1-b3bd-168de7103e83","year":2024},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"cited_paper":"/paper/2409.07434","citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:034698aa11d90b11bf39fcbbdca5de726dcd406879aac4d327882ddb97e68403","observation_id":"4cf942dd-7f18-4ff9-ba1b-2a7bc596c937","resolution":{"observed_at":"2026-05-11T07:25:59.852635Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"A statistical analysis of polyak-ruppert averaged q-learning","venue":null,"work_id":"cbf4be7c-d23a-404b-865e-a1f59a6f0a7d","year":2023},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:74c851d0c67c2c4302c8de15c6192eb7f8493020c024aac8e29dc84d71c4b981","observation_id":"68b69d25-12d7-4540-91fb-08739c4433b6","resolution":{"observed_at":"2026-05-17T11:39:32.938703Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2509.18964","last_updated":"2026-04-20T11:35:29Z","snapshot_observed_at":"2026-07-06T22:30:31.933240Z","submitted_at":"2025-09-23T13:16:14Z","title":"Central Limit Theorems for Asynchronous Averaged Q-Learning","version":3},"cited_work":{"arxiv_id":"2509.18964","doi":null,"metadata_source":"pith","pith_arxiv_id":"2509.18964","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Central Limit Theorems for Asynchronous Averaged Q-Learning","venue":"cs.LG","work_id":"a74f3960-4e8e-4a12-a8ad-98b07c578800","year":2025},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"cited_paper":"/paper/2509.18964","citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:e2684e978218bb260531f403616fce555ff3f22b6b20ccb0649caf9f0f802bb2","observation_id":"319119e5-b75f-4a34-a2f3-45f1d8e6d5d9","resolution":{"observed_at":"2026-05-11T07:25:59.828468Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Concentration inequalities for sums of markov-dependent random matrices.Information and Inference: A Journal of the IMA, 13(4):iaae032","venue":null,"work_id":"1e838c37-246c-4bde-ac31-8ba520947ee3","year":2024},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:2806d55a61d42c67a048ba86b8ff44c2c56fafa2ccf9eec1317f69910be7ff60","observation_id":"d353ee5a-e83b-43d6-87ac-192ab437c281","resolution":{"observed_at":"2026-05-17T11:39:32.837435Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"New stochastic approximation type procedures.Automat","venue":null,"work_id":"8ce3af34-35f4-442b-be45-734d62797651","year":1990},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:da48f291305bc0045731e70fe02d5cd3626a71126e3aac9b4d9f59fc10864bef","observation_id":"18d51853-e684-4487-b01b-29f26b6f041f","resolution":{"observed_at":"2026-05-17T11:39:32.817522Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Acceleration of stochastic approximation by averaging.SIAM journal on control and optimization, 30(4):838–855","venue":null,"work_id":"e229dace-bf39-49be-8877-18a949273085","year":1992},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:9c99786991b3eb45c5ee5183c1ccd6d9b6293c9baaba9a4ddfd1f9b7f945b6d7","observation_id":"23324682-fef6-4752-9ddf-5b1b38cd4e22","resolution":{"observed_at":"2026-05-17T11:39:32.877292Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Puterman.Markov Decision Processes: Discrete Stochastic Dynamic Programming","venue":null,"work_id":"9096adf7-bfdd-40fe-9486-d0841e0bef47","year":1994},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:ea06312a3c34ce3ea47e79b363c6088cf4fd6e29c9684df72452a7c2140e258e","observation_id":"2fab149e-a821-4c51-88b6-a30c5bcd5753","resolution":{"observed_at":"2026-05-17T11:39:32.827624Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Finite-time analysis of asynchronous stochastic approximation and q-learning","venue":null,"work_id":"fda1823e-0928-4c06-8273-02ef2af19865","year":2020},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:12f94b5a313b612357be1ed97cb9cbc7c68763f918c02a9a4705da944426d0d9","observation_id":"92e1848a-d317-4b0a-9530-e3648ff551ac","resolution":{"observed_at":"2026-05-17T11:39:32.820899Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Multivariate normal approximation with Stein’s method of ex- changeable pairs under a general linearity condition.The Annals of Probability, 37(6):2150 – 2173","venue":null,"work_id":"f96a4b69-7efc-4b8a-87de-63dfb309b8e7","year":2009},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:a91970ed0aa2b55a652159c4a7bc8aaaaf5122949891fe031e85128cefb73c19","observation_id":"72acc8df-8150-475e-94b4-825c14445af3","resolution":{"observed_at":"2026-05-17T11:39:32.810944Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"On quantitative bounds in the mean martingale central limit theorem.Statistics & Probability Letters, 138:171–176","venue":null,"work_id":"284f1067-ee6a-4b00-8b57-84c2271579a3","year":2018},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:f9dfc2cbb1e75c54c54e84b3e324251cbbdc21e2d5b845557e673f114c5c0538","observation_id":"3cb1514c-1381-47dd-a479-190ec1df18e8","resolution":{"observed_at":"2026-05-17T11:39:32.807530Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Efficient estimations from a slowly convergent Robbins-Monro process","venue":null,"work_id":"b1153e7f-98c5-42b1-a5df-f65a2fb8d522","year":1988},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:37aa53d3c50737e86317cdd56b01c3bb680f9c65591c4a53353f04059eb97cb0","observation_id":"6149379c-880e-47c1-b7f9-126935c3de6d","resolution":{"observed_at":"2026-05-17T11:39:32.814172Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"0f98cbc4-918a-4353-93e1-a7b76dd91bd5","year":2024},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:8e136b09cea132b2972f24826eab91ffe8d80d8c3bd3e20e1a9cd170ff911ef0","observation_id":"e886c817-3bba-4a6f-b4ce-56ede99313a6","resolution":{"observed_at":"2026-05-17T11:39:32.824169Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.19102","last_updated":"2025-05-25T11:43:28Z","snapshot_observed_at":"2026-07-06T21:30:04.828669Z","submitted_at":"2025-05-25T11:43:28Z","title":"Statistical inference for Linear Stochastic Approximation with Markovian Noise","version":1},"cited_work":{"arxiv_id":"2505.19102","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.19102","snapshot_observed_at":"2026-07-03T23:29:02.029526Z","title":"Statistical inference for linear stochastic approximation with markovian noise.arXiv preprint arXiv:2505.19102","venue":null,"work_id":"f8ab9b67-6456-42b8-ab43-1a398b96241f","year":2025},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"cited_paper":"/paper/2505.19102","citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:e01ecb3f7a9ade868398fb282f1108f251aa24f23f7d22c3cd67da9636ed7871","observation_id":"5b64ad4c-5317-43c5-ab7e-eeb96956a16b","resolution":{"observed_at":"2026-05-11T07:25:59.943910Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06719","last_updated":"2026-05-04T10:50:33Z","snapshot_observed_at":"2026-07-06T20:34:06.899427Z","submitted_at":"2025-02-10T17:49:05Z","title":"Gaussian Approximation and Multiplier Bootstrap for Stochastic Gradient Descent","version":3},"cited_work":{"arxiv_id":"2502.06719","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.06719","snapshot_observed_at":"2026-07-01T21:46:15.184522Z","title":"Gaussian Approximation and Multiplier Bootstrap for Stochastic Gradient Descent","venue":"stat.ML","work_id":"06b8a6c9-a585-4e52-aeef-7148619d9cc0","year":2025},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"cited_paper":"/paper/2502.06719","citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:3647f52cff48b295bf412fb2dc2792c9495df04d4321cbcb26b0a3e4d090062a","observation_id":"2c59474f-08a3-450c-a8ca-caa6e2161aae","resolution":{"observed_at":"2026-05-11T07:25:59.959150Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"a2e7e305-e77a-4447-a01a-e0f8535198a8","year":2025},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:a6530ad6025141bb9e29de042d52d389b28aab4ee3e3b6b419c310f04b51bb09","observation_id":"cef8a62f-9158-4d6d-adfc-c035449027a9","resolution":{"observed_at":"2026-05-17T11:39:32.931896Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-08T14:14:59.445454Z","title":"Sutton and Andrew G","venue":null,"work_id":"34a41b4b-6488-46eb-93a5-911d8a963bbc","year":2018},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:c7da4512ec9a6a1b2a4ea8ca9ecc8f81afbdc31e8948796038c6e19e6057dcfc","observation_id":"d5213755-02f7-40a6-9bee-2612eef29b20","resolution":{"observed_at":"2026-05-17T11:39:32.907798Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.06265","last_updated":"2019-06-24T17:09:55Z","snapshot_observed_at":"2026-07-06T07:53:15.177000Z","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":"1905.06265","doi":null,"metadata_source":"pith","pith_arxiv_id":"1905.06265","snapshot_observed_at":"2026-07-09T22:56:37.754397Z","title":"Stochastic approximation with cone-contractive operators: Sharp $\\ell_\\infty$-bounds for $Q$-learning","venue":"cs.LG","work_id":"493446c0-0206-4c59-8a76-c5c0886192b1","year":2019},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"cited_paper":"/paper/1905.06265","citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:bb3790742dc348259ae0da5c4aed59866fca12b31d2fb1b4999c6605bb1bd1ee","observation_id":"0a7d760a-9cf2-497d-8880-cb0b59df6dba","resolution":{"observed_at":"2026-05-11T07:25:59.858264Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1906.04697","last_updated":"2019-08-08T17:33:58Z","snapshot_observed_at":"2026-07-06T07:59:34.794687Z","submitted_at":"2019-06-11T16:58:54Z","title":"Variance-reduced $Q$-learning is minimax optimal","version":2},"cited_work":{"arxiv_id":"1906.04697","doi":null,"metadata_source":"pith","pith_arxiv_id":"1906.04697","snapshot_observed_at":"2026-07-09T22:56:37.735104Z","title":"Variance-reduced q-learning is minimax optimal","venue":"cs.LG","work_id":"60497a6e-266a-42d8-9dd6-acc8d3171cc4","year":2019},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"cited_paper":"/paper/1906.04697","citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:ecbf1cdc60a597d720475df994e691e9584603d84a8701f502c51960c925198d","observation_id":"d976f237-ad61-48dd-99a0-9f29ce3c1dce","resolution":{"observed_at":"2026-05-11T07:25:59.876792Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Randomized linear programming solves the markov decision problem in nearly linear (sometimes sublinear) time.Mathematics of Operations Research, 45(2):517–546","venue":null,"work_id":"545bbd12-e6e1-4d2f-b7de-aafa1551d0df","year":2020},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:10ca723927c8db9b4124011b206c8ac458deb5c98946e0d5fd864f1ce216802e","observation_id":"754525f4-4a2f-4227-a21d-f8bf142b4f5e","resolution":{"observed_at":"2026-05-17T11:39:32.928609Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Online Covariance Matrix Estimation in Stochastic Gradient Descent.Journal of the American Statistical Association, 118(541):393–404","venue":null,"work_id":"dfef0d63-747e-44b9-a796-6ccb9354506b","year":2023},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:068c8682c0ea96ee37ee39927e0dd1f047721554012ef2a3bbc82570ced5a5a8","observation_id":"b53fc583-0aa2-4f6e-abc6-cac615f71a09","resolution":{"observed_at":"2026-05-17T11:39:32.831150Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"2d62c107-5de1-44f5-b94e-f59256d04215","year":1989},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:e83131f47793f9b4913ad2c31ab41941b1096b5c4f5000a14e7ef38b20fef264","observation_id":"11d6687f-2c79-4e2c-9553-fa28fa821a5b","resolution":{"observed_at":"2026-05-17T11:39:32.834170Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"037c2f83-0401-4d0c-8cb5-5e08c30a6f8b","year":1992},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:cebeba1b1a24de7f7c739e1bc4cc18fd63df52b63764a718e5864322c9d3cb26","observation_id":"361b5503-949d-427c-8362-a47d7f929d60","resolution":{"observed_at":"2026-05-17T11:39:32.840631Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.16106","last_updated":"2026-06-21T21:42:59Z","snapshot_observed_at":"2026-08-02T15:16:38.422811Z","submitted_at":"2024-10-21T15:34:44Z","title":"Statistical Inference for Policy Evaluation with Temporal Difference Learning","version":6},"cited_work":{"arxiv_id":"2410.16106","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.16106","snapshot_observed_at":"2026-06-23T03:13:09.455495Z","title":"Statistical Inference for Temporal Difference Learning with Linear Function Approximation","venue":null,"work_id":"aeaad93f-8e33-49d7-b7ea-ae6a23d879f6","year":2024},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"cited_paper":"/paper/2410.16106","citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:fe224b545946b7dcc51ba6755f4b835f992bccce85970390e5b0348d10ae355e","observation_id":"ae2c99bd-b6bf-481e-9378-71930048d62f","resolution":{"observed_at":"2026-06-23T03:13:09.455495Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.13822","last_updated":"2026-05-21T08:10:44Z","snapshot_observed_at":"2026-07-06T20:39:15.111209Z","submitted_at":"2025-02-19T15:33:55Z","title":"Uncertainty quantification for Markov chain induced martingales with application to temporal difference learning","version":3},"cited_work":{"arxiv_id":"2502.13822","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.13822","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Uncertainty quantification for Markov chains with application to temporal difference learning","venue":null,"work_id":"6fa7e411-91e6-464d-9d45-cc8f8aec253e","year":2025},"citing_paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-05-10T17:11:48.816106Z"},"links":{"cited_paper":"/paper/2502.13822","citing_paper":"/paper/2604.07323"},"observation_digest":"sha256:529612980372c00069ab4ee15f1125dc5006e33ac93d363ebc90808cd122fa92","observation_id":"08382349-42f3-4684-951c-2d12d3197992","resolution":{"observed_at":"2026-05-22T02:03:46.373087Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2604.07323","last_updated":"2026-04-08T17:37:15Z","latest_version":1,"primary_category":"stat.ML","snapshot_observed_at":"2026-07-06T22:55:37.787732Z","submitted_at":"2026-04-08T17:37:15Z","title":"Gaussian Approximation for Asynchronous Q-learning"},"reference_resolution":{"displayed":55,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":7,"verified_exact":14,"verified_fuzzy":33},"total_outbound_references":55},"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-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 4 August 2026, this Paper Citation Record lists 55 of 55 outbound references and 1 inbound Pith citation observation for arXiv:2604.07323."}