{"as_of":"2026-08-07T10:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f5fc364857ce14409e76168b7333810063979009b332a7c5f8ba8d82ec67c661","coverage":[{"denominator":16,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":16,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T11:22:57.874474Z","state":"measured"},{"denominator":16,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":16,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2507.22854/citation-record","integrity":"/paper/2507.22854/integrity","json":"/paper/2507.22854/citation-record.json","paper":"/paper/2507.22854"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:22:57.842621Z","title":"Markov decision processes with their applications , vol- ume 14","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2507.22854","last_updated":"2026-07-16T17:57:33Z","snapshot_observed_at":"2026-08-07T03:47:37.735545Z","submitted_at":"2025-07-30T17:24:23Z","title":"A Bit of Freedom Goes a Long Way: Classical and Quantum Algorithms for Reinforcement Learning under a Generative Model","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T11:22:57.842621Z"},"links":{"citing_paper":"/paper/2507.22854"},"observation_digest":"sha256:d72305b9a05849bcc06f79d74e586339cf3206e6e96e339fa4db299809231f16","observation_id":"75fe3cf3-5c90-4468-bd2e-87fc122f11db","resolution":{"observed_at":"2026-08-06T11:22:57.842621Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.07591","last_updated":"2026-05-30T18:39:29Z","snapshot_observed_at":"2026-08-07T03:38:19.454726Z","submitted_at":"2023-08-15T06:24:53Z","title":"Approximations and Learning for Continuous State and Action MDPs under Average Cost Criteria","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.07591","snapshot_observed_at":"2026-08-06T11:22:57.846867Z","title":"Finite-sample convergence rates for Q-learning and indirect algorithms","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2507.22854","last_updated":"2026-07-16T17:57:33Z","snapshot_observed_at":"2026-08-07T03:47:37.735545Z","submitted_at":"2025-07-30T17:24:23Z","title":"A Bit of Freedom Goes a Long Way: Classical and Quantum Algorithms for Reinforcement Learning under a Generative Model","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T11:22:57.846867Z"},"links":{"cited_paper":"/paper/2308.07591","citing_paper":"/paper/2507.22854"},"observation_digest":"sha256:12fef357db436e852937f721fe7a9bcee7dae087a116748d549acefee85e9216","observation_id":"4818222d-efd6-4c52-9fad-972f49f8c88e","resolution":{"observed_at":"2026-08-06T11:22:57.846867Z","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-06T11:22:58.097398Z","title":"Almost optimal model-free reinforce- ment learningvia reference-advantage decomposition","venue":null,"work_id":"38964328-a51f-41f4-a4b3-859d0ab9f292","year":2020},"citing_paper":{"arxiv_id":"2507.22854","last_updated":"2026-07-16T17:57:33Z","snapshot_observed_at":"2026-08-07T03:47:37.735545Z","submitted_at":"2025-07-30T17:24:23Z","title":"A Bit of Freedom Goes a Long Way: Classical and Quantum Algorithms for Reinforcement Learning under a Generative Model","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T11:22:57.874474Z"},"links":{"citing_paper":"/paper/2507.22854"},"observation_digest":"sha256:234ca08b851585527155d54e683a8b9ad2212a3187526f3526dada1b074d06f6","observation_id":"de05e2e0-113e-441b-9c5e-e193260455b9","resolution":{"observed_at":"2026-08-06T11:22:58.102079Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/9607014","last_updated":"1999-01-07T16:50:45Z","snapshot_observed_at":"2026-07-07T07:26:17.833366Z","submitted_at":"1996-07-18T19:12:42Z","title":"A Quantum Algorithm for Finding the Minimum","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/9607014","snapshot_observed_at":"2026-08-06T11:22:57.829026Z","title":"Approximate policy iteration: A survey and some new meth- ods","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2507.22854","last_updated":"2026-07-16T17:57:33Z","snapshot_observed_at":"2026-08-07T03:47:37.735545Z","submitted_at":"2025-07-30T17:24:23Z","title":"A Bit of Freedom Goes a Long Way: Classical and Quantum Algorithms for Reinforcement Learning under a Generative Model","version":3},"reference_index":1998,"source":"pdf_text","source_observed_at":"2026-08-06T11:22:57.829026Z"},"links":{"cited_paper":"/paper/quant-ph/9607014","citing_paper":"/paper/2507.22854"},"observation_digest":"sha256:48ee8df102d3d800498b8dc9030dc50e5999f486a265eb2727e9fa1091c33686","observation_id":"67e72fbd-9ef6-47f6-9b05-2f1f3fffb0e4","resolution":{"observed_at":"2026-08-06T11:22:57.829026Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.05456","last_updated":"2020-07-10T15:52:21Z","snapshot_observed_at":"2026-07-06T09:37:12.055152Z","submitted_at":"2020-07-10T15:52:21Z","title":"Improved Analysis of UCRL2 with Empirical Bernstein Inequality","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.05456","snapshot_observed_at":"2026-08-06T11:22:57.833805Z","title":"Tight regret bounds for model-based reinforcement learning with greedy policies","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.22854","last_updated":"2026-07-16T17:57:33Z","snapshot_observed_at":"2026-08-07T03:47:37.735545Z","submitted_at":"2025-07-30T17:24:23Z","title":"A Bit of Freedom Goes a Long Way: Classical and Quantum Algorithms for Reinforcement Learning under a Generative Model","version":3},"reference_index":2005,"source":"pdf_text","source_observed_at":"2026-08-06T11:22:57.833805Z"},"links":{"cited_paper":"/paper/2007.05456","citing_paper":"/paper/2507.22854"},"observation_digest":"sha256:f407e4a28e27e77a92589e820914d9504f3d636acb4ddd0bfc7b281acf87331e","observation_id":"18e15db9-9115-45ca-9938-caa8c5ed36a4","resolution":{"observed_at":"2026-08-06T11:22:57.833805Z","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-06T11:22:58.186115Z","title":"Minimax regret bounds for reinforcement learning","venue":null,"work_id":"7897388e-10bc-4eb7-8dab-32a8f2d5c941","year":null},"citing_paper":{"arxiv_id":"2507.22854","last_updated":"2026-07-16T17:57:33Z","snapshot_observed_at":"2026-08-07T03:47:37.735545Z","submitted_at":"2025-07-30T17:24:23Z","title":"A Bit of Freedom Goes a Long Way: Classical and Quantum Algorithms for Reinforcement Learning under a Generative Model","version":3},"reference_index":2006,"source":"pdf_text","source_observed_at":"2026-08-06T11:22:57.819860Z"},"links":{"citing_paper":"/paper/2507.22854"},"observation_digest":"sha256:16537689a0279aaa56b45a0cd978dc34432ef8f72f4894f0f58c8020013c0f9e","observation_id":"ab7710d8-836a-4d91-a4b9-2db33c708e67","resolution":{"observed_at":"2026-08-06T11:22:58.190660Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T11:22:58.200073Z","title":"Logarithmic online regret bounds for undiscounted reinforcement learning","venue":null,"work_id":"6af11b1e-cf0d-434f-a70a-13d5d3b86a2e","year":null},"citing_paper":{"arxiv_id":"2507.22854","last_updated":"2026-07-16T17:57:33Z","snapshot_observed_at":"2026-08-07T03:47:37.735545Z","submitted_at":"2025-07-30T17:24:23Z","title":"A Bit of Freedom Goes a Long Way: Classical and Quantum Algorithms for Reinforcement Learning under a Generative Model","version":3},"reference_index":2008,"source":"pdf_text","source_observed_at":"2026-08-06T11:22:57.815098Z"},"links":{"citing_paper":"/paper/2507.22854"},"observation_digest":"sha256:1fe3d3736f2592b5fffc26973e138fc7b8045bf34029b30e6257e361aac7ceec","observation_id":"e68d45e1-769e-4625-98ba-b3e184298ee1","resolution":{"observed_at":"2026-08-06T11:22:58.204202Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T11:22:58.213472Z","title":"Near-optimal regret bounds for reinforcement learning","venue":null,"work_id":"3d8be840-7606-4798-81fc-25c58844febc","year":null},"citing_paper":{"arxiv_id":"2507.22854","last_updated":"2026-07-16T17:57:33Z","snapshot_observed_at":"2026-08-07T03:47:37.735545Z","submitted_at":"2025-07-30T17:24:23Z","title":"A Bit of Freedom Goes a Long Way: Classical and Quantum Algorithms for Reinforcement Learning under a Generative Model","version":3},"reference_index":2012,"source":"pdf_text","source_observed_at":"2026-08-06T11:22:57.810526Z"},"links":{"citing_paper":"/paper/2507.22854"},"observation_digest":"sha256:b74fb6f79384856d718a8bf5d7778932311b24f0f5669137bac68e642b575294","observation_id":"fd105edd-8c00-41f0-9eea-5e0d78751993","resolution":{"observed_at":"2026-08-06T11:22:58.217846Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T11:22:58.141621Z","title":"Improved regret bounds for undiscounted continuous reinforcement learning","venue":null,"work_id":"50ee41f3-8d63-40a5-abb6-0d225d5f4ae4","year":2015},"citing_paper":{"arxiv_id":"2507.22854","last_updated":"2026-07-16T17:57:33Z","snapshot_observed_at":"2026-08-07T03:47:37.735545Z","submitted_at":"2025-07-30T17:24:23Z","title":"A Bit of Freedom Goes a Long Way: Classical and Quantum Algorithms for Reinforcement Learning under a Generative Model","version":3},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-06T11:22:57.852347Z"},"links":{"citing_paper":"/paper/2507.22854"},"observation_digest":"sha256:aadeb3755eda796973f8f9caab97126242de7f69cd7a360478b57d19eebf4c56","observation_id":"67ae80fc-2a13-42db-b016-b8c2233fdfb5","resolution":{"observed_at":"2026-08-06T11:22:58.146322Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T11:22:58.171180Z","title":"Quantum probability oracles & multidimensional amplitude estimation","venue":null,"work_id":"a05c774d-a204-471c-9f63-4578f6043b3f","year":2021},"citing_paper":{"arxiv_id":"2507.22854","last_updated":"2026-07-16T17:57:33Z","snapshot_observed_at":"2026-08-07T03:47:37.735545Z","submitted_at":"2025-07-30T17:24:23Z","title":"A Bit of Freedom Goes a Long Way: Classical and Quantum Algorithms for Reinforcement Learning under a Generative Model","version":3},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-06T11:22:57.824455Z"},"links":{"citing_paper":"/paper/2507.22854"},"observation_digest":"sha256:3989b7c414a5946f8cef157e71627655b9ee2c3d437ecf998571b6338b6144e9","observation_id":"fcb39ba7-a87b-49a5-835d-76a1daa5cb04","resolution":{"observed_at":"2026-08-06T11:22:58.176021Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T11:22:58.227580Z","title":"Dynamic policy programming","venue":null,"work_id":"fce6d357-8f05-4434-aee9-3652b08daa9f","year":null},"citing_paper":{"arxiv_id":"2507.22854","last_updated":"2026-07-16T17:57:33Z","snapshot_observed_at":"2026-08-07T03:47:37.735545Z","submitted_at":"2025-07-30T17:24:23Z","title":"A Bit of Freedom Goes a Long Way: Classical and Quantum Algorithms for Reinforcement Learning under a Generative Model","version":3},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-06T11:22:57.805142Z"},"links":{"citing_paper":"/paper/2507.22854"},"observation_digest":"sha256:88d7ec26dffdcff4201ec7377e1b53d1fb380c3ece943c47ff43d8ba0fa2df44","observation_id":"0556d1d9-6889-41e9-b3d4-aaf336d63979","resolution":{"observed_at":"2026-08-06T11:22:58.231651Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T11:22:58.156444Z","title":"Hernandez-Lerma","venue":null,"work_id":"0a52ebc7-a143-4ea1-a9de-0bd57b41b097","year":2001},"citing_paper":{"arxiv_id":"2507.22854","last_updated":"2026-07-16T17:57:33Z","snapshot_observed_at":"2026-08-07T03:47:37.735545Z","submitted_at":"2025-07-30T17:24:23Z","title":"A Bit of Freedom Goes a Long Way: Classical and Quantum Algorithms for Reinforcement Learning under a Generative Model","version":3},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-06T11:22:57.838527Z"},"links":{"citing_paper":"/paper/2507.22854"},"observation_digest":"sha256:52d183e518ca0be428ba3f9a0e93ecf72ba6fc1a6b21d0534f06342bc0244d0b","observation_id":"ed7c7f1b-2f63-4f6f-8943-36aa2379ada7","resolution":{"observed_at":"2026-08-06T11:22:58.160474Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2212.00603","last_updated":"2022-12-01T15:57:58Z","snapshot_observed_at":"2026-07-06T14:25:40.781383Z","submitted_at":"2022-12-01T15:57:58Z","title":"Near Sample-Optimal Reduction-based Policy Learning for Average Reward MDP","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.00603","snapshot_observed_at":"2026-08-06T11:22:57.865812Z","title":"Near sample-optimal reduction- based policy learning for average reward MDP","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.22854","last_updated":"2026-07-16T17:57:33Z","snapshot_observed_at":"2026-08-07T03:47:37.735545Z","submitted_at":"2025-07-30T17:24:23Z","title":"A Bit of Freedom Goes a Long Way: Classical and Quantum Algorithms for Reinforcement Learning under a Generative Model","version":3},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-06T11:22:57.865812Z"},"links":{"cited_paper":"/paper/2212.00603","citing_paper":"/paper/2507.22854"},"observation_digest":"sha256:15cabf0dbe44032afd009ae91e661dcb381ab214d792c7377f520dc9b23c9e4b","observation_id":"f54689f6-5d42-400b-a9bf-f0e1dfc99477","resolution":{"observed_at":"2026-08-06T11:22:57.865812Z","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-06T11:22:58.112757Z","title":"Interactive value iteration for Markov decision processes with unknown rewards","venue":null,"work_id":"edd35719-4083-4a26-8c4a-54812e615e35","year":2013},"citing_paper":{"arxiv_id":"2507.22854","last_updated":"2026-07-16T17:57:33Z","snapshot_observed_at":"2026-08-07T03:47:37.735545Z","submitted_at":"2025-07-30T17:24:23Z","title":"A Bit of Freedom Goes a Long Way: Classical and Quantum Algorithms for Reinforcement Learning under a Generative Model","version":3},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-06T11:22:57.870544Z"},"links":{"citing_paper":"/paper/2507.22854"},"observation_digest":"sha256:59a686fed127aafbb48d11a434c9a3690323aa5f70b0be2a54365d4707857866","observation_id":"b77448f8-06d7-44bd-b9a2-9dfae67d3fa4","resolution":{"observed_at":"2026-08-06T11:22:58.117270Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T11:22:58.127556Z","title":"Learn- ing infinite-horizon average-reward MDPs with linear function approximation","venue":null,"work_id":"5127e830-d53d-4f75-aabf-4d7ab29e2711","year":2021},"citing_paper":{"arxiv_id":"2507.22854","last_updated":"2026-07-16T17:57:33Z","snapshot_observed_at":"2026-08-07T03:47:37.735545Z","submitted_at":"2025-07-30T17:24:23Z","title":"A Bit of Freedom Goes a Long Way: Classical and Quantum Algorithms for Reinforcement Learning under a Generative Model","version":3},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-06T11:22:57.861761Z"},"links":{"citing_paper":"/paper/2507.22854"},"observation_digest":"sha256:b4dd3997e384a6559c8cc26c49b0781d79183adb549f0929e75c14bdf42f4012","observation_id":"f4f8c309-e9e0-4570-b2c3-ad3751b2b498","resolution":{"observed_at":"2026-08-06T11:22:58.131921Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-06T19:44:57.514581Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"cited_work":{"arxiv_id":"2507.04438","doi":null,"metadata_source":"pith","pith_arxiv_id":"2507.04438","snapshot_observed_at":"2026-08-06T11:22:57.926875Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","venue":"quant-ph","work_id":"e39e4709-a3cd-40c5-8b08-749897b4d802","year":2025},"citing_paper":{"arxiv_id":"2507.22854","last_updated":"2026-07-16T17:57:33Z","snapshot_observed_at":"2026-08-07T03:47:37.735545Z","submitted_at":"2025-07-30T17:24:23Z","title":"A Bit of Freedom Goes a Long Way: Classical and Quantum Algorithms for Reinforcement Learning under a Generative Model","version":3},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-06T11:22:57.856397Z"},"links":{"cited_paper":"/paper/2507.04438","citing_paper":"/paper/2507.22854"},"observation_digest":"sha256:c882cd56ab0befc355110b58533d7deacf183442aee73d0a2fd21a587ed3f084","observation_id":"87020556-fd2f-4104-b40c-d19aa609a1d4","resolution":{"observed_at":"2026-08-06T11:22:57.934217Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.22854","last_updated":"2026-07-16T17:57:33Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T03:47:37.735545Z","submitted_at":"2025-07-30T17:24:23Z","title":"A Bit of Freedom Goes a Long Way: Classical and Quantum Algorithms for Reinforcement Learning under a Generative Model"},"reference_resolution":{"displayed":16,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":1,"verified_fuzzy":10},"total_outbound_references":16},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 16 of 16 outbound references and 0 inbound Pith citation observations for arXiv:2507.22854."}