{"as_of":"2026-08-08T13:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6b2a2e59534457e999a6220451dda2941f17e3b0e35f9268a74eafe397ffa50d","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:45:01.676167Z","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-12T06:56:30.498428Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2107.06226","last_updated":"2023-01-10T04:15:46Z","snapshot_observed_at":"2026-08-04T18:44:55.716082Z","submitted_at":"2021-07-13T16:30:01Z","title":"Pessimistic Model-based Offline Reinforcement Learning under Partial Coverage","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.06226","snapshot_observed_at":"2026-08-07T13:45:01.676167Z","title":"and Sun, W","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.21395","last_updated":"2025-05-27T16:23:24Z","snapshot_observed_at":"2026-08-07T13:26:21.678395Z","submitted_at":"2025-05-27T16:23:24Z","title":"Square$\\chi$PO: Differentially Private and Robust $\\chi^2$-Preference Optimization in Offline Direct Alignment","version":1},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:01.676167Z"},"links":{"cited_paper":"/paper/2107.06226","citing_paper":"/paper/2505.21395"},"observation_digest":"sha256:acca2876a4fa5ffb27437f5bfe9802f07377368d6c7561414d337f4d47749b31","observation_id":"32fd6239-8a15-4a5e-8b43-1d4eb839d10e","resolution":{"observed_at":"2026-08-07T13:45:01.676167Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2107.06226","last_updated":"2023-01-10T04:15:46Z","snapshot_observed_at":"2026-08-04T18:44:55.716082Z","submitted_at":"2021-07-13T16:30:01Z","title":"Pessimistic Model-based Offline Reinforcement Learning under Partial Coverage","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.06226","snapshot_observed_at":"2026-08-03T00:05:19.800270Z","title":"and Sun, W","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.12107","last_updated":"2026-06-07T03:40:44Z","snapshot_observed_at":"2026-08-03T19:35:11.911054Z","submitted_at":"2026-02-12T15:59:42Z","title":"On the Complexity of Offline Reinforcement Learning with $Q^\\star$-Approximation and Partial Coverage","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-03T00:05:19.800270Z"},"links":{"cited_paper":"/paper/2107.06226","citing_paper":"/paper/2602.12107"},"observation_digest":"sha256:0964e7c351595a6e18f55f2823478207b1772dcab5eb7b320c384225542b2677","observation_id":"8db989ba-9fbf-4274-ac81-a29ba1ce6776","resolution":{"observed_at":"2026-08-03T00:05:19.800270Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2107.06226","last_updated":"2023-01-10T04:15:46Z","snapshot_observed_at":"2026-08-04T18:44:55.716082Z","submitted_at":"2021-07-13T16:30:01Z","title":"Pessimistic Model-based Offline Reinforcement Learning under Partial Coverage","version":4},"cited_work":{"arxiv_id":"2107.06226","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2107.06226","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2107.06226 , year=","venue":null,"work_id":"11bd1bda-2239-43a7-a652-877ed47d4e08","year":2021},"citing_paper":{"arxiv_id":"2604.13966","last_updated":"2026-04-15T15:17:40Z","snapshot_observed_at":"2026-08-08T02:57:57.796032Z","submitted_at":"2026-04-15T15:17:40Z","title":"Provably Efficient Offline-to-Online Value Adaptation with General Function Approximation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-10T12:55:12.531822Z"},"links":{"cited_paper":"/paper/2107.06226","citing_paper":"/paper/2604.13966"},"observation_digest":"sha256:aaf03c18fa13a394ce7e3fa5521264f3057f8a7a8a47ba851088ebc5e4e49c99","observation_id":"30fc32bc-9a4e-4375-ab69-e2d49f92b646","resolution":{"observed_at":"2026-05-10T12:55:24.131199Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2107.06226","last_updated":"2023-01-10T04:15:46Z","snapshot_observed_at":"2026-08-04T18:44:55.716082Z","submitted_at":"2021-07-13T16:30:01Z","title":"Pessimistic Model-based Offline Reinforcement Learning under Partial Coverage","version":4},"cited_work":{"arxiv_id":"2107.06226","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2107.06226","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2107.06226 , year=","venue":null,"work_id":"11bd1bda-2239-43a7-a652-877ed47d4e08","year":2021},"citing_paper":{"arxiv_id":"2605.02141","last_updated":"2026-05-04T01:46:35Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-04T01:46:35Z","title":"On the Optimal Sample Complexity of Offline Multi-Armed Bandits with KL Regularization","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-05-08T19:35:59.832868Z"},"links":{"cited_paper":"/paper/2107.06226","citing_paper":"/paper/2605.02141"},"observation_digest":"sha256:a657b227bb38dd828c14b7f66551cb63790d3aa0ed0bb9933fa4f5da1701f6cc","observation_id":"865a1e46-3de7-4037-b004-c9bae69ce8fd","resolution":{"observed_at":"2026-05-09T05:45:22.273049Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2107.06226","last_updated":"2023-01-10T04:15:46Z","snapshot_observed_at":"2026-08-04T18:44:55.716082Z","submitted_at":"2021-07-13T16:30:01Z","title":"Pessimistic Model-based Offline Reinforcement Learning under Partial Coverage","version":4},"cited_work":{"arxiv_id":"2107.06226","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2107.06226","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2107.06226 , year=","venue":null,"work_id":"11bd1bda-2239-43a7-a652-877ed47d4e08","year":2021},"citing_paper":{"arxiv_id":"2605.09214","last_updated":"2026-05-09T23:17:46Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-09T23:17:46Z","title":"Fast Rates for Offline Contextual Bandits with Forward-KL Regularization under Single-Policy Concentrability","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-05-12T03:47:14.379908Z"},"links":{"cited_paper":"/paper/2107.06226","citing_paper":"/paper/2605.09214"},"observation_digest":"sha256:0a7696311a1b8f71f32cbd907e7243b0e2083d07ea511c998c71b7e35f6fa143","observation_id":"ed23f370-ad7b-40a7-8e39-6407411e183a","resolution":{"observed_at":"2026-05-12T06:56:30.506981Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2107.06226/citation-record","integrity":"/paper/2107.06226/integrity","json":"/paper/2107.06226/citation-record.json","paper":"/paper/2107.06226"},"outbound":[],"paper":{"arxiv_id":"2107.06226","last_updated":"2023-01-10T04:15:46Z","latest_version":4,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-04T18:44:55.716082Z","submitted_at":"2021-07-13T16:30:01Z","title":"Pessimistic Model-based Offline Reinforcement Learning under Partial Coverage"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2107.06226."}