{"as_of":"2026-08-05T17:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:002c5beda62f5a680e7df4c078b8d97039cb0e1ead674987b2302b6b5f1c6481","coverage":[{"denominator":82,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":82,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-09T15:12:54.575483Z","state":"measured"},{"denominator":82,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":82,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-05T06:32:48.257954+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2605.01242/citation-record","integrity":"/paper/2605.01242/integrity","json":"/paper/2605.01242/citation-record.json","paper":"/paper/2605.01242"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T20:07:34.119737Z","title":"Langley , title =","venue":null,"work_id":"6cd283dc-0548-45e9-af07-6bc1005593ad","year":2000},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:a2eb010e76cee1f64415d9829e8ecbdea7dd43ea9230b0ef5410b31305ba25d3","observation_id":"a7c0d1d3-2aa9-4a6d-b85f-2b788cf12de6","resolution":{"observed_at":"2026-05-26T01:26:27.526136Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-07-11T00:47:54.976173Z","title":null,"venue":null,"work_id":"6b09bca6-ef5d-4a83-8c8e-219f23cbd761","year":1980},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:cef2921a4d2611f16f13a469c489ef412cb9621244068f1498c5dc22e08b932e","observation_id":"6fa572fe-1c04-493d-9443-87b73fb95583","resolution":{"observed_at":"2026-05-26T01:26:27.603035Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-07-11T00:47:54.841265Z","title":null,"venue":null,"work_id":"8efd8073-6f5d-45c5-94d5-62d366b52518","year":null},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:3bae8138215884c49c776f4acf7d37088263f88bbdb1403266a7f0064f62495b","observation_id":"75d47d3f-37f0-44b0-85c5-aca8ce466f9f","resolution":{"observed_at":"2026-05-26T01:26:27.600805Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-07-11T00:47:54.783905Z","title":null,"venue":null,"work_id":"51835800-f16e-4534-8339-d3ea09147556","year":1983},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:f95e7f6cd45c7084ab2793402c1176a7969165dc613a0f27f97551a29b643b8f","observation_id":"ae447274-c14b-4cea-9347-7790a4d21c58","resolution":{"observed_at":"2026-05-26T01:26:27.546654Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-07-11T00:47:54.877035Z","title":null,"venue":null,"work_id":"a24cb892-7ac9-4509-8f5b-abbdfb15998b","year":2000},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:8b9d9fd9d9cb072c90058b70fd2e73ee06c6c5cf10f7c835de4f7e0b6dfb140d","observation_id":"9d2735d8-7a7a-485f-ac8b-4d2ed6a7c318","resolution":{"observed_at":"2026-05-26T01:26:27.531867Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-07-11T00:47:55.004500Z","title":null,"venue":null,"work_id":"744d3ca1-d321-4345-b9e3-30a42bcf1b37","year":null},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:3839485bea80506ad18c8ec42271e54c38c4c5f4cfd4bcdb03c2659cc875cd4b","observation_id":"8b32aefd-fe97-4f21-a24f-33d37c4f1612","resolution":{"observed_at":"2026-05-26T01:26:27.481513Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-07-11T00:47:54.757534Z","title":"Newell and P","venue":null,"work_id":"c2e14246-296a-4c66-84e9-a797b1c9d6da","year":1981},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:d9aec5aff8e1e29770012fa081769a4bd73a058d1ab63af54a6ec96ee545fc64","observation_id":"32de5dca-5718-4725-8d39-8988fc2f0add","resolution":{"observed_at":"2026-05-26T01:26:27.497462Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-07-11T00:47:54.727878Z","title":null,"venue":null,"work_id":"8d7d9e29-63b8-4039-8dc1-7059f06840ea","year":1959},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:f58b5cc4c3c03e141d6cc2e4226107c4b9cf2ef64055a4c7b42d58266bd57a23","observation_id":"9976bc44-d7fe-4379-97e1-525aaa877664","resolution":{"observed_at":"2026-05-26T01:26:27.567841Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.02057","last_updated":"2019-07-03T17:53:02Z","snapshot_observed_at":"2026-07-06T08:04:56.737336Z","submitted_at":"2019-07-03T17:53:02Z","title":"Benchmarking Model-Based Reinforcement Learning","version":1},"cited_work":{"arxiv_id":"1907.02057","doi":null,"metadata_source":"pith","pith_arxiv_id":"1907.02057","snapshot_observed_at":"2026-07-04T19:00:06.269409Z","title":"Benchmarking Model-Based Reinforcement Learning","venue":"cs.LG","work_id":"14cc71c0-924c-4734-8464-145da2d06666","year":2019},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"cited_paper":"/paper/1907.02057","citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:24ba93407dc71fd1bcaf5c3ff5491c379bd9e794a04cbe37b022d9a6c8b3b596","observation_id":"ab0d4039-fb70-4858-b4ab-43a3f9076e4f","resolution":{"observed_at":"2026-05-11T16:46:05.301657Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.08632","last_updated":"2025-02-12T18:47:13Z","snapshot_observed_at":"2026-08-04T19:27:28.228933Z","submitted_at":"2025-02-12T18:47:13Z","title":"Necessary and Sufficient Oracles: Toward a Computational Taxonomy For Reinforcement Learning","version":1},"cited_work":{"arxiv_id":"2502.08632","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.08632","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2502.08632 , year=","venue":null,"work_id":"3440ce46-3514-43dc-9254-442489fcf9a3","year":2025},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"cited_paper":"/paper/2502.08632","citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:a209cffe900a25af1e43806afbb1e6ec661c275030c72fa89dba1729b5616623","observation_id":"d5a63cde-decd-41a7-9b3d-ffbe0796a8ff","resolution":{"observed_at":"2026-05-11T16:46:05.324230Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-07-05T11:31:00.325202Z","title":"Advances in neural information processing systems , volume=","venue":null,"work_id":"aac6c28a-ac53-4530-bfd9-85a9f50de62c","year":null},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:942f4df58d35f3824d6a9ab4a3b412db878110dddcca351f8c06c1635d3e8f92","observation_id":"ed230eb1-f75f-4077-868e-b9395faf56e1","resolution":{"observed_at":"2026-05-26T01:26:27.574799Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.17032","last_updated":"2025-11-02T13:42:19Z","snapshot_observed_at":"2026-07-06T18:51:06.750136Z","submitted_at":"2024-07-24T06:35:05Z","title":"Gymnasium: A Standard Interface for Reinforcement Learning Environments","version":4},"cited_work":{"arxiv_id":"2407.17032","doi":"10.48550/arxiv.2407.17032","metadata_source":"pith","pith_arxiv_id":"2407.17032","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Gymnasium: A Standard Interface for Reinforcement Learning Environments","venue":"cs.LG","work_id":"5382dc1c-a327-49b9-afda-4794d5847698","year":2024},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"cited_paper":"/paper/2407.17032","citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:fb77d981c7b1cf05911e77c2b16f563ebfb2fbfb81b34f71c983992718b12ff1","observation_id":"2180fb82-a11c-4be6-b42b-be9544e69170","resolution":{"observed_at":"2026-05-11T17:29:49.696310Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-07-13T20:21:08.751241+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T20:21:08.751241+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Journal of Optimization Theory and Applications , volume=","venue":null,"work_id":"3c33d83d-a7ca-44ee-9567-4c5405650a47","year":2023},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:710084186bb7e19e514fd2494262ee683b8671c2e9480a3a97854fb50c3723d7","observation_id":"aed96e7d-6c6d-4ba8-82dc-6c3a7bc64007","resolution":{"observed_at":"2026-05-26T01:26:27.572133Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":"078579f8-f056-4e88-a49a-1d26a649fca7","year":null},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:38c777add1408c33d744aad782123486f4f174d18ab7d655fccc534b4c501f85","observation_id":"440f896e-3b63-4d21-8d5c-7c3627df3274","resolution":{"observed_at":"2026-05-26T01:26:27.523535Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":"09c01ad4-1067-4787-8b77-70aa24735baf","year":null},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:903ce3cbefac9d9a04c0082abff574139f471b4586adfd51515b7ccc379588c7","observation_id":"16bf0f18-88e8-477e-8885-a85d04f877fb","resolution":{"observed_at":"2026-05-26T01:26:27.569947Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Advances in neural information processing systems , volume=","venue":null,"work_id":"7a49de8d-ba4d-4c5c-b1d3-9cf4900aa8cb","year":null},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:575ced59b4429cd19f63a0cc9b506da325f1549bed1af7e7389dae436e574dad","observation_id":"07522139-34b0-47ab-b980-f85e0d7584fe","resolution":{"observed_at":"2026-05-26T01:26:27.508774Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"International conference on machine learning , pages=","venue":null,"work_id":"2250fb89-4466-4639-9ccb-8beef95af160","year":2017},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:d7053dcc9c6d56b59dc1dcfbe246279c61df440a2f957ab6ca4e74e2d02691a2","observation_id":"09d925fe-292d-41fa-a221-8c9e40c90a26","resolution":{"observed_at":"2026-05-26T01:26:27.512029Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Advances in neural information processing systems , volume=","venue":null,"work_id":"a91bb967-af48-4c86-82ac-bee3188bc87b","year":null},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:b24b5992cc5a4c91f710419ec6bf8b62cd829a8f9b89e488b96b178410042f40","observation_id":"c0ef7e9b-32a9-4351-838b-3ee704c83d63","resolution":{"observed_at":"2026-05-26T01:26:27.514850Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"International Conference on Artificial Intelligence and Statistics , pages=","venue":null,"work_id":"a8a3117c-de65-48d6-b64f-0ce26aa77344","year":2024},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:7e9fa4509706e043f262eedf80fa74b817e733c111a2a1d62ace4f1e4be284f6","observation_id":"fb4384e8-e4fc-441a-b2f1-0fab803f7ed9","resolution":{"observed_at":"2026-05-26T01:26:27.544423Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Uncertainty in Artificial Intelligence , pages=","venue":null,"work_id":"2bfde022-7ba6-49c7-a299-7734e1f532ed","year":2022},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:8f4fcf4ce3a19e8115d882c532db6b4dd67d978e5a3d51de545b1998d21c468c","observation_id":"077ce9cd-7689-46cb-ad57-de78063dea63","resolution":{"observed_at":"2026-05-26T01:26:27.520789Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"International Conference on Machine Learning , pages=","venue":null,"work_id":"b22aa030-c80f-4951-b8bf-dd2e78fe2bc0","year":2022},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:8d2516099d830968e387d032e01b391cdfe084d8eb5dcc4b745e0bbf8bda631d","observation_id":"0270ffbe-3f6f-4716-be95-e4e1455ccaf1","resolution":{"observed_at":"2026-05-26T01:26:27.534559Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"International Conference on Machine Learning , pages=","venue":null,"work_id":"342b58e5-adae-4d3a-b180-27e47847a445","year":2021},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:0bf8c6a1b236d81e1f49923ca6467dab84b8e687788a26db4abd0a49bf308904","observation_id":"b9137848-e69f-467f-b25f-8a40697deded","resolution":{"observed_at":"2026-05-26T01:26:27.490553Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Advances in neural information processing systems , volume=","venue":null,"work_id":"bd7eb809-c036-4084-9c4e-00e195e6a048","year":null},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:357d3d96243a02df68effd00a6b798986fea21be04a080f9ad2000869764fd19","observation_id":"984eaa46-8962-4010-97e9-3318362943b2","resolution":{"observed_at":"2026-05-26T01:26:27.495185Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"NeurIPS 2025 Workshop: Second Workshop on Aligning Reinforcement Learning Experimentalists and Theorists , year=","venue":null,"work_id":"ee3be737-14a4-46e5-a7a2-582dcc8f79ee","year":2025},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:25fbcfd18df34097520bf655c361845a7104be68e4891c6122212b544c66f12d","observation_id":"42c51930-4d44-4692-a752-cc9c57605e91","resolution":{"observed_at":"2026-05-26T01:26:27.499975Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.03710","last_updated":"2025-05-06T17:32:39Z","snapshot_observed_at":"2026-07-06T21:19:49.709528Z","submitted_at":"2025-05-06T17:32:39Z","title":"Actor-Critics Can Achieve Optimal Sample Efficiency","version":1},"cited_work":{"arxiv_id":"2505.03710","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.03710","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2505.03710 , year=","venue":null,"work_id":"9e47581b-b1fb-42ba-948f-644e77bdc516","year":null},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"cited_paper":"/paper/2505.03710","citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:57b5696e287b0e30b8d4fa14d27c8cbe0c734af240f4015a5de0c6137639eb69","observation_id":"42f0f087-7d67-4a0d-be29-1af14e8ef2b0","resolution":{"observed_at":"2026-05-11T16:46:05.341054Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":"8d191d78-00e8-44f1-927e-2a66f3c177a8","year":null},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:cd41ae5594c230221b3990c20d9c43098c9d0a6646eb26d4a2423e40f98e7f2c","observation_id":"389b57c0-1238-4298-9ae3-1ef7f9c85cad","resolution":{"observed_at":"2026-05-26T01:26:27.486175Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.10859","last_updated":"2023-03-20T04:39:39Z","snapshot_observed_at":"2026-07-06T15:05:31.386599Z","submitted_at":"2023-03-20T04:39:39Z","title":"Improved Sample Complexity for Reward-free Reinforcement Learning under Low-rank MDPs","version":1},"cited_work":{"arxiv_id":"2303.10859","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2303.10859","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2303.10859 , year=","venue":null,"work_id":"5c8c77a2-8c20-493d-836a-c2c579a07c44","year":null},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"cited_paper":"/paper/2303.10859","citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:de250f360b461d4dcd9434b0d621dde5340e4e4f0896fb1211934fa898c50169","observation_id":"c4f66d03-c5c9-42ee-a426-5a8ad6c39655","resolution":{"observed_at":"2026-05-11T16:46:05.356321Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"2021 , eprint=","venue":null,"work_id":"c4eacf90-f125-4c09-b0c4-92612896f3e4","year":2021},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:18b62900ff44b0f8ac564de8f01674d41934c662ee11382d01207c00752485c0","observation_id":"daf299ed-9d0b-408a-8380-eac5b4cc2b6a","resolution":{"observed_at":"2026-05-26T01:26:27.488324Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"CoRR , volume =","venue":null,"work_id":"32955baf-383c-492b-a66a-64a76ba53dc2","year":null},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:3f9f53288c3ad4a90d826b6386501c4b5ccaa45cab869ef901f39545f7601d99","observation_id":"aa9e8d4a-699b-49d3-b768-4b65c28f9c34","resolution":{"observed_at":"2026-05-26T01:26:27.579108Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"2021 , eprint=","venue":null,"work_id":"83042f88-7fb7-47a0-a122-0058104d91f0","year":2021},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:360e8c1449089fa35ff2601eb66b3f124aa14676d64ad88e0b1a984bfd70fc89","observation_id":"c2beaf25-aaf3-4fe3-adb5-bb8c1292d2f0","resolution":{"observed_at":"2026-05-26T01:26:27.502097Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"3a9dfb93-08c6-4d6b-8af3-6ab5092c5c7a","year":null},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:8d6e24ef38164020e6bc275f2913c98d5a11ef7c88e1efa4c9df49b739128328","observation_id":"5ce41f07-6411-4811-87ce-00bf1cbd4736","resolution":{"observed_at":"2026-05-26T01:26:27.479072Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"e512eefd-3508-4dae-85ec-5474d9c657d2","year":null},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:e02a0789bb37def750a50f333b251ba1f79d42b4c89776853776878d3bdc9095","observation_id":"e759f713-0bf0-4448-ad79-2ba93f52c046","resolution":{"observed_at":"2026-05-26T01:26:27.492926Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Proceedings of the 37th International Conference on Machine Learning , pages =","venue":null,"work_id":"e829b334-200c-46e0-8444-85f59b404901","year":null},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:458307125dce9ba21a5715166553dc9ab4531c1b57338f79f630df6151b3bff4","observation_id":"cab4e89d-04e7-4637-9870-e74c3d5da11b","resolution":{"observed_at":"2026-05-26T01:26:27.469505Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Proceedings of the 38th International Conference on Machine Learning , pages =","venue":null,"work_id":"55a0feed-9eac-489c-9e74-db330f7a807a","year":null},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:1879628f6dd644f6a842e01b71c31868bd870799743db304674afa79e0073928","observation_id":"85a64514-51c9-4e1f-9cb9-96a57d712ab2","resolution":{"observed_at":"2026-05-26T01:26:27.476948Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"FLAMBE: Structural Complexity and Representation Learning of Low Rank MDPs , volume =","venue":null,"work_id":"67b7ade1-fb38-4939-bc83-4e0df924a6f4","year":null},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:e4be9a286d69c1a912837d5f4545695b3407ef3a2e289f5207c436256de14cff","observation_id":"9fb5c9a6-c253-4f01-bd98-754954de2493","resolution":{"observed_at":"2026-05-26T01:26:27.466949Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.04652","last_updated":"2022-01-06T04:33:56Z","snapshot_observed_at":"2026-07-06T11:56:10.689708Z","submitted_at":"2021-10-09T22:04:34Z","title":"Representation Learning for Online and Offline RL in Low-rank MDPs","version":3},"cited_work":{"arxiv_id":"2110.04652","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2110.04652","snapshot_observed_at":"2026-07-03T14:58:33.273324Z","title":"arXiv preprint arXiv:2110.04652 , year=","venue":null,"work_id":"ba10b80c-8cae-4680-a164-f7928de300d0","year":2021},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"cited_paper":"/paper/2110.04652","citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:92d1af9d6336490b228444fce7dcfba0c54b87c702b962a6cbee949b5ea5f9e9","observation_id":"26fca4be-6254-4baf-b5e6-0b61569f8e44","resolution":{"observed_at":"2026-05-11T16:46:05.450866Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"International Conference on Machine Learning , pages=","venue":null,"work_id":"636b6713-3489-4ad7-b094-9cba03cc3221","year":2017},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:f2e0fe84b41c8f0cb187eea74c2ceac3792e1ec0688c98c57d0aaf0abd318b89","observation_id":"c2af3f8d-46f3-4cc1-945b-f4cd8838d558","resolution":{"observed_at":"2026-05-26T01:26:27.461959Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.11274","last_updated":"2020-06-19T17:59:36Z","snapshot_observed_at":"2026-08-05T14:57:00.030905Z","submitted_at":"2020-06-19T17:59:36Z","title":"On Reward-Free Reinforcement Learning with Linear Function Approximation","version":1},"cited_work":{"arxiv_id":"2006.11274","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2006.11274","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2006.11274 , year=","venue":null,"work_id":"d374500b-76d6-4ff4-b832-54f62bb20387","year":2006},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"cited_paper":"/paper/2006.11274","citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:f795a30492ff31023e5a2dc543c149f074062183b57d81d1569bd16b0d55d695","observation_id":"af7bfae2-95c5-4990-9f75-9fa2ac215260","resolution":{"observed_at":"2026-05-11T16:46:05.276253Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Conference on Learning Theory , pages=","venue":null,"work_id":"7ec0c771-a91e-4077-b76e-afa1c3e18407","year":2020},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:d7132ce5c38d8f15b4d38f3f2956644dea6c69ba5f9b9781f7278f9a7efc52ff","observation_id":"98296292-a3a2-403f-a1d2-8bb9a53cefa5","resolution":{"observed_at":"2026-05-26T01:26:27.464535Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2102.07035","last_updated":"2022-06-21T21:34:58Z","snapshot_observed_at":"2026-08-05T14:56:05.630631Z","submitted_at":"2021-02-14T00:06:54Z","title":"Model-free Representation Learning and Exploration in Low-rank MDPs","version":2},"cited_work":{"arxiv_id":"2102.07035","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2102.07035","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2102.07035 , year=","venue":null,"work_id":"2d72534e-9ec8-446b-be76-a2177f4f760a","year":null},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"cited_paper":"/paper/2102.07035","citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:0d2b692a492d6a7fbad77cd9a45eaf4053c45624d0ae00c9674f3db2018c3b41","observation_id":"e0b596e6-1b70-4d8d-b8fe-fd57c8d43149","resolution":{"observed_at":"2026-05-11T16:46:05.418500Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-07-05T23:31:35.020798Z","title":"International Conference on Machine Learning , pages=","venue":null,"work_id":"840a8bb5-1527-4594-a1c7-b3b9be2e25bb","year":2020},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:13ec3dfccb0d84161676f9874631db3435ce16d5842fdec731d7bedd721f1ee2","observation_id":"70b287cd-bb0d-499c-8975-fdb91c6bfa57","resolution":{"observed_at":"2026-05-26T01:26:27.474446Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1703.07710","last_updated":"2018-01-02T13:25:46Z","snapshot_observed_at":"2026-07-06T05:34:45.522346Z","submitted_at":"2017-03-22T15:34:23Z","title":"Unifying PAC and Regret: Uniform PAC Bounds for Episodic Reinforcement Learning","version":3},"cited_work":{"arxiv_id":"1703.07710","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1703.07710","snapshot_observed_at":"2026-07-04T22:26:48.537262Z","title":"arXiv preprint arXiv:1703.07710 , year=","venue":null,"work_id":"b1ed92e0-9056-4181-b16b-d711683d200d","year":null},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"cited_paper":"/paper/1703.07710","citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:160535f3e36231b00e5a01f250b12dfb5a5c924b983ae1ed9cd1aaa6a14c6e6b","observation_id":"3ee3d256-a2f6-49bc-a9b2-5f9bf51ef690","resolution":{"observed_at":"2026-07-04T22:26:48.537262Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":"24e5e11c-116b-4237-a594-ba1a1416d637","year":null},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:75d9688c6711e984ec9d703a3832953b1667d37a39ba1b0870972ffc444d75cf","observation_id":"10ee0b76-3de8-4349-a396-959b132cb374","resolution":{"observed_at":"2026-05-26T01:26:27.471919Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Conference on learning theory , pages=","venue":null,"work_id":"48246d1b-8829-4f76-a3ad-40cd8f974d7f","year":2019},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:8c1c34293ed0418cc63b9740df800ff2ebe9d863f8af561e0206d47b90af1c1d","observation_id":"4c74d48c-1b79-4385-b316-b45359723fd6","resolution":{"observed_at":"2026-05-26T01:26:27.504927Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2010.05901","last_updated":"2020-10-23T17:41:20Z","snapshot_observed_at":"2026-08-05T13:53:14.942718Z","submitted_at":"2020-10-12T17:51:19Z","title":"Nearly Minimax Optimal Reward-free Reinforcement Learning","version":2},"cited_work":{"arxiv_id":"2010.05901","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2010.05901","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Nearly minimax optimal reward-free reinforcement learning","venue":null,"work_id":"b1eb2cf1-1bb8-46e1-bc91-518a62bcab3b","year":2010},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"cited_paper":"/paper/2010.05901","citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:a5b86a50e00870892db2c83384d056fc303aef92c0394571552971a0c1d68667","observation_id":"12f0a5d1-b337-40f7-a6c5-6dc22d1b86f5","resolution":{"observed_at":"2026-05-11T16:46:05.319610Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"International Conference on Machine Learning , pages=","venue":null,"work_id":"f4f92e2e-18dd-42a7-9e30-80afa83b4f6a","year":2021},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:a31f1b79531364e7415dbfc2568e4c7e5effcbc930b7369ddcdffef8bdc8ab85","observation_id":"9047d9c7-5afd-4e2a-83e6-124118d77def","resolution":{"observed_at":"2026-05-26T01:26:27.529342Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Algorithmic Learning Theory , pages=","venue":null,"work_id":"803c04ea-ed24-484f-a793-fe8376e51974","year":2021},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:d3e462ff36cd098224324e5137f65881c854ea2e03e2a36f404ea16fdc73c3e0","observation_id":"08e18025-a9eb-44c1-b83f-779144e6ab1e","resolution":{"observed_at":"2026-05-26T01:26:27.483992Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2008.07737","last_updated":"2020-10-22T02:30:08Z","snapshot_observed_at":"2026-07-06T09:48:00.142946Z","submitted_at":"2020-08-18T04:34:21Z","title":"Provably Efficient Reward-Agnostic Navigation with Linear Value Iteration","version":2},"cited_work":{"arxiv_id":"2008.07737","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2008.07737","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2008.07737 , year=","venue":null,"work_id":"23c19e03-b809-4858-b848-48604b44ca97","year":2008},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"cited_paper":"/paper/2008.07737","citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:c4be72b45153c1ece95c63e4aeb9970ea98caffb8899fc62d75bc9437aaae685","observation_id":"a6305636-ac57-45c7-b84b-ab2e7ce14020","resolution":{"observed_at":"2026-05-11T16:46:05.391311Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"International Conference on Machine Learning , pages=","venue":null,"work_id":"00d108a5-22ad-4356-9c4c-64c5596550a1","year":2020},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:b5234a247a364950e7ca50f1fa0dc8998164ecb2aa8735deb5cb549f64c91d93","observation_id":"d0292d09-b1bf-493d-92f8-1f94d70a3166","resolution":{"observed_at":"2026-05-26T01:26:27.598166Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"International Conference on Machine Learning , pages=","venue":null,"work_id":"69395fd6-bdca-40e0-aa1f-074a52412d3f","year":2019},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:4a823f560faf166e9926e572fedb3c5e821e76a23b44bfc12cc704a512519afb","observation_id":"9847dccf-f0e9-449f-a5c6-71396ad9dad5","resolution":{"observed_at":"2026-05-26T01:26:27.593299Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"International Conference on Machine Learning , pages=","venue":null,"work_id":"e651faf3-18f1-4466-9487-21e0d5ce811d","year":null},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:bcd700047eaddfcf12d0cc58d5c59921efff5a80b206a4ca89f6b8d8147494cd","observation_id":"1907b811-f4c4-432f-857a-0e53bd12b7ab","resolution":{"observed_at":"2026-05-26T01:26:27.583682Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"International conference on machine learning , pages=","venue":null,"work_id":"eae4643e-2a7d-4a61-b710-64e330a0b28c","year":null},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:0c8a2044ac017fc4d013dca96e2975ed3a0ae79737ef38292fb13eebd4af1a1f","observation_id":"aa941652-ecd3-455f-98df-a28a022549a7","resolution":{"observed_at":"2026-05-26T01:26:27.581413Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"IEEE transactions on evolutionary computation , volume=","venue":null,"work_id":"70a25f00-8d9e-4af9-9959-09b11ac2b392","year":2007},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:9957495a322923973946dfb680303a82ef4328e346546e56b00526b3be1af87a","observation_id":"cd2016a4-5213-422e-9c30-81983871da3c","resolution":{"observed_at":"2026-05-26T01:26:27.585931Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-07-08T03:24:29.193821Z","title":"Advances in neural information processing systems , volume=","venue":null,"work_id":"91b356cb-2f2f-4ca5-b796-4990c8e765f1","year":null},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:1d01b3f08b7b2024ba15cced03475608d15d51701fa75fa50378a1f5032b9d41","observation_id":"d059c845-89ab-40f2-89ef-a6f64f78bdb4","resolution":{"observed_at":"2026-05-26T01:26:27.588562Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2103.10897","last_updated":"2021-07-11T22:29:02Z","snapshot_observed_at":"2026-07-06T10:51:32.534213Z","submitted_at":"2021-03-19T16:34:20Z","title":"Bilinear Classes: A Structural Framework for Provable Generalization in RL","version":3},"cited_work":{"arxiv_id":"2103.10897","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2103.10897","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2103.10897 , year=","venue":null,"work_id":"52f1dc33-a3c2-4e24-b809-c66dcc95ad3b","year":null},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"cited_paper":"/paper/2103.10897","citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:a9eca67a964648178798cde186c011bf98b30394e6a9271bd039a778783a8652","observation_id":"3c506552-1906-4e3e-9be2-fe618bb017e6","resolution":{"observed_at":"2026-05-11T16:46:05.397656Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1903.03698","last_updated":"2020-08-04T04:07:27Z","snapshot_observed_at":"2026-07-06T07:38:07.496179Z","submitted_at":"2019-03-08T23:32:17Z","title":"Skew-Fit: State-Covering Self-Supervised Reinforcement Learning","version":4},"cited_work":{"arxiv_id":"1903.03698","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1903.03698","snapshot_observed_at":"2026-07-04T06:59:38.343947Z","title":"arXiv preprint arXiv:1903.03698 , year=","venue":null,"work_id":"9912f351-bd16-4037-9627-98a975a611ff","year":1903},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"cited_paper":"/paper/1903.03698","citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:9626490d4c4716a8a50bcb8ebdb997685abfe77b3eee73fe7b696c55139a8b2c","observation_id":"075a2598-7790-4088-af7b-9a03bae07a5d","resolution":{"observed_at":"2026-05-11T16:46:05.336561Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1802.06070","last_updated":"2018-10-09T23:19:52Z","snapshot_observed_at":"2026-07-06T06:23:52.853341Z","submitted_at":"2018-02-16T18:57:57Z","title":"Diversity is All You Need: Learning Skills without a Reward Function","version":6},"cited_work":{"arxiv_id":"1802.06070","doi":"10.48550/arxiv.1802.06070","metadata_source":"pith","pith_arxiv_id":"1802.06070","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Diversity is All You Need: Learning Skills without a Reward Function","venue":"cs.AI","work_id":"2ee80929-ae4d-4342-a8f3-ad970e340f75","year":2018},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"cited_paper":"/paper/1802.06070","citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:a068160e8c7671d8d3f1bd6545ab478e1576ef3058915285aa6c18d7096a3111","observation_id":"b7202ca6-5f69-4602-aedc-dbf22a39d57f","resolution":{"observed_at":"2026-05-11T16:46:05.350281Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1807.04742","last_updated":"2018-12-04T08:44:08Z","snapshot_observed_at":"2026-07-06T06:49:53.002704Z","submitted_at":"2018-07-12T17:51:16Z","title":"Visual Reinforcement Learning with Imagined Goals","version":2},"cited_work":{"arxiv_id":"1807.04742","doi":null,"metadata_source":"pith","pith_arxiv_id":"1807.04742","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Visual Reinforcement Learning with Imagined Goals","venue":"cs.LG","work_id":"06928066-278b-48bc-9cb9-b230d19e0976","year":2018},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"cited_paper":"/paper/1807.04742","citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:7ecc6474c4ced4e0165509140391fd51e663334a494eac23026d94e058f04ee8","observation_id":"718d3e34-2b17-4b47-aa86-5db4a5758d73","resolution":{"observed_at":"2026-05-11T16:46:05.290729Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"International Conference on Machine Learning , pages=","venue":null,"work_id":"906cf2af-631a-46f2-9c32-818e08f6aeba","year":2018},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:8da239dfb456edc13ff9dfd968e54358bf77db500b5c5c099e55dea07e29e831","observation_id":"3c7b51ca-d9e5-42d6-98f6-b18bd191f917","resolution":{"observed_at":"2026-05-26T01:26:27.595765Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1810.12894","last_updated":"2018-10-30T17:44:42Z","snapshot_observed_at":"2026-07-06T07:11:32.319931Z","submitted_at":"2018-10-30T17:44:42Z","title":"Exploration by Random Network Distillation","version":1},"cited_work":{"arxiv_id":"1810.12894","doi":"10.48550/arxiv.1810.12894","metadata_source":"pith","pith_arxiv_id":"1810.12894","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Exploration by Random Network Distillation","venue":"cs.LG","work_id":"5a87fef6-96e2-4d5b-91ec-1a7c9a43cab9","year":2018},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"cited_paper":"/paper/1810.12894","citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:af7e5490cc992468258586eeb92b48e6e7e030cd2694bc11cf5ec931bd2bb0d2","observation_id":"0f0c171f-26f5-4d00-a859-23e6d752eca1","resolution":{"observed_at":"2026-05-11T16:46:05.440869Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"2014 IEEE Symposium on Adaptive Dynamic Programming and Reinforcement Learning (ADPRL) , pages=","venue":null,"work_id":"8f721cef-f8ce-4299-b702-80f83489f5cc","year":2014},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:5f62cf738152bcd963b4543e3e8b671890ae02561ddb4ec961a322dc70c75f56","observation_id":"83e42eb4-6094-402d-9b8e-ddf1e5f5d275","resolution":{"observed_at":"2026-05-26T01:26:27.517235Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Proceedings of the 19th international conference on World wide web , pages=","venue":null,"work_id":"5ec32b98-f267-4894-8b8f-674ac48e062d","year":null},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:ca544843752b3e69df99da3ea8ad5fb2f32562e2ad89c8a2d91c9a633354d4fc","observation_id":"6d2d06e9-1bc4-4a43-a6d2-386092209f82","resolution":{"observed_at":"2026-05-26T01:26:27.555894Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.00063","last_updated":"2022-10-11T04:12:57Z","snapshot_observed_at":"2026-07-06T12:33:05.199267Z","submitted_at":"2022-01-31T19:47:55Z","title":"Efficient Reinforcement Learning in Block MDPs: A Model-free Representation Learning Approach","version":3},"cited_work":{"arxiv_id":"2202.00063","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2202.00063","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2202.00063 , year=","venue":null,"work_id":"6c5ab9b8-2f54-4f4d-9874-f994c95f7116","year":null},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"cited_paper":"/paper/2202.00063","citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:0785cf088629e39ef507a09a1b91ec7417cf90663ff7bd4d0de5534e3377df1d","observation_id":"72983b8a-5fa0-45de-94b7-0794bf7236c6","resolution":{"observed_at":"2026-05-11T16:46:05.360298Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Kakade and Jason D","venue":null,"work_id":"4e65ec46-8a61-4ef2-8eec-52ec04f7f743","year":null},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:0bb77458723ec5412b46294eb59cbb67f12621401d705780a2a5e3fca8009d82","observation_id":"ad37a687-0425-4243-adff-16e53a1d4ba0","resolution":{"observed_at":"2026-05-26T01:26:27.558002Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":"490ca02a-1036-4d4f-a80a-b379c0c6b164","year":null},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:7664b08189c892fa53192f2fb100ab4fae07f11aea53c31b9264bde69c7731e3","observation_id":"be88d332-6c13-4213-a99b-75188857a88b","resolution":{"observed_at":"2026-05-26T01:26:27.565402Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"CoRR , volume =","venue":null,"work_id":"f136960a-0bf9-4255-9f6e-86d9b713fc99","year":null},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:6af1cc09f780cab94812f93610a128cebbef5bb013299ca80296905a44ac381d","observation_id":"fc4ea697-a24b-4d60-9413-42414e7c8379","resolution":{"observed_at":"2026-05-26T01:26:27.548793Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"CoRR , volume =","venue":null,"work_id":"f51084e7-b47c-48fa-9f2c-5c27c632ec6d","year":null},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:94597af2c2d201382434447e1089d2e7baf06d6849c26a94f535a64aa6425b85","observation_id":"a8e73ab2-3dc7-443b-9f34-ce0dac0563d4","resolution":{"observed_at":"2026-05-26T01:26:27.550962Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"CoRR , volume =","venue":null,"work_id":"037363fc-ce29-410c-8873-339308ea1072","year":null},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:d67416c1f92cb2b7f5cfef7f67ad5417bd9bca0942755f88183386ac42ab28ba","observation_id":"e79e4dfa-e0e9-4f32-a85c-3b2b20b12383","resolution":{"observed_at":"2026-05-26T01:26:27.553137Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2206.14057","last_updated":"2023-03-21T18:26:14Z","snapshot_observed_at":"2026-08-05T01:43:12.552648Z","submitted_at":"2022-06-28T15:00:45Z","title":"Safe Exploration Incurs Nearly No Additional Sample Complexity for Reward-free RL","version":3},"cited_work":{"arxiv_id":"2206.14057","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2206.14057","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2206.14057 , year=","venue":null,"work_id":"29bf2a75-de98-40f3-9579-33affbfab4e4","year":null},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"cited_paper":"/paper/2206.14057","citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:877f86d415007ec0f671c30ab6d39e0bb21ebab8b97d57d840d7f52bf3857080","observation_id":"6914f710-4b5b-4f45-8253-a8b7b6923c30","resolution":{"observed_at":"2026-05-11T16:46:05.345135Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"The Tenth International Conference on Learning Representations","venue":null,"work_id":"fa9c88c9-5d8f-4b15-b1a6-b8d2600eda1b","year":null},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:86f63416503b79c293272df226eb832f5551012ac8641d46384032568afbed47","observation_id":"8fae3f39-04c0-4b48-9454-399255af2c0a","resolution":{"observed_at":"2026-05-26T01:26:27.562829Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2206.12020","last_updated":"2022-06-24T00:27:42Z","snapshot_observed_at":"2026-07-06T13:24:10.141302Z","submitted_at":"2022-06-24T00:27:42Z","title":"Provably Efficient Reinforcement Learning in Partially Observable Dynamical Systems","version":1},"cited_work":{"arxiv_id":"2206.12020","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2206.12020","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2206.12020 , year=","venue":null,"work_id":"67e70334-cc6c-4012-85f5-b62bff921d02","year":null},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"cited_paper":"/paper/2206.12020","citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:fb910d5f60315cc53d3f90cd6e4e58c5cb2d189d4b1bd7911a89b0ff5ee4977a","observation_id":"e7cf026b-5281-4583-98c6-d5b61b8d12ba","resolution":{"observed_at":"2026-05-11T16:46:05.369119Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2208.09515","last_updated":"2023-03-07T16:26:05Z","snapshot_observed_at":"2026-07-06T13:43:35.936418Z","submitted_at":"2022-08-19T19:01:30Z","title":"Spectral Decomposition Representation for Reinforcement Learning","version":2},"cited_work":{"arxiv_id":"2208.09515","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2208.09515","snapshot_observed_at":"2026-07-03T14:58:33.275948Z","title":"arXiv preprint arXiv:2208.09515 , year=","venue":null,"work_id":"df5be900-cf8f-468f-9033-0bfee4450877","year":2022},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"cited_paper":"/paper/2208.09515","citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:4c358044c8a5ab2e3a14b6939512973c05a0365d3d7d9b331b7d7b8063293380","observation_id":"8d1af092-0814-4b17-bc1a-aaf7e199f944","resolution":{"observed_at":"2026-05-11T16:46:05.411562Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2207.05738","last_updated":"2022-08-13T15:21:02Z","snapshot_observed_at":"2026-07-06T13:30:32.141738Z","submitted_at":"2022-07-12T17:57:17Z","title":"PAC Reinforcement Learning for Predictive State Representations","version":3},"cited_work":{"arxiv_id":"2207.05738","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2207.05738","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2207.05738 , year=","venue":null,"work_id":"ae0d0724-85e7-4e1e-aff2-7fb4cdb65630","year":null},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"cited_paper":"/paper/2207.05738","citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:7d328729d80526530d56b51e4aee92e97525d8166e58dd8f08065812bcf7231f","observation_id":"79800d39-d4b2-4a5d-be12-0e355058d4f9","resolution":{"observed_at":"2026-05-11T16:46:05.428994Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.14571","last_updated":"2023-02-22T05:31:18Z","snapshot_observed_at":"2026-08-01T13:17:52.470464Z","submitted_at":"2022-05-29T04:31:29Z","title":"Provable Benefits of Representational Transfer in Reinforcement Learning","version":2},"cited_work":{"arxiv_id":"2205.14571","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2205.14571","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2205.14571 , year=","venue":null,"work_id":"db33389f-83a4-4905-b801-e243ea87aa62","year":null},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"cited_paper":"/paper/2205.14571","citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:f7bb9f083799e144d7f740fb4a9a1bb9eaab64df2b0f546ae9be84394ab96970","observation_id":"0979e8bd-3bd0-43cb-9b58-e5c6a50549f1","resolution":{"observed_at":"2026-05-11T16:46:05.257271Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.08053","last_updated":"2021-06-15T11:21:06Z","snapshot_observed_at":"2026-08-04T23:27:06.902484Z","submitted_at":"2021-06-15T11:21:06Z","title":"On the Power of Multitask Representation Learning in Linear MDP","version":1},"cited_work":{"arxiv_id":"2106.08053","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2106.08053","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2106.08053 , year=","venue":null,"work_id":"a9631432-ede3-494a-b8e5-57065e0e89c6","year":null},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"cited_paper":"/paper/2106.08053","citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:07d17e132c61a4fa2c6f86f22b6f735e8aae72bfba1560738d10472a460e67fd","observation_id":"59771bd7-7b8a-4a5b-ac46-dc50928b42af","resolution":{"observed_at":"2026-05-11T16:46:05.266375Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Lee and Simon Shaolei Du , title =","venue":null,"work_id":"44ca7bfa-2b95-4654-bf3d-770d85ac8e52","year":null},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:42c0b93aa5d1595ca3c16fc7a9cd58ab86d60c57004f138a581cd76096be8578","observation_id":"3b40a12a-60ce-4e20-91f5-49256ef14156","resolution":{"observed_at":"2026-05-26T01:26:27.576949Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Conference on Learning Theory , pages=","venue":null,"work_id":"91ead711-0ff2-4edf-969a-93002e7f9585","year":2021},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:5591ba039ea5ee48c5d84a52fdb106a8c76cb341385a43e837e7f75aed7e3739","observation_id":"ee3bef0f-8cc5-408e-b972-a322462edd31","resolution":{"observed_at":"2026-05-26T01:26:27.590804Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2209.14997","last_updated":"2022-11-23T18:57:52Z","snapshot_observed_at":"2026-07-06T13:57:54.539656Z","submitted_at":"2022-09-29T17:56:25Z","title":"Optimistic MLE -- A Generic Model-based Algorithm for Partially Observable Sequential Decision Making","version":3},"cited_work":{"arxiv_id":"2209.14997","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2209.14997","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2209.14997 , year=","venue":null,"work_id":"1b099add-909f-4f3c-9419-8bc6b1de3716","year":null},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"cited_paper":"/paper/2209.14997","citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:1ab4f20eed0313dd33ee72ef7ee0bc098ca9a729798ab846673bc230e06135ee","observation_id":"c756bfb5-69ba-427e-8e72-6b5fb9fc2be6","resolution":{"observed_at":"2026-05-11T16:46:05.422370Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2209.14990","last_updated":"2022-12-16T12:52:07Z","snapshot_observed_at":"2026-07-31T01:41:20.967405Z","submitted_at":"2022-09-29T17:51:51Z","title":"Partially Observable RL with B-Stability: Unified Structural Condition and Sharp Sample-Efficient Algorithms","version":2},"cited_work":{"arxiv_id":"2209.14990","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2209.14990","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2209.14990 , year=","venue":null,"work_id":"c219676e-8757-4143-852b-17e34ee9e052","year":null},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"cited_paper":"/paper/2209.14990","citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:08a69375dc274efc66e872834969fd36ee156a9c0166b6c9ba397b1efa53a63f","observation_id":"6743e4ed-1091-4159-9ffd-e5fff2b7c38e","resolution":{"observed_at":"2026-05-11T16:46:05.306422Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Rusu and Neil C","venue":null,"work_id":"c7921fed-c41c-47fd-9e21-5ef02439bea0","year":null},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:f9c2adb87fb015ff2a05da9b4be2bfef6d2c7fe8fe8f98d7b57b43f0c160bc4c","observation_id":"e038b4d9-9eb6-4a20-baba-612591f28290","resolution":{"observed_at":"2026-05-26T01:26:27.560289Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Neural Comput","venue":null,"work_id":"ae2000b0-23bf-4d76-92ab-6d04ea3295a0","year":null},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:e91cb5fe7b4cf1b352545f8f7843a845257fe7e4c68749031b6e6ef2951e6655","observation_id":"e0241707-b364-4f7f-9ef9-adfb4dcce4a7","resolution":{"observed_at":"2026-05-26T01:26:27.536843Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"CoRR , volume =","venue":null,"work_id":"02ddc8d6-42f1-49e8-bef6-a642a31dc930","year":null},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:534c179771e8e3c228370f272688f0c46be47a5a02f48cd760d86d39e3556558","observation_id":"de2f3bda-5b35-4cd9-9e40-e7f5a12640a3","resolution":{"observed_at":"2026-05-26T01:26:27.540726Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs"},"reference_resolution":{"displayed":82,"state_counts":{"malformed_identifier":0,"metadata_mismatch":6,"parse_uncertain":1,"unresolved":7,"verified_exact":19,"verified_fuzzy":49},"total_outbound_references":82},"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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 82 of 82 outbound references and 0 inbound Pith citation observations for arXiv:2605.01242."}