{"as_of":"2026-08-08T08:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:98d5fd408b0df413234a28f2cd8a4a86dff1ec958b5eae96c02c6ba06d41cb68","coverage":[{"denominator":62,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":62,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:37:07.336312Z","state":"measured"},{"denominator":63,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":63,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-26T11:59:18.223000Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-04T08:19:43.736761Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"cited_work":{"arxiv_id":"2505.14821","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.14821","snapshot_observed_at":"2026-07-04T08:19:43.736761Z","title":"arXiv preprint arXiv:2505.14821 , year=","venue":null,"work_id":"786272b1-6b96-4281-8295-d1d12af14ba5","year":null},"citing_paper":{"arxiv_id":"2606.21925","last_updated":"2026-06-20T07:47:41Z","snapshot_observed_at":"2026-07-06T23:56:49.977855Z","submitted_at":"2026-06-20T07:47:41Z","title":"PhiBE-Q-Learning: Bridging Off-Policy Reinforcement Learning and Continuous-Time Control","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-06-26T11:59:18.223000Z"},"links":{"cited_paper":"/paper/2505.14821","citing_paper":"/paper/2606.21925"},"observation_digest":"sha256:57a37607e1ff18a59ba95d70d9e32a37508f33db9daba56ec99925bf5920c8db","observation_id":"cbb84136-02e0-4a41-85f4-0d7c5d34707a","resolution":{"observed_at":"2026-07-04T08:19:43.738291Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.14821/citation-record","integrity":"/paper/2505.14821/integrity","json":"/paper/2505.14821/citation-record.json","paper":"/paper/2505.14821"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:36:59.233159Z","title":"Improved algorithms for linear stochastic bandits","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T15:36:59.233159Z"},"links":{"citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:5835f64ce18f494a4b1cf9fa6d4e5e2b36af071274d278e4faf1f324165d5ee6","observation_id":"31abe703-6ff6-4548-856e-846249918849","resolution":{"observed_at":"2026-08-07T15:36:59.233159Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:37:15.495589Z","title":"Efficient optimistic exploration in linear-quadratic regulators via lagrangian relaxation","venue":null,"work_id":"8d868804-8b04-4c88-8fd9-4feef6c23149","year":2020},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T15:36:59.320362Z"},"links":{"citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:99bca0b1baf3f3ff8435277851f94f10a613cd261a3b0e974f3a9df9fe2c13fa","observation_id":"2cc0f559-aa62-41e0-9463-6412f645b2e1","resolution":{"observed_at":"2026-08-07T15:37:15.637195Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.08797","last_updated":"2025-10-09T00:43:44Z","snapshot_observed_at":"2026-07-06T15:03:52.079498Z","submitted_at":"2023-03-15T17:43:42Z","title":"Stochastic Interpolants: A Unifying Framework for Flows and Diffusions","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.08797","snapshot_observed_at":"2026-08-07T15:36:59.482816Z","title":"Stochastic interpolants: A unifying framework for flows and diffusions","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T15:36:59.482816Z"},"links":{"cited_paper":"/paper/2303.08797","citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:93015a9dcc814d2a62cbc3cbbda30fcc7c8c997a33515b2c7d600d63ffedbc77","observation_id":"e7fb566b-ff05-47b9-815f-a17bcdbcc7ca","resolution":{"observed_at":"2026-08-07T15:36:59.482816Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:36:59.590274Z","title":"Finite-time analysis of the multiarmed bandit problem, 2002","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T15:36:59.590274Z"},"links":{"citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:949e02f8321ec627d42d992d0608c5616797d1e3265e8fd69e4fb718731048bb","observation_id":"8f916fcf-36e8-45e9-abf9-740603d960b9","resolution":{"observed_at":"2026-08-07T15:36:59.590274Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:37:15.274567Z","title":"Provably efficient q-learning with low switching cost","venue":null,"work_id":"e28da214-614a-42d1-a25c-872e9275bef6","year":2019},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T15:36:59.780050Z"},"links":{"citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:c8cf329410d9c606ac7290024f3bb946836a9dfa5b3b9977b49b20d2de57cef6","observation_id":"afbd4c9f-0f80-4a8b-8be0-6f8709c4c0ae","resolution":{"observed_at":"2026-08-07T15:37:15.393947Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:37:15.025360Z","title":"Logarithmic regret for episodic continuous-time linear-quadratic reinforcement learning over a finite-time horizon","venue":null,"work_id":"57457457-2e5f-4ba4-b23a-7e2d68b97e3e","year":2022},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T15:36:59.917393Z"},"links":{"citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:7b7327812282a8771c7e024fb2dc35ddb47979eaf63093f75e2081cefba82299","observation_id":"c955c716-c5a9-4388-bb25-f1680efa5177","resolution":{"observed_at":"2026-08-07T15:37:15.148852Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:37:14.851907Z","title":"The stability of solutions of linear differential equations","venue":null,"work_id":"d2fc15b3-2548-4b16-a811-3bf602c1f0e1","year":1943},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:00.082842Z"},"links":{"citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:5e84ace7445635e827076540d8d9422f8742564e439994da8ec3d4b05402ab43","observation_id":"21e0f825-ca2a-4fa2-bc77-b1473cde29ae","resolution":{"observed_at":"2026-08-07T15:37:14.917492Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.13301","last_updated":"2024-01-04T19:11:25Z","snapshot_observed_at":"2026-08-01T15:43:51.739518Z","submitted_at":"2023-05-22T17:57:41Z","title":"Training Diffusion Models with Reinforcement Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.13301","snapshot_observed_at":"2026-08-07T15:37:00.214724Z","title":"Training diffusion models with reinforcement learning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:00.214724Z"},"links":{"cited_paper":"/paper/2305.13301","citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:38d03b2ac86a98f34ffbd7b151d640e74c339cd62a4cabcdbec74cf02317666f","observation_id":"6b2f0766-dd42-4309-91ab-d338196e7f14","resolution":{"observed_at":"2026-08-07T15:37:00.214724Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:37:00.365912Z","title":"Variational inference: A review for statisticians","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:00.365912Z"},"links":{"citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:71be3775344f92fa72d927c5c8fce9aebc7b7c885b459f56cedbb0cf4dab9d5f","observation_id":"8ba6a6d6-2fe0-4c24-acc7-d917cec0d6fe","resolution":{"observed_at":"2026-08-07T15:37:00.365912Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1606.01540","last_updated":"2016-06-05T17:54:48Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2016-06-05T17:54:48Z","title":"OpenAI Gym","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1606.01540","snapshot_observed_at":"2026-08-07T15:37:00.524020Z","title":"Openai gym","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:00.524020Z"},"links":{"cited_paper":"/paper/1606.01540","citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:371177e327b604b4c08cef46e15c0a308fa1224eafbb567f10cd3c5f0eaacc6d","observation_id":"b21b9bac-380b-4d06-b489-84378a9f8539","resolution":{"observed_at":"2026-08-07T15:37:00.524020Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:37:14.649649Z","title":"Caines and David Levanony","venue":null,"work_id":"e5513697-728a-46d6-ab51-d70d16b55328","year":2019},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:00.640241Z"},"links":{"citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:3377ee47a4f31f69f953165d0828d0b561c2c2c4cfb2abe9b038055523a3e96f","observation_id":"3e957e68-8569-4ba6-9f3b-52618ed56dff","resolution":{"observed_at":"2026-08-07T15:37:14.755597Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:37:14.443824Z","title":"Online learning with switching costs and other adaptive adversaries","venue":null,"work_id":"2b9190a5-e4e1-4900-b60c-60bfeca9c0b0","year":2013},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:00.763160Z"},"links":{"citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:3c8bb5ff42e998a31cfc0524b77eab216521157b8ed212af6990ac72397795ba","observation_id":"d93d14fc-37a0-44d2-abb3-8924c4de9d5b","resolution":{"observed_at":"2026-08-07T15:37:14.538817Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:37:00.896562Z","title":"Neural ordinary differential equations","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:00.896562Z"},"links":{"citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:dc3f478394fa9c02169eaf8bc85a34edfcca6c34c256241279f8ce544af79adb","observation_id":"c6c64d36-d5cf-438c-b79b-758a7ef020ac","resolution":{"observed_at":"2026-08-07T15:37:00.896562Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:37:14.140309Z","title":"Online linear quadratic control","venue":null,"work_id":"b99bad6f-e5d8-423b-998e-a82b126f9f31","year":2018},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:01.075060Z"},"links":{"citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:947c1c8e9200ff120aadb2dc6934442588afbd71a3a71380487264dafc6d3fba","observation_id":"0eaeffb2-8706-4271-8b95-03cd195d33be","resolution":{"observed_at":"2026-08-07T15:37:14.299553Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:37:13.885887Z","title":"Reinforcement learning in continuous time and space","venue":null,"work_id":"b46b8936-a6db-487d-a81c-528686df0748","year":2000},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:01.196231Z"},"links":{"citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:29a8073aecd518fb8e6bd8fed360be27faf957fc2c965b4c6e237800abd134a4","observation_id":"041f687a-14ac-4dee-a887-64a53dbcbe3a","resolution":{"observed_at":"2026-08-07T15:37:14.041489Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2101.00494","last_updated":"2021-01-02T18:41:27Z","snapshot_observed_at":"2026-07-06T10:29:29.006834Z","submitted_at":"2021-01-02T18:41:27Z","title":"A Provably Efficient Algorithm for Linear Markov Decision Process with Low Switching Cost","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2101.00494","snapshot_observed_at":"2026-08-07T15:37:01.315074Z","title":"A provably efficient algorithm for linear markov decision process with low switching cost","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:01.315074Z"},"links":{"cited_paper":"/paper/2101.00494","citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:ef58a5404c58b426e52df7c12352849304cd52572faeda02ebbcd74dbc0501e3","observation_id":"b1d2a57e-f7af-4e2e-81f8-98e72c58d1c5","resolution":{"observed_at":"2026-08-07T15:37:01.315074Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:37:01.437324Z","title":"Hamiltonian neural networks","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:01.437324Z"},"links":{"citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:a5c2724894b29efd7ff964a6810662e975bf6d686bb3a00f161d6687b1ae976f","observation_id":"1fc92e53-bbbf-4cd9-9e70-e367d4ed1754","resolution":{"observed_at":"2026-08-07T15:37:01.437324Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:37:13.617007Z","title":"Nearly minimax optimal reinforcement learning for linear markov decision processes","venue":null,"work_id":"acdfd0bb-a637-4a2d-b7a1-cff3986d975a","year":2023},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:01.581767Z"},"links":{"citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:96c1fca115e5a45d9a127ac340ca39f5e0afa8531018a12ddddf5d42945c8144","observation_id":"21af838b-f18f-47ef-a737-d445ab0bc8cf","resolution":{"observed_at":"2026-08-07T15:37:13.748968Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:37:01.704585Z","title":"Denoising diffusion probabilistic models","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:01.704585Z"},"links":{"citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:17df425e2b916375728b5af9506d6dbe1696bf005c1742c841338d2da657f867","observation_id":"e4036064-d016-4112-b852-94334e775d14","resolution":{"observed_at":"2026-08-07T15:37:01.704585Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:37:13.354217Z","title":"Active observing in continuous-time control","venue":null,"work_id":"c0c8f465-55f2-4ea3-89ec-7e0bded79bc3","year":2024},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:01.856298Z"},"links":{"citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:12be078cfd832d986b7682a96eff8188a6c8dbbda291f2c742f39d9e94f1ea6f","observation_id":"e9f44f34-cc47-401f-a33d-7590540df29d","resolution":{"observed_at":"2026-08-07T15:37:13.472817Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.06450","last_updated":"2022-08-31T03:04:16Z","snapshot_observed_at":"2026-07-06T12:37:21.762051Z","submitted_at":"2022-02-14T01:31:46Z","title":"Towards Deployment-Efficient Reinforcement Learning: Lower Bound and Optimality","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.06450","snapshot_observed_at":"2026-08-07T15:37:01.988572Z","title":"Towards deployment-efficient reinforcement learning: Lower bound and optimality","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:01.988572Z"},"links":{"cited_paper":"/paper/2202.06450","citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:1e3ffdf7e2ae2ab5e09f501196745cdeb623d05fb0fa81fc3da82508f2473bad","observation_id":"255b7f55-7f02-4aca-8a34-25c15c2acc10","resolution":{"observed_at":"2026-08-07T15:37:01.988572Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.17226","last_updated":"2025-07-24T15:32:35Z","snapshot_observed_at":"2026-08-01T16:37:37.972314Z","submitted_at":"2024-07-24T12:26:21Z","title":"Sublinear Regret for a Class of Continuous-Time Linear-Quadratic Reinforcement Learning Problems","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.17226","snapshot_observed_at":"2026-08-07T15:37:02.148669Z","title":"Sublinear regret for a class of continuous-time linear--quadratic reinforcement learning problems","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:02.148669Z"},"links":{"cited_paper":"/paper/2407.17226","citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:1ee4e70a9fa37e79b9a1cc7e26a0a15e9175e037f93f8011e0d323b591321c90","observation_id":"a97f3957-348d-4671-84db-5b72c7c52797","resolution":{"observed_at":"2026-08-07T15:37:02.148669Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:37:13.084146Z","title":"Bellman eluder dimension: New rich classes of rl problems, and sample-efficient algorithms","venue":null,"work_id":"fccd356e-4565-478e-911b-62007cd5a752","year":2021},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:02.244042Z"},"links":{"citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:8759edd2f0d3b7680e344ca3782129f3a8ab4805b68426d862553fc7c65f195e","observation_id":"e0c9ea22-7e44-4783-972a-3b766667bb7f","resolution":{"observed_at":"2026-08-07T15:37:13.215115Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2014-12-22T13:54:29Z","title":"Adam: A Method for Stochastic Optimization","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6980","snapshot_observed_at":"2026-08-07T15:37:02.352310Z","title":"Adam: A method for stochastic optimization","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:02.352310Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:f0b729455385945e598e34f7efb1f6714bdba4e852518f29ce14679616dd296b","observation_id":"93762ce8-1451-4622-87b8-47c2f943a7fc","resolution":{"observed_at":"2026-08-07T15:37:02.352310Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.07203","last_updated":"2023-04-18T12:57:43Z","snapshot_observed_at":"2026-07-06T11:18:53.721387Z","submitted_at":"2021-06-14T07:36:25Z","title":"Online Sub-Sampling for Reinforcement Learning with General Function Approximation","version":2},"cited_work":{"arxiv_id":"2106.07203","doi":null,"metadata_source":"pith","pith_arxiv_id":"2106.07203","snapshot_observed_at":"2026-08-07T15:37:07.878198Z","title":"Online Sub-Sampling for Reinforcement Learning with General Function Approximation","venue":"cs.LG","work_id":"a93dfb83-21f7-45d8-85aa-6a37b5dbae60","year":2021},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:02.474018Z"},"links":{"cited_paper":"/paper/2106.07203","citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:07ec10aa46d3712b96a8ca3302c04fb03f756b8de21fcb4e55951ce892aa735a","observation_id":"9381f5fc-91a1-4689-8527-870df0773e32","resolution":{"observed_at":"2026-08-07T15:37:07.954064Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.02747","last_updated":"2023-02-08T15:46:05Z","snapshot_observed_at":"2026-08-02T18:24:58.914589Z","submitted_at":"2022-10-06T08:32:20Z","title":"Flow Matching for Generative Modeling","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.02747","snapshot_observed_at":"2026-08-07T15:37:02.602294Z","title":"Flow matching for generative modeling","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:02.602294Z"},"links":{"cited_paper":"/paper/2210.02747","citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:9f72e0002a5e27b59054a8178e2a632e365f2a325d1b624f26e1c5f1f7c6822b","observation_id":"c65610ec-cc6a-460b-877f-a4d4a4e0c3ce","resolution":{"observed_at":"2026-08-07T15:37:02.602294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:37:12.844292Z","title":"I ^2 sb: Image-to-image schr \\\"o dinger bridge","venue":null,"work_id":"00ee653f-f1a1-459f-94c9-f1736ca17750","year":2023},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:02.724108Z"},"links":{"citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:e01c29878d9829df92ddf421d1c3cf93d5ba68536e44b07cb259a72f80a4fc54","observation_id":"3147964e-5a85-432e-b811-ea5fbc8571ce","resolution":{"observed_at":"2026-08-07T15:37:12.971364Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2208.14699","last_updated":"2022-08-31T08:58:10Z","snapshot_observed_at":"2026-07-06T13:47:14.953794Z","submitted_at":"2022-08-31T08:58:10Z","title":"Let us Build Bridges: Understanding and Extending Diffusion Generative Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2208.14699","snapshot_observed_at":"2026-08-07T15:37:02.821067Z","title":"Let us build bridges: Understanding and extending diffusion generative models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:02.821067Z"},"links":{"cited_paper":"/paper/2208.14699","citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:f54c16b06aab044cf5dfd61186442e4341de083103c749aedb492dcda60f9e2f","observation_id":"27935312-6765-4732-8ff1-b371fc8c9432","resolution":{"observed_at":"2026-08-07T15:37:02.821067Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:37:12.616303Z","title":"A convnet for the 2020s","venue":null,"work_id":"04514a60-fcea-4666-af05-21c7d200bcb2","year":2022},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:02.982165Z"},"links":{"citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:333c86ca12b02b706048d3c6fe6a743b57b7a47c5169c0033379e6b19a9f00a0","observation_id":"09757a76-cb2b-44ef-b396-c121d0b67af6","resolution":{"observed_at":"2026-08-07T15:37:12.746109Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:37:12.353716Z","title":"Value iteration in continuous actions, states and time","venue":null,"work_id":"6725891b-9176-4a5b-b2be-2245bc32449d","year":2021},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:03.084542Z"},"links":{"citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:40054ec22cbd5b10ee3aed52ccc0682c599bae8af035cba22d50dcb2648cb3e0","observation_id":"df0dcf9c-bc8d-4429-b2c8-964f3dd20d07","resolution":{"observed_at":"2026-08-07T15:37:12.498702Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:37:12.111679Z","title":"Numerical solution of stochastic differential equations with jumps in finance, volume 64","venue":null,"work_id":"4bbfa4a4-2c6f-4e9f-8823-8fdd28581a91","year":2010},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:03.194918Z"},"links":{"citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:670f523e8a40735bc3f27385a93e8d77c79296cea72551aa484b8bf60b0ca506","observation_id":"aa055ce6-79f9-43e7-884f-e1c95db8a82b","resolution":{"observed_at":"2026-08-07T15:37:12.232221Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.03739","last_updated":"2024-11-07T03:54:22Z","snapshot_observed_at":"2026-07-06T16:28:22.350574Z","submitted_at":"2023-10-05T17:59:18Z","title":"Aligning Text-to-Image Diffusion Models with Reward Backpropagation","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.03739","snapshot_observed_at":"2026-08-07T15:37:03.307786Z","title":"Aligning text-to-image diffusion models with reward backpropagation","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:03.307786Z"},"links":{"cited_paper":"/paper/2310.03739","citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:72bb124665755fbda47684cd646f68eb3493e2922ed24f7cce0f66dbc8feedf2","observation_id":"a94bb423-231c-4428-a409-657d08cdb7bf","resolution":{"observed_at":"2026-08-07T15:37:03.307786Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:37:03.477449Z","title":"Ramesh, Gabriel Goh, Sandhini Agarwal, Girish Sastry, Amanda Askell, Pamela Mishkin, Jack Clark, Gretchen Krueger, and Ilya Sutskever","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:03.477449Z"},"links":{"citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:c5599a6f9c6d4c724d0383c629b72994553862d0ca30fbf5dd2bef7c09f0ae50","observation_id":"de40edfe-7396-4f0b-bbf7-5910725aaa5f","resolution":{"observed_at":"2026-08-07T15:37:03.477449Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:37:03.631221Z","title":"High-resolution image synthesis with latent diffusion models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:03.631221Z"},"links":{"citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:12109af6c03586de06d11469f8b78d507188ce75d77c9ee60a29f69eafda9417","observation_id":"cfe2e36d-e9e8-414f-a703-9aaf7c239487","resolution":{"observed_at":"2026-08-07T15:37:03.631221Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:37:11.876635Z","title":"Linear bandits with limited adaptivity and learning distributional optimal design","venue":null,"work_id":"617a48c5-5e4f-4ca4-b433-e0cf651471d4","year":2021},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:03.741041Z"},"links":{"citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:60169ba664c993834c4a0734cee8ca0ba8577a818eda82ea30079e8991138619","observation_id":"cfb1daed-c4d5-49e2-ac26-034d4b32c7ae","resolution":{"observed_at":"2026-08-07T15:37:11.980963Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:37:03.889752Z","title":"Eluder dimension and the sample complexity of optimistic exploration","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:03.889752Z"},"links":{"citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:beb3c6addf2adfc843b8a7c33f97b66e47d557a4c4791a254ebb3879aca0f0ab","observation_id":"edbab1c5-78cb-4a8a-a3b5-86e90be59e8c","resolution":{"observed_at":"2026-08-07T15:37:03.889752Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:37:11.598587Z","title":"Schuhmann","venue":null,"work_id":"8c2ebe68-63b6-4328-9bf0-517548726c30","year":2022},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:03.993506Z"},"links":{"citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:180850df0b6a919e6f9cbfbafb7fcd69d104c55976de6c4d208e50b93c4e0d7b","observation_id":"21be4dc2-33cf-44b5-b9fd-0a8e6c6ee4e7","resolution":{"observed_at":"2026-08-07T15:37:11.707355Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:37:11.321895Z","title":"LAION -5b: An open large-scale dataset for training next generation image-text models","venue":null,"work_id":"25e0cd5b-6726-4f78-9bb1-30686732afa0","year":2022},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:04.130770Z"},"links":{"citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:9f3ff00f8742fca5ef77110c210cabbea6d5ce5a80fe45df6739a58c87f1ee80","observation_id":"a690dc3c-22c8-42c3-805a-32ffa3a2e502","resolution":{"observed_at":"2026-08-07T15:37:11.459230Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:37:11.186116Z","title":"Diffusion schr \\\"o dinger bridge matching","venue":null,"work_id":"9f803c37-a0ae-4ee3-af3a-2b653cf3d43b","year":2024},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:04.244735Z"},"links":{"citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:4fb1218db5f431b4a3cc944eaa635340ca730397125c9315141bb5abdb07f666","observation_id":"ca70e740-8335-45ef-8a0a-7cc214dcd390","resolution":{"observed_at":"2026-08-07T15:37:11.229149Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:37:11.009250Z","title":"Online reinforcement learning in stochastic continuous-time systems","venue":null,"work_id":"1258ffd1-3ac2-4ec1-8c5e-214e0ad2ec0a","year":2023},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:04.391596Z"},"links":{"citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:0aee69b46b6b2657cb215dbde6a80899ec49cc4850eeb300118433e85982e404","observation_id":"a814814e-ae76-4b28-bd31-e826998242e3","resolution":{"observed_at":"2026-08-07T15:37:11.108327Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:37:10.746252Z","title":"Naive exploration is optimal for online lqr","venue":null,"work_id":"55e4dbf5-c3d1-4652-9b60-68c8f15bff95","year":2020},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:04.484664Z"},"links":{"citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:91b45664931f70769079def65caeaad28b18659ca5fdf75811286743c3de565c","observation_id":"587dbca1-4873-4455-89d6-510e4f341db9","resolution":{"observed_at":"2026-08-07T15:37:10.838667Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:37:04.637569Z","title":"Deep unsupervised learning using nonequilibrium thermodynamics","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:04.637569Z"},"links":{"citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:3264126fe8e86fc9c8a819a881fac9b82c17949e908cbe095585593eba383700","observation_id":"b6b09908-611b-4e5c-b8ee-9bf4915d4ca5","resolution":{"observed_at":"2026-08-07T15:37:04.637569Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:37:10.477400Z","title":"Aligned diffusion schr \\\"o dinger bridges","venue":null,"work_id":"d184f3f5-ef12-48a0-9ef8-2a74547991e0","year":1985},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:04.744524Z"},"links":{"citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:cdd145b6300a96bc0eb6ef1adb9745203c96e8fcf5468376d6eadf4e73a6f522","observation_id":"dd7c5d72-0835-4672-9e22-63f56d784c1e","resolution":{"observed_at":"2026-08-07T15:37:10.593886Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2010.02502","last_updated":"2022-10-05T20:19:21Z","snapshot_observed_at":"2026-07-06T10:01:50.133383Z","submitted_at":"2020-10-06T06:15:51Z","title":"Denoising Diffusion Implicit Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.02502","snapshot_observed_at":"2026-08-07T15:37:04.869147Z","title":"Denoising diffusion implicit models","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:04.869147Z"},"links":{"cited_paper":"/paper/2010.02502","citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:ea67fdb93c85684a327610dde80d8065ae3bd893e96ba8fa28bd0a1fa52d8a15","observation_id":"52534e3d-f3fb-436a-8c23-5ce0273270f1","resolution":{"observed_at":"2026-08-07T15:37:04.869147Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2011.13456","last_updated":"2021-02-10T18:17:04Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2020-11-26T19:39:10Z","title":"Score-Based Generative Modeling through Stochastic Differential Equations","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.13456","snapshot_observed_at":"2026-08-07T15:37:05.028823Z","title":"Score-based generative modeling through stochastic differential equations","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:05.028823Z"},"links":{"cited_paper":"/paper/2011.13456","citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:95559bc9ceb693cc484502c0fc6d42912951447921ce55228f12984a987a7dbe","observation_id":"eb177310-4c57-4b3d-825c-0dfe8a5e8d06","resolution":{"observed_at":"2026-08-07T15:37:05.028823Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:37:10.243449Z","title":"Optimal scheduling of entropy regularizer for continuous-time linear-quadratic reinforcement learning","venue":null,"work_id":"d3449a12-eda2-4cce-8192-2f7004d59708","year":2024},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:05.168220Z"},"links":{"citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:1d0274d915e03b662539d63a5da4574e170ebaf5b3efd064443a89805cebfb5a","observation_id":"3e4b72ec-d0b1-49e5-9f8a-97d4283c155c","resolution":{"observed_at":"2026-08-07T15:37:10.364103Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.00482","last_updated":"2024-03-11T14:27:48Z","snapshot_observed_at":"2026-07-06T14:47:04.817434Z","submitted_at":"2023-02-01T14:47:17Z","title":"Improving and generalizing flow-based generative models with minibatch optimal transport","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.00482","snapshot_observed_at":"2026-08-07T15:37:05.316223Z","title":"Improving and generalizing flow-based generative models with minibatch optimal transport","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:05.316223Z"},"links":{"cited_paper":"/paper/2302.00482","citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:015769bfb0029df6d5183f6403098e10662f83f00473f8c5fa319dca6fc68622","observation_id":"e99bb684-77a3-4031-88da-12c510c0a0a2","resolution":{"observed_at":"2026-08-07T15:37:05.316223Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:37:10.102608Z","title":"Efficient exploration in continuous-time model-based reinforcement learning","venue":null,"work_id":"20bef647-7358-4b47-8418-2b2ed71b01fd","year":2024},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:05.462414Z"},"links":{"citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:0fb0a95f222ff2dc05e19611594eddb20a2e09b21f665cbb7347fdcdd76813d2","observation_id":"94113673-91f3-48f8-8f25-d48c2074a2b7","resolution":{"observed_at":"2026-08-07T15:37:10.158591Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.01163","last_updated":"2024-10-30T18:45:36Z","snapshot_observed_at":"2026-07-06T18:24:17.711867Z","submitted_at":"2024-06-03T09:57:18Z","title":"When to Sense and Control? A Time-adaptive Approach for Continuous-Time RL","version":3},"cited_work":{"arxiv_id":"2406.01163","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.01163","snapshot_observed_at":"2026-08-07T15:37:07.590499Z","title":"When to Sense and Control? A Time-adaptive Approach for Continuous-Time RL","venue":"cs.LG","work_id":"e8b62735-09ed-4832-b2a2-bb66eea2df43","year":2024},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:05.609821Z"},"links":{"cited_paper":"/paper/2406.01163","citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:9a7616800ad525d2faf813d5ee4642695b77b45ec749386c0fe35b84365a9f5f","observation_id":"f83f1bff-2f1c-4b3c-b84d-43aa19dc913a","resolution":{"observed_at":"2026-08-07T15:37:07.667326Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.16359","last_updated":"2024-07-18T08:21:54Z","snapshot_observed_at":"2026-07-06T17:35:18.965223Z","submitted_at":"2024-02-26T07:24:32Z","title":"Feedback Efficient Online Fine-Tuning of Diffusion Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.16359","snapshot_observed_at":"2026-08-07T15:37:05.745300Z","title":"Feedback efficient online fine-tuning of diffusion models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:05.745300Z"},"links":{"cited_paper":"/paper/2402.16359","citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:ea0fde140b6009dffc986c5f15e7ce5eac103a310781dae8517918cd41380f74","observation_id":"b5f7337d-44a6-4d94-bcb9-fcb9da649da3","resolution":{"observed_at":"2026-08-07T15:37:05.745300Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:37:09.876676Z","title":"Neural network approach to continuous-time direct adaptive optimal control for partially unknown nonlinear systems","venue":null,"work_id":"cce81206-23f1-4a0b-b894-9e4ae9ce1856","year":2009},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:05.886867Z"},"links":{"citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:005abfd0dba5a776ea9256646dfb2a3497ebd79c37e2d42f4c54290a2f374904","observation_id":"d8506601-fbdd-41bc-9936-bb6a23b50d87","resolution":{"observed_at":"2026-08-07T15:37:09.997520Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:37:09.616304Z","title":"The benefits of being distributional: Small-loss bounds for reinforcement learning","venue":null,"work_id":"c506fd99-3889-47be-98fe-fc4d70ab0a91","year":2023},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:06.017072Z"},"links":{"citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:f3e030dcde4679c37c208729dc3eda02554f62113f15dd52bfff31bb765e775b","observation_id":"7702d10a-3c37-4c0a-a95a-49aade64764d","resolution":{"observed_at":"2026-08-07T15:37:09.750686Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:37:09.373644Z","title":"Provably efficient reinforcement learning with linear function approximation under adaptivity constraints","venue":null,"work_id":"160ede3d-20bd-4683-a3d2-7e120c5adfc0","year":2021},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:06.160946Z"},"links":{"citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:b85b13b118622d9a5cb59707cae1f757d4c1c9c2ba76d0414c2798b1793d6f68","observation_id":"b3a74679-9960-4c7e-95c4-6f52117c8263","resolution":{"observed_at":"2026-08-07T15:37:09.484417Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:37:06.270726Z","title":"Pytorch image models","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:06.270726Z"},"links":{"citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:e1b062ac9e30e1fa6d4daeed73c6f6c848b5094b8cd0dca159faa12bb833d1cb","observation_id":"acda09f0-934e-445c-990c-f1a439f68b17","resolution":{"observed_at":"2026-08-07T15:37:06.270726Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:37:09.101649Z","title":"Difffit: Unlocking transferability of large diffusion models via simple parameter-efficient fine-tuning","venue":null,"work_id":"7421b9d5-a742-4039-8f36-9c3248dac624","year":2023},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:06.396186Z"},"links":{"citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:7cedcf751d79348aeee7565a6c4111cef2cbb1f55e270a6149c8f45509839957","observation_id":"164b93c3-0d70-46fb-b4c8-203ef5fbaca4","resolution":{"observed_at":"2026-08-07T15:37:09.232604Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:37:08.863543Z","title":"A general framework for sequential decision-making under adaptivity constraints","venue":null,"work_id":"74a23c07-71ae-4dbe-baf8-c8c686fdeea0","year":2023},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:06.556290Z"},"links":{"citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:d8079b90a89f4f4174909f5f78ab5595ec71c2f8369c17023e9fc1fd5cd6a9ba","observation_id":"f32868e0-e755-4191-bbc9-c95217842739","resolution":{"observed_at":"2026-08-07T15:37:08.969253Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:37:08.616184Z","title":"a hdesm \\","venue":null,"work_id":"4f22c66d-d8bd-462a-b604-c771eef76335","year":2021},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:06.669219Z"},"links":{"citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:adee9fbedc7a9fc883dee27c913c8b849d741747ac6a37261b541729c860c499","observation_id":"d1a177c7-4a94-48c0-a660-f323fba03955","resolution":{"observed_at":"2026-08-07T15:37:08.717697Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:37:08.382971Z","title":"Censored sampling of diffusion models using 3 minutes of human feedback","venue":null,"work_id":"1af3f969-6261-4607-9ee5-eeac7f765387","year":2024},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:06.784005Z"},"links":{"citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:aa9355acd0505a17a1953a578022b213eeb5052f06090e08377574461d183eb9","observation_id":"54937fe4-15bf-42f9-88b6-5fb6f8e9f34f","resolution":{"observed_at":"2026-08-07T15:37:08.519371Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:37:07.034256Z","title":"Is reinforcement learning more difficult than bandits? a near-optimal algorithm escaping the curse of horizon","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:07.034256Z"},"links":{"citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:2535d4c2cc16a48955bd3b56cd10234c71a648b5b3268c94a8c37e055148614f","observation_id":"c5d5841b-dfd4-4569-b0c2-7d817593d2e1","resolution":{"observed_at":"2026-08-07T15:37:07.034256Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:37:07.113976Z","title":"Improved variance-aware confidence sets for linear bandits and linear mixture mdp","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:07.113976Z"},"links":{"citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:0d567ec59295f4c41d7dc83e5c22275d4fe6c838de180714fe0ee88c63a2b946","observation_id":"656dc45f-26bf-4352-a7ea-4a1f85646e7e","resolution":{"observed_at":"2026-08-07T15:37:07.113976Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:37:07.256981Z","title":"A nearly optimal and low-switching algorithm for reinforcement learning with general function approximation","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:07.256981Z"},"links":{"citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:bed9b13137e3676559681b04e1a67b58498f208ead387fae936b1c238cf9c648","observation_id":"1488d572-2bef-4de6-9d25-36dfcf8e73b1","resolution":{"observed_at":"2026-08-07T15:37:07.256981Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:37:08.140435Z","title":"Unsupervised learning of lagrangian dynamics from images for prediction and control","venue":null,"work_id":"861a6c58-caad-48f4-ba0e-50347b6290d3","year":2020},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:07.336312Z"},"links":{"citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:6b2c16c0c6fbbcf4d7f4fdba1752dae9479d3f3b498e219dde698fe503a266d5","observation_id":"6fa972cc-2468-4cac-b7ab-1e912c9f9142","resolution":{"observed_at":"2026-08-07T15:37:08.235545Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation"},"reference_resolution":{"displayed":62,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":28,"verified_exact":2,"verified_fuzzy":32},"total_outbound_references":62},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 62 of 62 outbound references and 1 inbound Pith citation observation for arXiv:2505.14821."}