{"as_of":"2026-08-10T09:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c5bc375cabaef8ac96b87c94a1c1cca2c001ab98e92d15947c6b83ddd4c0a557","coverage":[{"denominator":21,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T12:03:21.469609Z","state":"measured"},{"denominator":24,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":24,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-27T23:43:27.932309Z","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-07-03T23:29:02.034641Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.01052","last_updated":"2026-06-07T16:29:36Z","snapshot_observed_at":"2026-08-09T03:46:00.561850Z","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":"2509.08933","last_updated":"2026-05-21T17:37:36Z","snapshot_observed_at":"2026-07-06T22:28:28.274132Z","submitted_at":"2025-09-10T18:56:39Z","title":"Corruption-Tolerant Asynchronous Q-Learning with Near-Optimal Rates","version":2},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-05-22T12:58:26.626172Z"},"links":{"cited_paper":"/paper/2506.01052","citing_paper":"/paper/2509.08933"},"observation_digest":"sha256:236d88b77d29c690669570650ba5bd57b90ae9d94f238e1bcb7b9c015997b642","observation_id":"4896404f-231f-44ae-8383-243f7c9a77c6","resolution":{"observed_at":"2026-06-09T03:07:01.159921Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.01052","last_updated":"2026-06-07T16:29:36Z","snapshot_observed_at":"2026-08-09T03:46:00.561850Z","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-09T03:46:09.572958Z","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:e76e4e46eb0eff2f1d7af58fd2e0737b1e91cd7039833be16b8c1e104a1bcfe1","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.01052","last_updated":"2026-06-07T16:29:36Z","snapshot_observed_at":"2026-08-09T03:46:00.561850Z","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.18183","last_updated":"2026-06-16T17:16:52Z","snapshot_observed_at":"2026-08-09T03:46:18.603323Z","submitted_at":"2026-06-16T17:16:52Z","title":"A Diffusion Approximation for Temporal-Difference Learning with Linear Features under Markovian Noise","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-06-26T22:22:51.788055Z"},"links":{"cited_paper":"/paper/2506.01052","citing_paper":"/paper/2606.18183"},"observation_digest":"sha256:1a97c69fa1c9c2df6a5457e2bbf8bd9fea161cb4c36a8cd50ccafffe6361ff8a","observation_id":"0ef1ca93-3dd2-41be-8378-60cf046f8f3e","resolution":{"observed_at":"2026-07-03T23:29:02.036146Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2506.01052/citation-record","integrity":"/paper/2506.01052/integrity","json":"/paper/2506.01052/citation-record.json","paper":"/paper/2506.01052"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:03:27.162381Z","title":"A finite time analysis of temporal difference learning with linear function approximation","venue":null,"work_id":"8d9f9a5a-11f8-4f68-b10a-dd4990bf7fe3","year":2018},"citing_paper":{"arxiv_id":"2506.01052","last_updated":"2026-06-07T16:29:36Z","snapshot_observed_at":"2026-08-09T03:46:00.561850Z","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},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T12:03:18.617315Z"},"links":{"citing_paper":"/paper/2506.01052"},"observation_digest":"sha256:c5e51d4a91f9f923ef317d10b16c4ccb3381cf64da0748d3f4017f9fe83ef025","observation_id":"1d5643d9-2025-4b22-9964-92ad4c933866","resolution":{"observed_at":"2026-08-07T12:03:27.410486Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:03:26.678904Z","title":"Deepdriving: Learning affordance for direct perception in autonomous driving","venue":null,"work_id":"46328619-bc2e-4231-b57e-bf5d1f196fce","year":2015},"citing_paper":{"arxiv_id":"2506.01052","last_updated":"2026-06-07T16:29:36Z","snapshot_observed_at":"2026-08-09T03:46:00.561850Z","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},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T12:03:18.682758Z"},"links":{"citing_paper":"/paper/2506.01052"},"observation_digest":"sha256:c40aec2e8a7f9ffd7095347564c63bbdba038c30c420a4a9a01e82bc1abbe404","observation_id":"ec333438-c1ed-4c55-b275-bc94098c4c92","resolution":{"observed_at":"2026-08-07T12:03:26.917892Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:03:26.194588Z","title":"Cutkosky and Francesco Orabona","venue":null,"work_id":"dbe39796-4c0e-4a49-8b51-8a73d772a7f1","year":2018},"citing_paper":{"arxiv_id":"2506.01052","last_updated":"2026-06-07T16:29:36Z","snapshot_observed_at":"2026-08-09T03:46:00.561850Z","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},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T12:03:18.827002Z"},"links":{"citing_paper":"/paper/2506.01052"},"observation_digest":"sha256:9d66b051d53998a185fd0a126c571fcccbafd78f49891a5775e59943c3670e92","observation_id":"7bd7d890-9da1-41fa-85d6-530cb310fb9b","resolution":{"observed_at":"2026-08-07T12:03:26.420242Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:03:25.874334Z","title":"Finite sample analysis of two-timescale stochastic approximation with applications to reinforcement learning","venue":null,"work_id":"24ec89c4-a74e-4702-a3f4-e99def0c20a4","year":2018},"citing_paper":{"arxiv_id":"2506.01052","last_updated":"2026-06-07T16:29:36Z","snapshot_observed_at":"2026-08-09T03:46:00.561850Z","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},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T12:03:18.972656Z"},"links":{"citing_paper":"/paper/2506.01052"},"observation_digest":"sha256:434602480729e16828fd4cf637bd30bf3e92841796be3c0689f3fdb010921337","observation_id":"fb67af19-7fe8-4d7d-9fec-36f5bb844bc7","resolution":{"observed_at":"2026-08-07T12:03:26.041499Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:03:25.520852Z","title":"Logarithmic Sobolev inequalities for finite Markov chains","venue":null,"work_id":"184be448-777f-430f-89c1-5e0c89bbed46","year":1996},"citing_paper":{"arxiv_id":"2506.01052","last_updated":"2026-06-07T16:29:36Z","snapshot_observed_at":"2026-08-09T03:46:00.561850Z","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},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T12:03:19.061133Z"},"links":{"citing_paper":"/paper/2506.01052"},"observation_digest":"sha256:c66c9348b92701d4910055b9a8c47f89dc6ed35a92347566ccbcd87d11f00084","observation_id":"9cb3a3f7-445c-465b-8da7-cf2debe6104b","resolution":{"observed_at":"2026-08-07T12:03:25.685916Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:03:25.108893Z","title":"Deep reinforcement learning for robotic manipulation with asynchronous off-policy updates","venue":null,"work_id":"88bdf848-7896-4c83-929c-62441bf78565","year":2017},"citing_paper":{"arxiv_id":"2506.01052","last_updated":"2026-06-07T16:29:36Z","snapshot_observed_at":"2026-08-09T03:46:00.561850Z","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},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T12:03:19.210341Z"},"links":{"citing_paper":"/paper/2506.01052"},"observation_digest":"sha256:156ea2578ddeb56df9d6df2196d3f8126d17bb9b5c204a4b1f04fdc12891f78f","observation_id":"d564c3d4-6ac3-42a7-8cd8-2e3b0f6a4abb","resolution":{"observed_at":"2026-08-07T12:03:25.301077Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:03:24.745167Z","title":"DoG is SGD 's best friend: A parameter-free dynamic step size schedule","venue":null,"work_id":"b0a39c9c-3219-425b-ad31-f949e1d633ac","year":2023},"citing_paper":{"arxiv_id":"2506.01052","last_updated":"2026-06-07T16:29:36Z","snapshot_observed_at":"2026-08-09T03:46:00.561850Z","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},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T12:03:19.319129Z"},"links":{"citing_paper":"/paper/2506.01052"},"observation_digest":"sha256:840dea7c9b2217029e8e54eab40ab185086ffc2e715fdbab32a8fe0214b66d2f","observation_id":"471abd51-65e4-4fd7-bbfe-277c76423a81","resolution":{"observed_at":"2026-08-07T12:03:24.909078Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:03:24.411388Z","title":"On TD (0) with function approximation: Concentration bounds and a centered variant with exponential convergence","venue":null,"work_id":"69cf7127-875f-4592-9777-32c3cbf9f8f0","year":2015},"citing_paper":{"arxiv_id":"2506.01052","last_updated":"2026-06-07T16:29:36Z","snapshot_observed_at":"2026-08-09T03:46:00.561850Z","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},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T12:03:19.469727Z"},"links":{"citing_paper":"/paper/2506.01052"},"observation_digest":"sha256:cbb83516e43e0a23b947a55b52f9a4e6d5f0d2ef3d0250939b1f44ceaaaa54de","observation_id":"ff5df0d8-eb78-42cc-8c04-56e2ec90063b","resolution":{"observed_at":"2026-08-07T12:03:24.580141Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:03:23.973363Z","title":"Stochastic approximation: a survey","venue":null,"work_id":"bcc170f2-6573-4ce2-80c9-edea8efbb997","year":2010},"citing_paper":{"arxiv_id":"2506.01052","last_updated":"2026-06-07T16:29:36Z","snapshot_observed_at":"2026-08-09T03:46:00.561850Z","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},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T12:03:19.620040Z"},"links":{"citing_paper":"/paper/2506.01052"},"observation_digest":"sha256:4dde0001e7a0a100a3dce7a28ad497d69b5c0fc91200adb94f4e5b9469b86c5d","observation_id":"47003276-022e-4df4-808f-7b7d96485781","resolution":{"observed_at":"2026-08-07T12:03:24.223236Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:03:23.678281Z","title":"Linear stochastic approximation: How far does constant step-size and iterate averaging go? In International conference on artificial intelligence and statistics, pages 1347--1355","venue":null,"work_id":"d5fe06e4-7314-4166-b801-0363092b4d0d","year":2018},"citing_paper":{"arxiv_id":"2506.01052","last_updated":"2026-06-07T16:29:36Z","snapshot_observed_at":"2026-08-09T03:46:00.561850Z","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},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T12:03:19.779890Z"},"links":{"citing_paper":"/paper/2506.01052"},"observation_digest":"sha256:78a211cdbe6e557443f1db331eda63787df18d3f237429b24ee4287a5512c05e","observation_id":"1c95acc9-e3c2-4b24-932a-9deb21d9f9ad","resolution":{"observed_at":"2026-08-07T12:03:23.806451Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:03:19.946010Z","title":"Markov chains and mixing times, volume 107","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.01052","last_updated":"2026-06-07T16:29:36Z","snapshot_observed_at":"2026-08-09T03:46:00.561850Z","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},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T12:03:19.946010Z"},"links":{"citing_paper":"/paper/2506.01052"},"observation_digest":"sha256:9a1678ff92e211f13f5c6bb9ea3936a873c245e15449bf17a2f7c7d7f3394b4f","observation_id":"5497b0d8-739c-46cc-8cb7-49e1d57eb3c7","resolution":{"observed_at":"2026-08-07T12:03:19.946010Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:03:23.319983Z","title":"Temporal difference learning as gradient splitting","venue":null,"work_id":"62706e8b-7613-4414-b5ab-8f03508a114c","year":2021},"citing_paper":{"arxiv_id":"2506.01052","last_updated":"2026-06-07T16:29:36Z","snapshot_observed_at":"2026-08-09T03:46:00.561850Z","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},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T12:03:20.094695Z"},"links":{"citing_paper":"/paper/2506.01052"},"observation_digest":"sha256:b3e9adfa7c0e8fab3f77316245b905946d3afc275070b6341129188d9f5e699f","observation_id":"01a6ae64-ac52-43fb-8979-810e7d79c305","resolution":{"observed_at":"2026-08-07T12:03:23.460603Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:03:23.006987Z","title":"Reinforcement Learning: Foundations","venue":null,"work_id":"7950ed75-bec1-41ea-83b1-ce0ea7884d42","year":2022},"citing_paper":{"arxiv_id":"2506.01052","last_updated":"2026-06-07T16:29:36Z","snapshot_observed_at":"2026-08-09T03:46:00.561850Z","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},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T12:03:20.266446Z"},"links":{"citing_paper":"/paper/2506.01052"},"observation_digest":"sha256:80cb1eaa2712822e57551ce7bb35f608fb1953d3b8746d03978dfa437a9cdb92","observation_id":"82719736-fc3b-4a88-9abb-063adc43b8ef","resolution":{"observed_at":"2026-08-07T12:03:23.179762Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:03:22.719229Z","title":"A simple finite-time analysis of TD learning with linear function approximation","venue":null,"work_id":"db13cce9-daa2-41df-b18c-b4c760177059","year":2024},"citing_paper":{"arxiv_id":"2506.01052","last_updated":"2026-06-07T16:29:36Z","snapshot_observed_at":"2026-08-09T03:46:00.561850Z","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},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T12:03:20.517986Z"},"links":{"citing_paper":"/paper/2506.01052"},"observation_digest":"sha256:f64c0ac34b0d8466d0d74f9897d7bf15fb03fb0b62c2f5ea6cc084877484eaaf","observation_id":"4e820a99-e309-4ebe-bf3d-7a0fce6df899","resolution":{"observed_at":"2026-08-07T12:03:22.861122Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1805.00869","last_updated":"2018-05-02T15:40:24Z","snapshot_observed_at":"2026-08-10T06:37:56.192036Z","submitted_at":"2018-05-02T15:40:24Z","title":"Approximate Temporal Difference Learning is a Gradient Descent for Reversible Policies","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1805.00869","snapshot_observed_at":"2026-08-07T12:03:20.765551Z","title":"Approximate temporal difference learning is a gradient descent for reversible policies","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.01052","last_updated":"2026-06-07T16:29:36Z","snapshot_observed_at":"2026-08-09T03:46:00.561850Z","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},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T12:03:20.765551Z"},"links":{"cited_paper":"/paper/1805.00869","citing_paper":"/paper/2506.01052"},"observation_digest":"sha256:4dd3156668f438a17958f08a2f9543047aa656c1b8a20d71554f04fe0cc375c2","observation_id":"3856d66e-0213-4226-b285-cf6cf4cc1925","resolution":{"observed_at":"2026-08-07T12:03:20.765551Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2102.00236","last_updated":"2021-01-30T15:05:34Z","snapshot_observed_at":"2026-08-09T10:30:00.447486Z","submitted_at":"2021-01-30T15:05:34Z","title":"Parameter-free Stochastic Optimization of Variationally Coherent Functions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.00236","snapshot_observed_at":"2026-08-07T12:03:20.888572Z","title":"Parameter-free stochastic optimization of variationally coherent functions","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.01052","last_updated":"2026-06-07T16:29:36Z","snapshot_observed_at":"2026-08-09T03:46:00.561850Z","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},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T12:03:20.888572Z"},"links":{"cited_paper":"/paper/2102.00236","citing_paper":"/paper/2506.01052"},"observation_digest":"sha256:0f9b9c7d58c98d31268a13c919289510cef9848340e841bb7cd2550960564859","observation_id":"0553c78a-6c65-4b45-86b8-ca08b2f7abe0","resolution":{"observed_at":"2026-08-07T12:03:20.888572Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:03:22.477028Z","title":"Mastering the game of go with deep neural networks and tree search","venue":null,"work_id":"ffad518b-d713-42d1-96f0-4d83d41cdad1","year":2016},"citing_paper":{"arxiv_id":"2506.01052","last_updated":"2026-06-07T16:29:36Z","snapshot_observed_at":"2026-08-09T03:46:00.561850Z","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},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T12:03:21.008136Z"},"links":{"citing_paper":"/paper/2506.01052"},"observation_digest":"sha256:cbb64b69fecd301ec5c97d4d23329f4d65b3f18709578eb5a16f8e868b94bf16","observation_id":"64eb2c5d-7ba6-4fd2-9eb7-e224ef1934c0","resolution":{"observed_at":"2026-08-07T12:03:22.625362Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:03:22.116295Z","title":"Finite-time error bounds for linear stochastic approximation and td learning","venue":null,"work_id":"80dab6d1-6184-41a4-95db-f43a042165e2","year":2019},"citing_paper":{"arxiv_id":"2506.01052","last_updated":"2026-06-07T16:29:36Z","snapshot_observed_at":"2026-08-09T03:46:00.561850Z","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},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T12:03:21.121927Z"},"links":{"citing_paper":"/paper/2506.01052"},"observation_digest":"sha256:f0c493f63158576389ffcb765610c5241bde3ad89175081dfe32c3f792769024","observation_id":"59e42b4e-b53a-4c23-b908-54615f8be824","resolution":{"observed_at":"2026-08-07T12:03:22.330205Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:03:21.240807Z","title":"Learning to predict by the methods of temporal differences","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2506.01052","last_updated":"2026-06-07T16:29:36Z","snapshot_observed_at":"2026-08-09T03:46:00.561850Z","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},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T12:03:21.240807Z"},"links":{"citing_paper":"/paper/2506.01052"},"observation_digest":"sha256:6ba764fdb8922785fe0176c7eda56e66b2a80e6400491032c91f28e3a5f3853e","observation_id":"f01bc406-cc4d-4117-9bd7-f630f9287375","resolution":{"observed_at":"2026-08-07T12:03:21.240807Z","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-08-07T12:03:21.356132Z","title":"Analysis of temporal-diffference learning with function approximation","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2506.01052","last_updated":"2026-06-07T16:29:36Z","snapshot_observed_at":"2026-08-09T03:46:00.561850Z","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},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T12:03:21.356132Z"},"links":{"citing_paper":"/paper/2506.01052"},"observation_digest":"sha256:dd00bef64bac0579e69d6c2986476b16ed30e3f3dd33aeebfe318099fffcc2d5","observation_id":"8c1d018b-922a-4076-8883-a4599b8389ae","resolution":{"observed_at":"2026-08-07T12:03:21.356132Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:03:21.719951Z","title":null,"venue":null,"work_id":"485df8c4-f5e0-4c4e-8b31-2bf6cabd8a5f","year":2010},"citing_paper":{"arxiv_id":"2506.01052","last_updated":"2026-06-07T16:29:36Z","snapshot_observed_at":"2026-08-09T03:46:00.561850Z","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},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T12:03:21.469609Z"},"links":{"citing_paper":"/paper/2506.01052"},"observation_digest":"sha256:687e129d326cdef50be7ddff58c547ad47338a18bd4fa726d35991240fb59c15","observation_id":"2ffd0b19-b5d0-4ba1-8a6a-ec3367bdd4dd","resolution":{"observed_at":"2026-08-07T12:03:21.878165Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.01052","last_updated":"2026-06-07T16:29:36Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T03:46:00.561850Z","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"},"reference_resolution":{"displayed":21,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":0,"verified_fuzzy":15},"total_outbound_references":21},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 3 inbound Pith citation observations for arXiv:2506.01052."}