{"as_of":"2026-08-20T21:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bb3f6d082d578c572ef1f832a33a2eb8ffc07490f752311a593e99564274a3ee","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-24T02:16:04.596951Z","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-05-24T02:18:44.854518Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2006.03041","last_updated":"2021-08-08T03:42:12Z","snapshot_observed_at":"2026-08-14T11:03:58.601572Z","submitted_at":"2020-06-04T17:51:00Z","title":"Sample Complexity of Asynchronous Q-Learning: Sharper Analysis and Variance Reduction","version":3},"cited_work":{"arxiv_id":"2006.03041","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2006.03041","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Sample complexity of asy nchronous Q-learning: Sharper analysis and variance reduction","venue":null,"work_id":"ccfaf98f-0e08-491a-ac13-aca0f92e9c0a","year":2006},"citing_paper":{"arxiv_id":"2404.14442","last_updated":"2026-05-11T13:49:35Z","snapshot_observed_at":"2026-08-02T21:40:55.937181Z","submitted_at":"2024-04-20T01:16:27Z","title":"Toward a Unified Lyapunov-Certified ODE Convergence Analysis of Smooth Q-Learning with p-Norms","version":7},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-24T02:16:04.596951Z"},"links":{"cited_paper":"/paper/2006.03041","citing_paper":"/paper/2404.14442"},"observation_digest":"sha256:54af0ac8cd1ffe3381f1ad8d30bd7ee9bbc95af98835109166d7a99fcc6f1291","observation_id":"3480e319-29f3-457a-a428-e5f7bc10fc2b","resolution":{"observed_at":"2026-05-24T02:18:44.857935Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.03041","last_updated":"2021-08-08T03:42:12Z","snapshot_observed_at":"2026-08-14T11:03:58.601572Z","submitted_at":"2020-06-04T17:51:00Z","title":"Sample Complexity of Asynchronous Q-Learning: Sharper Analysis and Variance Reduction","version":3},"cited_work":{"arxiv_id":"2006.03041","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2006.03041","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Sample complexity of asy nchronous Q-learning: Sharper analysis and variance reduction","venue":null,"work_id":"ccfaf98f-0e08-491a-ac13-aca0f92e9c0a","year":2006},"citing_paper":{"arxiv_id":"2604.04394","last_updated":"2026-04-06T03:48:42Z","snapshot_observed_at":"2026-08-14T07:50:03.428620Z","submitted_at":"2026-04-06T03:48:42Z","title":"Finite-Time Analysis of Q-Value Iteration for General-Sum Stackelberg Games","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-10T19:49:31.844061Z"},"links":{"cited_paper":"/paper/2006.03041","citing_paper":"/paper/2604.04394"},"observation_digest":"sha256:8962c9c534f14bdfef93303c536cbfc835cb96075f17c9f79e43ebba78a3a3b9","observation_id":"e205f12b-95c4-4297-975f-5c63ee13178b","resolution":{"observed_at":"2026-05-10T22:30:50.072126Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2006.03041/citation-record","integrity":"/paper/2006.03041/integrity","json":"/paper/2006.03041/citation-record.json","paper":"/paper/2006.03041"},"outbound":[],"paper":{"arxiv_id":"2006.03041","last_updated":"2021-08-08T03:42:12Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-14T11:03:58.601572Z","submitted_at":"2020-06-04T17:51:00Z","title":"Sample Complexity of Asynchronous Q-Learning: Sharper Analysis and Variance Reduction"},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2006.03041."}