{"as_of":"2026-08-09T19:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0539a6e27c2586dd93f627a1cd7009480daed079e47e672edc8ea30cf36047bd","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T17:43:48.412070Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-06-28T23:22:46.684996Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.13711","last_updated":"2024-11-20T21:09:09Z","snapshot_observed_at":"2026-08-08T12:14:31.746361Z","submitted_at":"2024-11-20T21:09:09Z","title":"Almost Sure Convergence Rates and Concentration of Stochastic Approximation and Reinforcement Learning with Markovian Noise","version":1},"cited_work":{"arxiv_id":"2411.13711","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.13711","snapshot_observed_at":"2026-06-28T23:22:46.684996Z","title":"arXiv preprint arXiv:2411.13711 , year=","venue":null,"work_id":"625ef552-f185-41ba-ba82-e223ba169a4b","year":2024},"citing_paper":{"arxiv_id":"2504.18743","last_updated":"2026-04-05T13:54:13Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-04-25T23:41:14Z","title":"From Set Convergence to Pointwise Convergence: Finite-Time Guarantees for Average-Reward Q-Learning with Adaptive Stepsizes","version":2},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-05-22T17:34:49.191496Z"},"links":{"cited_paper":"/paper/2411.13711","citing_paper":"/paper/2504.18743"},"observation_digest":"sha256:bda0ea7267c64656de6c9d31907b0494fae624ea9066cce7752fe44c45a79332","observation_id":"46969412-f26c-42cc-86e3-e8d8dc8a448a","resolution":{"observed_at":"2026-05-22T17:35:00.886167Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.13711","last_updated":"2024-11-20T21:09:09Z","snapshot_observed_at":"2026-08-08T12:14:31.746361Z","submitted_at":"2024-11-20T21:09:09Z","title":"Almost Sure Convergence Rates and Concentration of Stochastic Approximation and Reinforcement Learning with Markovian Noise","version":1},"cited_work":{"arxiv_id":"2411.13711","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.13711","snapshot_observed_at":"2026-06-28T23:22:46.684996Z","title":"arXiv preprint arXiv:2411.13711 , year=","venue":null,"work_id":"625ef552-f185-41ba-ba82-e223ba169a4b","year":2024},"citing_paper":{"arxiv_id":"2605.20999","last_updated":"2026-05-20T10:38:08Z","snapshot_observed_at":"2026-07-06T23:31:32.577242Z","submitted_at":"2026-05-20T10:38:08Z","title":"Concentration of General Stochastic Approximation Under Heavy-Tailed Markovian Noise","version":1},"reference_index":189,"source":"arxiv_source","source_observed_at":"2026-05-21T02:27:24.989781Z"},"links":{"cited_paper":"/paper/2411.13711","citing_paper":"/paper/2605.20999"},"observation_digest":"sha256:923a1b58bb471a0b567e98b0442bd9fe70e709a1fc2b0e9c650c664834507569","observation_id":"37d4a5d2-ea98-4e26-b95b-3f9da7b8d639","resolution":{"observed_at":"2026-05-21T02:29:25.120406Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.13711","last_updated":"2024-11-20T21:09:09Z","snapshot_observed_at":"2026-08-08T12:14:31.746361Z","submitted_at":"2024-11-20T21:09:09Z","title":"Almost Sure Convergence Rates and Concentration of Stochastic Approximation and Reinforcement Learning with Markovian Noise","version":1},"cited_work":{"arxiv_id":"2411.13711","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.13711","snapshot_observed_at":"2026-06-28T23:22:46.684996Z","title":"arXiv preprint arXiv:2411.13711 , year=","venue":null,"work_id":"625ef552-f185-41ba-ba82-e223ba169a4b","year":2024},"citing_paper":{"arxiv_id":"2605.31309","last_updated":"2026-05-29T13:41:01Z","snapshot_observed_at":"2026-08-02T14:22:06.907671Z","submitted_at":"2026-05-29T13:41:01Z","title":"Non-Asymptotic Convergence of Stochastic Iterative Algorithms: A Lyapunov Framework","version":1},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-06-28T23:11:02.699220Z"},"links":{"cited_paper":"/paper/2411.13711","citing_paper":"/paper/2605.31309"},"observation_digest":"sha256:5bb5ec2a7156f19cea9560df7645112e16b0a609a52c79801fce3c1b8ead40de","observation_id":"09600e6d-f149-4f19-8e66-c4adcce72e9a","resolution":{"observed_at":"2026-06-28T23:12:46.708825Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.13711","last_updated":"2024-11-20T21:09:09Z","snapshot_observed_at":"2026-08-08T12:14:31.746361Z","submitted_at":"2024-11-20T21:09:09Z","title":"Almost Sure Convergence Rates and Concentration of Stochastic Approximation and Reinforcement Learning with Markovian Noise","version":1},"cited_work":{"arxiv_id":"2411.13711","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.13711","snapshot_observed_at":"2026-06-28T23:22:46.684996Z","title":"arXiv preprint arXiv:2411.13711 , year=","venue":null,"work_id":"625ef552-f185-41ba-ba82-e223ba169a4b","year":2024},"citing_paper":{"arxiv_id":"2606.00309","last_updated":"2026-05-29T19:34:28Z","snapshot_observed_at":"2026-08-07T08:31:18.869284Z","submitted_at":"2026-05-29T19:34:28Z","title":"Large-scale Uncertainty Quantification for Latent Variable Models Using Subsampling Markov Chain Monte Carlo","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-06-28T23:21:13.128400Z"},"links":{"cited_paper":"/paper/2411.13711","citing_paper":"/paper/2606.00309"},"observation_digest":"sha256:7668014e4ef70d60f5dbf31014809e3a610ce63603d1d40172169461414dc392","observation_id":"a2d748cd-b955-4d18-a041-7b23109f17d6","resolution":{"observed_at":"2026-06-28T23:22:46.686693Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.13711","last_updated":"2024-11-20T21:09:09Z","snapshot_observed_at":"2026-08-08T12:14:31.746361Z","submitted_at":"2024-11-20T21:09:09Z","title":"Almost Sure Convergence Rates and Concentration of Stochastic Approximation and Reinforcement Learning with Markovian Noise","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.13711","snapshot_observed_at":"2026-08-01T17:43:48.412070Z","title":"Almost sure convergence rates and concentration of stochastic approximation and reinforcement learning with markovian noise","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.17595","last_updated":"2026-07-20T06:27:22Z","snapshot_observed_at":"2026-08-01T17:43:45.250211Z","submitted_at":"2026-07-20T06:27:22Z","title":"Concentration and Mean-Square Bounds for Contractive Stochastic Approximation: A Unified Elementary Approach","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-01T17:43:48.412070Z"},"links":{"cited_paper":"/paper/2411.13711","citing_paper":"/paper/2607.17595"},"observation_digest":"sha256:dd2a4ff1571bbe8873fba3abab6a6ad45a86f4db2323ba1481eaf5008826de0f","observation_id":"71b9b92d-810f-49c1-8961-216e7c228253","resolution":{"observed_at":"2026-08-01T17:43:48.412070Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2411.13711/citation-record","integrity":"/paper/2411.13711/integrity","json":"/paper/2411.13711/citation-record.json","paper":"/paper/2411.13711"},"outbound":[],"paper":{"arxiv_id":"2411.13711","last_updated":"2024-11-20T21:09:09Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-08T12:14:31.746361Z","submitted_at":"2024-11-20T21:09:09Z","title":"Almost Sure Convergence Rates and Concentration of Stochastic Approximation and Reinforcement Learning with Markovian Noise"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2411.13711."}