{"as_of":"2026-08-21T07:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:69995995e98dc53ceb9441f8aab5bc4f315a01cfd37cbc8eed3ee8f2a08f0058","coverage":[{"denominator":46,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":46,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T05:12:25.940706Z","state":"measured"},{"denominator":46,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":46,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2504.21383/citation-record","integrity":"/paper/2504.21383/integrity","json":"/paper/2504.21383/citation-record.json","paper":"/paper/2504.21383"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:12:25.719653Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.21383","last_updated":"2025-04-30T07:32:40Z","snapshot_observed_at":"2026-08-20T09:47:29.252176Z","submitted_at":"2025-04-30T07:32:40Z","title":"FAST-Q: Fast-track Exploration with Adversarially Balanced State Representations for Counterfactual Action Estimation in Offline Reinforcement Learning","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:25.719653Z"},"links":{"citing_paper":"/paper/2504.21383"},"observation_digest":"sha256:d7af3555d46011aba95ea66f1d83a9272866193ff25d3f001abce9376b0de635","observation_id":"5a3a6c76-72b9-4009-8a55-c388e08e0e0e","resolution":{"observed_at":"2026-08-16T05:12:25.719653Z","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-16T05:12:26.858927Z","title":"Breunig, Hans-Peter Kriegel, and Jörg Sander","venue":null,"work_id":"5d870cc4-43c1-4bf2-9176-0c2a70dcee50","year":1999},"citing_paper":{"arxiv_id":"2504.21383","last_updated":"2025-04-30T07:32:40Z","snapshot_observed_at":"2026-08-20T09:47:29.252176Z","submitted_at":"2025-04-30T07:32:40Z","title":"FAST-Q: Fast-track Exploration with Adversarially Balanced State Representations for Counterfactual Action Estimation in Offline Reinforcement Learning","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:25.725178Z"},"links":{"citing_paper":"/paper/2504.21383"},"observation_digest":"sha256:aa5074f648f2e94f7849034e41a9981509ecb6faf331d233502a30d7e13b6118","observation_id":"2974ecc0-be56-4bce-9e23-5f6b8cb2061f","resolution":{"observed_at":"2026-08-16T05:12:26.863720Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T05:12:26.842091Z","title":null,"venue":null,"work_id":"a077b77a-940b-4089-b246-1939dc9a748d","year":2008},"citing_paper":{"arxiv_id":"2504.21383","last_updated":"2025-04-30T07:32:40Z","snapshot_observed_at":"2026-08-20T09:47:29.252176Z","submitted_at":"2025-04-30T07:32:40Z","title":"FAST-Q: Fast-track Exploration with Adversarially Balanced State Representations for Counterfactual Action Estimation in Offline Reinforcement Learning","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:25.730061Z"},"links":{"citing_paper":"/paper/2504.21383"},"observation_digest":"sha256:e70267044488209e93d8c7e6fe69d61d2bdd66361a50812bc2bc2f6c7e3f3e4a","observation_id":"7b35f68d-4cf0-48a0-932b-aa1d43e9ce90","resolution":{"observed_at":"2026-08-16T05:12:26.846285Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T05:12:26.826817Z","title":null,"venue":null,"work_id":"01f542f8-707e-4501-afc8-7add5685817a","year":2006},"citing_paper":{"arxiv_id":"2504.21383","last_updated":"2025-04-30T07:32:40Z","snapshot_observed_at":"2026-08-20T09:47:29.252176Z","submitted_at":"2025-04-30T07:32:40Z","title":"FAST-Q: Fast-track Exploration with Adversarially Balanced State Representations for Counterfactual Action Estimation in Offline Reinforcement Learning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:25.734611Z"},"links":{"citing_paper":"/paper/2504.21383"},"observation_digest":"sha256:20edde705cd9b6032fea42e5487640ef2e1dec34169d6abb2644b825e59c4c32","observation_id":"c050ec12-e7c3-4033-be82-ddd8e8a04d77","resolution":{"observed_at":"2026-08-16T05:12:26.831349Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.04083","last_updated":"2020-02-10T20:47:36Z","snapshot_observed_at":"2026-08-20T09:49:00.935930Z","submitted_at":"2020-02-10T20:47:36Z","title":"Estimating Counterfactual Treatment Outcomes over Time Through Adversarially Balanced Representations","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.04083","snapshot_observed_at":"2026-08-16T05:12:25.739583Z","title":"Alaa, James Jordon, and Mihaela van der Schaar","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2504.21383","last_updated":"2025-04-30T07:32:40Z","snapshot_observed_at":"2026-08-20T09:47:29.252176Z","submitted_at":"2025-04-30T07:32:40Z","title":"FAST-Q: Fast-track Exploration with Adversarially Balanced State Representations for Counterfactual Action Estimation in Offline Reinforcement Learning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:25.739583Z"},"links":{"cited_paper":"/paper/2002.04083","citing_paper":"/paper/2504.21383"},"observation_digest":"sha256:a0cfd4f8ed1dc199c1b5d6c27f432d1ad868fd2bdb033fef76a55b20c3d20024","observation_id":"382410ec-a162-41e7-a0d2-4a253d00623a","resolution":{"observed_at":"2026-08-16T05:12:25.739583Z","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-08-13T12:26:05.192883Z","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-16T05:12:25.744394Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2504.21383","last_updated":"2025-04-30T07:32:40Z","snapshot_observed_at":"2026-08-20T09:47:29.252176Z","submitted_at":"2025-04-30T07:32:40Z","title":"FAST-Q: Fast-track Exploration with Adversarially Balanced State Representations for Counterfactual Action Estimation in Offline Reinforcement Learning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:25.744394Z"},"links":{"cited_paper":"/paper/1606.01540","citing_paper":"/paper/2504.21383"},"observation_digest":"sha256:b4cb3ce1319d3736c13833bb9471250696bcbbbcc77fc6d57ce292716ef7c28b","observation_id":"c3a16e26-328c-4c53-816c-d9384ecac9b9","resolution":{"observed_at":"2026-08-16T05:12:25.744394Z","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-16T05:12:26.812546Z","title":"Hasegawa- Johnson, and Thomas S","venue":null,"work_id":"b96f6eaa-07b1-4aba-9abc-506d111b1798","year":2017},"citing_paper":{"arxiv_id":"2504.21383","last_updated":"2025-04-30T07:32:40Z","snapshot_observed_at":"2026-08-20T09:47:29.252176Z","submitted_at":"2025-04-30T07:32:40Z","title":"FAST-Q: Fast-track Exploration with Adversarially Balanced State Representations for Counterfactual Action Estimation in Offline Reinforcement Learning","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:25.749761Z"},"links":{"citing_paper":"/paper/2504.21383"},"observation_digest":"sha256:6fa202cb9b51ebfaa7f63abdf949a28e874d191d8a5c18269e90f848e2223338","observation_id":"8fe02d9d-6234-465d-ba27-bd124fbb7b26","resolution":{"observed_at":"2026-08-16T05:12:26.816701Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T05:12:26.798137Z","title":null,"venue":null,"work_id":"027f6472-4008-4e9a-a351-e728e4a0ded2","year":2020},"citing_paper":{"arxiv_id":"2504.21383","last_updated":"2025-04-30T07:32:40Z","snapshot_observed_at":"2026-08-20T09:47:29.252176Z","submitted_at":"2025-04-30T07:32:40Z","title":"FAST-Q: Fast-track Exploration with Adversarially Balanced State Representations for Counterfactual Action Estimation in Offline Reinforcement Learning","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:25.753951Z"},"links":{"citing_paper":"/paper/2504.21383"},"observation_digest":"sha256:3aecd0dbe5484ae986fef81aad2e99e890f17915db856d59d7f1c401f4cb88d5","observation_id":"31d475d8-7341-4314-a286-4ba2143043e0","resolution":{"observed_at":"2026-08-16T05:12:26.802779Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T05:12:26.784537Z","title":null,"venue":null,"work_id":"6abe57bc-b5fc-401e-b41d-82de0e13b179","year":2020},"citing_paper":{"arxiv_id":"2504.21383","last_updated":"2025-04-30T07:32:40Z","snapshot_observed_at":"2026-08-20T09:47:29.252176Z","submitted_at":"2025-04-30T07:32:40Z","title":"FAST-Q: Fast-track Exploration with Adversarially Balanced State Representations for Counterfactual Action Estimation in Offline Reinforcement Learning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:25.758726Z"},"links":{"citing_paper":"/paper/2504.21383"},"observation_digest":"sha256:89185ab96e525b96afcc1482705a0fb43bcd36cc2fb0a2f622174185eb41952b","observation_id":"79e50c62-83b6-4393-a778-5726bcaaadfc","resolution":{"observed_at":"2026-08-16T05:12:26.788630Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T05:12:25.764284Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2504.21383","last_updated":"2025-04-30T07:32:40Z","snapshot_observed_at":"2026-08-20T09:47:29.252176Z","submitted_at":"2025-04-30T07:32:40Z","title":"FAST-Q: Fast-track Exploration with Adversarially Balanced State Representations for Counterfactual Action Estimation in Offline Reinforcement Learning","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:25.764284Z"},"links":{"citing_paper":"/paper/2504.21383"},"observation_digest":"sha256:a162866380875986721cf5dbbc74502b554ab749a7fc172f54a169450fbfc7ce","observation_id":"f2c42b87-ed47-4a52-a24d-082fe1316194","resolution":{"observed_at":"2026-08-16T05:12:25.764284Z","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-16T05:12:26.758207Z","title":null,"venue":null,"work_id":"bb5e0448-fc1c-4c9e-9cd8-777178899601","year":2021},"citing_paper":{"arxiv_id":"2504.21383","last_updated":"2025-04-30T07:32:40Z","snapshot_observed_at":"2026-08-20T09:47:29.252176Z","submitted_at":"2025-04-30T07:32:40Z","title":"FAST-Q: Fast-track Exploration with Adversarially Balanced State Representations for Counterfactual Action Estimation in Offline Reinforcement Learning","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:25.773428Z"},"links":{"citing_paper":"/paper/2504.21383"},"observation_digest":"sha256:1461da4b189652ae37b5cee10e2b158e17317529a6c0caa9e926ca4762ebfa99","observation_id":"84fc2c40-c8c2-4874-9589-91397b90489d","resolution":{"observed_at":"2026-08-16T05:12:26.763523Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T05:12:26.743203Z","title":null,"venue":null,"work_id":"4fc84cda-c1d5-4271-894a-6e533d153832","year":2023},"citing_paper":{"arxiv_id":"2504.21383","last_updated":"2025-04-30T07:32:40Z","snapshot_observed_at":"2026-08-20T09:47:29.252176Z","submitted_at":"2025-04-30T07:32:40Z","title":"FAST-Q: Fast-track Exploration with Adversarially Balanced State Representations for Counterfactual Action Estimation in Offline Reinforcement Learning","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:25.779092Z"},"links":{"citing_paper":"/paper/2504.21383"},"observation_digest":"sha256:aefd4ea577c225b7e4ef7f8ec6052fa4061e8479ac047c5d77edcac86415644c","observation_id":"364699a7-c56e-474e-a34d-297194b7a812","resolution":{"observed_at":"2026-08-16T05:12:26.747412Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T05:12:26.727836Z","title":null,"venue":null,"work_id":"579316fd-3fa5-4547-94a1-258be64977fb","year":2024},"citing_paper":{"arxiv_id":"2504.21383","last_updated":"2025-04-30T07:32:40Z","snapshot_observed_at":"2026-08-20T09:47:29.252176Z","submitted_at":"2025-04-30T07:32:40Z","title":"FAST-Q: Fast-track Exploration with Adversarially Balanced State Representations for Counterfactual Action Estimation in Offline Reinforcement Learning","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:25.783691Z"},"links":{"citing_paper":"/paper/2504.21383"},"observation_digest":"sha256:7a6d0ad245ecb412db21ff666ffec54094f0cf9379795502ad2a80cc9148122a","observation_id":"8ec487a6-c313-49ed-b8dc-1012a1d5e0d5","resolution":{"observed_at":"2026-08-16T05:12:26.732349Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T05:12:26.713418Z","title":null,"venue":null,"work_id":"b4102a45-f7a6-467b-9ca9-b91d9df3f1f0","year":2018},"citing_paper":{"arxiv_id":"2504.21383","last_updated":"2025-04-30T07:32:40Z","snapshot_observed_at":"2026-08-20T09:47:29.252176Z","submitted_at":"2025-04-30T07:32:40Z","title":"FAST-Q: Fast-track Exploration with Adversarially Balanced State Representations for Counterfactual Action Estimation in Offline Reinforcement Learning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:25.787932Z"},"links":{"citing_paper":"/paper/2504.21383"},"observation_digest":"sha256:e7e4850e491622ae8077bc82f2adac3d58535a371cd5d528e43ba4c3ed9cdf56","observation_id":"8ee6d7f3-4a89-4b22-8e57-c3f1928f3c18","resolution":{"observed_at":"2026-08-16T05:12:26.717608Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1812.02900","last_updated":"2019-08-10T03:36:31Z","snapshot_observed_at":"2026-08-20T21:25:16.574803Z","submitted_at":"2018-12-07T04:03:25Z","title":"Off-Policy Deep Reinforcement Learning without Exploration","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1812.02900","snapshot_observed_at":"2026-08-16T05:12:25.792675Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2504.21383","last_updated":"2025-04-30T07:32:40Z","snapshot_observed_at":"2026-08-20T09:47:29.252176Z","submitted_at":"2025-04-30T07:32:40Z","title":"FAST-Q: Fast-track Exploration with Adversarially Balanced State Representations for Counterfactual Action Estimation in Offline Reinforcement Learning","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:25.792675Z"},"links":{"cited_paper":"/paper/1812.02900","citing_paper":"/paper/2504.21383"},"observation_digest":"sha256:d14e3e5eaec8bfb6ac5fd0a6bda07c6605f5b5037354eaeffe440d0b0e8dc8c7","observation_id":"af49df21-5a83-47e8-8e05-54eb16dd9a2f","resolution":{"observed_at":"2026-08-16T05:12:25.792675Z","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-16T05:12:26.698691Z","title":null,"venue":null,"work_id":"c6d54893-95c9-4d40-b137-8658834e78c1","year":2016},"citing_paper":{"arxiv_id":"2504.21383","last_updated":"2025-04-30T07:32:40Z","snapshot_observed_at":"2026-08-20T09:47:29.252176Z","submitted_at":"2025-04-30T07:32:40Z","title":"FAST-Q: Fast-track Exploration with Adversarially Balanced State Representations for Counterfactual Action Estimation in Offline Reinforcement Learning","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:25.797975Z"},"links":{"citing_paper":"/paper/2504.21383"},"observation_digest":"sha256:6bf8b11646c9eda8fd537b14126b3a79329e127310b065588c30f92d524b368a","observation_id":"3477fc0f-11b5-4d55-9bd7-4e1d3cf04210","resolution":{"observed_at":"2026-08-16T05:12:26.703316Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T05:12:26.683641Z","title":null,"venue":null,"work_id":"c6943302-dc8c-4061-ac27-fefb21c0ffc7","year":2024},"citing_paper":{"arxiv_id":"2504.21383","last_updated":"2025-04-30T07:32:40Z","snapshot_observed_at":"2026-08-20T09:47:29.252176Z","submitted_at":"2025-04-30T07:32:40Z","title":"FAST-Q: Fast-track Exploration with Adversarially Balanced State Representations for Counterfactual Action Estimation in Offline Reinforcement Learning","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:25.802252Z"},"links":{"citing_paper":"/paper/2504.21383"},"observation_digest":"sha256:2e529ac5713656a0e5dcd00006d5cbd9b40a6fd1fe77a7b6752adacb88e5e052","observation_id":"625de808-01ef-447a-b192-163f9825d1eb","resolution":{"observed_at":"2026-08-16T05:12:26.688061Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1505.07818","last_updated":"2016-05-26T19:56:08Z","snapshot_observed_at":"2026-08-14T22:46:42.231375Z","submitted_at":"2015-05-28T19:34:53Z","title":"Domain-Adversarial Training of Neural Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1505.07818","snapshot_observed_at":"2026-08-16T05:12:25.807503Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2504.21383","last_updated":"2025-04-30T07:32:40Z","snapshot_observed_at":"2026-08-20T09:47:29.252176Z","submitted_at":"2025-04-30T07:32:40Z","title":"FAST-Q: Fast-track Exploration with Adversarially Balanced State Representations for Counterfactual Action Estimation in Offline Reinforcement Learning","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:25.807503Z"},"links":{"cited_paper":"/paper/1505.07818","citing_paper":"/paper/2504.21383"},"observation_digest":"sha256:c9e12346793edcf59ea637639b7e41351042448482d9f7f482ee547cd60e5ab7","observation_id":"4a115e6e-c1bd-4d87-9ee5-b2daf4af6a40","resolution":{"observed_at":"2026-08-16T05:12:25.807503Z","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-16T05:12:25.812364Z","title":null,"venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2504.21383","last_updated":"2025-04-30T07:32:40Z","snapshot_observed_at":"2026-08-20T09:47:29.252176Z","submitted_at":"2025-04-30T07:32:40Z","title":"FAST-Q: Fast-track Exploration with Adversarially Balanced State Representations for Counterfactual Action Estimation in Offline Reinforcement Learning","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:25.812364Z"},"links":{"citing_paper":"/paper/2504.21383"},"observation_digest":"sha256:7c7aa5fc70942442edd7f6f5e4c58f54702e65c7e196420c0d71fc5d7519ddb1","observation_id":"1729e447-8dbf-4d01-a062-a1ae37d898bb","resolution":{"observed_at":"2026-08-16T05:12:25.812364Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-08-17T19:26:44.032537Z","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-16T05:12:25.817386Z","title":"Kingma and Jimmy Ba","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2504.21383","last_updated":"2025-04-30T07:32:40Z","snapshot_observed_at":"2026-08-20T09:47:29.252176Z","submitted_at":"2025-04-30T07:32:40Z","title":"FAST-Q: Fast-track Exploration with Adversarially Balanced State Representations for Counterfactual Action Estimation in Offline Reinforcement Learning","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:25.817386Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/2504.21383"},"observation_digest":"sha256:d6a59db963b6e4228c86a20adf31f6e6f3a8d3038423aa4b0b4a4c765c2053aa","observation_id":"57cac8fc-e6c4-4786-ad4a-9fe11c05494e","resolution":{"observed_at":"2026-08-16T05:12:25.817386Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.06169","last_updated":"2021-10-12T17:05:05Z","snapshot_observed_at":"2026-08-13T07:57:56.087944Z","submitted_at":"2021-10-12T17:05:05Z","title":"Offline Reinforcement Learning with Implicit Q-Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.06169","snapshot_observed_at":"2026-08-16T05:12:25.822466Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.21383","last_updated":"2025-04-30T07:32:40Z","snapshot_observed_at":"2026-08-20T09:47:29.252176Z","submitted_at":"2025-04-30T07:32:40Z","title":"FAST-Q: Fast-track Exploration with Adversarially Balanced State Representations for Counterfactual Action Estimation in Offline Reinforcement Learning","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:25.822466Z"},"links":{"cited_paper":"/paper/2110.06169","citing_paper":"/paper/2504.21383"},"observation_digest":"sha256:48e9b393f5f3c83209daeeb4dfeab535f8058e394cee8e9d9e8cfc12ed476eee","observation_id":"7608cf5e-4e50-4958-89e8-e5235a9041b0","resolution":{"observed_at":"2026-08-16T05:12:25.822466Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2112.04716","last_updated":"2021-12-09T06:01:01Z","snapshot_observed_at":"2026-08-16T19:53:28.439461Z","submitted_at":"2021-12-09T06:01:01Z","title":"DR3: Value-Based Deep Reinforcement Learning Requires Explicit Regularization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2112.04716","snapshot_observed_at":"2026-08-16T05:12:25.827696Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.21383","last_updated":"2025-04-30T07:32:40Z","snapshot_observed_at":"2026-08-20T09:47:29.252176Z","submitted_at":"2025-04-30T07:32:40Z","title":"FAST-Q: Fast-track Exploration with Adversarially Balanced State Representations for Counterfactual Action Estimation in Offline Reinforcement Learning","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:25.827696Z"},"links":{"cited_paper":"/paper/2112.04716","citing_paper":"/paper/2504.21383"},"observation_digest":"sha256:6ef87630559c89f8ca481f08b222e3ef1959461636cc8b8493a618aa3ceb36b0","observation_id":"732f2f5c-6081-4abb-bfc5-548560954d26","resolution":{"observed_at":"2026-08-16T05:12:25.827696Z","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-16T05:12:26.659341Z","title":null,"venue":null,"work_id":"4e625fd9-049b-486e-bd05-de66828128ec","year":2019},"citing_paper":{"arxiv_id":"2504.21383","last_updated":"2025-04-30T07:32:40Z","snapshot_observed_at":"2026-08-20T09:47:29.252176Z","submitted_at":"2025-04-30T07:32:40Z","title":"FAST-Q: Fast-track Exploration with Adversarially Balanced State Representations for Counterfactual Action Estimation in Offline Reinforcement Learning","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:25.831905Z"},"links":{"citing_paper":"/paper/2504.21383"},"observation_digest":"sha256:124819733407b4a9c5828d78e293beea1f502cff193e9f8410c07b8f9d1924bc","observation_id":"71de6429-82d1-4e3e-808a-5d5a129f0ca5","resolution":{"observed_at":"2026-08-16T05:12:26.663325Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.04779","last_updated":"2020-08-19T17:07:05Z","snapshot_observed_at":"2026-08-17T05:44:04.325551Z","submitted_at":"2020-06-08T17:53:42Z","title":"Conservative Q-Learning for Offline Reinforcement Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.04779","snapshot_observed_at":"2026-08-16T05:12:25.836255Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2504.21383","last_updated":"2025-04-30T07:32:40Z","snapshot_observed_at":"2026-08-20T09:47:29.252176Z","submitted_at":"2025-04-30T07:32:40Z","title":"FAST-Q: Fast-track Exploration with Adversarially Balanced State Representations for Counterfactual Action Estimation in Offline Reinforcement Learning","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:25.836255Z"},"links":{"cited_paper":"/paper/2006.04779","citing_paper":"/paper/2504.21383"},"observation_digest":"sha256:f6fdc14d5276400418d8d2f39039b0d5f3748899204be0dc40ac1fc62ba54c7c","observation_id":"fae3c151-9e85-4480-bc46-cbc238605f38","resolution":{"observed_at":"2026-08-16T05:12:25.836255Z","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-16T05:12:26.644353Z","title":"Riedmiller","venue":null,"work_id":"bcbc5820-8345-4796-9415-a565e792aefa","year":2012},"citing_paper":{"arxiv_id":"2504.21383","last_updated":"2025-04-30T07:32:40Z","snapshot_observed_at":"2026-08-20T09:47:29.252176Z","submitted_at":"2025-04-30T07:32:40Z","title":"FAST-Q: Fast-track Exploration with Adversarially Balanced State Representations for Counterfactual Action Estimation in Offline Reinforcement Learning","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:25.840879Z"},"links":{"citing_paper":"/paper/2504.21383"},"observation_digest":"sha256:c6fe6a721d9c7853e6918eb9e842cad69a228bbb5c01a32fac0c713b0964347a","observation_id":"763e4fe9-1f38-438f-b0cd-e15d0c705073","resolution":{"observed_at":"2026-08-16T05:12:26.649482Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T05:12:26.627762Z","title":null,"venue":null,"work_id":"2e441ac4-3470-43d4-b971-21f3aaa33f58","year":2017},"citing_paper":{"arxiv_id":"2504.21383","last_updated":"2025-04-30T07:32:40Z","snapshot_observed_at":"2026-08-20T09:47:29.252176Z","submitted_at":"2025-04-30T07:32:40Z","title":"FAST-Q: Fast-track Exploration with Adversarially Balanced State Representations for Counterfactual Action Estimation in Offline Reinforcement Learning","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:25.844949Z"},"links":{"citing_paper":"/paper/2504.21383"},"observation_digest":"sha256:b5e7fb1e7fafc94c2a6059afac2464c0c8a16895491551aa5be5458ae61ef9ac","observation_id":"4a098b64-a327-4473-8b19-185a87964aa2","resolution":{"observed_at":"2026-08-16T05:12:26.632488Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T05:12:26.612423Z","title":null,"venue":null,"work_id":"a999ac99-cbef-40af-b6cc-d2e31725b4ee","year":1947},"citing_paper":{"arxiv_id":"2504.21383","last_updated":"2025-04-30T07:32:40Z","snapshot_observed_at":"2026-08-20T09:47:29.252176Z","submitted_at":"2025-04-30T07:32:40Z","title":"FAST-Q: Fast-track Exploration with Adversarially Balanced State Representations for Counterfactual Action Estimation in Offline Reinforcement Learning","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:25.849552Z"},"links":{"citing_paper":"/paper/2504.21383"},"observation_digest":"sha256:013ece5eeb241d097830234d075b01c95fe273af028a978bb32389a4ef0d6955","observation_id":"7de9b251-9c09-4e6c-876b-c678811c334f","resolution":{"observed_at":"2026-08-16T05:12:26.616442Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1802.03426","last_updated":"2020-09-18T01:56:41Z","snapshot_observed_at":"2026-08-02T15:32:07.466568Z","submitted_at":"2018-02-09T19:39:33Z","title":"UMAP: Uniform Manifold Approximation and Projection for Dimension Reduction","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1802.03426","snapshot_observed_at":"2026-08-16T05:12:25.854506Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2504.21383","last_updated":"2025-04-30T07:32:40Z","snapshot_observed_at":"2026-08-20T09:47:29.252176Z","submitted_at":"2025-04-30T07:32:40Z","title":"FAST-Q: Fast-track Exploration with Adversarially Balanced State Representations for Counterfactual Action Estimation in Offline Reinforcement Learning","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:25.854506Z"},"links":{"cited_paper":"/paper/1802.03426","citing_paper":"/paper/2504.21383"},"observation_digest":"sha256:e8c60e490726f9755920357eaa0c9c0ef65be38f3acecfb51b80be81b338c0db","observation_id":"5c7f6d19-2fb4-4adf-8258-25ca17b012fc","resolution":{"observed_at":"2026-08-16T05:12:25.854506Z","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-16T05:12:26.598494Z","title":null,"venue":null,"work_id":"c5fa6ade-17d7-43ca-a728-d8a0a9fc7a52","year":2007},"citing_paper":{"arxiv_id":"2504.21383","last_updated":"2025-04-30T07:32:40Z","snapshot_observed_at":"2026-08-20T09:47:29.252176Z","submitted_at":"2025-04-30T07:32:40Z","title":"FAST-Q: Fast-track Exploration with Adversarially Balanced State Representations for Counterfactual Action Estimation in Offline Reinforcement Learning","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:25.859984Z"},"links":{"citing_paper":"/paper/2504.21383"},"observation_digest":"sha256:bafc19e26cbaa29c4c12414fe89d7a5d28dd1a0c9671a6948c3e4d7ba3da7776","observation_id":"c6ab395a-d987-4fa2-b289-1f1a67e2765f","resolution":{"observed_at":"2026-08-16T05:12:26.602509Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T05:12:26.585607Z","title":null,"venue":null,"work_id":"b2ab3e99-b3e0-474d-a68e-421a33ec981f","year":2005},"citing_paper":{"arxiv_id":"2504.21383","last_updated":"2025-04-30T07:32:40Z","snapshot_observed_at":"2026-08-20T09:47:29.252176Z","submitted_at":"2025-04-30T07:32:40Z","title":"FAST-Q: Fast-track Exploration with Adversarially Balanced State Representations for Counterfactual Action Estimation in Offline Reinforcement Learning","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:25.864909Z"},"links":{"citing_paper":"/paper/2504.21383"},"observation_digest":"sha256:16958d1c1149c37acf8e01f2d9747b7180b35f5e1823dd0e272840caeb76af8f","observation_id":"b5ece7a5-bb0c-4ca9-a050-38cd29915130","resolution":{"observed_at":"2026-08-16T05:12:26.589450Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T05:12:26.572313Z","title":"Robins and Miguel A","venue":null,"work_id":"432fccc5-ff27-4912-925c-f6025b3634bd","year":2008},"citing_paper":{"arxiv_id":"2504.21383","last_updated":"2025-04-30T07:32:40Z","snapshot_observed_at":"2026-08-20T09:47:29.252176Z","submitted_at":"2025-04-30T07:32:40Z","title":"FAST-Q: Fast-track Exploration with Adversarially Balanced State Representations for Counterfactual Action Estimation in Offline Reinforcement Learning","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:25.869370Z"},"links":{"citing_paper":"/paper/2504.21383"},"observation_digest":"sha256:b32d7b8513e041ea8bab7d9057b485268c55b9795487085e961629181566832b","observation_id":"165777ac-3090-41dc-b383-b9ce5ac2ea10","resolution":{"observed_at":"2026-08-16T05:12:26.576256Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T05:12:26.558009Z","title":"Wu, and Steve J","venue":null,"work_id":"8acadb68-e541-4c88-80bd-ee81c23f834d","year":2019},"citing_paper":{"arxiv_id":"2504.21383","last_updated":"2025-04-30T07:32:40Z","snapshot_observed_at":"2026-08-20T09:47:29.252176Z","submitted_at":"2025-04-30T07:32:40Z","title":"FAST-Q: Fast-track Exploration with Adversarially Balanced State Representations for Counterfactual Action Estimation in Offline Reinforcement Learning","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:25.874313Z"},"links":{"citing_paper":"/paper/2504.21383"},"observation_digest":"sha256:8941745168df16c6163063439c3b77acfa46b0efb1f684c5b644bce11f7e85d5","observation_id":"48db4625-c752-413e-8fd8-548ede8f4d51","resolution":{"observed_at":"2026-08-16T05:12:26.562181Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1703.10651","last_updated":"2018-02-01T13:40:16Z","snapshot_observed_at":"2026-08-19T20:34:58.485413Z","submitted_at":"2017-03-30T19:51:03Z","title":"Reliable Decision Support using Counterfactual Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1703.10651","snapshot_observed_at":"2026-08-16T05:12:25.879002Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2504.21383","last_updated":"2025-04-30T07:32:40Z","snapshot_observed_at":"2026-08-20T09:47:29.252176Z","submitted_at":"2025-04-30T07:32:40Z","title":"FAST-Q: Fast-track Exploration with Adversarially Balanced State Representations for Counterfactual Action Estimation in Offline Reinforcement Learning","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:25.879002Z"},"links":{"cited_paper":"/paper/1703.10651","citing_paper":"/paper/2504.21383"},"observation_digest":"sha256:ca3414b62e5d5a1499b3f1a7314e2416eae5b64f268868bdbd739822a21d90ac","observation_id":"d1a16981-8b7f-42bd-8762-e6cf4c69a984","resolution":{"observed_at":"2026-08-16T05:12:25.879002Z","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-16T05:12:26.544251Z","title":null,"venue":null,"work_id":"a1d900e8-8576-4cea-add2-9dd29aaccb3b","year":2015},"citing_paper":{"arxiv_id":"2504.21383","last_updated":"2025-04-30T07:32:40Z","snapshot_observed_at":"2026-08-20T09:47:29.252176Z","submitted_at":"2025-04-30T07:32:40Z","title":"FAST-Q: Fast-track Exploration with Adversarially Balanced State Representations for Counterfactual Action Estimation in Offline Reinforcement Learning","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:25.884329Z"},"links":{"citing_paper":"/paper/2504.21383"},"observation_digest":"sha256:aed72732a44ccf4c15e292721d41fdcafd091de5b7584d922986391393034e98","observation_id":"d85dd0f8-a4ee-4cae-9340-32ce5c67d224","resolution":{"observed_at":"2026-08-16T05:12:26.548426Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1704.02038","last_updated":"2017-11-05T02:16:25Z","snapshot_observed_at":"2026-08-14T21:07:54.125524Z","submitted_at":"2017-04-06T22:42:13Z","title":"Treatment-Response Models for Counterfactual Reasoning with Continuous-time, Continuous-valued Interventions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1704.02038","snapshot_observed_at":"2026-08-16T05:12:25.888767Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2504.21383","last_updated":"2025-04-30T07:32:40Z","snapshot_observed_at":"2026-08-20T09:47:29.252176Z","submitted_at":"2025-04-30T07:32:40Z","title":"FAST-Q: Fast-track Exploration with Adversarially Balanced State Representations for Counterfactual Action Estimation in Offline Reinforcement Learning","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:25.888767Z"},"links":{"cited_paper":"/paper/1704.02038","citing_paper":"/paper/2504.21383"},"observation_digest":"sha256:b3c2f189656549dc775c9f63b76cec8efa6452764763af8fc03b57278504e59e","observation_id":"e8c02a18-abc2-4b17-b029-ffdf3986ffed","resolution":{"observed_at":"2026-08-16T05:12:25.888767Z","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-16T05:12:26.529553Z","title":null,"venue":null,"work_id":"f1506538-06b1-4efe-b314-9d27f48bd0bb","year":1998},"citing_paper":{"arxiv_id":"2504.21383","last_updated":"2025-04-30T07:32:40Z","snapshot_observed_at":"2026-08-20T09:47:29.252176Z","submitted_at":"2025-04-30T07:32:40Z","title":"FAST-Q: Fast-track Exploration with Adversarially Balanced State Representations for Counterfactual Action Estimation in Offline Reinforcement Learning","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:25.893514Z"},"links":{"citing_paper":"/paper/2504.21383"},"observation_digest":"sha256:2df54c2859c6b1f1ebe81e1e3496a9af54ffe0f249981455dbebedd968e45175","observation_id":"99498c48-690a-4cc1-9180-a05292dd301c","resolution":{"observed_at":"2026-08-16T05:12:26.534322Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T05:12:26.511268Z","title":null,"venue":null,"work_id":"52eb81f2-9c63-4ea7-9c20-65e0b55ddb57","year":2022},"citing_paper":{"arxiv_id":"2504.21383","last_updated":"2025-04-30T07:32:40Z","snapshot_observed_at":"2026-08-20T09:47:29.252176Z","submitted_at":"2025-04-30T07:32:40Z","title":"FAST-Q: Fast-track Exploration with Adversarially Balanced State Representations for Counterfactual Action Estimation in Offline Reinforcement Learning","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:25.898294Z"},"links":{"citing_paper":"/paper/2504.21383"},"observation_digest":"sha256:2d2fd570aa25653923830202c0a9456cfd127acfea59dc2f7f818a5dec375701","observation_id":"337a5414-45da-42a9-bd9d-14233caf8df5","resolution":{"observed_at":"2026-08-16T05:12:26.516808Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T05:12:25.902604Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2504.21383","last_updated":"2025-04-30T07:32:40Z","snapshot_observed_at":"2026-08-20T09:47:29.252176Z","submitted_at":"2025-04-30T07:32:40Z","title":"FAST-Q: Fast-track Exploration with Adversarially Balanced State Representations for Counterfactual Action Estimation in Offline Reinforcement Learning","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:25.902604Z"},"links":{"citing_paper":"/paper/2504.21383"},"observation_digest":"sha256:500f3a17a109c2dbac40b4b4a6ff6e14c3a7468d9cf231cad848dcd9295efd51","observation_id":"85e43b1a-815e-46c4-8413-0ecd086adcf0","resolution":{"observed_at":"2026-08-16T05:12:25.902604Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2208.06193","last_updated":"2023-08-25T19:39:32Z","snapshot_observed_at":"2026-08-12T13:12:28.417467Z","submitted_at":"2022-08-12T09:54:11Z","title":"Diffusion Policies as an Expressive Policy Class for Offline Reinforcement Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2208.06193","snapshot_observed_at":"2026-08-16T05:12:25.907562Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.21383","last_updated":"2025-04-30T07:32:40Z","snapshot_observed_at":"2026-08-20T09:47:29.252176Z","submitted_at":"2025-04-30T07:32:40Z","title":"FAST-Q: Fast-track Exploration with Adversarially Balanced State Representations for Counterfactual Action Estimation in Offline Reinforcement Learning","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:25.907562Z"},"links":{"cited_paper":"/paper/2208.06193","citing_paper":"/paper/2504.21383"},"observation_digest":"sha256:a11175749701b5dbca0e1305eed155762cd446fcfe290c7e0eb53f341db23ad7","observation_id":"af5b193f-7600-4881-a708-58eb85d356d8","resolution":{"observed_at":"2026-08-16T05:12:25.907562Z","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-16T05:12:26.494139Z","title":null,"venue":null,"work_id":"137c1aeb-af59-497d-90fa-a653689a2889","year":2018},"citing_paper":{"arxiv_id":"2504.21383","last_updated":"2025-04-30T07:32:40Z","snapshot_observed_at":"2026-08-20T09:47:29.252176Z","submitted_at":"2025-04-30T07:32:40Z","title":"FAST-Q: Fast-track Exploration with Adversarially Balanced State Representations for Counterfactual Action Estimation in Offline Reinforcement Learning","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:25.913241Z"},"links":{"citing_paper":"/paper/2504.21383"},"observation_digest":"sha256:43a30b5841e0bbf7c294fca25a0279e1d69a1f425801050e2d37599d11e7a0d7","observation_id":"6a1574f9-8d89-483a-88a4-b59a1717aa6b","resolution":{"observed_at":"2026-08-16T05:12:26.499437Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T05:12:26.478425Z","title":null,"venue":null,"work_id":"654e41d4-5b30-4cd8-9832-11187bc18c66","year":2024},"citing_paper":{"arxiv_id":"2504.21383","last_updated":"2025-04-30T07:32:40Z","snapshot_observed_at":"2026-08-20T09:47:29.252176Z","submitted_at":"2025-04-30T07:32:40Z","title":"FAST-Q: Fast-track Exploration with Adversarially Balanced State Representations for Counterfactual Action Estimation in Offline Reinforcement Learning","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:25.919013Z"},"links":{"citing_paper":"/paper/2504.21383"},"observation_digest":"sha256:2c57bf8f052b61da7f2e6f4a243292865c2089f438e38a5792f5e0dc8bdff9df","observation_id":"5329a503-b537-40a5-baec-40af3d07eb19","resolution":{"observed_at":"2026-08-16T05:12:26.482951Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T05:12:26.462899Z","title":null,"venue":null,"work_id":"630c0fbe-f602-476a-a47f-d589709c4ef2","year":2019},"citing_paper":{"arxiv_id":"2504.21383","last_updated":"2025-04-30T07:32:40Z","snapshot_observed_at":"2026-08-20T09:47:29.252176Z","submitted_at":"2025-04-30T07:32:40Z","title":"FAST-Q: Fast-track Exploration with Adversarially Balanced State Representations for Counterfactual Action Estimation in Offline Reinforcement Learning","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:25.924613Z"},"links":{"citing_paper":"/paper/2504.21383"},"observation_digest":"sha256:a11f813e20609351754ed437e71f47efffee92290f0007b7f3ecf2b15807faaf","observation_id":"4df7170f-5eaa-47f1-b567-8d7ac3a3a1a8","resolution":{"observed_at":"2026-08-16T05:12:26.467747Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T05:12:26.443548Z","title":null,"venue":null,"work_id":"ea96f827-df6d-4bec-ad42-619c7cd5c5d1","year":2019},"citing_paper":{"arxiv_id":"2504.21383","last_updated":"2025-04-30T07:32:40Z","snapshot_observed_at":"2026-08-20T09:47:29.252176Z","submitted_at":"2025-04-30T07:32:40Z","title":"FAST-Q: Fast-track Exploration with Adversarially Balanced State Representations for Counterfactual Action Estimation in Offline Reinforcement Learning","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:25.929839Z"},"links":{"citing_paper":"/paper/2504.21383"},"observation_digest":"sha256:a68fc4734850ba9e4b8e6e5dfa48cf6b29abf55f9b4aafb637d218924b962f2b","observation_id":"7a7f163e-0bf7-4c2d-86a3-fadfb200b1f9","resolution":{"observed_at":"2026-08-16T05:12:26.449337Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T05:12:25.935001Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2504.21383","last_updated":"2025-04-30T07:32:40Z","snapshot_observed_at":"2026-08-20T09:47:29.252176Z","submitted_at":"2025-04-30T07:32:40Z","title":"FAST-Q: Fast-track Exploration with Adversarially Balanced State Representations for Counterfactual Action Estimation in Offline Reinforcement Learning","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:25.935001Z"},"links":{"citing_paper":"/paper/2504.21383"},"observation_digest":"sha256:c8bda78d5612fb9dc3ecf3c9a01db0f061fce6839d691e695aecf572f47b5c45","observation_id":"82069a97-0baa-4215-8b97-f035c24ae781","resolution":{"observed_at":"2026-08-16T05:12:25.935001Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1902.05570","last_updated":"2019-07-11T08:28:08Z","snapshot_observed_at":"2026-08-19T17:22:30.389913Z","submitted_at":"2019-02-13T02:53:37Z","title":"Reinforcement Learning to Optimize Long-term User Engagement in Recommender Systems","version":4},"cited_work":{"arxiv_id":"1902.05570","doi":null,"metadata_source":"pith","pith_arxiv_id":"1902.05570","snapshot_observed_at":"2026-08-16T05:12:25.990165Z","title":"Reinforcement Learning to Optimize Long-term User Engagement in Recommender Systems","venue":"cs.IR","work_id":"a7399e59-e71f-4f00-b736-a9d0d5dca078","year":2019},"citing_paper":{"arxiv_id":"2504.21383","last_updated":"2025-04-30T07:32:40Z","snapshot_observed_at":"2026-08-20T09:47:29.252176Z","submitted_at":"2025-04-30T07:32:40Z","title":"FAST-Q: Fast-track Exploration with Adversarially Balanced State Representations for Counterfactual Action Estimation in Offline Reinforcement Learning","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:25.940706Z"},"links":{"cited_paper":"/paper/1902.05570","citing_paper":"/paper/2504.21383"},"observation_digest":"sha256:6b2d765aa569b00f42c2c9f9dbb16fddd63fba6bd29f38f28b10e64018d0e948","observation_id":"66223e2f-113f-4529-b0ce-035ec20763c9","resolution":{"observed_at":"2026-08-16T05:12:25.999842Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2004.07219","last_updated":"2021-02-06T01:57:28Z","snapshot_observed_at":"2026-08-16T08:32:46.407746Z","submitted_at":"2020-04-15T17:18:19Z","title":"D4RL: Datasets for Deep Data-Driven Reinforcement Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.07219","snapshot_observed_at":"2026-08-16T05:12:25.768691Z","title":"arXiv:2004.07219 [cs.LG] https://arxiv.org/abs/2004.07219","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2504.21383","last_updated":"2025-04-30T07:32:40Z","snapshot_observed_at":"2026-08-20T09:47:29.252176Z","submitted_at":"2025-04-30T07:32:40Z","title":"FAST-Q: Fast-track Exploration with Adversarially Balanced State Representations for Counterfactual Action Estimation in Offline Reinforcement Learning","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:25.768691Z"},"links":{"cited_paper":"/paper/2004.07219","citing_paper":"/paper/2504.21383"},"observation_digest":"sha256:fad3888f6f99805ff06df3f0ed81971e7e5b5318e0cfdf9d3c4cdd77865f2dca","observation_id":"0a084f72-fe8d-4bf9-9636-5f99c36ff400","resolution":{"observed_at":"2026-08-16T05:12:25.768691Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2504.21383","last_updated":"2025-04-30T07:32:40Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-20T09:47:29.252176Z","submitted_at":"2025-04-30T07:32:40Z","title":"FAST-Q: Fast-track Exploration with Adversarially Balanced State Representations for Counterfactual Action Estimation in Offline Reinforcement Learning"},"reference_resolution":{"displayed":46,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":40,"verified_exact":0,"verified_fuzzy":5},"total_outbound_references":46},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 46 of 46 outbound references and 0 inbound Pith citation observations for arXiv:2504.21383."}