{"as_of":"2026-08-15T09:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a635c38ed2ce5603a7bcafcf049455e3a4af608e4753ce09e65d0a4b6cae3899","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-15T06:32:42.880941+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-08-02T20:42:07.966293Z","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-11T16:46:05.269563Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2006.11274","last_updated":"2020-06-19T17:59:36Z","snapshot_observed_at":"2026-08-05T14:57:00.030905Z","submitted_at":"2020-06-19T17:59:36Z","title":"On Reward-Free Reinforcement Learning with Linear Function Approximation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.11274","snapshot_observed_at":"2026-08-02T20:42:07.966293Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2602.22810","last_updated":"2026-06-23T02:26:25Z","snapshot_observed_at":"2026-08-06T15:15:16.654587Z","submitted_at":"2026-02-26T09:50:15Z","title":"Multi-agent imitation learning with function approximation: Linear Markov games and beyond","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-02T20:42:07.966293Z"},"links":{"cited_paper":"/paper/2006.11274","citing_paper":"/paper/2602.22810"},"observation_digest":"sha256:b631dab9284869d12bf7deb1d7da9369a7c1e0594b1f781f2fd7da68cab56e88","observation_id":"71452cbf-5e6d-4c22-ae29-9827f29452c3","resolution":{"observed_at":"2026-08-02T20:42:07.966293Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.11274","last_updated":"2020-06-19T17:59:36Z","snapshot_observed_at":"2026-08-05T14:57:00.030905Z","submitted_at":"2020-06-19T17:59:36Z","title":"On Reward-Free Reinforcement Learning with Linear Function Approximation","version":1},"cited_work":{"arxiv_id":"2006.11274","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2006.11274","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2006.11274 , year=","venue":null,"work_id":"d374500b-76d6-4ff4-b832-54f62bb20387","year":2006},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-08-10T22:34:08.334502Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"cited_paper":"/paper/2006.11274","citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:b2e8c7fe6fb96026bb29fb204b8dad0da15f169d5f204d9fdf579c7047475d95","observation_id":"af7bfae2-95c5-4990-9f75-9fa2ac215260","resolution":{"observed_at":"2026-05-11T16:46:05.276253Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2006.11274/citation-record","integrity":"/paper/2006.11274/integrity","json":"/paper/2006.11274/citation-record.json","paper":"/paper/2006.11274"},"outbound":[],"paper":{"arxiv_id":"2006.11274","last_updated":"2020-06-19T17:59:36Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-05T14:57:00.030905Z","submitted_at":"2020-06-19T17:59:36Z","title":"On Reward-Free Reinforcement Learning with Linear Function Approximation"},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2006.11274."}