{"as_of":"2026-08-08T21:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6d44f4f1b77990a23ba102f193fb90028fdcec47322e08dd7348685b342f7676","coverage":[{"denominator":22,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":22,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-27T23:43:27.932309Z","state":"measured"},{"denominator":22,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":22,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2606.05967/citation-record","integrity":"/paper/2606.05967/integrity","json":"/paper/2606.05967/citation-record.json","paper":"/paper/2606.05967"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T23:43:27.932309Z","title":"Non-strongly-convex smooth stochastic approximation with convergence rate O (1/n)","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2606.05967","last_updated":"2026-06-05T07:03:28Z","snapshot_observed_at":"2026-08-04T22:29:50.912035Z","submitted_at":"2026-06-04T10:10:29Z","title":"Fast and Robust Convergence Rate for TD(0) with Linear Function Approximation, Universal Learning Steps and I.I.D. Samples","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-06-27T23:43:27.932309Z"},"links":{"citing_paper":"/paper/2606.05967"},"observation_digest":"sha256:b7d844a3d214f22e86d2c63f5b115d13207f5ed1333c0f28a8534c3e62f1d3a5","observation_id":"675cd709-6400-4971-8b3a-972db4bf64db","resolution":{"observed_at":"2026-06-27T23:43:27.932309Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T23:43:27.932309Z","title":"A non-asymptotic analysis of non-parametric temporal-difference learning","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.05967","last_updated":"2026-06-05T07:03:28Z","snapshot_observed_at":"2026-08-04T22:29:50.912035Z","submitted_at":"2026-06-04T10:10:29Z","title":"Fast and Robust Convergence Rate for TD(0) with Linear Function Approximation, Universal Learning Steps and I.I.D. Samples","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-06-27T23:43:27.932309Z"},"links":{"citing_paper":"/paper/2606.05967"},"observation_digest":"sha256:6af1a86b05bebab5fecf706593280de6507eed998d983c329e80b77077b398ee","observation_id":"1ee20919-e929-4441-b5b7-663225063695","resolution":{"observed_at":"2026-06-27T23:43:27.932309Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T23:43:27.932309Z","title":"A finite time analysis of temporal difference learning with linear function approximation","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.05967","last_updated":"2026-06-05T07:03:28Z","snapshot_observed_at":"2026-08-04T22:29:50.912035Z","submitted_at":"2026-06-04T10:10:29Z","title":"Fast and Robust Convergence Rate for TD(0) with Linear Function Approximation, Universal Learning Steps and I.I.D. Samples","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-06-27T23:43:27.932309Z"},"links":{"citing_paper":"/paper/2606.05967"},"observation_digest":"sha256:9dffed99bab6aefa5a244c17952f17a29da3196a24718e833fa2c4aa748807c2","observation_id":"892db21c-2c0d-447d-a324-b5240bc3d6be","resolution":{"observed_at":"2026-06-27T23:43:27.932309Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T23:43:27.932309Z","title":"Lee, and Zhaoran Wang","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.05967","last_updated":"2026-06-05T07:03:28Z","snapshot_observed_at":"2026-08-04T22:29:50.912035Z","submitted_at":"2026-06-04T10:10:29Z","title":"Fast and Robust Convergence Rate for TD(0) with Linear Function Approximation, Universal Learning Steps and I.I.D. Samples","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-06-27T23:43:27.932309Z"},"links":{"citing_paper":"/paper/2606.05967"},"observation_digest":"sha256:95debef82e7a31aed6d593666f9f4b6762fe9888716cac6d861ace8ab865c690","observation_id":"2ef4255f-303c-495b-9ee4-4afb88c0c9ec","resolution":{"observed_at":"2026-06-27T23:43:27.932309Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T23:43:27.932309Z","title":"Finite sample analyses for TD (0) with function approximation","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.05967","last_updated":"2026-06-05T07:03:28Z","snapshot_observed_at":"2026-08-04T22:29:50.912035Z","submitted_at":"2026-06-04T10:10:29Z","title":"Fast and Robust Convergence Rate for TD(0) with Linear Function Approximation, Universal Learning Steps and I.I.D. Samples","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-06-27T23:43:27.932309Z"},"links":{"citing_paper":"/paper/2606.05967"},"observation_digest":"sha256:91e11678e2f40940e629f9e3b9c6c43ef191d27639bc041d3f01fa33c2654c29","observation_id":"37e5917f-b1b2-441d-9151-8bbed8c5dcf8","resolution":{"observed_at":"2026-06-27T23:43:27.932309Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T23:43:27.932309Z","title":"Wainwright, and Michael I","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.05967","last_updated":"2026-06-05T07:03:28Z","snapshot_observed_at":"2026-08-04T22:29:50.912035Z","submitted_at":"2026-06-04T10:10:29Z","title":"Fast and Robust Convergence Rate for TD(0) with Linear Function Approximation, Universal Learning Steps and I.I.D. Samples","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-06-27T23:43:27.932309Z"},"links":{"citing_paper":"/paper/2606.05967"},"observation_digest":"sha256:584aef5560ad3470a65f82c330ef5b966c295856a1082a2d3c4ec8d74377e2d0","observation_id":"fb22ef54-547e-403d-81a0-4ee4fb059064","resolution":{"observed_at":"2026-06-27T23:43:27.932309Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2202.07960","last_updated":"2023-06-07T12:18:33Z","snapshot_observed_at":"2026-08-08T10:30:31.331783Z","submitted_at":"2022-02-16T10:10:53Z","title":"Temporal Difference Learning with Continuous Time and State in the Stochastic Setting","version":3},"cited_work":{"arxiv_id":"2202.07960","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2202.07960","snapshot_observed_at":"2026-07-02T15:37:06.772989Z","title":"Temporal difference learning with continuous time and state in the stochastic setting","venue":null,"work_id":"0173142a-f268-414e-a940-9e4240bc5d70","year":2022},"citing_paper":{"arxiv_id":"2606.05967","last_updated":"2026-06-05T07:03:28Z","snapshot_observed_at":"2026-08-04T22:29:50.912035Z","submitted_at":"2026-06-04T10:10:29Z","title":"Fast and Robust Convergence Rate for TD(0) with Linear Function Approximation, Universal Learning Steps and I.I.D. Samples","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-06-27T23:43:27.932309Z"},"links":{"cited_paper":"/paper/2202.07960","citing_paper":"/paper/2606.05967"},"observation_digest":"sha256:087654a562b9155fe08f9ef31bbf2da6cdb3fd241604a76603ce45ed655ce8ee","observation_id":"e9f8e421-0d5d-42d1-ae99-961e5cd0d7ac","resolution":{"observed_at":"2026-07-02T15:37:06.774474Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T23:43:27.932309Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.05967","last_updated":"2026-06-05T07:03:28Z","snapshot_observed_at":"2026-08-04T22:29:50.912035Z","submitted_at":"2026-06-04T10:10:29Z","title":"Fast and Robust Convergence Rate for TD(0) with Linear Function Approximation, Universal Learning Steps and I.I.D. Samples","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-06-27T23:43:27.932309Z"},"links":{"citing_paper":"/paper/2606.05967"},"observation_digest":"sha256:5da8946a1780f572a53e3cbea546f1f93ee19651adcea2f35783b339efc94aed","observation_id":"fac37991-c0c9-4d3e-92ca-854fc83c4ecb","resolution":{"observed_at":"2026-06-27T23:43:27.932309Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.01052","last_updated":"2026-06-07T16:29:36Z","snapshot_observed_at":"2026-08-07T11:49:50.260605Z","submitted_at":"2025-06-01T15:39:00Z","title":"A Robust $\\widetilde{\\mathcal{O}}(1/\\sqrt{T})$ Rate for Unprojected TD Learning with Linear Function Approximation","version":3},"cited_work":{"arxiv_id":"2506.01052","doi":null,"metadata_source":"pith","pith_arxiv_id":"2506.01052","snapshot_observed_at":"2026-07-03T23:29:02.034641Z","title":"A finite-time analysis of td learning with linear function approximation without projections nor strong convexity","venue":"cs.LG","work_id":"5f61ffe8-c9d1-48fc-b0b2-a16f489ac910","year":2025},"citing_paper":{"arxiv_id":"2606.05967","last_updated":"2026-06-05T07:03:28Z","snapshot_observed_at":"2026-08-04T22:29:50.912035Z","submitted_at":"2026-06-04T10:10:29Z","title":"Fast and Robust Convergence Rate for TD(0) with Linear Function Approximation, Universal Learning Steps and I.I.D. Samples","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-06-27T23:43:27.932309Z"},"links":{"cited_paper":"/paper/2506.01052","citing_paper":"/paper/2606.05967"},"observation_digest":"sha256:adc5690ad03e7ccc92861ee6006b580a7dcbe26eeb7b46bf990feac934deae31","observation_id":"2a3fd8fd-90a7-4e5a-903a-76b475ae6caf","resolution":{"observed_at":"2026-07-02T15:37:06.777104Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T23:43:27.932309Z","title":"Temporal difference learning as gradient splitting","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.05967","last_updated":"2026-06-05T07:03:28Z","snapshot_observed_at":"2026-08-04T22:29:50.912035Z","submitted_at":"2026-06-04T10:10:29Z","title":"Fast and Robust Convergence Rate for TD(0) with Linear Function Approximation, Universal Learning Steps and I.I.D. Samples","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-06-27T23:43:27.932309Z"},"links":{"citing_paper":"/paper/2606.05967"},"observation_digest":"sha256:0659e66581434c06ecfab537bef69b746351b6ae19e1fd14a5ae8fb02cef0524","observation_id":"8081098a-a275-459d-ab97-75ba51dcd067","resolution":{"observed_at":"2026-06-27T23:43:27.932309Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T23:43:27.932309Z","title":"A simple finite-time analysis of TD learning with linear function approximation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.05967","last_updated":"2026-06-05T07:03:28Z","snapshot_observed_at":"2026-08-04T22:29:50.912035Z","submitted_at":"2026-06-04T10:10:29Z","title":"Fast and Robust Convergence Rate for TD(0) with Linear Function Approximation, Universal Learning Steps and I.I.D. Samples","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-06-27T23:43:27.932309Z"},"links":{"citing_paper":"/paper/2606.05967"},"observation_digest":"sha256:5b88f9b7ffd758aa242850e1b54a00613fcced4ee11f0fd1916264976b213e71","observation_id":"746f7e7d-8804-4a52-9719-6156db6e4158","resolution":{"observed_at":"2026-06-27T23:43:27.932309Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T23:43:27.932309Z","title":"Robust stochastic approximation approach to stochastic programming","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2606.05967","last_updated":"2026-06-05T07:03:28Z","snapshot_observed_at":"2026-08-04T22:29:50.912035Z","submitted_at":"2026-06-04T10:10:29Z","title":"Fast and Robust Convergence Rate for TD(0) with Linear Function Approximation, Universal Learning Steps and I.I.D. Samples","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-06-27T23:43:27.932309Z"},"links":{"citing_paper":"/paper/2606.05967"},"observation_digest":"sha256:b18c098cc0da9d32602775986c32897fd80ad39104f69b7f126524274b749175","observation_id":"4d4685c6-0ab8-4677-ab67-6c74a8aeab22","resolution":{"observed_at":"2026-06-27T23:43:27.932309Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T23:43:27.932309Z","title":"Finite time analysis of temporal difference learning with linear function approximation: Tail averaging and regularisation","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.05967","last_updated":"2026-06-05T07:03:28Z","snapshot_observed_at":"2026-08-04T22:29:50.912035Z","submitted_at":"2026-06-04T10:10:29Z","title":"Fast and Robust Convergence Rate for TD(0) with Linear Function Approximation, Universal Learning Steps and I.I.D. Samples","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-06-27T23:43:27.932309Z"},"links":{"citing_paper":"/paper/2606.05967"},"observation_digest":"sha256:b0b8858194ae481b13e20010ec64d5886b16cb9d5126c6ec8400e4254652bc25","observation_id":"3807fd06-0e3e-488d-a12d-239d9aab4a55","resolution":{"observed_at":"2026-06-27T23:43:27.932309Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T23:43:27.932309Z","title":"A stochastic approximation method","venue":null,"work_id":null,"year":1951},"citing_paper":{"arxiv_id":"2606.05967","last_updated":"2026-06-05T07:03:28Z","snapshot_observed_at":"2026-08-04T22:29:50.912035Z","submitted_at":"2026-06-04T10:10:29Z","title":"Fast and Robust Convergence Rate for TD(0) with Linear Function Approximation, Universal Learning Steps and I.I.D. Samples","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-06-27T23:43:27.932309Z"},"links":{"citing_paper":"/paper/2606.05967"},"observation_digest":"sha256:a6281497b0f25be04c16c32c8495f5bb2496cef0a413dad2d786daa4b7eedc24","observation_id":"7cde91c6-716e-4657-b562-ec5ccf5d9f1a","resolution":{"observed_at":"2026-06-27T23:43:27.932309Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T23:43:27.932309Z","title":"Improved high-probability bounds for the temporal difference learning algorithm via exponential stability","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.05967","last_updated":"2026-06-05T07:03:28Z","snapshot_observed_at":"2026-08-04T22:29:50.912035Z","submitted_at":"2026-06-04T10:10:29Z","title":"Fast and Robust Convergence Rate for TD(0) with Linear Function Approximation, Universal Learning Steps and I.I.D. Samples","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-06-27T23:43:27.932309Z"},"links":{"citing_paper":"/paper/2606.05967"},"observation_digest":"sha256:271ddccd916de54b14323141004fc1f8f5d41022d17b605bf78b13c96a6b38f1","observation_id":"6dab5af1-4e38-443a-b9e3-21f00128ff54","resolution":{"observed_at":"2026-06-27T23:43:27.932309Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T23:43:27.932309Z","title":"Mastering the game of go without human knowledge","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.05967","last_updated":"2026-06-05T07:03:28Z","snapshot_observed_at":"2026-08-04T22:29:50.912035Z","submitted_at":"2026-06-04T10:10:29Z","title":"Fast and Robust Convergence Rate for TD(0) with Linear Function Approximation, Universal Learning Steps and I.I.D. Samples","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-06-27T23:43:27.932309Z"},"links":{"citing_paper":"/paper/2606.05967"},"observation_digest":"sha256:f9326c07337f05c1296db5a33514b5269dcb03c6b05934ab5940cc58a3d759f0","observation_id":"9f5a42e2-2e3f-49ee-b386-8d35f1ab109d","resolution":{"observed_at":"2026-06-27T23:43:27.932309Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T23:43:27.932309Z","title":"Finite-time error bounds for linear stochastic approximation and TD learning","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.05967","last_updated":"2026-06-05T07:03:28Z","snapshot_observed_at":"2026-08-04T22:29:50.912035Z","submitted_at":"2026-06-04T10:10:29Z","title":"Fast and Robust Convergence Rate for TD(0) with Linear Function Approximation, Universal Learning Steps and I.I.D. Samples","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-06-27T23:43:27.932309Z"},"links":{"citing_paper":"/paper/2606.05967"},"observation_digest":"sha256:73f43df49d739c8dfb11bf43d659c3e1d5eb0ae7ee85cc3c2429728da25fd66c","observation_id":"cdc77db6-6623-4bd1-ae2b-879642311594","resolution":{"observed_at":"2026-06-27T23:43:27.932309Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T23:43:27.932309Z","title":null,"venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2606.05967","last_updated":"2026-06-05T07:03:28Z","snapshot_observed_at":"2026-08-04T22:29:50.912035Z","submitted_at":"2026-06-04T10:10:29Z","title":"Fast and Robust Convergence Rate for TD(0) with Linear Function Approximation, Universal Learning Steps and I.I.D. Samples","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-06-27T23:43:27.932309Z"},"links":{"citing_paper":"/paper/2606.05967"},"observation_digest":"sha256:e9ca0d1664bc57c4eaafde601d319b3126ede97a79516fe84bec6843df9b1214","observation_id":"d6127842-dafe-4135-83bf-463a59b40ccd","resolution":{"observed_at":"2026-06-27T23:43:27.932309Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T23:43:27.932309Z","title":"Sutton and Andrew G","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.05967","last_updated":"2026-06-05T07:03:28Z","snapshot_observed_at":"2026-08-04T22:29:50.912035Z","submitted_at":"2026-06-04T10:10:29Z","title":"Fast and Robust Convergence Rate for TD(0) with Linear Function Approximation, Universal Learning Steps and I.I.D. Samples","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-06-27T23:43:27.932309Z"},"links":{"citing_paper":"/paper/2606.05967"},"observation_digest":"sha256:d18df607d639c3c794e4afbbe2c4a15fa26e83ffb6e998e68acf3101e01a87a8","observation_id":"210654a6-75a4-40dd-a593-a0fb2b677b12","resolution":{"observed_at":"2026-06-27T23:43:27.932309Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T23:43:27.932309Z","title":"Elf opengo: An analysis and open reimplementation of alphazero","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.05967","last_updated":"2026-06-05T07:03:28Z","snapshot_observed_at":"2026-08-04T22:29:50.912035Z","submitted_at":"2026-06-04T10:10:29Z","title":"Fast and Robust Convergence Rate for TD(0) with Linear Function Approximation, Universal Learning Steps and I.I.D. Samples","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-06-27T23:43:27.932309Z"},"links":{"citing_paper":"/paper/2606.05967"},"observation_digest":"sha256:a29c8899245144729b0f5b281b04508eab3536264f22e63d62033d09a5f56851","observation_id":"dba43e33-0045-4774-bbeb-cbc4e104bceb","resolution":{"observed_at":"2026-06-27T23:43:27.932309Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T23:43:27.932309Z","title":"Trefethen and Mark Embree","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2606.05967","last_updated":"2026-06-05T07:03:28Z","snapshot_observed_at":"2026-08-04T22:29:50.912035Z","submitted_at":"2026-06-04T10:10:29Z","title":"Fast and Robust Convergence Rate for TD(0) with Linear Function Approximation, Universal Learning Steps and I.I.D. Samples","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-06-27T23:43:27.932309Z"},"links":{"citing_paper":"/paper/2606.05967"},"observation_digest":"sha256:1ad184b982124bcd937abd65ab9ce8063f143d08ae4952c43f4b372770b9374e","observation_id":"62b63157-d4f2-4585-b5f2-a8113acdc65a","resolution":{"observed_at":"2026-06-27T23:43:27.932309Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/9.580874","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tsitsiklis and Benjamin Van Roy","venue":"IEEE Transactions on Automatic Control","work_id":"eb416acc-dbb6-43a9-92c0-3c83e6b6a809","year":1997},"citing_paper":{"arxiv_id":"2606.05967","last_updated":"2026-06-05T07:03:28Z","snapshot_observed_at":"2026-08-04T22:29:50.912035Z","submitted_at":"2026-06-04T10:10:29Z","title":"Fast and Robust Convergence Rate for TD(0) with Linear Function Approximation, Universal Learning Steps and I.I.D. Samples","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-06-27T23:43:27.932309Z"},"links":{"citing_paper":"/paper/2606.05967"},"observation_digest":"sha256:bb902384e941b9031c860578dce123b24a5d7c6eaf0d890b6310fcf279dd691c","observation_id":"8b353d23-ed43-4ef3-81fb-2ef74da51374","resolution":{"observed_at":"2026-06-27T23:51:25.177526Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2606.05967","last_updated":"2026-06-05T07:03:28Z","latest_version":2,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-04T22:29:50.912035Z","submitted_at":"2026-06-04T10:10:29Z","title":"Fast and Robust Convergence Rate for TD(0) with Linear Function Approximation, Universal Learning Steps and I.I.D. Samples"},"reference_resolution":{"displayed":22,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":19,"verified_exact":3,"verified_fuzzy":0},"total_outbound_references":22},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 22 of 22 outbound references and 0 inbound Pith citation observations for arXiv:2606.05967."}