{"as_of":"2026-08-11T16:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:97d3199854e666097e9f20f26d23f0ec8bcbad1fca834a162a32f668559e2f61","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T11:01:33.933425Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-22T07:51:16.626435Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2305.09836","last_updated":"2023-10-24T09:10:03Z","snapshot_observed_at":"2026-08-09T16:16:18.244483Z","submitted_at":"2023-05-16T22:37:01Z","title":"Revisiting the Minimalist Approach to Offline Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.09836","snapshot_observed_at":"2026-08-04T11:01:33.933425Z","title":"Revisiting the minimalist approach to offline reinforcement learning, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.07650","last_updated":"2026-05-30T05:26:12Z","snapshot_observed_at":"2026-08-04T11:01:21.243413Z","submitted_at":"2025-10-09T00:57:40Z","title":"Value Flows","version":4},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-08-04T11:01:33.933425Z"},"links":{"cited_paper":"/paper/2305.09836","citing_paper":"/paper/2510.07650"},"observation_digest":"sha256:cf89efef745c43b419cabcb913a47261d8a35e33505a621e7461e456290bea0d","observation_id":"e93d6353-2fa9-4423-ab1c-f0619dffc6d6","resolution":{"observed_at":"2026-08-04T11:01:33.933425Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.09836","last_updated":"2023-10-24T09:10:03Z","snapshot_observed_at":"2026-08-09T16:16:18.244483Z","submitted_at":"2023-05-16T22:37:01Z","title":"Revisiting the Minimalist Approach to Offline Reinforcement Learning","version":2},"cited_work":{"arxiv_id":"2305.09836","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2305.09836","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Revisiting the Minimalist Approach to Offline Reinforcement Learning, October 2023","venue":null,"work_id":"08ad3e5a-4806-4a75-b300-70d46dafd1a0","year":2023},"citing_paper":{"arxiv_id":"2605.05812","last_updated":"2026-05-11T14:20:38Z","snapshot_observed_at":"2026-08-11T13:36:41.746341Z","submitted_at":"2026-05-07T07:47:55Z","title":"Long-Horizon Q-Learning: Accurate Value Learning via n-Step Inequalities","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-05-08T11:20:19.749415Z"},"links":{"cited_paper":"/paper/2305.09836","citing_paper":"/paper/2605.05812"},"observation_digest":"sha256:30cbfbd3a03257a843568efba20dbfa691aa598ba3f0a8343dcb13c9f22866fe","observation_id":"4d619b10-8368-4f73-a930-90479d29d469","resolution":{"observed_at":"2026-05-11T19:41:07.949401Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.09836","last_updated":"2023-10-24T09:10:03Z","snapshot_observed_at":"2026-08-09T16:16:18.244483Z","submitted_at":"2023-05-16T22:37:01Z","title":"Revisiting the Minimalist Approach to Offline Reinforcement Learning","version":2},"cited_work":{"arxiv_id":"2305.09836","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2305.09836","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Revisiting the Minimalist Approach to Offline Reinforcement Learning, October 2023","venue":null,"work_id":"08ad3e5a-4806-4a75-b300-70d46dafd1a0","year":2023},"citing_paper":{"arxiv_id":"2605.05812","last_updated":"2026-05-11T14:20:38Z","snapshot_observed_at":"2026-08-11T13:36:41.746341Z","submitted_at":"2026-05-07T07:47:55Z","title":"Long-Horizon Q-Learning: Accurate Value Learning via n-Step Inequalities","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-05-12T05:05:29.984355Z"},"links":{"cited_paper":"/paper/2305.09836","citing_paper":"/paper/2605.05812"},"observation_digest":"sha256:534ee25c4684b350bb44a149d93eb25a11353896ccf5af14b20395d8cc1a3907","observation_id":"ca759100-b47d-4607-8893-591603c2495c","resolution":{"observed_at":"2026-05-12T05:41:24.766345Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.09836","last_updated":"2023-10-24T09:10:03Z","snapshot_observed_at":"2026-08-09T16:16:18.244483Z","submitted_at":"2023-05-16T22:37:01Z","title":"Revisiting the Minimalist Approach to Offline Reinforcement Learning","version":2},"cited_work":{"arxiv_id":"2305.09836","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2305.09836","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Revisiting the Minimalist Approach to Offline Reinforcement Learning, October 2023","venue":null,"work_id":"08ad3e5a-4806-4a75-b300-70d46dafd1a0","year":2023},"citing_paper":{"arxiv_id":"2605.11151","last_updated":"2026-05-20T06:10:49Z","snapshot_observed_at":"2026-07-06T23:23:02.025664Z","submitted_at":"2026-05-11T18:58:49Z","title":"RankQ: Offline-to-Online Reinforcement Learning via Self-Supervised Action Ranking","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-13T02:32:16.746824Z"},"links":{"cited_paper":"/paper/2305.09836","citing_paper":"/paper/2605.11151"},"observation_digest":"sha256:bce23fac7105c7d9249599ba27e3f5140774485ea54936be38b026b392ee0848","observation_id":"990e4c5e-04d6-4a26-940c-ba6d3b720a6e","resolution":{"observed_at":"2026-05-13T02:37:08.180692Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.09836","last_updated":"2023-10-24T09:10:03Z","snapshot_observed_at":"2026-08-09T16:16:18.244483Z","submitted_at":"2023-05-16T22:37:01Z","title":"Revisiting the Minimalist Approach to Offline Reinforcement Learning","version":2},"cited_work":{"arxiv_id":"2305.09836","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2305.09836","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Revisiting the Minimalist Approach to Offline Reinforcement Learning, October 2023","venue":null,"work_id":"08ad3e5a-4806-4a75-b300-70d46dafd1a0","year":2023},"citing_paper":{"arxiv_id":"2605.11151","last_updated":"2026-05-20T06:10:49Z","snapshot_observed_at":"2026-07-06T23:23:02.025664Z","submitted_at":"2026-05-11T18:58:49Z","title":"RankQ: Offline-to-Online Reinforcement Learning via Self-Supervised Action Ranking","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-21T08:53:29.468764Z"},"links":{"cited_paper":"/paper/2305.09836","citing_paper":"/paper/2605.11151"},"observation_digest":"sha256:1de453409af29a7fcea3376bd62f48f425f2bbef0c521ab8f28aa93fbffbb7b9","observation_id":"a0bd2cc3-7b94-46b1-9f37-a7f338af5164","resolution":{"observed_at":"2026-05-21T08:54:05.812498Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.09836","last_updated":"2023-10-24T09:10:03Z","snapshot_observed_at":"2026-08-09T16:16:18.244483Z","submitted_at":"2023-05-16T22:37:01Z","title":"Revisiting the Minimalist Approach to Offline Reinforcement Learning","version":2},"cited_work":{"arxiv_id":"2305.09836","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2305.09836","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Revisiting the Minimalist Approach to Offline Reinforcement Learning, October 2023","venue":null,"work_id":"08ad3e5a-4806-4a75-b300-70d46dafd1a0","year":2023},"citing_paper":{"arxiv_id":"2605.22711","last_updated":"2026-05-21T16:50:26Z","snapshot_observed_at":"2026-07-06T23:32:59.663926Z","submitted_at":"2026-05-21T16:50:26Z","title":"Abstraction for Offline Goal-Conditioned Reinforcement Learning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-22T07:46:20.289421Z"},"links":{"cited_paper":"/paper/2305.09836","citing_paper":"/paper/2605.22711"},"observation_digest":"sha256:34767f9a8f7c05a2e53fa10d8bcf2a961c3f8b4dc8fcab5eda5a6f004361a0db","observation_id":"961bcf7d-6779-45d9-80f6-d5ab4545ef13","resolution":{"observed_at":"2026-05-22T07:51:16.629858Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2305.09836/citation-record","integrity":"/paper/2305.09836/integrity","json":"/paper/2305.09836/citation-record.json","paper":"/paper/2305.09836"},"outbound":[],"paper":{"arxiv_id":"2305.09836","last_updated":"2023-10-24T09:10:03Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T16:16:18.244483Z","submitted_at":"2023-05-16T22:37:01Z","title":"Revisiting the Minimalist Approach to Offline Reinforcement Learning"},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2305.09836."}