{"as_of":"2026-08-16T20:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:19045086aaaf08e9580a185a39574d7a59b0abe74cef214bcb14ef2555a45f0e","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T14:39:15.588609Z","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-15T14:39:16.888427Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2204.05275","last_updated":"2024-03-08T18:40:01Z","snapshot_observed_at":"2026-08-16T17:07:42.827520Z","submitted_at":"2022-04-11T17:26:19Z","title":"Settling the Sample Complexity of Model-Based Offline Reinforcement Learning","version":4},"cited_work":{"arxiv_id":"2204.05275","doi":null,"metadata_source":"pith","pith_arxiv_id":"2204.05275","snapshot_observed_at":"2026-08-15T14:39:16.888427Z","title":"Settling the Sample Complexity of Model-Based Offline Reinforcement Learning","venue":"stat.ML","work_id":"de1b7b4f-4fd5-4ac3-bb86-18ad14f7a04b","year":2022},"citing_paper":{"arxiv_id":"2608.06545","last_updated":"2026-08-06T19:49:48Z","snapshot_observed_at":"2026-08-16T19:41:39.037201Z","submitted_at":"2026-08-06T19:49:48Z","title":"Robust Average-Reward Markov Decision Processes: Minimax-Optimal Learning via Plug-in Reductions","version":1},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-08-15T14:39:15.588609Z"},"links":{"cited_paper":"/paper/2204.05275","citing_paper":"/paper/2608.06545"},"observation_digest":"sha256:cc6367b2bab55eeeeb074540d807666f7aaea99993f91cbc32d7ef83c033caf5","observation_id":"3fd88426-9fe4-4008-b4d0-9a108e0bdd80","resolution":{"observed_at":"2026-08-15T14:39:16.893053Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2204.05275/citation-record","integrity":"/paper/2204.05275/integrity","json":"/paper/2204.05275/citation-record.json","paper":"/paper/2204.05275"},"outbound":[],"paper":{"arxiv_id":"2204.05275","last_updated":"2024-03-08T18:40:01Z","latest_version":4,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-16T17:07:42.827520Z","submitted_at":"2022-04-11T17:26:19Z","title":"Settling the Sample Complexity of Model-Based Offline Reinforcement Learning"},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2204.05275."}