{"as_of":"2026-08-08T02:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:85c4fe01fd3c84f6623b44a7263d8d07cf63be82b15c5105bcb221bd342ace8d","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-07T06:34:17.273281+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-07T14:28:41.882921Z","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-08-07T00:53:53.640352Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2008.07353","last_updated":"2020-08-17T14:26:18Z","snapshot_observed_at":"2026-07-06T09:47:48.007337Z","submitted_at":"2020-08-17T14:26:18Z","title":"On the Sample Complexity of Reinforcement Learning with Policy Space Generalization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2008.07353","snapshot_observed_at":"2026-08-07T14:28:41.882921Z","title":"Wen, and X","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.19002","last_updated":"2025-05-25T06:47:36Z","snapshot_observed_at":"2026-08-07T14:19:44.954656Z","submitted_at":"2025-05-25T06:47:36Z","title":"Semi-pessimistic Reinforcement Learning","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T14:28:41.882921Z"},"links":{"cited_paper":"/paper/2008.07353","citing_paper":"/paper/2505.19002"},"observation_digest":"sha256:f52a6bef5b2fbbcba67a9fd70c05ffe605ba2c681047a5b39cb8447f5fcda9a9","observation_id":"73aa90c8-ba05-405b-b920-f852d6bc3aa3","resolution":{"observed_at":"2026-08-07T14:28:41.882921Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2008.07353","last_updated":"2020-08-17T14:26:18Z","snapshot_observed_at":"2026-07-06T09:47:48.007337Z","submitted_at":"2020-08-17T14:26:18Z","title":"On the Sample Complexity of Reinforcement Learning with Policy Space Generalization","version":1},"cited_work":{"arxiv_id":"2008.07353","doi":null,"metadata_source":"pith","pith_arxiv_id":"2008.07353","snapshot_observed_at":"2026-08-07T00:53:53.640352Z","title":"On the Sample Complexity of Reinforcement Learning with Policy Space Generalization","venue":"cs.LG","work_id":"5ecaf4da-f3c5-4943-94f5-d84858ee93f4","year":2020},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-08T00:45:51.797303Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:50.889556Z"},"links":{"cited_paper":"/paper/2008.07353","citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:64489bc76b9a892079116050aba7adf7e43c7f716c30f8134b2b8722482f7360","observation_id":"bd5a3d6c-21ac-4d2e-a107-12af7358e728","resolution":{"observed_at":"2026-08-07T00:53:53.699191Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2008.07353/citation-record","integrity":"/paper/2008.07353/integrity","json":"/paper/2008.07353/citation-record.json","paper":"/paper/2008.07353"},"outbound":[],"paper":{"arxiv_id":"2008.07353","last_updated":"2020-08-17T14:26:18Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T09:47:48.007337Z","submitted_at":"2020-08-17T14:26:18Z","title":"On the Sample Complexity of Reinforcement Learning with Policy Space Generalization"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2008.07353."}