{"as_of":"2026-08-09T14:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0f295970f7342c8bf9cd0cf8690a7e1d44ffa2fd88af46ec003858ca1b119fee","coverage":[{"denominator":56,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":56,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T11:58:17.325670Z","state":"measured"},{"denominator":57,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":57,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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-05-11T02:32:24.570036Z","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-11T03:15:56.793092Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"cited_work":{"arxiv_id":"2502.07715","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.07715","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2502.07715 (2025)","venue":null,"work_id":"cb97828c-986e-41e2-932d-b463eca74e05","year":2025},"citing_paper":{"arxiv_id":"2605.07218","last_updated":"2026-05-08T04:10:03Z","snapshot_observed_at":"2026-07-06T23:19:35.885430Z","submitted_at":"2026-05-08T04:10:03Z","title":"Improved Model-based Reinforcement Learning with Smooth Kernels","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-11T02:32:24.570036Z"},"links":{"cited_paper":"/paper/2502.07715","citing_paper":"/paper/2605.07218"},"observation_digest":"sha256:8e89eb4cedc508dd624c4c12c2050b7498f1d97925b743ecda18ead351690ca9","observation_id":"e3e5661e-a5c0-4368-a5c2-f4663796ba54","resolution":{"observed_at":"2026-05-11T03:15:56.797255Z","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/2502.07715/citation-record","integrity":"/paper/2502.07715/integrity","json":"/paper/2502.07715/citation-record.json","paper":"/paper/2502.07715"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:58:18.444277Z","title":null,"venue":null,"work_id":"da2bdf71-734c-406e-8a49-4bed9e2fce66","year":2013},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.037889Z"},"links":{"citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:20c326d89103784dfe0bd919377d9e26525a685379827ed846d9f1c6f8eb2d60","observation_id":"d9261dce-5468-4576-8de6-ceedea7da9c9","resolution":{"observed_at":"2026-08-08T11:58:18.450467Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:58:18.426660Z","title":null,"venue":null,"work_id":"5b26577b-6a05-4522-b610-94dcf4d0f952","year":2020},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.043882Z"},"links":{"citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:b5491d0d92ce08104ce0e047d70d4d03632b51718b273342d3da32aeda8adf5c","observation_id":"efec3d41-167f-44f3-88c0-590f63750a36","resolution":{"observed_at":"2026-08-08T11:58:18.431990Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:58:17.049167Z","title":null,"venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.049167Z"},"links":{"citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:df67f9b8351f0bdc6a83005147eb16f24ad490a73180032dbaae514c4252250b","observation_id":"b23d1161-3d05-4893-982c-977f66ef35fe","resolution":{"observed_at":"2026-08-08T11:58:17.049167Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:58:18.393518Z","title":null,"venue":null,"work_id":"0dc7a72f-1c53-42e6-99b2-693cbe44ed86","year":2008},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.054427Z"},"links":{"citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:ed568022f2968a4d1680a09d5e749736ac355ab9d3fb71af18ce48203b1907ec","observation_id":"91069382-d3ff-4b35-b03a-e5efd64e0730","resolution":{"observed_at":"2026-08-08T11:58:18.398903Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:58:18.376599Z","title":"G., Munos, R., and Kappen, H","venue":null,"work_id":"4a30670a-7e2b-4955-a104-55cb820404db","year":2013},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.059649Z"},"links":{"citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:bde1b3d186c372072dff53f7fbd96bcb6e45076048e2738a2ce1d8f2b6a8f2ec","observation_id":"c9c554ad-fba2-45e5-961a-6ba578f179a3","resolution":{"observed_at":"2026-08-08T11:58:18.381832Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"1205.2661","last_updated":"2012-05-09T14:47:06Z","snapshot_observed_at":"2026-07-06T02:47:58.266745Z","submitted_at":"2012-05-09T14:47:06Z","title":"REGAL: A Regularization based Algorithm for Reinforcement Learning in Weakly Communicating MDPs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1205.2661","snapshot_observed_at":"2026-08-08T11:58:17.064802Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.064802Z"},"links":{"cited_paper":"/paper/1205.2661","citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:a9c65e0d2ff7db3b3b61d49381a3e16830d4bd195f86d2e0124ad2f0817b5a49","observation_id":"800bfa74-f165-4f78-8453-ba96ac2d0931","resolution":{"observed_at":"2026-08-08T11:58:17.064802Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:58:17.070864Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.070864Z"},"links":{"citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:2879aadccbdddd916ef781cd6b745673a0d64608df1f3552445fe40595efc4bd","observation_id":"7312b91c-d4a6-4c34-b72f-f9773c27120d","resolution":{"observed_at":"2026-08-08T11:58:17.070864Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:58:18.348343Z","title":"and Jiang, N","venue":null,"work_id":"a9c46c7b-45f2-434e-b7e2-10bc7a27b383","year":2019},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.075801Z"},"links":{"citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:4e65b17e3ea8b81c1f97487cfcbf66e1625d9527cba7dc401a83433614505949","observation_id":"1204772f-a2df-47e7-91c0-ea643dfe262b","resolution":{"observed_at":"2026-08-08T11:58:18.353784Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:58:18.330871Z","title":null,"venue":null,"work_id":"df1a69eb-7fb4-49b0-9545-577b94f38eb9","year":2017},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.080577Z"},"links":{"citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:9d7a6cdd2a788fc80ec6ec5e1b7487915cec26d6b0b6dafe318defd6510ed07f","observation_id":"a00e5d2a-05d4-4a7d-b0f1-a42f3c49d982","resolution":{"observed_at":"2026-08-08T11:58:18.336391Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:58:18.271026Z","title":null,"venue":null,"work_id":"a4cc192f-b20c-43e5-97fd-239ae8c16805","year":2019},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.085407Z"},"links":{"citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:38b44fc1a34bd3fbbbc24d9be7b56929428b2edec9c2bd97338d0ac2b5fd2ab7","observation_id":"a559daf4-6c76-4772-be6d-c41e8781be43","resolution":{"observed_at":"2026-08-08T11:58:18.276343Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:58:18.254421Z","title":null,"venue":null,"work_id":"74468b95-7a49-4a75-a0cd-98f7f7e76a39","year":2023},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.090251Z"},"links":{"citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:9ef5826141cb98f882e3fbda821f3d73c93af16d90fd794d7fc139da2e7967e5","observation_id":"2280dc80-f5cf-4e55-a204-694ff1c2a844","resolution":{"observed_at":"2026-08-08T11:58:18.259661Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:58:18.238275Z","title":"and Steinwart, I","venue":null,"work_id":"b0219536-bd97-40bc-811a-b6e4fc6931cc","year":2008},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.095498Z"},"links":{"citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:69e72cdd60a7a24ae14c4eebd264ae1f07573341312457776ff2b64aa1a0081a","observation_id":"9ca7c5c6-12d4-4954-b6ad-7f30c0de2408","resolution":{"observed_at":"2026-08-08T11:58:18.243396Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:58:18.219879Z","title":"D., M \\'e nard, P., Pirotta, M., Kaufmann, E., and Valko, M","venue":null,"work_id":"72be5bac-8f88-49d6-a018-9260135a450d","year":2021},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.100328Z"},"links":{"citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:97f085949f79e8a2aac673fa7a793e3c7afa2414c700558985ef88f10aef82e1","observation_id":"d01b9345-a3cb-4170-a1b6-3266da2e6b57","resolution":{"observed_at":"2026-08-08T11:58:18.226206Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:58:18.203262Z","title":null,"venue":null,"work_id":"51609594-f004-4b59-9f04-3c600a98ba86","year":2019},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.105346Z"},"links":{"citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:5c02f05ee0fe3c58629a7d573d2cec31ab37a55b8e6dc27f4eddae00f52d2366","observation_id":"17c7f57d-fd0a-4fa6-9bb4-3baf09c4144b","resolution":{"observed_at":"2026-08-08T11:58:18.208856Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:58:18.180748Z","title":null,"venue":null,"work_id":"b88f1f06-40fc-4f70-8e8a-202f3e1514aa","year":2022},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.110244Z"},"links":{"citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:ae95f19199493af6b53eea62bb1fe2b4a05b0218fd87a7980bd78314b191f1a6","observation_id":"215dcae0-5a61-4efb-9bd4-9efd44944824","resolution":{"observed_at":"2026-08-08T11:58:18.187545Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:58:18.157099Z","title":null,"venue":null,"work_id":"e59c79a8-c62b-4992-962f-17e9bcca799c","year":2018},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.115280Z"},"links":{"citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:fd6bebb2a3be1f40fa5d996d7bdedd253f471d61f296fe90f9646f66960b582a","observation_id":"b1a6846c-9b88-491f-a651-965b27214328","resolution":{"observed_at":"2026-08-08T11:58:18.162450Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:58:18.114396Z","title":null,"venue":null,"work_id":"74d746b3-708f-49a3-b4f4-7fd5db4de2e7","year":2018},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.120265Z"},"links":{"citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:501df958522a53a1f3ba753b16cb9cc1f1f95617a2a69724ccd4cf7ac00322c4","observation_id":"2cddd199-ec5e-41a1-9b9d-22f82fd33ad0","resolution":{"observed_at":"2026-08-08T11:58:18.122472Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:58:18.070112Z","title":null,"venue":null,"work_id":"a2b3d2e6-1ec0-4601-b137-03c174e9d370","year":2020},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.125299Z"},"links":{"citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:eb473e3993b0ba23558ea8bf65cbb3f24f594a5828ecd62fc6def871217f7cc4","observation_id":"81b007d1-4fbe-4d89-843d-4699f0bceea6","resolution":{"observed_at":"2026-08-08T11:58:18.076396Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:58:18.031897Z","title":null,"venue":null,"work_id":"72a5e2f0-4e73-4b8a-8430-55f074dae81c","year":2020},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.130188Z"},"links":{"citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:2cff5310adc7f72f2a8d9a093127d8ad9f0fe05a889822c018942e3ff69e67d1","observation_id":"6847bce4-9a9c-4d06-b4cb-1e09d884d75d","resolution":{"observed_at":"2026-08-08T11:58:18.043001Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:58:18.007634Z","title":null,"venue":null,"work_id":"d3bc3e84-8e07-40cd-a2b7-450dda0a19c4","year":2003},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.135540Z"},"links":{"citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:1368d381b585641dd74ae7ef224a8f28f6a696e95ed0f617c3e625bed9218644","observation_id":"701431ad-079c-456d-9549-00aab22c53c6","resolution":{"observed_at":"2026-08-08T11:58:18.014232Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:58:17.986300Z","title":"and Singh, S","venue":null,"work_id":"551bf8b1-6fe9-4a23-a165-d8b1c5e0c286","year":1998},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.140919Z"},"links":{"citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:f6432c0f9a79d17e82cb500c98ae31019ce031bd3fb86871d5a5350369fe904e","observation_id":"b35b76cb-e9a9-47a3-a026-d5060fb1418b","resolution":{"observed_at":"2026-08-08T11:58:17.991675Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:58:17.968567Z","title":"and Singh, S","venue":null,"work_id":"7a562049-c7eb-4e3a-88ed-8760c14a1bdf","year":1998},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.146146Z"},"links":{"citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:b8d772925834213e0675f206360a84d6ca8d3da04bf74f811b68b2ee687f87d4","observation_id":"83fd5d24-dfa7-456d-ae80-2c4e0085a490","resolution":{"observed_at":"2026-08-08T11:58:17.973957Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:58:17.946416Z","title":null,"venue":null,"work_id":"f105fdff-999a-4c3c-bc0f-48a45cc45316","year":2023},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.151401Z"},"links":{"citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:d00bdba36a4a62fea56f0eb4d624dd2df5dd307a303e0f9f9a611dd9bfe02158","observation_id":"3ed03b18-a981-45e6-81ee-c9eea674a1fa","resolution":{"observed_at":"2026-08-08T11:58:17.952190Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:58:17.928028Z","title":"and Oh, M.-h","venue":null,"work_id":"37e4c80a-8b13-4110-989c-b44f74ad1024","year":2023},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.156822Z"},"links":{"citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:affef3699859893b6945645b4f5a0ccf63e02f8cfbb0803a902d2b55c86129ce","observation_id":"299863bb-f4b7-43d3-b40c-2772d0681675","resolution":{"observed_at":"2026-08-08T11:58:17.933493Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2005.01643","last_updated":"2020-11-01T23:50:25Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2020-05-04T17:00:15Z","title":"Offline Reinforcement Learning: Tutorial, Review, and Perspectives on Open Problems","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.01643","snapshot_observed_at":"2026-08-08T11:58:17.162837Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.162837Z"},"links":{"cited_paper":"/paper/2005.01643","citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:7e2de1f4dec32baedda53cb8f183d71b42bffdf35844e143d8b642688daf1d11","observation_id":"8d4b6ff8-997f-49ce-a5e1-b82ffdd2d0e3","resolution":{"observed_at":"2026-08-08T11:58:17.162837Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:58:17.909960Z","title":null,"venue":null,"work_id":"ae2e42eb-c081-4658-b4db-a70cf26af0fa","year":1909},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.168499Z"},"links":{"citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:ec4431adc923ee22d587c16de0c58ba98a308d697af219bdc552d30340a0eda2","observation_id":"78adbb3c-2356-4985-beb2-f1df186f3f67","resolution":{"observed_at":"2026-08-08T11:58:17.915932Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:58:17.175216Z","title":"and Szepesv \\'a ri, C","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.175216Z"},"links":{"citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:7bebbc895ac36e065b22c5f8feb8e1ee6461ead9ceb14daedf35c66d490755b4","observation_id":"66afaa18-9727-4900-810b-e21f23b61a1d","resolution":{"observed_at":"2026-08-08T11:58:17.175216Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:58:17.878464Z","title":"and Pike-Burke, C","venue":null,"work_id":"6cc1f0be-0f32-4e48-afab-aed87b759630","year":2020},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.180712Z"},"links":{"citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:fdec4051227a13055e42f79afb4312a0b54f274c93b53e8d5e5f9602d932715b","observation_id":"42b8f276-8d08-4e9d-a7aa-0367b21a2932","resolution":{"observed_at":"2026-08-08T11:58:17.883895Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:58:17.185787Z","title":"A., and Darrell, T","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.185787Z"},"links":{"citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:cb113269288cf68748d5c55c7c8401b61e03aa675c90bc8677f7f9d253ceb325","observation_id":"0e89736e-660c-41f0-a131-4772fb42112d","resolution":{"observed_at":"2026-08-08T11:58:17.185787Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:58:17.190753Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.190753Z"},"links":{"citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:16021222e6308e16d44936da5b9e31b9f2b331455584c9a40e50c48a03350f41","observation_id":"0b10df38-dfdf-4cf7-8f49-01fb1072c079","resolution":{"observed_at":"2026-08-08T11:58:17.190753Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:58:17.837560Z","title":null,"venue":null,"work_id":"c7bc9c56-db81-4434-bb0f-3c2d5d804bc9","year":2000},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.195730Z"},"links":{"citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:c07afa52dfa8602f06bcdd2e5e86c1c6668f1c76a2af4e03dc6a859074395316","observation_id":"5d8705ac-8559-4ae0-b03c-59153e4b87fd","resolution":{"observed_at":"2026-08-08T11:58:17.843030Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:58:17.200907Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.200907Z"},"links":{"citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:3e9a5fa628749804b991455af035393396c3f16290438c5bfd27d40303ab194d","observation_id":"2c245087-b622-438f-972d-1f8e3d0fa86e","resolution":{"observed_at":"2026-08-08T11:58:17.200907Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:58:17.809526Z","title":null,"venue":null,"work_id":"9ae77df8-3ed0-4ccc-b53e-cd60b57b4c35","year":2021},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.206125Z"},"links":{"citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:8b813bbceb0b5dce0f78a1ee2f2deb1e686ec6a1d67b1aa041a35b7d445bdaba","observation_id":"98236b50-b190-4953-bcde-903f9a3d8fdd","resolution":{"observed_at":"2026-08-08T11:58:17.814795Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:58:17.790370Z","title":null,"venue":null,"work_id":"27d77428-8620-4f2c-896a-0210f9145d19","year":2019},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.211629Z"},"links":{"citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:eac51e3ddaf7ed80b12caeade8c3c17d117113a0c73bd0a138a3c41e7d6099e7","observation_id":"aa98d03d-f5b1-4ea2-bbd8-e51dc7efec00","resolution":{"observed_at":"2026-08-08T11:58:17.795684Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:58:17.773339Z","title":null,"venue":null,"work_id":"f7196ab0-521c-4e4b-9dea-da7b46983616","year":2017},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.216680Z"},"links":{"citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:469c2de47d4352c38abf09a3b58b9a36e217ba123a77be6a34324e97c1228742","observation_id":"3a03b1bc-ef33-495a-867a-1c8c6d626a5c","resolution":{"observed_at":"2026-08-08T11:58:17.778728Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:58:17.753441Z","title":null,"venue":null,"work_id":"00ffde1f-545d-4fa3-b6df-05ba95e94fdd","year":2018},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.221953Z"},"links":{"citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:2da5e459a28c2d91f5c2850505c183b6d64edcb4606d7c3e33522e34361de8ae","observation_id":"d7de7413-535c-456c-8ee5-39ade540d348","resolution":{"observed_at":"2026-08-08T11:58:17.758771Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:58:17.736748Z","title":null,"venue":null,"work_id":"5ff78274-99d4-47e6-9fae-f363d3ade9eb","year":2018},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.227169Z"},"links":{"citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:3aa583319012936666dcd702dbec6dbe6702e130fef8b8c1dccc4752fcb1f334","observation_id":"9d4e3eb1-1c2c-48a8-99db-c6ff532d1db9","resolution":{"observed_at":"2026-08-08T11:58:17.742228Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:58:17.718708Z","title":"M., and Seeger, M","venue":null,"work_id":"14312ef3-edaf-4527-9971-5bdd3fd1ad25","year":2010},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.232280Z"},"links":{"citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:0ef160fb1c6008cd07937e0efd421a1b727344d069791c6cc8ebe2761c99a6ed","observation_id":"6b32105f-7a31-48e4-8bf8-77defc3c368c","resolution":{"observed_at":"2026-08-08T11:58:17.723882Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:58:17.701758Z","title":null,"venue":null,"work_id":"f258ffb4-c85f-4114-909c-7d9f10487ad3","year":2024},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.237265Z"},"links":{"citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:2550cfe7206a0c1aa9da9bfbca4aa69517ce489e691dcad58139db84fe8c44ea","observation_id":"eb71bab5-add9-4332-b79c-a234507023fe","resolution":{"observed_at":"2026-08-08T11:58:17.707131Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:58:17.685136Z","title":null,"venue":null,"work_id":"2732c2da-c448-4860-8993-4cf6c288e91c","year":2021},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.242458Z"},"links":{"citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:6951b9a847ca842bb64715c3156959cf7c6e7e8eef7303308e24556fcfd56666","observation_id":"9dc590ec-f2ab-4039-8452-f552fe6023c2","resolution":{"observed_at":"2026-08-08T11:58:17.690467Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:58:17.662340Z","title":null,"venue":null,"work_id":"0f5b38b6-d3be-4cbe-ad7e-475953a47e69","year":2023},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.248382Z"},"links":{"citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:0a756039a923bad6f2e58de4a2101f985b2a30ecad30832b07e00181318417c0","observation_id":"754188ac-3372-4ab8-983d-032a7a462cfe","resolution":{"observed_at":"2026-08-08T11:58:17.667470Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:58:17.645381Z","title":null,"venue":null,"work_id":"78f56a06-2cbd-427d-b93e-35f25598b67a","year":2021},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.253685Z"},"links":{"citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:d79cf06c602562d27bbdd0794e0689a7582d87a26144447aadbbe5c6ea5e95b0","observation_id":"d1cf7d09-5191-4d1c-86e6-96bd7a92497a","resolution":{"observed_at":"2026-08-08T11:58:17.650914Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:58:17.626713Z","title":null,"venue":null,"work_id":"a5da2578-fa5c-4e08-8a80-fb1cd98ac11e","year":2024},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.258982Z"},"links":{"citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:f9ff6d1b62a3f5ce9379f644844c3c82171cdd45f16a32abef0b7f8b006d017e","observation_id":"040c59ff-231a-4df3-adb0-776620453fdd","resolution":{"observed_at":"2026-08-08T11:58:17.633076Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:58:17.610127Z","title":"and Olkhovskaya, J","venue":null,"work_id":"a4e95aed-7886-47a2-8e9c-b09318d1175a","year":2023},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.264197Z"},"links":{"citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:6304e5728db237a38a36883cd5cfa5040c03a743daf4e12823fbbd152c91a36f","observation_id":"ffd46891-f6b8-4f39-adf5-56f934a3cc23","resolution":{"observed_at":"2026-08-08T11:58:17.615497Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:58:17.593035Z","title":null,"venue":null,"work_id":"afa22c5c-ca8b-4102-abb7-add758dba8da","year":2022},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.269108Z"},"links":{"citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:6a5414ed020b8dab80132fe4d5b39f70128e70a96a0d03779a06c15aaeaf6de2","observation_id":"2af67a26-6160-42dd-921d-24ae0588844d","resolution":{"observed_at":"2026-08-08T11:58:17.598257Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:58:17.576151Z","title":"J., Chen, Y., Simchowitz, M., Du, S., and Jamieson, K","venue":null,"work_id":"42d9c106-3900-4b17-9cfb-f60903a9876b","year":2022},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.274052Z"},"links":{"citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:54ff0afacac6997310a0f2e7b533289f2e708e00d73a4bc2135d117191b84f13","observation_id":"1cd0eab1-e351-42d9-b097-ebed38fae71a","resolution":{"observed_at":"2026-08-08T11:58:17.581655Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:58:17.559773Z","title":"S., Yang, L., and Salakhutdinov, R","venue":null,"work_id":"7920d9be-18ed-4160-b994-71bab9049975","year":2020},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.279072Z"},"links":{"citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:d05f38a4da4b52bacdaf2ecae383b502af367c01ca2f0bac33aab50270fe7dbc","observation_id":"7540b946-fd6d-4798-b56e-709e17d17dc1","resolution":{"observed_at":"2026-08-08T11:58:17.565008Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"1912.04136","last_updated":"2019-12-09T15:47:27Z","snapshot_observed_at":"2026-07-06T08:43:06.269882Z","submitted_at":"2019-12-09T15:47:27Z","title":"Optimism in Reinforcement Learning with Generalized Linear Function Approximation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.04136","snapshot_observed_at":"2026-08-08T11:58:17.285029Z","title":"S., and Krishnamurthy, A","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.285029Z"},"links":{"cited_paper":"/paper/1912.04136","citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:5b1d1854b260edb2bff801fd000f552cec028b07593dcab120ba536fbee412f5","observation_id":"75a7666c-b69d-4573-9741-5dac53f5fe9a","resolution":{"observed_at":"2026-08-08T11:58:17.285029Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:58:17.543517Z","title":null,"venue":null,"work_id":"c71a1da3-fc05-4945-a9de-42a321d4509a","year":2023},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.290322Z"},"links":{"citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:03b6ade08287de24e612f4ac3916878d06d2b10d8343f28acd325cdd12b0ac69","observation_id":"2809a65b-b3be-4269-b78a-e82ef7876a46","resolution":{"observed_at":"2026-08-08T11:58:17.548366Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:58:17.526709Z","title":null,"venue":null,"work_id":"e0b70323-87f3-4b12-a800-2d3d6b8f9c09","year":2021},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.295245Z"},"links":{"citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:1e8796f0b863342720204b35ac57ccd1e7d2f86a00da54774ea03b7fa21ebc0b","observation_id":"7a1064e4-beed-4dc8-b1b2-bda7f4ce3114","resolution":{"observed_at":"2026-08-08T11:58:17.531912Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:58:17.507374Z","title":"and Wang, M","venue":null,"work_id":"917172b5-e246-4325-972d-95356257bc58","year":2019},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.300185Z"},"links":{"citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:07b3c6285913765df5f029b96beaffb8e3e4097e5bce954f852596ec5d96ad76","observation_id":"26ef60e7-ab2f-4174-811d-b8ea865767e1","resolution":{"observed_at":"2026-08-08T11:58:17.513749Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:58:17.487647Z","title":"and Wang, M","venue":null,"work_id":"26629d6e-a32d-498b-911b-3be9860a3f68","year":2020},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.305790Z"},"links":{"citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:73506a5580a3408b8955232c4eb081aefcb6dc4efa7d7119cbacb7b814586ffb","observation_id":"d7f768a7-913c-4fe3-afcf-b3af074f1977","resolution":{"observed_at":"2026-08-08T11:58:17.493897Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:58:17.471421Z","title":null,"venue":null,"work_id":"93a0afe7-ca56-43cd-a147-9a2f165062c3","year":2020},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.310641Z"},"links":{"citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:c31618d5ab5cefd5180df2a748f4b4c4686fbc9130a6b60f9a7e8115f2c1cd60","observation_id":"40193885-4005-4961-b7d7-a59f19f7dc16","resolution":{"observed_at":"2026-08-08T11:58:17.476498Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:58:17.453947Z","title":"A., and Zhang, X","venue":null,"work_id":"f9f2a861-3777-4b09-ab95-ceb0bf78fbbc","year":2014},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.315667Z"},"links":{"citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:41f2b00ea86c43c8298d910f29ec0a895d846d76f6abc8f4aaabdc1c029fa4c2","observation_id":"1e226074-1fb8-4cc7-9c78-c7ce5e94204d","resolution":{"observed_at":"2026-08-08T11:58:17.459653Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:58:17.435668Z","title":null,"venue":null,"work_id":"21dc7563-94b0-4e27-a220-5c3f51df31d4","year":2023},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.320828Z"},"links":{"citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:83824216695bb548ce04f04eb5156c2ff93416ed342a91854ff23740df72fb1b","observation_id":"0b3a4185-8aa8-4e9f-a22a-0c55aaed3fc0","resolution":{"observed_at":"2026-08-08T11:58:17.441127Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:58:17.416586Z","title":null,"venue":null,"work_id":"88fb267c-8977-4dc8-ba73-ee06182112da","year":2020},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.325670Z"},"links":{"citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:1660c97389357a470b6c83246dd734f8944914e6d7480cb9bf62b8e5367a60bd","observation_id":"2eb95f15-4554-45fe-873b-f96f8a061552","resolution":{"observed_at":"2026-08-08T11:58:17.423017Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}}],"paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-08T11:45:07.488837Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning"},"reference_resolution":{"displayed":56,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":41,"verified_exact":0,"verified_fuzzy":15},"total_outbound_references":56},"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 9 August 2026, this Paper Citation Record lists 56 of 56 outbound references and 1 inbound Pith citation observation for arXiv:2502.07715."}