{"as_of":"2026-08-12T14:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dedbf3babaa74e9c0bef519a36132753f76d411dcae1ac616a6bcd5b07e4a919","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-12T06:34:41.77262+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-10T11:09:53.114264Z","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-06T18:01:47.394239Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2311.02215","last_updated":"2023-11-03T20:03:54Z","snapshot_observed_at":"2026-08-10T20:29:44.751726Z","submitted_at":"2023-11-03T20:03:54Z","title":"Towards model-free RL algorithms that scale well with unstructured data","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.02215","snapshot_observed_at":"2026-08-10T11:09:53.114264Z","title":"Towards model-free RL algorithms that scale well with unstructured data","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.16729","last_updated":"2025-02-01T06:43:04Z","snapshot_observed_at":"2026-08-10T20:29:50.224973Z","submitted_at":"2025-01-28T06:13:35Z","title":"On the Interplay Between Sparsity and Training in Deep Reinforcement Learning","version":2},"reference_index":2010,"source":"pdf_text","source_observed_at":"2026-08-10T11:09:53.114264Z"},"links":{"cited_paper":"/paper/2311.02215","citing_paper":"/paper/2501.16729"},"observation_digest":"sha256:97cc920f416501579140f479a650c3ce82cf4083f5ba98f017b71ac5cf143317","observation_id":"00377648-d430-425a-9209-2b49a9a582b3","resolution":{"observed_at":"2026-08-10T11:09:53.114264Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.02215","last_updated":"2023-11-03T20:03:54Z","snapshot_observed_at":"2026-08-10T20:29:44.751726Z","submitted_at":"2023-11-03T20:03:54Z","title":"Towards model-free RL algorithms that scale well with unstructured data","version":1},"cited_work":{"arxiv_id":"2311.02215","doi":null,"metadata_source":"pith","pith_arxiv_id":"2311.02215","snapshot_observed_at":"2026-08-06T18:01:47.394239Z","title":"Towards model-free RL algorithms that scale well with unstructured data","venue":"cs.LG","work_id":"2f458956-f2b9-4ab4-90d4-21dfc13654c6","year":2023},"citing_paper":{"arxiv_id":"2507.09523","last_updated":"2025-09-04T06:03:10Z","snapshot_observed_at":"2026-08-10T20:30:00.534834Z","submitted_at":"2025-07-13T07:34:33Z","title":"An Analysis of Action-Value Temporal-Difference Methods That Learn State Values","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-06T18:01:45.917099Z"},"links":{"cited_paper":"/paper/2311.02215","citing_paper":"/paper/2507.09523"},"observation_digest":"sha256:9f84e34afae8ab9cc60767a2cf866e1a246ced82150589fc1a1f9fd5fe275b84","observation_id":"c9259be3-76b0-4b10-a6a0-c393a0c51e4d","resolution":{"observed_at":"2026-08-06T18:01:47.519541Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2311.02215/citation-record","integrity":"/paper/2311.02215/integrity","json":"/paper/2311.02215/citation-record.json","paper":"/paper/2311.02215"},"outbound":[],"paper":{"arxiv_id":"2311.02215","last_updated":"2023-11-03T20:03:54Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-10T20:29:44.751726Z","submitted_at":"2023-11-03T20:03:54Z","title":"Towards model-free RL algorithms that scale well with unstructured data"},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2311.02215."}