{"as_of":"2026-08-08T17:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:aa0d9001140e2560751af78ee76d7bf9d30d7d6921e56486811797245686e183","coverage":[{"denominator":22,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":22,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:36:23.070508Z","state":"measured"},{"denominator":24,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":24,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-21T19:15:30.759880Z","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-21T19:20:31.176550Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.14564","last_updated":"2025-05-20T16:24:42Z","snapshot_observed_at":"2026-08-07T15:29:53.634370Z","submitted_at":"2025-05-20T16:24:42Z","title":"Bellman operator convergence enhancements in reinforcement learning algorithms","version":1},"cited_work":{"arxiv_id":"2505.14564","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.14564","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Bellman operator convergence enhancements in reinforcement learning algorithms","venue":null,"work_id":"ddbcce18-393b-44bd-8db5-d8b055f3f278","year":2025},"citing_paper":{"arxiv_id":"2511.18240","last_updated":"2026-05-19T21:00:33Z","snapshot_observed_at":"2026-08-05T01:03:21.251938Z","submitted_at":"2025-11-23T00:59:27Z","title":"Carbon-Aware Intrusion Detection: A Comparative Study of Supervised and Unsupervised DRL for Sustainable IoT Edge Gateways","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-21T19:15:30.759880Z"},"links":{"cited_paper":"/paper/2505.14564","citing_paper":"/paper/2511.18240"},"observation_digest":"sha256:f8fbfe7cb7c3f2769c36eb617fc508329022e2a3c7caeea771ff83763b08d065","observation_id":"5e064f49-fe9c-44bf-a386-8cd8c3911954","resolution":{"observed_at":"2026-05-21T19:20:31.178252Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.14564","last_updated":"2025-05-20T16:24:42Z","snapshot_observed_at":"2026-08-07T15:29:53.634370Z","submitted_at":"2025-05-20T16:24:42Z","title":"Bellman operator convergence enhancements in reinforcement learning algorithms","version":1},"cited_work":{"arxiv_id":"2505.14564","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.14564","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Bellman operator convergence enhancements in reinforcement learning algorithms","venue":null,"work_id":"ddbcce18-393b-44bd-8db5-d8b055f3f278","year":2025},"citing_paper":{"arxiv_id":"2605.18979","last_updated":"2026-05-18T18:03:05Z","snapshot_observed_at":"2026-07-06T23:29:47.081347Z","submitted_at":"2026-05-18T18:03:05Z","title":"TabQL: In-Context Q-Learning with Tabular Foundation Models","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-20T12:34:58.734670Z"},"links":{"cited_paper":"/paper/2505.14564","citing_paper":"/paper/2605.18979"},"observation_digest":"sha256:cd1f8628a6c786583cc5df4e2e3b3e9d521e8360c57a56c69ecba4b808db4b8b","observation_id":"92b1a724-e897-400f-b5a6-3aec6e20797d","resolution":{"observed_at":"2026-05-20T12:38:16.878324Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.14564/citation-record","integrity":"/paper/2505.14564/integrity","json":"/paper/2505.14564/citation-record.json","paper":"/paper/2505.14564"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:36:25.988033Z","title":"Accessed on 13/03/2024","venue":null,"work_id":"24f6a77d-3e7d-403a-8f4e-27ab9a70cb17","year":2021},"citing_paper":{"arxiv_id":"2505.14564","last_updated":"2025-05-20T16:24:42Z","snapshot_observed_at":"2026-08-07T15:29:53.634370Z","submitted_at":"2025-05-20T16:24:42Z","title":"Bellman operator convergence enhancements in reinforcement learning algorithms","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T15:36:21.194203Z"},"links":{"citing_paper":"/paper/2505.14564"},"observation_digest":"sha256:a1571ae2e28eee958eb5d9e8585cd8a3fcdf32aab25bab7d7f26e73625f02900","observation_id":"97971769-4e0c-44b1-aa2e-c90c255db885","resolution":{"observed_at":"2026-08-07T15:36:26.040351Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:36:21.276599Z","title":"An alternative softmax operator for reinforcement learning","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.14564","last_updated":"2025-05-20T16:24:42Z","snapshot_observed_at":"2026-08-07T15:29:53.634370Z","submitted_at":"2025-05-20T16:24:42Z","title":"Bellman operator convergence enhancements in reinforcement learning algorithms","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T15:36:21.276599Z"},"links":{"citing_paper":"/paper/2505.14564"},"observation_digest":"sha256:a2ccf9b388e23847110ece60dd27155fb6ff56b51d7194e6231256ed60b78805","observation_id":"88a77697-2960-4bfc-a9da-32b850b2e55e","resolution":{"observed_at":"2026-08-07T15:36:21.276599Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1804.07193","last_updated":"2018-07-27T12:40:44Z","snapshot_observed_at":"2026-07-06T06:34:19.449844Z","submitted_at":"2018-04-19T14:29:41Z","title":"Lipschitz Continuity in Model-based Reinforcement Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1804.07193","snapshot_observed_at":"2026-08-07T15:36:21.402923Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.14564","last_updated":"2025-05-20T16:24:42Z","snapshot_observed_at":"2026-08-07T15:29:53.634370Z","submitted_at":"2025-05-20T16:24:42Z","title":"Bellman operator convergence enhancements in reinforcement learning algorithms","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T15:36:21.402923Z"},"links":{"cited_paper":"/paper/1804.07193","citing_paper":"/paper/2505.14564"},"observation_digest":"sha256:8ff622459d527b89d3c508c8c766f0d6c63e5d46f218c6988cdb6b060720bd8f","observation_id":"22af8a4b-41b4-401c-b211-b638843799b6","resolution":{"observed_at":"2026-08-07T15:36:21.402923Z","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-07T15:36:25.902300Z","title":"Speedy q-learning","venue":null,"work_id":"1fa9d8dc-cf58-4be6-ab0e-eaf3b4712f40","year":2011},"citing_paper":{"arxiv_id":"2505.14564","last_updated":"2025-05-20T16:24:42Z","snapshot_observed_at":"2026-08-07T15:29:53.634370Z","submitted_at":"2025-05-20T16:24:42Z","title":"Bellman operator convergence enhancements in reinforcement learning algorithms","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T15:36:21.519597Z"},"links":{"citing_paper":"/paper/2505.14564"},"observation_digest":"sha256:4633241a8428b172d3241f0f839cf50c8b7b8ab6b88360cfbc3d501791236d99","observation_id":"30701fa9-700d-44a8-a382-4029391ac28f","resolution":{"observed_at":"2026-08-07T15:36:25.931030Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:36:25.747590Z","title":"Neuronlike adaptive elements that can solve difficult learning control problems.IEEE transactions on systems, man, and cybernetics, (5):834–846, 1983","venue":null,"work_id":"15fd610f-b2ec-436c-9764-1a251beab0d4","year":1983},"citing_paper":{"arxiv_id":"2505.14564","last_updated":"2025-05-20T16:24:42Z","snapshot_observed_at":"2026-08-07T15:29:53.634370Z","submitted_at":"2025-05-20T16:24:42Z","title":"Bellman operator convergence enhancements in reinforcement learning algorithms","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T15:36:21.610842Z"},"links":{"citing_paper":"/paper/2505.14564"},"observation_digest":"sha256:bea87a839c028f9a23033c4baf387a057d3db849dadcf83bbef4315ec47475f9","observation_id":"c70850de-13a6-4feb-9af8-4da18a2eeeb7","resolution":{"observed_at":"2026-08-07T15:36:25.847166Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:36:25.656664Z","title":"Increasing the action gap: New operators for reinforcement learning","venue":null,"work_id":"7ec52247-8f26-4417-8f48-b0b396b7a714","year":2016},"citing_paper":{"arxiv_id":"2505.14564","last_updated":"2025-05-20T16:24:42Z","snapshot_observed_at":"2026-08-07T15:29:53.634370Z","submitted_at":"2025-05-20T16:24:42Z","title":"Bellman operator convergence enhancements in reinforcement learning algorithms","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T15:36:21.749774Z"},"links":{"citing_paper":"/paper/2505.14564"},"observation_digest":"sha256:0cd7e2f2cdf2bdd3d1e5f3730290a89eaab15a423aba6734c50b69678ba5f6ad","observation_id":"385bb917-34a3-4712-8395-c5d0f5b6d3d3","resolution":{"observed_at":"2026-08-07T15:36:25.694636Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:36:25.492866Z","title":"Q-learning and enhanced policy iteration in discounted dynamic programming","venue":null,"work_id":"c55fb833-715b-477f-a2be-3664afdd183b","year":2012},"citing_paper":{"arxiv_id":"2505.14564","last_updated":"2025-05-20T16:24:42Z","snapshot_observed_at":"2026-08-07T15:29:53.634370Z","submitted_at":"2025-05-20T16:24:42Z","title":"Bellman operator convergence enhancements in reinforcement learning algorithms","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T15:36:21.837142Z"},"links":{"citing_paper":"/paper/2505.14564"},"observation_digest":"sha256:26508388a50fa6302c49f27dd7a2125f4b21d036dfa54fd9c0d5cccf75a6df45","observation_id":"5dc4b47a-a18f-475e-a079-cbee99a440f0","resolution":{"observed_at":"2026-08-07T15:36:25.575426Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1901.11524","last_updated":"2019-05-15T18:22:34Z","snapshot_observed_at":"2026-07-06T07:30:23.639913Z","submitted_at":"2019-01-31T18:45:04Z","title":"The Value Function Polytope in Reinforcement Learning","version":3},"cited_work":{"arxiv_id":"1901.11524","doi":null,"metadata_source":"pith","pith_arxiv_id":"1901.11524","snapshot_observed_at":"2026-08-07T15:36:23.919088Z","title":"The Value Function Polytope in Reinforcement Learning","venue":"cs.LG","work_id":"578d124f-9e52-4e70-ac3e-f1d87b237fbf","year":2019},"citing_paper":{"arxiv_id":"2505.14564","last_updated":"2025-05-20T16:24:42Z","snapshot_observed_at":"2026-08-07T15:29:53.634370Z","submitted_at":"2025-05-20T16:24:42Z","title":"Bellman operator convergence enhancements in reinforcement learning algorithms","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T15:36:21.874040Z"},"links":{"cited_paper":"/paper/1901.11524","citing_paper":"/paper/2505.14564"},"observation_digest":"sha256:603f0f08dc8a89695f0bad4fbe342031f0b08428e9f47dc05390591a28bdd36e","observation_id":"ee427491-64a4-4073-bbf6-1bbd0e756822","resolution":{"observed_at":"2026-08-07T15:36:23.995209Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:36:25.367979Z","title":"Addison-Wesley Professional, 2019","venue":null,"work_id":"67ea2403-252e-4424-b898-a057def462a0","year":2019},"citing_paper":{"arxiv_id":"2505.14564","last_updated":"2025-05-20T16:24:42Z","snapshot_observed_at":"2026-08-07T15:29:53.634370Z","submitted_at":"2025-05-20T16:24:42Z","title":"Bellman operator convergence enhancements in reinforcement learning algorithms","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T15:36:22.015595Z"},"links":{"citing_paper":"/paper/2505.14564"},"observation_digest":"sha256:da3ed05dec971569a954e662ac5b43f9d07a8ecb0f1b166de968081c242012f9","observation_id":"3396a85f-3cab-412a-ba59-edf573264ac2","resolution":{"observed_at":"2026-08-07T15:36:25.443561Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.03706","last_updated":"2024-09-25T21:21:23Z","snapshot_observed_at":"2026-07-06T19:28:01.764884Z","submitted_at":"2024-09-25T21:21:23Z","title":"Topological Foundations of Reinforcement Learning","version":1},"cited_work":{"arxiv_id":"2410.03706","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.03706","snapshot_observed_at":"2026-08-07T15:36:23.580815Z","title":"Topological Foundations of Reinforcement Learning","venue":"cs.LG","work_id":"f97ad728-2a91-4c17-9169-dffc6f89e326","year":2024},"citing_paper":{"arxiv_id":"2505.14564","last_updated":"2025-05-20T16:24:42Z","snapshot_observed_at":"2026-08-07T15:29:53.634370Z","submitted_at":"2025-05-20T16:24:42Z","title":"Bellman operator convergence enhancements in reinforcement learning algorithms","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T15:36:22.146406Z"},"links":{"cited_paper":"/paper/2410.03706","citing_paper":"/paper/2505.14564"},"observation_digest":"sha256:706071d39d057c958b111997dc49b2eac3bfc6d54cd576e9acefdfd6ad9e4658","observation_id":"077553d5-df00-491a-93ba-764231b43acd","resolution":{"observed_at":"2026-08-07T15:36:23.723956Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:36:25.220431Z","title":"Reinforcement learning essay (aims-cameroon)","venue":null,"work_id":"b3173577-7c03-4a20-867d-b2183a96686f","year":2023},"citing_paper":{"arxiv_id":"2505.14564","last_updated":"2025-05-20T16:24:42Z","snapshot_observed_at":"2026-08-07T15:29:53.634370Z","submitted_at":"2025-05-20T16:24:42Z","title":"Bellman operator convergence enhancements in reinforcement learning algorithms","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T15:36:22.248741Z"},"links":{"citing_paper":"/paper/2505.14564"},"observation_digest":"sha256:ca46c5dee98d988ceb2f6cbfe4796a8cae9e46d9b467829c04d12836a77ea44c","observation_id":"94e157b0-8bd1-4747-a679-eb98229684e7","resolution":{"observed_at":"2026-08-07T15:36:25.283575Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2102.01514","last_updated":"2021-02-02T14:30:41Z","snapshot_observed_at":"2026-08-04T18:27:47.273217Z","submitted_at":"2021-02-02T14:30:41Z","title":"Metrics and continuity in reinforcement learning","version":1},"cited_work":{"arxiv_id":"2102.01514","doi":null,"metadata_source":"pith","pith_arxiv_id":"2102.01514","snapshot_observed_at":"2026-08-07T15:36:23.357000Z","title":"Metrics and continuity in reinforcement learning","venue":"cs.LG","work_id":"3d92326d-c95d-4822-a83f-2946614c1a3f","year":2021},"citing_paper":{"arxiv_id":"2505.14564","last_updated":"2025-05-20T16:24:42Z","snapshot_observed_at":"2026-08-07T15:29:53.634370Z","submitted_at":"2025-05-20T16:24:42Z","title":"Bellman operator convergence enhancements in reinforcement learning algorithms","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T15:36:22.336319Z"},"links":{"cited_paper":"/paper/2102.01514","citing_paper":"/paper/2505.14564"},"observation_digest":"sha256:5cc7b47a020c4c5824d75c5672f27855662899c7210f6922a55f3505fffd74b0","observation_id":"12ddeb6d-a788-43bb-b167-c188ddef1d34","resolution":{"observed_at":"2026-08-07T15:36:23.456679Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:36:25.072255Z","title":"Markov decision processes and dynamic programming, 2013","venue":null,"work_id":"18488bd2-362c-4a8d-9934-3ba278d6a021","year":2013},"citing_paper":{"arxiv_id":"2505.14564","last_updated":"2025-05-20T16:24:42Z","snapshot_observed_at":"2026-08-07T15:29:53.634370Z","submitted_at":"2025-05-20T16:24:42Z","title":"Bellman operator convergence enhancements in reinforcement learning algorithms","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T15:36:22.421040Z"},"links":{"citing_paper":"/paper/2505.14564"},"observation_digest":"sha256:ed231aa48c51af2bdbb490403c8693c7dadbe8ab43f9deb17cd5b06807ff4bc7","observation_id":"47ff5210-c516-4a95-be5e-bd0fa24ae701","resolution":{"observed_at":"2026-08-07T15:36:25.162287Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1805.08122","last_updated":"2019-05-28T17:15:42Z","snapshot_observed_at":"2026-07-06T06:40:19.652047Z","submitted_at":"2018-05-21T15:30:54Z","title":"A General Family of Robust Stochastic Operators for Reinforcement Learning","version":2},"cited_work":{"arxiv_id":"1805.08122","doi":null,"metadata_source":"pith","pith_arxiv_id":"1805.08122","snapshot_observed_at":"2026-08-07T15:36:23.170081Z","title":"A General Family of Robust Stochastic Operators for Reinforcement Learning","venue":"stat.ML","work_id":"cad14a2a-966d-4166-bfef-b0ce8fc1ff2d","year":2018},"citing_paper":{"arxiv_id":"2505.14564","last_updated":"2025-05-20T16:24:42Z","snapshot_observed_at":"2026-08-07T15:29:53.634370Z","submitted_at":"2025-05-20T16:24:42Z","title":"Bellman operator convergence enhancements in reinforcement learning algorithms","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T15:36:22.530164Z"},"links":{"cited_paper":"/paper/1805.08122","citing_paper":"/paper/2505.14564"},"observation_digest":"sha256:9ba9524786b89952bed02f39a1d396d09e6f94ee6b418cb04294cedde9b34515","observation_id":"3e58590e-34a4-433b-8663-793648d0ee5d","resolution":{"observed_at":"2026-08-07T15:36:23.221020Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:36:24.930891Z","title":"Efficient memory-based learning for robot control","venue":null,"work_id":"8dcf0b5e-f426-4cd2-a173-a9fa9c70cb77","year":1990},"citing_paper":{"arxiv_id":"2505.14564","last_updated":"2025-05-20T16:24:42Z","snapshot_observed_at":"2026-08-07T15:29:53.634370Z","submitted_at":"2025-05-20T16:24:42Z","title":"Bellman operator convergence enhancements in reinforcement learning algorithms","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T15:36:22.608027Z"},"links":{"citing_paper":"/paper/2505.14564"},"observation_digest":"sha256:5ec9e2d3b0e32654db1566f777e76f7cda65a0fc1e711187dd3938403dbbcbaf","observation_id":"83833abb-6141-4a9d-ac0f-03679beb8b2e","resolution":{"observed_at":"2026-08-07T15:36:24.998711Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:36:24.784391Z","title":"John Wiley & Sons, 2013","venue":null,"work_id":"8566b459-275b-46cd-83c5-2347d6c3c3a0","year":2013},"citing_paper":{"arxiv_id":"2505.14564","last_updated":"2025-05-20T16:24:42Z","snapshot_observed_at":"2026-08-07T15:29:53.634370Z","submitted_at":"2025-05-20T16:24:42Z","title":"Bellman operator convergence enhancements in reinforcement learning algorithms","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T15:36:22.685167Z"},"links":{"citing_paper":"/paper/2505.14564"},"observation_digest":"sha256:8d2b2e4e1a840c2c555e241a6e1b9d3b9d046e51c5f519a1e63a77de00399b29","observation_id":"a2041a33-4389-44b0-b9f4-c833db4bdcbf","resolution":{"observed_at":"2026-08-07T15:36:24.857823Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.00475","last_updated":"2019-05-01T20:10:24Z","snapshot_observed_at":"2026-08-04T17:32:02.940135Z","submitted_at":"2019-05-01T20:10:24Z","title":"Efficient Model-free Reinforcement Learning in Metric Spaces","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.00475","snapshot_observed_at":"2026-08-07T15:36:22.717341Z","title":"Efficient model-free reinforcement learning in metric spaces.CoRR, abs/1905.00475, 2019","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2505.14564","last_updated":"2025-05-20T16:24:42Z","snapshot_observed_at":"2026-08-07T15:29:53.634370Z","submitted_at":"2025-05-20T16:24:42Z","title":"Bellman operator convergence enhancements in reinforcement learning algorithms","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T15:36:22.717341Z"},"links":{"cited_paper":"/paper/1905.00475","citing_paper":"/paper/2505.14564"},"observation_digest":"sha256:23f1607d080bb7a4cf2e0cbf6e356b7e0324cc7f8c7cb6d169ee2d7587a9a1ed","observation_id":"ef987062-9d92-4e6a-bf8b-2526c97377cb","resolution":{"observed_at":"2026-08-07T15:36:22.717341Z","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-07T15:36:22.778518Z","title":"Generalization in reinforcement learning: Successful examples using sparse coarse coding.Advances in neural information processing systems, 8, 1995","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2505.14564","last_updated":"2025-05-20T16:24:42Z","snapshot_observed_at":"2026-08-07T15:29:53.634370Z","submitted_at":"2025-05-20T16:24:42Z","title":"Bellman operator convergence enhancements in reinforcement learning algorithms","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T15:36:22.778518Z"},"links":{"citing_paper":"/paper/2505.14564"},"observation_digest":"sha256:8df6a1d07cd565fc582e24b04c594cc61ecd6eb77364226e8008381e524cc281","observation_id":"604ee969-6e6f-4f26-b1d7-2859d4bf060b","resolution":{"observed_at":"2026-08-07T15:36:22.778518Z","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-07T15:36:22.839696Z","title":"MIT press, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.14564","last_updated":"2025-05-20T16:24:42Z","snapshot_observed_at":"2026-08-07T15:29:53.634370Z","submitted_at":"2025-05-20T16:24:42Z","title":"Bellman operator convergence enhancements in reinforcement learning algorithms","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T15:36:22.839696Z"},"links":{"citing_paper":"/paper/2505.14564"},"observation_digest":"sha256:ca078aa80cde34c4377583bc4d8d8a967e138f758cfc6b6a415beaea2da969f2","observation_id":"e5dc5b02-45a1-42f9-9128-f1da5c38c23c","resolution":{"observed_at":"2026-08-07T15:36:22.839696Z","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-07T15:36:24.630442Z","title":"Nova Science Publishers, New York, 2021","venue":null,"work_id":"cd595974-7e58-4328-95f6-c7353f04ea6d","year":2021},"citing_paper":{"arxiv_id":"2505.14564","last_updated":"2025-05-20T16:24:42Z","snapshot_observed_at":"2026-08-07T15:29:53.634370Z","submitted_at":"2025-05-20T16:24:42Z","title":"Bellman operator convergence enhancements in reinforcement learning algorithms","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T15:36:22.874997Z"},"links":{"citing_paper":"/paper/2505.14564"},"observation_digest":"sha256:cff409bcd0d17db9374b3783aa7f7779eb7b87e35d8a34bc4ebb8045bd9c8fe3","observation_id":"4633efd3-8bb1-47ae-95f3-7945135c3b9e","resolution":{"observed_at":"2026-08-07T15:36:24.689116Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:36:24.411433Z","title":"Github : Basic Reinforcement Learning","venue":null,"work_id":"7dad711f-706a-4dd6-ace0-a4bab6fa1f6e","year":2024},"citing_paper":{"arxiv_id":"2505.14564","last_updated":"2025-05-20T16:24:42Z","snapshot_observed_at":"2026-08-07T15:29:53.634370Z","submitted_at":"2025-05-20T16:24:42Z","title":"Bellman operator convergence enhancements in reinforcement learning algorithms","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T15:36:22.981197Z"},"links":{"citing_paper":"/paper/2505.14564"},"observation_digest":"sha256:1ee32e228ebaf4503583d4459e5df6a98ef65e83c434ee332f1346cc75f72b9f","observation_id":"024b3833-47fe-415b-b7c1-5109dbabce50","resolution":{"observed_at":"2026-08-07T15:36:24.580346Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:36:24.125515Z","title":"Learning from delayed rewards","venue":null,"work_id":"f04f4004-2385-46ba-8f93-a6ff567dd894","year":1989},"citing_paper":{"arxiv_id":"2505.14564","last_updated":"2025-05-20T16:24:42Z","snapshot_observed_at":"2026-08-07T15:29:53.634370Z","submitted_at":"2025-05-20T16:24:42Z","title":"Bellman operator convergence enhancements in reinforcement learning algorithms","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T15:36:23.070508Z"},"links":{"citing_paper":"/paper/2505.14564"},"observation_digest":"sha256:014e4af4a7ad6176d1dfa42c352e9aa4f32d918d4601dc2ef0fd90498571830d","observation_id":"31244681-40c7-4d4d-af3f-5c18478d4b53","resolution":{"observed_at":"2026-08-07T15:36:24.241206Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.14564","last_updated":"2025-05-20T16:24:42Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T15:29:53.634370Z","submitted_at":"2025-05-20T16:24:42Z","title":"Bellman operator convergence enhancements in reinforcement learning algorithms"},"reference_resolution":{"displayed":22,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":5,"verified_exact":3,"verified_fuzzy":13},"total_outbound_references":22},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 22 of 22 outbound references and 2 inbound Pith citation observations for arXiv:2505.14564."}