{"as_of":"2026-08-10T06:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6328010d2c64483548db733625bada7f2633677ab6bf539f7b9428123724fdd4","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-09T06:31:02.800959+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-09T20:45:51.304986Z","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-19T14:22:24.062474Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2211.00716","last_updated":"2022-11-01T19:28:48Z","snapshot_observed_at":"2026-08-09T22:26:30.027097Z","submitted_at":"2022-11-01T19:28:48Z","title":"Optimal Conservative Offline RL with General Function Approximation via Augmented Lagrangian","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.00716","snapshot_observed_at":"2026-08-09T20:45:51.304986Z","title":"org/CorpusID:271534421","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.19300","last_updated":"2025-05-29T03:11:10Z","snapshot_observed_at":"2026-08-09T22:27:23.690951Z","submitted_at":"2025-01-31T16:56:18Z","title":"Offline Learning for Combinatorial Multi-armed Bandits","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-09T20:45:51.304986Z"},"links":{"cited_paper":"/paper/2211.00716","citing_paper":"/paper/2501.19300"},"observation_digest":"sha256:cea3baa6da6d0e9f8f4cb68b2c1571ad61f0a152a1e0f548b1408769a7be98c5","observation_id":"6579d043-19b6-49cd-9ec0-21dd3b22a6c8","resolution":{"observed_at":"2026-08-09T20:45:51.304986Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.00716","last_updated":"2022-11-01T19:28:48Z","snapshot_observed_at":"2026-08-09T22:26:30.027097Z","submitted_at":"2022-11-01T19:28:48Z","title":"Optimal Conservative Offline RL with General Function Approximation via Augmented Lagrangian","version":1},"cited_work":{"arxiv_id":"2211.00716","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2211.00716","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Optimal conserva- tive offline rl with general function approximation via augmented lagrangian","venue":null,"work_id":"50423e48-fb58-42d8-9082-021392b6a290","year":2022},"citing_paper":{"arxiv_id":"2505.17506","last_updated":"2026-05-12T07:45:35Z","snapshot_observed_at":"2026-07-06T21:29:02.122081Z","submitted_at":"2025-05-23T06:00:01Z","title":"Offline Constrained Reinforcement Learning under Partial Data Coverage","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-19T14:18:48.007454Z"},"links":{"cited_paper":"/paper/2211.00716","citing_paper":"/paper/2505.17506"},"observation_digest":"sha256:34d0bafdbec3fee61302127aba72ecd9a1819cd8b8351b572110543efa876eab","observation_id":"b13025b6-d6b8-4f31-b6b7-319abb5ba5bf","resolution":{"observed_at":"2026-05-19T14:22:24.064791Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.00716","last_updated":"2022-11-01T19:28:48Z","snapshot_observed_at":"2026-08-09T22:26:30.027097Z","submitted_at":"2022-11-01T19:28:48Z","title":"Optimal Conservative Offline RL with General Function Approximation via Augmented Lagrangian","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.00716","snapshot_observed_at":"2026-08-07T11:24:59.657584Z","title":"Optimal conservative offline rl with general function approximation via augmented lagrangian.arXiv preprint arXiv:2211.00716,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.02577","last_updated":"2025-06-03T07:55:57Z","snapshot_observed_at":"2026-08-07T13:50:57.173766Z","submitted_at":"2025-06-03T07:55:57Z","title":"Reachability Weighted Offline Goal-conditioned Resampling","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-07T11:24:59.657584Z"},"links":{"cited_paper":"/paper/2211.00716","citing_paper":"/paper/2506.02577"},"observation_digest":"sha256:36509d169f09f13b750796417ecc475d83a6fd6d6ba2431257bb853fc0593175","observation_id":"5054200b-91b8-4a5c-ba16-086516345e00","resolution":{"observed_at":"2026-08-07T11:24:59.657584Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.00716","last_updated":"2022-11-01T19:28:48Z","snapshot_observed_at":"2026-08-09T22:26:30.027097Z","submitted_at":"2022-11-01T19:28:48Z","title":"Optimal Conservative Offline RL with General Function Approximation via Augmented Lagrangian","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.00716","snapshot_observed_at":"2026-08-07T05:51:17.024238Z","title":", Zhu, H","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.07140","last_updated":"2025-06-08T13:37:38Z","snapshot_observed_at":"2026-08-09T10:50:01.902594Z","submitted_at":"2025-06-08T13:37:38Z","title":"Quantile-Optimal Policy Learning under Unmeasured Confounding","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-07T05:51:17.024238Z"},"links":{"cited_paper":"/paper/2211.00716","citing_paper":"/paper/2506.07140"},"observation_digest":"sha256:3216fa5270cd287bb6f4b3b433030468b6d00cccef7ccbb64d2a8c663ddd88c1","observation_id":"cf44ae55-dfab-4780-9bb2-ca7787dda7d9","resolution":{"observed_at":"2026-08-07T05:51:17.024238Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.00716","last_updated":"2022-11-01T19:28:48Z","snapshot_observed_at":"2026-08-09T22:26:30.027097Z","submitted_at":"2022-11-01T19:28:48Z","title":"Optimal Conservative Offline RL with General Function Approximation via Augmented Lagrangian","version":1},"cited_work":{"arxiv_id":"2211.00716","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2211.00716","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Optimal conserva- tive offline rl with general function approximation via augmented lagrangian","venue":null,"work_id":"50423e48-fb58-42d8-9082-021392b6a290","year":2022},"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":42,"source":"pdf_text","source_observed_at":"2026-05-08T19:35:59.832868Z"},"links":{"cited_paper":"/paper/2211.00716","citing_paper":"/paper/2605.02141"},"observation_digest":"sha256:d606a626d0d61e936f5a9e592f9249c72a0c860f6ae57217a1ba4fd98c9e3550","observation_id":"51f9e518-0971-4ce2-8035-d1306909f4e5","resolution":{"observed_at":"2026-05-09T05:45:22.251818Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2211.00716/citation-record","integrity":"/paper/2211.00716/integrity","json":"/paper/2211.00716/citation-record.json","paper":"/paper/2211.00716"},"outbound":[],"paper":{"arxiv_id":"2211.00716","last_updated":"2022-11-01T19:28:48Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T22:26:30.027097Z","submitted_at":"2022-11-01T19:28:48Z","title":"Optimal Conservative Offline RL with General Function Approximation via Augmented Lagrangian"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2211.00716."}