{"as_of":"2026-08-14T11:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cce8ab6e71d3058f351fa24afe3453fe6e06308fbc552f419d604df29a03a31d","coverage":[{"denominator":35,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":35,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T00:27:50.018822Z","state":"measured"},{"denominator":35,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":35,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+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/2608.07719/citation-record","integrity":"/paper/2608.07719/integrity","json":"/paper/2608.07719/citation-record.json","paper":"/paper/2608.07719"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:27:49.879450Z","title":"The Annals of Applied Statistics , volume=","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.07719","last_updated":"2026-08-07T19:11:54Z","snapshot_observed_at":"2026-08-13T23:20:37.414041Z","submitted_at":"2026-08-07T19:11:54Z","title":"CODS: Iterative Bellman-Residual Data Selection for Reusable Offline Reinforcement Learning","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-11T00:27:49.879450Z"},"links":{"citing_paper":"/paper/2608.07719"},"observation_digest":"sha256:5c5306b783678bcfbfd2fdfe85f144e531e523c34d5226583d7f9bf2cd3beb12","observation_id":"33821bdb-361d-40f5-8b58-a7af29a2bf9a","resolution":{"observed_at":"2026-08-11T00:27:49.879450Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2208.02814","last_updated":"2025-06-13T18:38:23Z","snapshot_observed_at":"2026-08-13T14:50:29.157891Z","submitted_at":"2022-08-04T17:59:44Z","title":"Conformal Risk Control","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2208.02814","snapshot_observed_at":"2026-08-11T00:27:49.885223Z","title":"arXiv preprint arXiv:2208.02814 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07719","last_updated":"2026-08-07T19:11:54Z","snapshot_observed_at":"2026-08-13T23:20:37.414041Z","submitted_at":"2026-08-07T19:11:54Z","title":"CODS: Iterative Bellman-Residual Data Selection for Reusable Offline Reinforcement Learning","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-11T00:27:49.885223Z"},"links":{"cited_paper":"/paper/2208.02814","citing_paper":"/paper/2608.07719"},"observation_digest":"sha256:c2f0e3e61bade79bd8d177a585797c7dffdac183f90f02b43a7a257c7b73c920","observation_id":"8fad9d70-848c-496c-85f3-7b2fbe126207","resolution":{"observed_at":"2026-08-11T00:27:49.885223Z","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-11T00:27:49.889681Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07719","last_updated":"2026-08-07T19:11:54Z","snapshot_observed_at":"2026-08-13T23:20:37.414041Z","submitted_at":"2026-08-07T19:11:54Z","title":"CODS: Iterative Bellman-Residual Data Selection for Reusable Offline Reinforcement Learning","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-11T00:27:49.889681Z"},"links":{"citing_paper":"/paper/2608.07719"},"observation_digest":"sha256:5aa552b07cb6a7d1e56fdee18d5d1857444780f941ff50a22847473767051587","observation_id":"ebe5ac09-1d28-433f-8405-3a995f3176d1","resolution":{"observed_at":"2026-08-11T00:27:49.889681Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.07219","last_updated":"2021-02-06T01:57:28Z","snapshot_observed_at":"2026-08-14T04:09:47.636898Z","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-11T00:27:49.894013Z","title":"arXiv preprint arXiv:2004.07219 , year=","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2608.07719","last_updated":"2026-08-07T19:11:54Z","snapshot_observed_at":"2026-08-13T23:20:37.414041Z","submitted_at":"2026-08-07T19:11:54Z","title":"CODS: Iterative Bellman-Residual Data Selection for Reusable Offline Reinforcement Learning","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-11T00:27:49.894013Z"},"links":{"cited_paper":"/paper/2004.07219","citing_paper":"/paper/2608.07719"},"observation_digest":"sha256:e43da7715c7e40ddd53d30e77b8ed4faf58eabf78a863b2cec2e556431f36ced","observation_id":"5a972dc8-73b4-4c36-9801-d7b3847aaf88","resolution":{"observed_at":"2026-08-11T00:27:49.894013Z","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-11T00:27:49.898951Z","title":"2023 , eprint=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.07719","last_updated":"2026-08-07T19:11:54Z","snapshot_observed_at":"2026-08-13T23:20:37.414041Z","submitted_at":"2026-08-07T19:11:54Z","title":"CODS: Iterative Bellman-Residual Data Selection for Reusable Offline Reinforcement Learning","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-11T00:27:49.898951Z"},"links":{"citing_paper":"/paper/2608.07719"},"observation_digest":"sha256:f6b1bc44408754db7600ebd1d9635ee8e05fe9d9401339e77b4a49d200374f1a","observation_id":"1ab0325e-c831-4f95-b9ea-ce3306c51d53","resolution":{"observed_at":"2026-08-11T00:27:49.898951Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.08020","last_updated":"2025-02-08T19:39:09Z","snapshot_observed_at":"2026-08-14T06:41:02.594043Z","submitted_at":"2024-10-10T15:17:49Z","title":"Efficiently Learning at Test-Time: Active Fine-Tuning of LLMs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.08020","snapshot_observed_at":"2026-08-11T00:27:49.902955Z","title":"arXiv preprint arXiv:2410.08020 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07719","last_updated":"2026-08-07T19:11:54Z","snapshot_observed_at":"2026-08-13T23:20:37.414041Z","submitted_at":"2026-08-07T19:11:54Z","title":"CODS: Iterative Bellman-Residual Data Selection for Reusable Offline Reinforcement Learning","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-11T00:27:49.902955Z"},"links":{"cited_paper":"/paper/2410.08020","citing_paper":"/paper/2608.07719"},"observation_digest":"sha256:f057bca6b1caa0f642e637cb066bf06b3212b5a47cbb5b91c78666cd98180b1e","observation_id":"3d20d29a-25f0-4970-97bf-418c55f87af0","resolution":{"observed_at":"2026-08-11T00:27:49.902955Z","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-11T00:27:50.370070Z","title":"International Conference on Machine Learning , year=","venue":null,"work_id":"dc2321b8-1f23-4ce7-bd5b-e109ef3e8d02","year":null},"citing_paper":{"arxiv_id":"2608.07719","last_updated":"2026-08-07T19:11:54Z","snapshot_observed_at":"2026-08-13T23:20:37.414041Z","submitted_at":"2026-08-07T19:11:54Z","title":"CODS: Iterative Bellman-Residual Data Selection for Reusable Offline Reinforcement Learning","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-11T00:27:49.907529Z"},"links":{"citing_paper":"/paper/2608.07719"},"observation_digest":"sha256:bfb225f00825dfa3d77e051e53553038c6526c00c8847f3e4ebb7aef5026025c","observation_id":"4a2c30dc-1f10-4e2f-bfa5-ac57ad1c6102","resolution":{"observed_at":"2026-08-11T00:27:50.374484Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T00:27:49.911553Z","title":"International conference on machine learning , pages=","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2608.07719","last_updated":"2026-08-07T19:11:54Z","snapshot_observed_at":"2026-08-13T23:20:37.414041Z","submitted_at":"2026-08-07T19:11:54Z","title":"CODS: Iterative Bellman-Residual Data Selection for Reusable Offline Reinforcement Learning","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-11T00:27:49.911553Z"},"links":{"citing_paper":"/paper/2608.07719"},"observation_digest":"sha256:92c1fc2afdcc1e2595740f75cf522ea57d52061f3845143989263dc4ad0972d3","observation_id":"434a47d6-1459-4fa1-a1c9-bfde42009482","resolution":{"observed_at":"2026-08-11T00:27:49.911553Z","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-11T00:27:50.351934Z","title":"Advances in Neural Information Processing Systems , year=","venue":null,"work_id":"ad534914-8b91-4b02-bb0b-740ffb0a1102","year":null},"citing_paper":{"arxiv_id":"2608.07719","last_updated":"2026-08-07T19:11:54Z","snapshot_observed_at":"2026-08-13T23:20:37.414041Z","submitted_at":"2026-08-07T19:11:54Z","title":"CODS: Iterative Bellman-Residual Data Selection for Reusable Offline Reinforcement Learning","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-11T00:27:49.915471Z"},"links":{"citing_paper":"/paper/2608.07719"},"observation_digest":"sha256:61db3e482e64ee39a10b72378470581c3f5e8d3714d60a3857c2a1501962800f","observation_id":"60b67713-1607-4712-9812-cd799ebadba6","resolution":{"observed_at":"2026-08-11T00:27:50.355776Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-11T00:27:49.919443Z","title":"arXiv preprint arXiv:2110.06169 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07719","last_updated":"2026-08-07T19:11:54Z","snapshot_observed_at":"2026-08-13T23:20:37.414041Z","submitted_at":"2026-08-07T19:11:54Z","title":"CODS: Iterative Bellman-Residual Data Selection for Reusable Offline Reinforcement Learning","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-11T00:27:49.919443Z"},"links":{"cited_paper":"/paper/2110.06169","citing_paper":"/paper/2608.07719"},"observation_digest":"sha256:02984eec7f04b0236b2f92983ac61caf1e441e6426751320de710b03e09d42cf","observation_id":"9ae21be4-8c5a-440a-a639-f966d35bdaf9","resolution":{"observed_at":"2026-08-11T00:27:49.919443Z","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-11T00:27:49.924189Z","title":"Advances in neural information processing systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07719","last_updated":"2026-08-07T19:11:54Z","snapshot_observed_at":"2026-08-13T23:20:37.414041Z","submitted_at":"2026-08-07T19:11:54Z","title":"CODS: Iterative Bellman-Residual Data Selection for Reusable Offline Reinforcement Learning","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-11T00:27:49.924189Z"},"links":{"citing_paper":"/paper/2608.07719"},"observation_digest":"sha256:821071ed9c5bdb31ff2f3853052bdefc69d027323d5334d655352f964ce576e6","observation_id":"590d9b11-3a86-4b6f-afd4-1f6da8962405","resolution":{"observed_at":"2026-08-11T00:27:49.924189Z","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-11T00:27:50.333696Z","title":"Neural computation , volume=","venue":null,"work_id":"64033311-1626-4b24-9dde-435054baa455","year":null},"citing_paper":{"arxiv_id":"2608.07719","last_updated":"2026-08-07T19:11:54Z","snapshot_observed_at":"2026-08-13T23:20:37.414041Z","submitted_at":"2026-08-07T19:11:54Z","title":"CODS: Iterative Bellman-Residual Data Selection for Reusable Offline Reinforcement Learning","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-11T00:27:49.927938Z"},"links":{"citing_paper":"/paper/2608.07719"},"observation_digest":"sha256:e1558174a12c39697061749936e06476bc1d5506b3a08d57d7eb341d84d713a3","observation_id":"f9e75e56-8f3c-4057-b8f1-a7cdb3b7aa58","resolution":{"observed_at":"2026-08-11T00:27:50.337508Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T00:27:49.931709Z","title":"International Conference on Machine Learning , pages=","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.07719","last_updated":"2026-08-07T19:11:54Z","snapshot_observed_at":"2026-08-13T23:20:37.414041Z","submitted_at":"2026-08-07T19:11:54Z","title":"CODS: Iterative Bellman-Residual Data Selection for Reusable Offline Reinforcement Learning","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-11T00:27:49.931709Z"},"links":{"citing_paper":"/paper/2608.07719"},"observation_digest":"sha256:6960a072772125ec815864da5aeb0fcba8fee8174d3f2b453e9aadc9f3c0c400","observation_id":"dc36e743-9c0c-41c8-accb-5275a893e3e3","resolution":{"observed_at":"2026-08-11T00:27:49.931709Z","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-11T00:27:50.315191Z","title":null,"venue":null,"work_id":"071d5b7c-11fb-430e-8cb4-ea05484c159a","year":null},"citing_paper":{"arxiv_id":"2608.07719","last_updated":"2026-08-07T19:11:54Z","snapshot_observed_at":"2026-08-13T23:20:37.414041Z","submitted_at":"2026-08-07T19:11:54Z","title":"CODS: Iterative Bellman-Residual Data Selection for Reusable Offline Reinforcement Learning","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-11T00:27:49.935637Z"},"links":{"citing_paper":"/paper/2608.07719"},"observation_digest":"sha256:92c68f44b6754b0fa2ca25d735eb845f79fda34e418d0bb5b9170e82ae8297c7","observation_id":"fdfeba61-f04c-416a-8f6f-f67e3518c204","resolution":{"observed_at":"2026-08-11T00:27:50.319256Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T00:27:49.939423Z","title":"Mathematical programming , volume=","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2608.07719","last_updated":"2026-08-07T19:11:54Z","snapshot_observed_at":"2026-08-13T23:20:37.414041Z","submitted_at":"2026-08-07T19:11:54Z","title":"CODS: Iterative Bellman-Residual Data Selection for Reusable Offline Reinforcement Learning","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-11T00:27:49.939423Z"},"links":{"citing_paper":"/paper/2608.07719"},"observation_digest":"sha256:f36ebe25ba3aee46396605ad4a5ea149c630dbb0fe5303e6e4c0e2ec7d3a3a02","observation_id":"b56a03a8-8e90-4733-b1b4-fa62da749130","resolution":{"observed_at":"2026-08-11T00:27:49.939423Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1511.05952","last_updated":"2016-02-25T17:55:31Z","snapshot_observed_at":"2026-08-12T23:53:55.764215Z","submitted_at":"2015-11-18T20:54:44Z","title":"Prioritized Experience Replay","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1511.05952","snapshot_observed_at":"2026-08-11T00:27:49.943646Z","title":"arXiv preprint arXiv:1511.05952 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07719","last_updated":"2026-08-07T19:11:54Z","snapshot_observed_at":"2026-08-13T23:20:37.414041Z","submitted_at":"2026-08-07T19:11:54Z","title":"CODS: Iterative Bellman-Residual Data Selection for Reusable Offline Reinforcement Learning","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-11T00:27:49.943646Z"},"links":{"cited_paper":"/paper/1511.05952","citing_paper":"/paper/2608.07719"},"observation_digest":"sha256:9dbe8a9e4fdc3f52d492f215fda553f49eac486f5a0ddee0396da0c774c4c360","observation_id":"e5f93146-799e-4124-95e0-b98c6115afa8","resolution":{"observed_at":"2026-08-11T00:27:49.943646Z","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-11T00:27:50.296072Z","title":"International Conference on Machine Learning , year=","venue":null,"work_id":"2e561968-90ec-4750-b09e-f6f537adc950","year":null},"citing_paper":{"arxiv_id":"2608.07719","last_updated":"2026-08-07T19:11:54Z","snapshot_observed_at":"2026-08-13T23:20:37.414041Z","submitted_at":"2026-08-07T19:11:54Z","title":"CODS: Iterative Bellman-Residual Data Selection for Reusable Offline Reinforcement Learning","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-11T00:27:49.947664Z"},"links":{"citing_paper":"/paper/2608.07719"},"observation_digest":"sha256:27c927a969a8ca1991cc9ca6703bc742dc80e8389c85c91d3beff1ef8ad4a1f6","observation_id":"2047acbb-9956-498a-9512-814780486962","resolution":{"observed_at":"2026-08-11T00:27:50.299823Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T00:27:50.284380Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":"b3dfe220-c271-4f2e-9a9d-fe4eeecf8bd6","year":null},"citing_paper":{"arxiv_id":"2608.07719","last_updated":"2026-08-07T19:11:54Z","snapshot_observed_at":"2026-08-13T23:20:37.414041Z","submitted_at":"2026-08-07T19:11:54Z","title":"CODS: Iterative Bellman-Residual Data Selection for Reusable Offline Reinforcement Learning","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-11T00:27:49.951896Z"},"links":{"citing_paper":"/paper/2608.07719"},"observation_digest":"sha256:7a8718f1258eafb2f8b3a1c14523c2f70cf238758ee088294e5cae5dc832376d","observation_id":"767680bc-ce83-4240-9e60-8186800d54d8","resolution":{"observed_at":"2026-08-11T00:27:50.288430Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T00:27:50.272291Z","title":"International Conference on Machine Learning , year=","venue":null,"work_id":"c6a66206-7b7f-4875-bfbc-792c70f995ae","year":null},"citing_paper":{"arxiv_id":"2608.07719","last_updated":"2026-08-07T19:11:54Z","snapshot_observed_at":"2026-08-13T23:20:37.414041Z","submitted_at":"2026-08-07T19:11:54Z","title":"CODS: Iterative Bellman-Residual Data Selection for Reusable Offline Reinforcement Learning","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-11T00:27:49.955669Z"},"links":{"citing_paper":"/paper/2608.07719"},"observation_digest":"sha256:a5bc10c593fba92f695aaca3b9d4228ee36cf50901616713aafa664723f7d30a","observation_id":"997a6100-9fe4-458d-ac19-14837a638906","resolution":{"observed_at":"2026-08-11T00:27:50.276302Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.04333","last_updated":"2024-06-13T03:42:02Z","snapshot_observed_at":"2026-08-13T04:24:51.821062Z","submitted_at":"2024-02-06T19:18:04Z","title":"LESS: Selecting Influential Data for Targeted Instruction Tuning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.04333","snapshot_observed_at":"2026-08-11T00:27:49.959430Z","title":"arXiv preprint arXiv:2402.04333 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07719","last_updated":"2026-08-07T19:11:54Z","snapshot_observed_at":"2026-08-13T23:20:37.414041Z","submitted_at":"2026-08-07T19:11:54Z","title":"CODS: Iterative Bellman-Residual Data Selection for Reusable Offline Reinforcement Learning","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-11T00:27:49.959430Z"},"links":{"cited_paper":"/paper/2402.04333","citing_paper":"/paper/2608.07719"},"observation_digest":"sha256:05cc62446ec292f92db39ad46013c0123d420b0d3a82c40c350c6f85fb189fe6","observation_id":"8bffff43-b5e4-40cb-996b-9ea6ae5014aa","resolution":{"observed_at":"2026-08-11T00:27:49.959430Z","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-11T00:27:50.260769Z","title":"2025 , eprint=","venue":null,"work_id":"51ada65a-82b1-4ef6-acb4-17d91faf5d92","year":2025},"citing_paper":{"arxiv_id":"2608.07719","last_updated":"2026-08-07T19:11:54Z","snapshot_observed_at":"2026-08-13T23:20:37.414041Z","submitted_at":"2026-08-07T19:11:54Z","title":"CODS: Iterative Bellman-Residual Data Selection for Reusable Offline Reinforcement Learning","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-11T00:27:49.963461Z"},"links":{"citing_paper":"/paper/2608.07719"},"observation_digest":"sha256:d0f81d79d0fbc650277701fabd3ddbdbce5bb92038788c21ecd8360e17de96cd","observation_id":"4396d8c4-745e-4235-a92c-e7344153a46d","resolution":{"observed_at":"2026-08-11T00:27:50.264903Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2005.01643","last_updated":"2020-11-01T23:50:25Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2020-05-04T17:00:15Z","title":"Offline Reinforcement Learning: Tutorial, Review, and Perspectives on Open Problems","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.01643","snapshot_observed_at":"2026-08-11T00:27:49.967283Z","title":"arXiv preprint arXiv:2005.01643 , year=","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2608.07719","last_updated":"2026-08-07T19:11:54Z","snapshot_observed_at":"2026-08-13T23:20:37.414041Z","submitted_at":"2026-08-07T19:11:54Z","title":"CODS: Iterative Bellman-Residual Data Selection for Reusable Offline Reinforcement Learning","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-11T00:27:49.967283Z"},"links":{"cited_paper":"/paper/2005.01643","citing_paper":"/paper/2608.07719"},"observation_digest":"sha256:edc1a761046542f6f775fb111f55f55be111a2d3e8730f3504b9bfb279110a16","observation_id":"c711a83a-a4ef-47ff-b0e1-11948397b7fe","resolution":{"observed_at":"2026-08-11T00:27:49.967283Z","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-11T00:27:50.249416Z","title":"2021 , eprint=","venue":null,"work_id":"308721a8-be93-47dc-b993-56260f827beb","year":2021},"citing_paper":{"arxiv_id":"2608.07719","last_updated":"2026-08-07T19:11:54Z","snapshot_observed_at":"2026-08-13T23:20:37.414041Z","submitted_at":"2026-08-07T19:11:54Z","title":"CODS: Iterative Bellman-Residual Data Selection for Reusable Offline Reinforcement Learning","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-11T00:27:49.971170Z"},"links":{"citing_paper":"/paper/2608.07719"},"observation_digest":"sha256:1bb9ce2c50eb6ed8874e6cf90b337bfabb609295602325caa92418b17730dc84","observation_id":"c7d26ba1-b705-4426-af0c-6af6efe31a9e","resolution":{"observed_at":"2026-08-11T00:27:50.253046Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T00:27:49.974741Z","title":"Advances in neural information processing systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07719","last_updated":"2026-08-07T19:11:54Z","snapshot_observed_at":"2026-08-13T23:20:37.414041Z","submitted_at":"2026-08-07T19:11:54Z","title":"CODS: Iterative Bellman-Residual Data Selection for Reusable Offline Reinforcement Learning","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-11T00:27:49.974741Z"},"links":{"citing_paper":"/paper/2608.07719"},"observation_digest":"sha256:b9bc59d9a3a79da235a833159bce36ac5574ad37db12be723d312f24a0945c80","observation_id":"632963f0-de81-43ce-9981-3ed051ba3299","resolution":{"observed_at":"2026-08-11T00:27:49.974741Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.09241","last_updated":"2022-10-17T16:34:01Z","snapshot_observed_at":"2026-08-13T14:03:32.523106Z","submitted_at":"2022-10-17T16:34:01Z","title":"Boosting Offline Reinforcement Learning via Data Rebalancing","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.09241","snapshot_observed_at":"2026-08-11T00:27:49.978621Z","title":"arXiv preprint arXiv:2210.09241 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07719","last_updated":"2026-08-07T19:11:54Z","snapshot_observed_at":"2026-08-13T23:20:37.414041Z","submitted_at":"2026-08-07T19:11:54Z","title":"CODS: Iterative Bellman-Residual Data Selection for Reusable Offline Reinforcement Learning","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-11T00:27:49.978621Z"},"links":{"cited_paper":"/paper/2210.09241","citing_paper":"/paper/2608.07719"},"observation_digest":"sha256:c48c0ab70d18bf05f74557870ae70507fbbecc2c029fcc46d5b4da3e3753dca6","observation_id":"2fcc04d0-779f-40dc-b392-6b6163d91762","resolution":{"observed_at":"2026-08-11T00:27:49.978621Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1708.00489","last_updated":"2018-06-01T10:17:23Z","snapshot_observed_at":"2026-07-06T05:53:39.440274Z","submitted_at":"2017-08-01T19:50:53Z","title":"Active Learning for Convolutional Neural Networks: A Core-Set Approach","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1708.00489","snapshot_observed_at":"2026-08-11T00:27:49.982924Z","title":"arXiv preprint arXiv:1708.00489 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07719","last_updated":"2026-08-07T19:11:54Z","snapshot_observed_at":"2026-08-13T23:20:37.414041Z","submitted_at":"2026-08-07T19:11:54Z","title":"CODS: Iterative Bellman-Residual Data Selection for Reusable Offline Reinforcement Learning","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-11T00:27:49.982924Z"},"links":{"cited_paper":"/paper/1708.00489","citing_paper":"/paper/2608.07719"},"observation_digest":"sha256:7ffb28149a7fc57f4701bf8ea5a8890704b8eb088c87b762378db53db87bf911","observation_id":"9c844579-6850-4953-9e09-2eb698db0905","resolution":{"observed_at":"2026-08-11T00:27:49.982924Z","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-11T00:27:50.231196Z","title":"Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems , pages=","venue":null,"work_id":"dfead654-2e84-416d-9324-fb6926c7dc54","year":null},"citing_paper":{"arxiv_id":"2608.07719","last_updated":"2026-08-07T19:11:54Z","snapshot_observed_at":"2026-08-13T23:20:37.414041Z","submitted_at":"2026-08-07T19:11:54Z","title":"CODS: Iterative Bellman-Residual Data Selection for Reusable Offline Reinforcement Learning","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-11T00:27:49.986822Z"},"links":{"citing_paper":"/paper/2608.07719"},"observation_digest":"sha256:0264e40101bcd9de8b0be0d14066ee12e0226587a988cc8f58df0fcb86359252","observation_id":"77e1e1b8-e063-47c4-bb7b-01ba6c0aad25","resolution":{"observed_at":"2026-08-11T00:27:50.235291Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T00:27:50.219516Z","title":"2025 , eprint=","venue":null,"work_id":"f0448465-6be2-47f7-89d7-3b3f1e064ea6","year":2025},"citing_paper":{"arxiv_id":"2608.07719","last_updated":"2026-08-07T19:11:54Z","snapshot_observed_at":"2026-08-13T23:20:37.414041Z","submitted_at":"2026-08-07T19:11:54Z","title":"CODS: Iterative Bellman-Residual Data Selection for Reusable Offline Reinforcement Learning","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-11T00:27:49.990661Z"},"links":{"citing_paper":"/paper/2608.07719"},"observation_digest":"sha256:c87634cf33661e435ad8cd796b24b8a255d85be730303084af472b41cd87a3cb","observation_id":"414bde1a-5e71-4005-8b01-98c3530a4919","resolution":{"observed_at":"2026-08-11T00:27:50.223214Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T00:27:49.994578Z","title":"2005 , publisher=","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2608.07719","last_updated":"2026-08-07T19:11:54Z","snapshot_observed_at":"2026-08-13T23:20:37.414041Z","submitted_at":"2026-08-07T19:11:54Z","title":"CODS: Iterative Bellman-Residual Data Selection for Reusable Offline Reinforcement Learning","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-11T00:27:49.994578Z"},"links":{"citing_paper":"/paper/2608.07719"},"observation_digest":"sha256:834c7ad08f4f490decf7df93d63ab219f442c57e1a623d8c75655b6192b0f9da","observation_id":"feab0f61-b7c3-4b9b-94d4-cb3f6f2d93f7","resolution":{"observed_at":"2026-08-11T00:27:49.994578Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2107.07511","last_updated":"2022-12-07T05:08:01Z","snapshot_observed_at":"2026-07-06T11:29:34.579530Z","submitted_at":"2021-07-15T17:59:50Z","title":"A Gentle Introduction to Conformal Prediction and Distribution-Free Uncertainty Quantification","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.07511","snapshot_observed_at":"2026-08-11T00:27:49.998224Z","title":"arXiv preprint arXiv:2107.07511 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07719","last_updated":"2026-08-07T19:11:54Z","snapshot_observed_at":"2026-08-13T23:20:37.414041Z","submitted_at":"2026-08-07T19:11:54Z","title":"CODS: Iterative Bellman-Residual Data Selection for Reusable Offline Reinforcement Learning","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-11T00:27:49.998224Z"},"links":{"cited_paper":"/paper/2107.07511","citing_paper":"/paper/2608.07719"},"observation_digest":"sha256:54c329dbfb88266233dcfef9538ae693789e0496c5dc3d3350b865a5e44700e3","observation_id":"616221f4-55f8-4e06-865b-0b5a19bd575c","resolution":{"observed_at":"2026-08-11T00:27:49.998224Z","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-11T00:27:50.200633Z","title":"Advances in Neural Information Processing Systems , volume =","venue":null,"work_id":"9108d658-8af8-485a-95f6-09fc756449e6","year":2021},"citing_paper":{"arxiv_id":"2608.07719","last_updated":"2026-08-07T19:11:54Z","snapshot_observed_at":"2026-08-13T23:20:37.414041Z","submitted_at":"2026-08-07T19:11:54Z","title":"CODS: Iterative Bellman-Residual Data Selection for Reusable Offline Reinforcement Learning","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-11T00:27:50.002418Z"},"links":{"citing_paper":"/paper/2608.07719"},"observation_digest":"sha256:174b994a4867ed60d42b446e3ec78875ea43010953e9956949ab48426f3a274a","observation_id":"9a9e88d4-92f0-465e-98d3-71dee4f7a6a6","resolution":{"observed_at":"2026-08-11T00:27:50.204958Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T00:27:50.188670Z","title":"Offline Reinforcement Learning for","venue":null,"work_id":"9d2a0b50-088b-4a6e-8369-42185af9498d","year":2025},"citing_paper":{"arxiv_id":"2608.07719","last_updated":"2026-08-07T19:11:54Z","snapshot_observed_at":"2026-08-13T23:20:37.414041Z","submitted_at":"2026-08-07T19:11:54Z","title":"CODS: Iterative Bellman-Residual Data Selection for Reusable Offline Reinforcement Learning","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-11T00:27:50.006454Z"},"links":{"citing_paper":"/paper/2608.07719"},"observation_digest":"sha256:0f7fbb586bc879b1dc47c39d57728b3ac91a3ae8a56e185713c009c6e5892373","observation_id":"3df61cd8-6a9e-4913-89d0-5fb22cd8a733","resolution":{"observed_at":"2026-08-11T00:27:50.192620Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T00:27:50.174748Z","title":"International Conference on Learning Representations , year =","venue":null,"work_id":"a88949c1-fdd4-4cd2-b0d6-da18ddb5297b","year":null},"citing_paper":{"arxiv_id":"2608.07719","last_updated":"2026-08-07T19:11:54Z","snapshot_observed_at":"2026-08-13T23:20:37.414041Z","submitted_at":"2026-08-07T19:11:54Z","title":"CODS: Iterative Bellman-Residual Data Selection for Reusable Offline Reinforcement Learning","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-11T00:27:50.010647Z"},"links":{"citing_paper":"/paper/2608.07719"},"observation_digest":"sha256:81af45a7d3d323556db3270e6530b2c76b1db61085b24918b9df838134e62bae","observation_id":"fc97fa34-5a49-4d47-a8ac-80dc8c0fd683","resolution":{"observed_at":"2026-08-11T00:27:50.180698Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.14168","last_updated":"2021-11-18T00:23:45Z","snapshot_observed_at":"2026-08-14T02:43:01.480086Z","submitted_at":"2021-10-27T04:49:45Z","title":"Training Verifiers to Solve Math Word Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.14168","snapshot_observed_at":"2026-08-11T00:27:50.014725Z","title":"arXiv preprint arXiv:2110.14168 , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07719","last_updated":"2026-08-07T19:11:54Z","snapshot_observed_at":"2026-08-13T23:20:37.414041Z","submitted_at":"2026-08-07T19:11:54Z","title":"CODS: Iterative Bellman-Residual Data Selection for Reusable Offline Reinforcement Learning","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-11T00:27:50.014725Z"},"links":{"cited_paper":"/paper/2110.14168","citing_paper":"/paper/2608.07719"},"observation_digest":"sha256:6007438f1fde11d17e0ca13ea937e21cc9901235caded3b188b5f234df243489","observation_id":"8a07762d-b81c-420b-92b8-d0c55dbf36f5","resolution":{"observed_at":"2026-08-11T00:27:50.014725Z","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-11T00:27:50.018822Z","title":"ArXiv , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.07719","last_updated":"2026-08-07T19:11:54Z","snapshot_observed_at":"2026-08-13T23:20:37.414041Z","submitted_at":"2026-08-07T19:11:54Z","title":"CODS: Iterative Bellman-Residual Data Selection for Reusable Offline Reinforcement Learning","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-11T00:27:50.018822Z"},"links":{"citing_paper":"/paper/2608.07719"},"observation_digest":"sha256:11c5818144ee8f2f1d86f552e51069851aa7c9fcac381e6a185634a16a50d5ff","observation_id":"c461bb34-41df-4226-a687-d3367ccbfa6f","resolution":{"observed_at":"2026-08-11T00:27:50.018822Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2608.07719","last_updated":"2026-08-07T19:11:54Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-13T23:20:37.414041Z","submitted_at":"2026-08-07T19:11:54Z","title":"CODS: Iterative Bellman-Residual Data Selection for Reusable Offline Reinforcement Learning"},"reference_resolution":{"displayed":35,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":22,"verified_exact":0,"verified_fuzzy":13},"total_outbound_references":35},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 35 of 35 outbound references and 0 inbound Pith citation observations for arXiv:2608.07719."}