{"as_of":"2026-08-19T01:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c095b47a3676e86affa74794f0ad26ac07cdcb6a16de1e09f4e694c13101704c","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":11,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":11,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":11,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":11,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T23:56:02.552940Z","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-07-07T14:33:54.431062Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2210.04157","last_updated":"2022-10-09T03:50:05Z","snapshot_observed_at":"2026-08-16T16:25:49.995295Z","submitted_at":"2022-10-09T03:50:05Z","title":"The Role of Coverage in Online Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.04157","snapshot_observed_at":"2026-08-12T21:48:16.928379Z","title":"The role of coverage in online reinforcement learning","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.08360","last_updated":"2024-11-13T06:16:12Z","snapshot_observed_at":"2026-08-14T09:16:04.938042Z","submitted_at":"2024-11-13T06:16:12Z","title":"Coverage Analysis for Digital Cousin Selection -- Improving Multi-Environment Q-Learning","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-12T21:48:16.928379Z"},"links":{"cited_paper":"/paper/2210.04157","citing_paper":"/paper/2411.08360"},"observation_digest":"sha256:20b44be7cc9fec74664320e143e42b34060d80ea537790dd38a639e91d507342","observation_id":"b10298f2-4e93-40ef-864d-5fcf11b9e2d3","resolution":{"observed_at":"2026-08-12T21:48:16.928379Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.04157","last_updated":"2022-10-09T03:50:05Z","snapshot_observed_at":"2026-08-16T16:25:49.995295Z","submitted_at":"2022-10-09T03:50:05Z","title":"The Role of Coverage in Online Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.04157","snapshot_observed_at":"2026-08-08T18:17:14.789543Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.05726","last_updated":"2025-02-08T23:59:41Z","snapshot_observed_at":"2026-08-18T00:00:27.285566Z","submitted_at":"2025-02-08T23:59:41Z","title":"Improving Environment Novelty Quantification for Effective Unsupervised Environment Design","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-08T18:17:14.789543Z"},"links":{"cited_paper":"/paper/2210.04157","citing_paper":"/paper/2502.05726"},"observation_digest":"sha256:69fb78d7ce130f824968ca797a331b74dd820f141d45c3b34dc84446f48383df","observation_id":"c93e8ac9-9a88-4775-88cc-de57cc13401d","resolution":{"observed_at":"2026-08-08T18:17:14.789543Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.04157","last_updated":"2022-10-09T03:50:05Z","snapshot_observed_at":"2026-08-16T16:25:49.995295Z","submitted_at":"2022-10-09T03:50:05Z","title":"The Role of Coverage in Online Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.04157","snapshot_observed_at":"2026-08-15T23:56:02.552940Z","title":"J., Bai, Y., Jiang, N., and Kakade, S","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.03710","last_updated":"2025-05-06T17:32:39Z","snapshot_observed_at":"2026-08-17T09:33:26.970157Z","submitted_at":"2025-05-06T17:32:39Z","title":"Actor-Critics Can Achieve Optimal Sample Efficiency","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-15T23:56:02.552940Z"},"links":{"cited_paper":"/paper/2210.04157","citing_paper":"/paper/2505.03710"},"observation_digest":"sha256:03ebaa09a9d749b3d7581807ea0cbf4422371da951cee927a13fb12a5eb3aa14","observation_id":"e5c44ab2-b78a-4c9d-ab7e-82832fd0adde","resolution":{"observed_at":"2026-08-15T23:56:02.552940Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.04157","last_updated":"2022-10-09T03:50:05Z","snapshot_observed_at":"2026-08-16T16:25:49.995295Z","submitted_at":"2022-10-09T03:50:05Z","title":"The Role of Coverage in Online Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.04157","snapshot_observed_at":"2026-08-07T14:10:43.178507Z","title":"The role of coverage in online reinforcement learning","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.20268","last_updated":"2025-07-24T14:21:12Z","snapshot_observed_at":"2026-08-17T11:27:40.773999Z","submitted_at":"2025-05-26T17:44:08Z","title":"Outcome-Based Online Reinforcement Learning: Algorithms and Fundamental Limits","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-07T14:10:43.178507Z"},"links":{"cited_paper":"/paper/2210.04157","citing_paper":"/paper/2505.20268"},"observation_digest":"sha256:a9acfedf5877d1b30130e1a8ba5af28de4283597d613ebab947c7a598fd26486","observation_id":"c2a50976-2814-4905-8bed-c7b223b4a9a0","resolution":{"observed_at":"2026-08-07T14:10:43.178507Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.04157","last_updated":"2022-10-09T03:50:05Z","snapshot_observed_at":"2026-08-16T16:25:49.995295Z","submitted_at":"2022-10-09T03:50:05Z","title":"The Role of Coverage in Online Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.04157","snapshot_observed_at":"2026-08-07T13:45:03.851174Z","title":"J., Bai, Y., Jiang, N., and Kakade, S","venue":null,"work_id":null,"year":2022},"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":90,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:03.851174Z"},"links":{"cited_paper":"/paper/2210.04157","citing_paper":"/paper/2505.21395"},"observation_digest":"sha256:48dec80eefdc99d685219848daffb2568758007b0c78a2472105637bef72798e","observation_id":"2c102604-556e-4131-b27d-df8e3dfe5770","resolution":{"observed_at":"2026-08-07T13:45:03.851174Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.04157","last_updated":"2022-10-09T03:50:05Z","snapshot_observed_at":"2026-08-16T16:25:49.995295Z","submitted_at":"2022-10-09T03:50:05Z","title":"The Role of Coverage in Online Reinforcement Learning","version":1},"cited_work":{"arxiv_id":"2210.04157","doi":null,"metadata_source":"pith","pith_arxiv_id":"2210.04157","snapshot_observed_at":"2026-07-07T14:33:54.431062Z","title":"A general framework for sequential decision- making under adaptivity constraints","venue":"cs.LG","work_id":"367e47e1-b4fc-4d4c-8249-3c3f2054b030","year":2022},"citing_paper":{"arxiv_id":"2605.07049","last_updated":"2026-05-07T23:58:28Z","snapshot_observed_at":"2026-08-16T14:48:12.642537Z","submitted_at":"2026-05-07T23:58:28Z","title":"Towards Differentially Private Reinforcement Learning with General Function Approximation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-11T01:15:59.533563Z"},"links":{"cited_paper":"/paper/2210.04157","citing_paper":"/paper/2605.07049"},"observation_digest":"sha256:c87d9ef2ebf8ac2a26f54d8859049bd53eca67c728dcbf010096c6c2fe0bce6d","observation_id":"3892cdd0-7f76-41af-b8f3-864fba48cbc5","resolution":{"observed_at":"2026-05-11T04:31:00.485398Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.04157","last_updated":"2022-10-09T03:50:05Z","snapshot_observed_at":"2026-08-16T16:25:49.995295Z","submitted_at":"2022-10-09T03:50:05Z","title":"The Role of Coverage in Online Reinforcement Learning","version":1},"cited_work":{"arxiv_id":"2210.04157","doi":null,"metadata_source":"pith","pith_arxiv_id":"2210.04157","snapshot_observed_at":"2026-07-07T14:33:54.431062Z","title":"A general framework for sequential decision- making under adaptivity constraints","venue":"cs.LG","work_id":"367e47e1-b4fc-4d4c-8249-3c3f2054b030","year":2022},"citing_paper":{"arxiv_id":"2606.06053","last_updated":"2026-07-12T09:46:20Z","snapshot_observed_at":"2026-08-15T09:30:13.878235Z","submitted_at":"2026-06-04T11:54:23Z","title":"Online KL-Regularized Reinforcement Learning with Function Approximation under Misspecification","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-28T02:31:11.200818Z"},"links":{"cited_paper":"/paper/2210.04157","citing_paper":"/paper/2606.06053"},"observation_digest":"sha256:ad35a5b594c6ec32aeff3c8a8ad337b7706d2eff25e55473ef51270f4c8bbd14","observation_id":"0181aa0f-1da9-47ca-b620-91c5f072847a","resolution":{"observed_at":"2026-07-02T12:06:55.869090Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.04157","last_updated":"2022-10-09T03:50:05Z","snapshot_observed_at":"2026-08-16T16:25:49.995295Z","submitted_at":"2022-10-09T03:50:05Z","title":"The Role of Coverage in Online Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.04157","snapshot_observed_at":"2026-07-14T18:23:21.126826Z","title":"13 Tengyang Xie, Dylan J","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06053","last_updated":"2026-07-12T09:46:20Z","snapshot_observed_at":"2026-08-15T09:30:13.878235Z","submitted_at":"2026-06-04T11:54:23Z","title":"Online KL-Regularized Reinforcement Learning with Function Approximation under Misspecification","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-14T18:23:21.126826Z"},"links":{"cited_paper":"/paper/2210.04157","citing_paper":"/paper/2606.06053"},"observation_digest":"sha256:cba3c770ef8316429c51539aa1d50ac7a0db281924f07b5e53efe746a2fabbba","observation_id":"652ebe5f-870a-42ed-ada9-2ab99a61889d","resolution":{"observed_at":"2026-07-14T18:23:21.126826Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.04157","last_updated":"2022-10-09T03:50:05Z","snapshot_observed_at":"2026-08-16T16:25:49.995295Z","submitted_at":"2022-10-09T03:50:05Z","title":"The Role of Coverage in Online Reinforcement Learning","version":1},"cited_work":{"arxiv_id":"2210.04157","doi":null,"metadata_source":"pith","pith_arxiv_id":"2210.04157","snapshot_observed_at":"2026-07-07T14:33:54.431062Z","title":"A general framework for sequential decision- making under adaptivity constraints","venue":"cs.LG","work_id":"367e47e1-b4fc-4d4c-8249-3c3f2054b030","year":2022},"citing_paper":{"arxiv_id":"2606.20107","last_updated":"2026-06-18T11:30:59Z","snapshot_observed_at":"2026-08-07T07:50:16.581167Z","submitted_at":"2026-06-18T11:30:59Z","title":"Quantile of Means: A Bonus-Free Ensemble Method for Minimax Optimal Reinforcement Learning","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-06-26T18:19:02.314185Z"},"links":{"cited_paper":"/paper/2210.04157","citing_paper":"/paper/2606.20107"},"observation_digest":"sha256:a6a85ee25a02361dbd925254579f78bb6dfedd51b94098eb6de212186c142508","observation_id":"23ae7914-0cfa-4e89-8e78-cca036e5460c","resolution":{"observed_at":"2026-07-04T03:09:30.520219Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.04157","last_updated":"2022-10-09T03:50:05Z","snapshot_observed_at":"2026-08-16T16:25:49.995295Z","submitted_at":"2022-10-09T03:50:05Z","title":"The Role of Coverage in Online Reinforcement Learning","version":1},"cited_work":{"arxiv_id":"2210.04157","doi":null,"metadata_source":"pith","pith_arxiv_id":"2210.04157","snapshot_observed_at":"2026-07-07T14:33:54.431062Z","title":"A general framework for sequential decision- making under adaptivity constraints","venue":"cs.LG","work_id":"367e47e1-b4fc-4d4c-8249-3c3f2054b030","year":2022},"citing_paper":{"arxiv_id":"2607.05375","last_updated":"2026-07-28T16:20:46Z","snapshot_observed_at":"2026-08-13T17:58:17.954177Z","submitted_at":"2026-07-06T17:53:32Z","title":"Fitted Occupancy-Ratio Evaluation without Bellman Completeness","version":1},"reference_index":90,"source":"arxiv_source","source_observed_at":"2026-07-07T14:25:33.921937Z"},"links":{"cited_paper":"/paper/2210.04157","citing_paper":"/paper/2607.05375"},"observation_digest":"sha256:6ea75e1df8b11a320546fb126422fb146a387320c660cc12f9aca3a8e92a82d4","observation_id":"8fe57352-e744-4e40-8c98-4e47f29dc806","resolution":{"observed_at":"2026-07-07T14:33:54.432242Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.04157","last_updated":"2022-10-09T03:50:05Z","snapshot_observed_at":"2026-08-16T16:25:49.995295Z","submitted_at":"2022-10-09T03:50:05Z","title":"The Role of Coverage in Online Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.04157","snapshot_observed_at":"2026-08-02T08:33:45.459641Z","title":"arXiv preprint arXiv:2210.04157 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.05375","last_updated":"2026-07-28T16:20:46Z","snapshot_observed_at":"2026-08-13T17:58:17.954177Z","submitted_at":"2026-07-06T17:53:32Z","title":"Fitted Occupancy-Ratio Evaluation without Bellman Completeness","version":2},"reference_index":148,"source":"arxiv_source","source_observed_at":"2026-08-02T08:33:45.459641Z"},"links":{"cited_paper":"/paper/2210.04157","citing_paper":"/paper/2607.05375"},"observation_digest":"sha256:86f16aafbed3b14bdf106b375179444afa5c4f4a668da46f715b81d1fd02b675","observation_id":"3cc8a1c4-8378-4483-80d5-a2f527b6c14f","resolution":{"observed_at":"2026-08-02T08:33:45.459641Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2210.04157/citation-record","integrity":"/paper/2210.04157/integrity","json":"/paper/2210.04157/citation-record.json","paper":"/paper/2210.04157"},"outbound":[],"paper":{"arxiv_id":"2210.04157","last_updated":"2022-10-09T03:50:05Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T16:25:49.995295Z","submitted_at":"2022-10-09T03:50:05Z","title":"The Role of Coverage in Online 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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 11 inbound Pith citation observations for arXiv:2210.04157."}