{"as_of":"2026-08-08T23:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:db78e27f4803605b394ab96cf000d75817cc311b23beecebd970be63acf82f52","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":18,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":18,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":18,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":18,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:23:15.758249Z","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-01T00:05:09.694789Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2101.05982","last_updated":"2021-03-18T03:42:07Z","snapshot_observed_at":"2026-07-06T10:32:46.366651Z","submitted_at":"2021-01-15T06:25:58Z","title":"Randomized Ensembled Double Q-Learning: Learning Fast Without a Model","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2101.05982","snapshot_observed_at":"2026-08-07T15:23:15.758249Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.15345","last_updated":"2025-05-23T11:18:10Z","snapshot_observed_at":"2026-08-07T20:34:34.327158Z","submitted_at":"2025-05-21T10:19:49Z","title":"Hadamax Encoding: Elevating Performance in Model-Free Atari","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:15.758249Z"},"links":{"cited_paper":"/paper/2101.05982","citing_paper":"/paper/2505.15345"},"observation_digest":"sha256:a6081bb55eb3a63a9bff7539220c53ce9dc589c07ab41efd0dbc4dcd3701f59e","observation_id":"2bc50aab-90da-403e-8d65-f027559c3200","resolution":{"observed_at":"2026-08-07T15:23:15.758249Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2101.05982","last_updated":"2021-03-18T03:42:07Z","snapshot_observed_at":"2026-07-06T10:32:46.366651Z","submitted_at":"2021-01-15T06:25:58Z","title":"Randomized Ensembled Double Q-Learning: Learning Fast Without a Model","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2101.05982","snapshot_observed_at":"2026-08-07T14:57:44.897231Z","title":"Lili Chen, Kevin Lu, Aravind Rajeswaran, Kimin Lee, Aditya Grover, Misha Laskin, Pieter Abbeel, Aravind Srinivas, and Igor Mordatch","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.16856","last_updated":"2025-05-22T16:14:08Z","snapshot_observed_at":"2026-08-07T14:51:50.965265Z","submitted_at":"2025-05-22T16:14:08Z","title":"Efficient Online RL Fine Tuning with Offline Pre-trained Policy Only","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-07T14:57:44.897231Z"},"links":{"cited_paper":"/paper/2101.05982","citing_paper":"/paper/2505.16856"},"observation_digest":"sha256:d1969f44a6a66b2714a78b19c444c563ede989be27064f2bd07c320d17e59531","observation_id":"ef582d84-4c4b-44e8-9edd-05a8791a980d","resolution":{"observed_at":"2026-08-07T14:57:44.897231Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2101.05982","last_updated":"2021-03-18T03:42:07Z","snapshot_observed_at":"2026-07-06T10:32:46.366651Z","submitted_at":"2021-01-15T06:25:58Z","title":"Randomized Ensembled Double Q-Learning: Learning Fast Without a Model","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2101.05982","snapshot_observed_at":"2026-08-07T13:49:54.433515Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.21119","last_updated":"2025-06-02T16:01:02Z","snapshot_observed_at":"2026-08-07T21:47:08.434516Z","submitted_at":"2025-05-27T12:38:19Z","title":"Universal Value-Function Uncertainties","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T13:49:54.433515Z"},"links":{"cited_paper":"/paper/2101.05982","citing_paper":"/paper/2505.21119"},"observation_digest":"sha256:5afd07b87dfd4aac2ec65b613d76b939b631528893ab74928b2483e5baff43df","observation_id":"6d8f962e-0ab7-4fa2-b9c5-655623c282df","resolution":{"observed_at":"2026-08-07T13:49:54.433515Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2101.05982","last_updated":"2021-03-18T03:42:07Z","snapshot_observed_at":"2026-07-06T10:32:46.366651Z","submitted_at":"2021-01-15T06:25:58Z","title":"Randomized Ensembled Double Q-Learning: Learning Fast Without a Model","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2101.05982","snapshot_observed_at":"2026-08-07T10:38:20.418907Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.04828","last_updated":"2025-06-05T09:50:02Z","snapshot_observed_at":"2026-08-07T10:30:13.757796Z","submitted_at":"2025-06-05T09:50:02Z","title":"Safe Planning and Policy Optimization via World Model Learning","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T10:38:20.418907Z"},"links":{"cited_paper":"/paper/2101.05982","citing_paper":"/paper/2506.04828"},"observation_digest":"sha256:bf0d53b37aec9349a365eb32e60d138a66d6e93a6b0fd5277fa0e1f45f79a670","observation_id":"2ee69c96-805f-45cb-82de-044df882b3db","resolution":{"observed_at":"2026-08-07T10:38:20.418907Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2101.05982","last_updated":"2021-03-18T03:42:07Z","snapshot_observed_at":"2026-07-06T10:32:46.366651Z","submitted_at":"2021-01-15T06:25:58Z","title":"Randomized Ensembled Double Q-Learning: Learning Fast Without a Model","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2101.05982","snapshot_observed_at":"2026-08-07T00:32:50.412668Z","title":"Randomized ensembled double q-learning: Learning fast without a model","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.13672","last_updated":"2025-06-16T16:30:00Z","snapshot_observed_at":"2026-08-07T00:25:29.162842Z","submitted_at":"2025-06-16T16:30:00Z","title":"The Courage to Stop: Overcoming Sunk Cost Fallacy in Deep Reinforcement Learning","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T00:32:50.412668Z"},"links":{"cited_paper":"/paper/2101.05982","citing_paper":"/paper/2506.13672"},"observation_digest":"sha256:e81ba092603bb8e06b35616dd46413db825fc556caf4e819a1ba9fbd9a2e14d6","observation_id":"b58b6687-ec6e-4d18-b8aa-6fc75da5b71c","resolution":{"observed_at":"2026-08-07T00:32:50.412668Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2101.05982","last_updated":"2021-03-18T03:42:07Z","snapshot_observed_at":"2026-07-06T10:32:46.366651Z","submitted_at":"2021-01-15T06:25:58Z","title":"Randomized Ensembled Double Q-Learning: Learning Fast Without a Model","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2101.05982","snapshot_observed_at":"2026-08-07T00:34:01.863748Z","title":"Randomized ensembled double q-learning: Learning fast without a model.arXiv preprint arXiv:2101.05982,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.13862","last_updated":"2025-06-16T18:00:01Z","snapshot_observed_at":"2026-08-07T00:24:19.971630Z","submitted_at":"2025-06-16T18:00:01Z","title":"StaQ it! Growing neural networks for Policy Mirror Descent","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-07T00:34:01.863748Z"},"links":{"cited_paper":"/paper/2101.05982","citing_paper":"/paper/2506.13862"},"observation_digest":"sha256:84d013ad99d595321c36b20dfdb691a62022fdab9090a5d4c1a6f0cd0b4de595","observation_id":"726edaa6-805d-4d80-9f87-9537bbeb5c61","resolution":{"observed_at":"2026-08-07T00:34:01.863748Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2101.05982","last_updated":"2021-03-18T03:42:07Z","snapshot_observed_at":"2026-07-06T10:32:46.366651Z","submitted_at":"2021-01-15T06:25:58Z","title":"Randomized Ensembled Double Q-Learning: Learning Fast Without a Model","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2101.05982","snapshot_observed_at":"2026-08-06T20:31:07.736250Z","title":"Randomized ensembled double q-learning: Learning fast without a model, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.02712","last_updated":"2025-07-03T15:26:48Z","snapshot_observed_at":"2026-08-08T15:34:11.449065Z","submitted_at":"2025-07-03T15:26:48Z","title":"A Forget-and-Grow Strategy for Deep Reinforcement Learning Scaling in Continuous Control","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-06T20:31:07.736250Z"},"links":{"cited_paper":"/paper/2101.05982","citing_paper":"/paper/2507.02712"},"observation_digest":"sha256:491580082b072c9742250c88aa3ce79c3225f8d35583c504e5215909229accdc","observation_id":"a1146ce5-7daf-4a84-a69c-1cb359dba087","resolution":{"observed_at":"2026-08-06T20:31:07.736250Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2101.05982","last_updated":"2021-03-18T03:42:07Z","snapshot_observed_at":"2026-07-06T10:32:46.366651Z","submitted_at":"2021-01-15T06:25:58Z","title":"Randomized Ensembled Double Q-Learning: Learning Fast Without a Model","version":2},"cited_work":{"arxiv_id":"2101.05982","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2101.05982","snapshot_observed_at":"2026-07-01T00:05:09.694789Z","title":"arXiv preprint arXiv:2101.05982 , year=","venue":null,"work_id":"0c1147c0-154a-4b5b-9dfc-2b504c4b9b3e","year":2021},"citing_paper":{"arxiv_id":"2507.07986","last_updated":"2026-04-30T00:00:17Z","snapshot_observed_at":"2026-08-08T11:51:09.954364Z","submitted_at":"2025-07-10T17:57:46Z","title":"EXPO: Stable Reinforcement Learning with Expressive Policies","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-19T05:09:02.111308Z"},"links":{"cited_paper":"/paper/2101.05982","citing_paper":"/paper/2507.07986"},"observation_digest":"sha256:d97f01c828fe73641c278be8c0451bec1efe908df3dfba098c2f4824f6a3df55","observation_id":"1ea33fd0-e326-43fa-8320-6b28f72fc17d","resolution":{"observed_at":"2026-05-19T05:12:05.288471Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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.05982","last_updated":"2021-03-18T03:42:07Z","snapshot_observed_at":"2026-07-06T10:32:46.366651Z","submitted_at":"2021-01-15T06:25:58Z","title":"Randomized Ensembled Double Q-Learning: Learning Fast Without a Model","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2101.05982","snapshot_observed_at":"2026-08-06T17:13:56.033564Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.11486","last_updated":"2026-05-25T18:57:00Z","snapshot_observed_at":"2026-08-06T17:04:58.264050Z","submitted_at":"2025-07-15T16:57:00Z","title":"Exploring the robustness of TractOracle methods in RL-based tractography","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T17:13:56.033564Z"},"links":{"cited_paper":"/paper/2101.05982","citing_paper":"/paper/2507.11486"},"observation_digest":"sha256:4a04099d50f60a4bc4e92134548971e20ca64536e6147c820576357dcabb082f","observation_id":"2931c806-2933-4b2c-994c-89cf5963f460","resolution":{"observed_at":"2026-08-06T17:13:56.033564Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2101.05982","last_updated":"2021-03-18T03:42:07Z","snapshot_observed_at":"2026-07-06T10:32:46.366651Z","submitted_at":"2021-01-15T06:25:58Z","title":"Randomized Ensembled Double Q-Learning: Learning Fast Without a Model","version":2},"cited_work":{"arxiv_id":"2101.05982","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2101.05982","snapshot_observed_at":"2026-07-01T00:05:09.694789Z","title":"arXiv preprint arXiv:2101.05982 , year=","venue":null,"work_id":"0c1147c0-154a-4b5b-9dfc-2b504c4b9b3e","year":2021},"citing_paper":{"arxiv_id":"2511.03828","last_updated":"2026-05-17T20:29:17Z","snapshot_observed_at":"2026-08-01T05:50:04.658635Z","submitted_at":"2025-11-05T19:48:46Z","title":"From Static Constraints to Dynamic Adaptation: Sample-Level Constraint Relaxation for Offline-to-Online Reinforcement Learning","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-18T00:36:32.681470Z"},"links":{"cited_paper":"/paper/2101.05982","citing_paper":"/paper/2511.03828"},"observation_digest":"sha256:e30d74ca0531c66082a9a4917453c217e57eb45df9ea2940a3a92c7d52316951","observation_id":"3a31fd7d-cfa2-471d-95dc-8e5cef1c18ba","resolution":{"observed_at":"2026-05-18T00:40:34.101065Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2101.05982","last_updated":"2021-03-18T03:42:07Z","snapshot_observed_at":"2026-07-06T10:32:46.366651Z","submitted_at":"2021-01-15T06:25:58Z","title":"Randomized Ensembled Double Q-Learning: Learning Fast Without a Model","version":2},"cited_work":{"arxiv_id":"2101.05982","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2101.05982","snapshot_observed_at":"2026-07-01T00:05:09.694789Z","title":"arXiv preprint arXiv:2101.05982 , year=","venue":null,"work_id":"0c1147c0-154a-4b5b-9dfc-2b504c4b9b3e","year":2021},"citing_paper":{"arxiv_id":"2511.03828","last_updated":"2026-05-17T20:29:17Z","snapshot_observed_at":"2026-08-01T05:50:04.658635Z","submitted_at":"2025-11-05T19:48:46Z","title":"From Static Constraints to Dynamic Adaptation: Sample-Level Constraint Relaxation for Offline-to-Online Reinforcement Learning","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-21T19:02:38.240098Z"},"links":{"cited_paper":"/paper/2101.05982","citing_paper":"/paper/2511.03828"},"observation_digest":"sha256:adb12abf1b61264ce52cb217305a2bc05f3f049da838a8632adf404841e0ff6c","observation_id":"001dbc78-7a2b-4cff-a309-75d678605e99","resolution":{"observed_at":"2026-05-21T19:04:19.084955Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2101.05982","last_updated":"2021-03-18T03:42:07Z","snapshot_observed_at":"2026-07-06T10:32:46.366651Z","submitted_at":"2021-01-15T06:25:58Z","title":"Randomized Ensembled Double Q-Learning: Learning Fast Without a Model","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2101.05982","snapshot_observed_at":"2026-08-02T21:36:19.350061Z","title":"Randomized ensembled double q-learning: Learning fast without a model.arXiv preprint arXiv:2101.05982, 2021.(Cited on page 6)","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.20220","last_updated":"2026-07-22T18:26:39Z","snapshot_observed_at":"2026-08-06T17:49:21.760460Z","submitted_at":"2026-02-23T10:34:15Z","title":"What Matters for Simulation to Online Reinforcement Learning on Real Robots","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-02T21:36:19.350061Z"},"links":{"cited_paper":"/paper/2101.05982","citing_paper":"/paper/2602.20220"},"observation_digest":"sha256:5da969ae7b95a004454526ae862e6754baa7e75442673834124dff0d5d506d67","observation_id":"98f63cc1-5242-4820-86e2-1075fe6e3200","resolution":{"observed_at":"2026-08-02T21:36:19.350061Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2101.05982","last_updated":"2021-03-18T03:42:07Z","snapshot_observed_at":"2026-07-06T10:32:46.366651Z","submitted_at":"2021-01-15T06:25:58Z","title":"Randomized Ensembled Double Q-Learning: Learning Fast Without a Model","version":2},"cited_work":{"arxiv_id":"2101.05982","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2101.05982","snapshot_observed_at":"2026-07-01T00:05:09.694789Z","title":"arXiv preprint arXiv:2101.05982 , year=","venue":null,"work_id":"0c1147c0-154a-4b5b-9dfc-2b504c4b9b3e","year":2021},"citing_paper":{"arxiv_id":"2604.20381","last_updated":"2026-04-22T09:31:45Z","snapshot_observed_at":"2026-08-05T04:56:13.342027Z","submitted_at":"2026-04-22T09:31:45Z","title":"Distributional Value Estimation Without Target Networks for Robust Quality-Diversity","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-10T00:11:04.222842Z"},"links":{"cited_paper":"/paper/2101.05982","citing_paper":"/paper/2604.20381"},"observation_digest":"sha256:5da19f612092e05e79998afd2c8c21c93a4063908b35e45d41bed83263e90e64","observation_id":"87c728a3-0fd5-4f24-a6d8-3c060a8719c8","resolution":{"observed_at":"2026-05-10T00:14:46.870973Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2101.05982","last_updated":"2021-03-18T03:42:07Z","snapshot_observed_at":"2026-07-06T10:32:46.366651Z","submitted_at":"2021-01-15T06:25:58Z","title":"Randomized Ensembled Double Q-Learning: Learning Fast Without a Model","version":2},"cited_work":{"arxiv_id":"2101.05982","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2101.05982","snapshot_observed_at":"2026-07-01T00:05:09.694789Z","title":"arXiv preprint arXiv:2101.05982 , year=","venue":null,"work_id":"0c1147c0-154a-4b5b-9dfc-2b504c4b9b3e","year":2021},"citing_paper":{"arxiv_id":"2604.23073","last_updated":"2026-04-30T20:04:38Z","snapshot_observed_at":"2026-07-31T07:02:53.376869Z","submitted_at":"2026-04-24T23:57:45Z","title":"RL Token: Bootstrapping Online RL with Vision-Language-Action Models","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-08T11:56:34.978806Z"},"links":{"cited_paper":"/paper/2101.05982","citing_paper":"/paper/2604.23073"},"observation_digest":"sha256:6dd76d6f13d69973707c7b5448d4b4b6d91890eeba1f00c862a97879f009078a","observation_id":"41a496fc-aae2-426e-9983-0253162fa8d8","resolution":{"observed_at":"2026-05-11T19:26:09.203649Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2101.05982","last_updated":"2021-03-18T03:42:07Z","snapshot_observed_at":"2026-07-06T10:32:46.366651Z","submitted_at":"2021-01-15T06:25:58Z","title":"Randomized Ensembled Double Q-Learning: Learning Fast Without a Model","version":2},"cited_work":{"arxiv_id":"2101.05982","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2101.05982","snapshot_observed_at":"2026-07-01T00:05:09.694789Z","title":"arXiv preprint arXiv:2101.05982 , year=","venue":null,"work_id":"0c1147c0-154a-4b5b-9dfc-2b504c4b9b3e","year":2021},"citing_paper":{"arxiv_id":"2605.03065","last_updated":"2026-06-26T00:04:01Z","snapshot_observed_at":"2026-07-06T23:16:00.796105Z","submitted_at":"2026-05-04T18:36:40Z","title":"OGPO: Sample Efficient Full-Finetuning of Generative Control Policies","version":1},"reference_index":139,"source":"arxiv_source","source_observed_at":"2026-05-08T18:48:56.075160Z"},"links":{"cited_paper":"/paper/2101.05982","citing_paper":"/paper/2605.03065"},"observation_digest":"sha256:ed9d5fb7cdec7852c408d66b429d45cd9a746157b4f995bc63da72742b970449","observation_id":"5199169e-efc2-4347-9902-71254aaadce7","resolution":{"observed_at":"2026-05-09T06:10:42.429745Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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.05982","last_updated":"2021-03-18T03:42:07Z","snapshot_observed_at":"2026-07-06T10:32:46.366651Z","submitted_at":"2021-01-15T06:25:58Z","title":"Randomized Ensembled Double Q-Learning: Learning Fast Without a Model","version":2},"cited_work":{"arxiv_id":"2101.05982","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2101.05982","snapshot_observed_at":"2026-07-01T00:05:09.694789Z","title":"arXiv preprint arXiv:2101.05982 , year=","venue":null,"work_id":"0c1147c0-154a-4b5b-9dfc-2b504c4b9b3e","year":2021},"citing_paper":{"arxiv_id":"2605.03065","last_updated":"2026-06-26T00:04:01Z","snapshot_observed_at":"2026-07-06T23:16:00.796105Z","submitted_at":"2026-05-04T18:36:40Z","title":"OGPO: Sample Efficient Full-Finetuning of Generative Control Policies","version":4},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-07-01T00:02:55.449923Z"},"links":{"cited_paper":"/paper/2101.05982","citing_paper":"/paper/2605.03065"},"observation_digest":"sha256:d02fc2ccb4f679a61bbc44c4d333b55facb5630365d7b06501344893e802be9f","observation_id":"2c6efab4-06a8-4f45-a19c-dc765a6f0c1a","resolution":{"observed_at":"2026-07-01T00:05:09.696207Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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.05982","last_updated":"2021-03-18T03:42:07Z","snapshot_observed_at":"2026-07-06T10:32:46.366651Z","submitted_at":"2021-01-15T06:25:58Z","title":"Randomized Ensembled Double Q-Learning: Learning Fast Without a Model","version":2},"cited_work":{"arxiv_id":"2101.05982","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2101.05982","snapshot_observed_at":"2026-07-01T00:05:09.694789Z","title":"arXiv preprint arXiv:2101.05982 , year=","venue":null,"work_id":"0c1147c0-154a-4b5b-9dfc-2b504c4b9b3e","year":2021},"citing_paper":{"arxiv_id":"2605.14350","last_updated":"2026-05-14T04:22:24Z","snapshot_observed_at":"2026-07-06T23:25:49.545418Z","submitted_at":"2026-05-14T04:22:24Z","title":"Distributionally Robust Multi-Task Reinforcement Learning via Adaptive Task Sampling","version":1},"reference_index":116,"source":"arxiv_source","source_observed_at":"2026-05-15T03:05:36.871497Z"},"links":{"cited_paper":"/paper/2101.05982","citing_paper":"/paper/2605.14350"},"observation_digest":"sha256:ca5a42984181a256206a8ad9cfd4956fa64300af3c4670a295d645f3c6843bdd","observation_id":"e874d28b-ad6c-4613-a732-8fe2791b8b0b","resolution":{"observed_at":"2026-05-15T03:08:59.689210Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2101.05982","last_updated":"2021-03-18T03:42:07Z","snapshot_observed_at":"2026-07-06T10:32:46.366651Z","submitted_at":"2021-01-15T06:25:58Z","title":"Randomized Ensembled Double Q-Learning: Learning Fast Without a Model","version":2},"cited_work":{"arxiv_id":"2101.05982","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2101.05982","snapshot_observed_at":"2026-07-01T00:05:09.694789Z","title":"arXiv preprint arXiv:2101.05982 , year=","venue":null,"work_id":"0c1147c0-154a-4b5b-9dfc-2b504c4b9b3e","year":2021},"citing_paper":{"arxiv_id":"2605.21822","last_updated":"2026-05-20T23:44:06Z","snapshot_observed_at":"2026-08-03T02:30:10.701058Z","submitted_at":"2026-05-20T23:44:06Z","title":"Implicit Safety Alignment from Crowd Preferences","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-05-22T08:28:41.652865Z"},"links":{"cited_paper":"/paper/2101.05982","citing_paper":"/paper/2605.21822"},"observation_digest":"sha256:3467fe3aa1ac26e870c16f2633db913818bbc51f7ae504097bc50b162ba36543","observation_id":"ea3cfe6a-0723-4654-b752-a326c9d11182","resolution":{"observed_at":"2026-05-22T08:31:16.890011Z","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/2101.05982/citation-record","integrity":"/paper/2101.05982/integrity","json":"/paper/2101.05982/citation-record.json","paper":"/paper/2101.05982"},"outbound":[],"paper":{"arxiv_id":"2101.05982","last_updated":"2021-03-18T03:42:07Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T10:32:46.366651Z","submitted_at":"2021-01-15T06:25:58Z","title":"Randomized Ensembled Double Q-Learning: Learning Fast Without a Model"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-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 0 of 0 outbound references and 18 inbound Pith citation observations for arXiv:2101.05982."}