{"as_of":"2026-08-19T23:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:49ad5c920d781a1d432c869a587516b76fc0c3e38c160dbb5d061f78776b4e2a","coverage":[{"denominator":30,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":30,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-10T15:54:48.026121Z","state":"measured"},{"denominator":30,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":30,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+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/2607.07893/citation-record","integrity":"/paper/2607.07893/integrity","json":"/paper/2607.07893/citation-record.json","paper":"/paper/2607.07893"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T15:57:20.883869Z","title":"Akametalu, Shromona Ghosh, Jaime F","venue":null,"work_id":"8914721a-f8f7-45d4-b89c-870bb59aa784","year":2024},"citing_paper":{"arxiv_id":"2607.07893","last_updated":"2026-07-08T20:04:46Z","snapshot_observed_at":"2026-08-19T14:51:08.169922Z","submitted_at":"2026-07-08T20:04:46Z","title":"Reachability-Preserving Bellman Operator for the Discounted Reach-Cost Value Function: Uniting Hamilton-Jacobi Reachability and Reinforcement Learning","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-10T15:54:48.026121Z"},"links":{"citing_paper":"/paper/2607.07893"},"observation_digest":"sha256:08187fdf892a8ec038f408b1f64fac5b258ee129443a44e575026f294d8da7e1","observation_id":"a63fd0b9-ceb1-4cd8-9168-472d87bc402c","resolution":{"observed_at":"2026-07-10T15:57:20.885073Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T15:57:20.844909Z","title":"Learning dexterous in-hand manipulation.The International Journal of Robotics Research, 39(1):3– 20, 2020","venue":null,"work_id":"f450c2bb-9e19-4527-aa63-cae9f9d86081","year":2020},"citing_paper":{"arxiv_id":"2607.07893","last_updated":"2026-07-08T20:04:46Z","snapshot_observed_at":"2026-08-19T14:51:08.169922Z","submitted_at":"2026-07-08T20:04:46Z","title":"Reachability-Preserving Bellman Operator for the Discounted Reach-Cost Value Function: Uniting Hamilton-Jacobi Reachability and Reinforcement Learning","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-10T15:54:48.026121Z"},"links":{"citing_paper":"/paper/2607.07893"},"observation_digest":"sha256:ab53c26ddc43fb787a1868e253b3100202c02926422915f362139246f4aea523","observation_id":"5bb8a948-0d0d-4444-ba9a-35109cce95cf","resolution":{"observed_at":"2026-07-10T15:57:20.846293Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T15:57:20.866137Z","title":"Hamilton- jacobi reachability: A brief overview and recent advances","venue":null,"work_id":"fd33ae44-3f3f-4d84-86cc-a5e075678057","year":null},"citing_paper":{"arxiv_id":"2607.07893","last_updated":"2026-07-08T20:04:46Z","snapshot_observed_at":"2026-08-19T14:51:08.169922Z","submitted_at":"2026-07-08T20:04:46Z","title":"Reachability-Preserving Bellman Operator for the Discounted Reach-Cost Value Function: Uniting Hamilton-Jacobi Reachability and Reinforcement Learning","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-10T15:54:48.026121Z"},"links":{"citing_paper":"/paper/2607.07893"},"observation_digest":"sha256:2aab6a00f800a72e5d9aac7562c8a1e8a49d122a818399c3b9138bf1c2a9a4c3","observation_id":"b0e89efa-db7d-41b3-beac-e6f0d1b89a9a","resolution":{"observed_at":"2026-07-10T15:57:20.867588Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T15:57:20.842854Z","title":"Deepreach: A deep learning approach to high-dimensional reachability","venue":null,"work_id":"ba3a8c69-8694-40c4-8d52-f9a28804f016","year":2021},"citing_paper":{"arxiv_id":"2607.07893","last_updated":"2026-07-08T20:04:46Z","snapshot_observed_at":"2026-08-19T14:51:08.169922Z","submitted_at":"2026-07-08T20:04:46Z","title":"Reachability-Preserving Bellman Operator for the Discounted Reach-Cost Value Function: Uniting Hamilton-Jacobi Reachability and Reinforcement Learning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-10T15:54:48.026121Z"},"links":{"citing_paper":"/paper/2607.07893"},"observation_digest":"sha256:bfac3c1e446c1ed89ca6da4c472db6260a063a2d63f6f953f64615ab051dd555","observation_id":"b1f33a20-c3fa-4d80-951a-fc46688b3622","resolution":{"observed_at":"2026-07-10T15:57:20.844307Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T15:57:20.846840Z","title":"Springer","venue":null,"work_id":"b1788f54-3fde-4d2f-8f18-68a6560f9861","year":1997},"citing_paper":{"arxiv_id":"2607.07893","last_updated":"2026-07-08T20:04:46Z","snapshot_observed_at":"2026-08-19T14:51:08.169922Z","submitted_at":"2026-07-08T20:04:46Z","title":"Reachability-Preserving Bellman Operator for the Discounted Reach-Cost Value Function: Uniting Hamilton-Jacobi Reachability and Reinforcement Learning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-10T15:54:48.026121Z"},"links":{"citing_paper":"/paper/2607.07893"},"observation_digest":"sha256:60786320a4fae66afbe3939d67cdb228b0fdf1a197cb69d92cee08ab75ef113f","observation_id":"fabb5a72-80a5-46b2-a728-7b3da82aedfb","resolution":{"observed_at":"2026-07-10T15:57:20.848228Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T15:57:20.872300Z","title":"Bertsekas and John N","venue":null,"work_id":"04bc9f22-682e-44eb-981d-8b06f9377a17","year":1996},"citing_paper":{"arxiv_id":"2607.07893","last_updated":"2026-07-08T20:04:46Z","snapshot_observed_at":"2026-08-19T14:51:08.169922Z","submitted_at":"2026-07-08T20:04:46Z","title":"Reachability-Preserving Bellman Operator for the Discounted Reach-Cost Value Function: Uniting Hamilton-Jacobi Reachability and Reinforcement Learning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-10T15:54:48.026121Z"},"links":{"citing_paper":"/paper/2607.07893"},"observation_digest":"sha256:ad640630410bc88a0bee3f7fe851b68c49b5be35a180ecec45568ceace232a68","observation_id":"8aae9330-fe1d-4e36-a7f8-2d580b87c48f","resolution":{"observed_at":"2026-07-10T15:57:20.873456Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T15:57:20.864279Z","title":"Robust control barrier–value functions for safety- critical control","venue":null,"work_id":"8f962bb9-c3f9-4343-9b06-eac54124f979","year":2021},"citing_paper":{"arxiv_id":"2607.07893","last_updated":"2026-07-08T20:04:46Z","snapshot_observed_at":"2026-08-19T14:51:08.169922Z","submitted_at":"2026-07-08T20:04:46Z","title":"Reachability-Preserving Bellman Operator for the Discounted Reach-Cost Value Function: Uniting Hamilton-Jacobi Reachability and Reinforcement Learning","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-10T15:54:48.026121Z"},"links":{"citing_paper":"/paper/2607.07893"},"observation_digest":"sha256:6e50b69138916c096efb3953b105887e3373ff677d28e8b9d9c8db80bf59f321","observation_id":"d4402c54-4967-4aef-a21a-a165e6dc0dad","resolution":{"observed_at":"2026-07-10T15:57:20.865540Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T15:57:20.862364Z","title":null,"venue":null,"work_id":"f008a33a-7793-4f2d-9ffb-0c23eba857f6","year":2016},"citing_paper":{"arxiv_id":"2607.07893","last_updated":"2026-07-08T20:04:46Z","snapshot_observed_at":"2026-08-19T14:51:08.169922Z","submitted_at":"2026-07-08T20:04:46Z","title":"Reachability-Preserving Bellman Operator for the Discounted Reach-Cost Value Function: Uniting Hamilton-Jacobi Reachability and Reinforcement Learning","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-10T15:54:48.026121Z"},"links":{"citing_paper":"/paper/2607.07893"},"observation_digest":"sha256:cda5aa04453b7f19d652b161f76612e3cb1eb9bab4977d03735b6cbe5b854713","observation_id":"3ecc579e-21d8-47bb-8343-e04ce67b8302","resolution":{"observed_at":"2026-07-10T15:57:20.863607Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T15:57:20.838797Z","title":"Magnetic control of tokamak plasmas through deep reinforcement learning.Nature, 602(7897):414– 419, 2022","venue":null,"work_id":"63ecf316-d15d-4ba2-84b6-9fff6fdcf6f9","year":2022},"citing_paper":{"arxiv_id":"2607.07893","last_updated":"2026-07-08T20:04:46Z","snapshot_observed_at":"2026-08-19T14:51:08.169922Z","submitted_at":"2026-07-08T20:04:46Z","title":"Reachability-Preserving Bellman Operator for the Discounted Reach-Cost Value Function: Uniting Hamilton-Jacobi Reachability and Reinforcement Learning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-10T15:54:48.026121Z"},"links":{"citing_paper":"/paper/2607.07893"},"observation_digest":"sha256:cd50cead9b21da0ecb1d09b5bd943df9eb475da1396942fd402ad3d09d6a191f","observation_id":"ca7ab78d-0037-4261-b7eb-68d3c442246f","resolution":{"observed_at":"2026-07-10T15:57:20.840103Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T15:57:20.860565Z","title":"Bridging hamilton-jacobi safety analysis and reinforcement learning","venue":null,"work_id":"3ae0177e-7d54-48b8-9668-5a2e7da9ea21","year":2019},"citing_paper":{"arxiv_id":"2607.07893","last_updated":"2026-07-08T20:04:46Z","snapshot_observed_at":"2026-08-19T14:51:08.169922Z","submitted_at":"2026-07-08T20:04:46Z","title":"Reachability-Preserving Bellman Operator for the Discounted Reach-Cost Value Function: Uniting Hamilton-Jacobi Reachability and Reinforcement Learning","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-10T15:54:48.026121Z"},"links":{"citing_paper":"/paper/2607.07893"},"observation_digest":"sha256:b67b7320ec8c17895ebaa8c7585c0931bb8fbf2c2cdf5d81bf1903a3440b3e5f","observation_id":"7ca5bcf0-a5b0-4c3b-be67-98de4c4325f0","resolution":{"observed_at":"2026-07-10T15:57:20.861791Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T15:57:20.882070Z","title":"Hamilton-jacobi reachability estimation in reinforcement learning","venue":null,"work_id":"656e8b70-3d62-46cb-a3f9-a857295e7b41","year":2024},"citing_paper":{"arxiv_id":"2607.07893","last_updated":"2026-07-08T20:04:46Z","snapshot_observed_at":"2026-08-19T14:51:08.169922Z","submitted_at":"2026-07-08T20:04:46Z","title":"Reachability-Preserving Bellman Operator for the Discounted Reach-Cost Value Function: Uniting Hamilton-Jacobi Reachability and Reinforcement Learning","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-10T15:54:48.026121Z"},"links":{"citing_paper":"/paper/2607.07893"},"observation_digest":"sha256:b6d81eb1ffad068bde7693ee35c0eaf6b5718129e9220bd31605702bad593063","observation_id":"7c15492b-3b49-43a8-8922-c7d046c5623f","resolution":{"observed_at":"2026-07-10T15:57:20.883268Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T15:57:20.885621Z","title":"Hamilton-jacobi reachability in reinforcement learning: A survey.IEEE Open Journal of Control Systems, 3:310–324, 2024","venue":null,"work_id":"f87741b1-27f1-47ba-ba10-f4f591774bf2","year":2024},"citing_paper":{"arxiv_id":"2607.07893","last_updated":"2026-07-08T20:04:46Z","snapshot_observed_at":"2026-08-19T14:51:08.169922Z","submitted_at":"2026-07-08T20:04:46Z","title":"Reachability-Preserving Bellman Operator for the Discounted Reach-Cost Value Function: Uniting Hamilton-Jacobi Reachability and Reinforcement Learning","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-10T15:54:48.026121Z"},"links":{"citing_paper":"/paper/2607.07893"},"observation_digest":"sha256:c8ccb90a18e3809451f01a225aaafeade083def8f18e5d309a628f7331b23007","observation_id":"54da9fe7-917d-4d6b-b1aa-1386403666d8","resolution":{"observed_at":"2026-07-10T15:57:20.886956Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T15:57:20.857017Z","title":"Springer, 2003","venue":null,"work_id":"93b8a4f5-8812-4748-b406-96229513dbcc","year":2003},"citing_paper":{"arxiv_id":"2607.07893","last_updated":"2026-07-08T20:04:46Z","snapshot_observed_at":"2026-08-19T14:51:08.169922Z","submitted_at":"2026-07-08T20:04:46Z","title":"Reachability-Preserving Bellman Operator for the Discounted Reach-Cost Value Function: Uniting Hamilton-Jacobi Reachability and Reinforcement Learning","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-10T15:54:48.026121Z"},"links":{"citing_paper":"/paper/2607.07893"},"observation_digest":"sha256:c765dd8d5d81f975fcc93234cad4ee960e5eb2daa9b4957f1c87cafe0e1cb255","observation_id":"5608a162-0336-4288-b452-6edc1c16e9ee","resolution":{"observed_at":"2026-07-10T15:57:20.858183Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T15:57:20.858772Z","title":"Scalable learning of safety guarantees for autonomous systems using hamilton-jacobi reachability","venue":null,"work_id":"35f6eee4-3dcd-4466-abdb-11f6d3e04466","year":2021},"citing_paper":{"arxiv_id":"2607.07893","last_updated":"2026-07-08T20:04:46Z","snapshot_observed_at":"2026-08-19T14:51:08.169922Z","submitted_at":"2026-07-08T20:04:46Z","title":"Reachability-Preserving Bellman Operator for the Discounted Reach-Cost Value Function: Uniting Hamilton-Jacobi Reachability and Reinforcement Learning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-10T15:54:48.026121Z"},"links":{"citing_paper":"/paper/2607.07893"},"observation_digest":"sha256:4d7b743239cceb980a87e4e740e14f0e8d78c3101782db54ffad93fd10f86dc9","observation_id":"496e4ce7-e39e-48b1-8d63-6d36efe5479a","resolution":{"observed_at":"2026-07-10T15:57:20.860035Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2112.12288","last_updated":"2021-12-23T00:44:38Z","snapshot_observed_at":"2026-08-19T09:52:52.519732Z","submitted_at":"2021-12-23T00:44:38Z","title":"Safety and Liveness Guarantees through Reach-Avoid Reinforcement Learning","version":1},"cited_work":{"arxiv_id":"2112.12288","doi":null,"metadata_source":"pith","pith_arxiv_id":"2112.12288","snapshot_observed_at":"2026-07-10T15:57:20.798076Z","title":"Safety and liveness guarantees through reach-avoid reinforcement learning","venue":"cs.LG","work_id":"ed96d47d-f915-40c3-8bad-2c508d951c09","year":2021},"citing_paper":{"arxiv_id":"2607.07893","last_updated":"2026-07-08T20:04:46Z","snapshot_observed_at":"2026-08-19T14:51:08.169922Z","submitted_at":"2026-07-08T20:04:46Z","title":"Reachability-Preserving Bellman Operator for the Discounted Reach-Cost Value Function: Uniting Hamilton-Jacobi Reachability and Reinforcement Learning","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-10T15:54:48.026121Z"},"links":{"cited_paper":"/paper/2112.12288","citing_paper":"/paper/2607.07893"},"observation_digest":"sha256:45fc7dc76a4e2a712e9a444329bb6733a9b5652e44a54b5455a44a5eb4ac2ea9","observation_id":"cbc12ae6-415d-4988-906a-cd44175655b8","resolution":{"observed_at":"2026-07-10T15:57:20.799854Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T15:57:20.868213Z","title":"A hopf-lax formula in hamilton– jacobi analysis of reach-avoid problems.IEEE Control Systems Letters, 5(3):1055–1060, 2020","venue":null,"work_id":"99a6ae4f-b7c8-4ef9-84d4-ef21f020b601","year":2020},"citing_paper":{"arxiv_id":"2607.07893","last_updated":"2026-07-08T20:04:46Z","snapshot_observed_at":"2026-08-19T14:51:08.169922Z","submitted_at":"2026-07-08T20:04:46Z","title":"Reachability-Preserving Bellman Operator for the Discounted Reach-Cost Value Function: Uniting Hamilton-Jacobi Reachability and Reinforcement Learning","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-10T15:54:48.026121Z"},"links":{"citing_paper":"/paper/2607.07893"},"observation_digest":"sha256:eb506d4f0dfb9ecd1fc6587f7fecf9bd3dd1c477f1760f21f1fcf97b67262476","observation_id":"8d82eb6c-850b-45b2-8925-8a049f677d8f","resolution":{"observed_at":"2026-07-10T15:57:20.869743Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T15:57:20.854966Z","title":"Con- verse barrier certificates for finite-time safety verification of continuous- time perturbed deterministic systems.Systems & Control Letters, 209:106357, 2026","venue":null,"work_id":"03700bb6-ed15-442c-96bd-0028bf29e41a","year":2026},"citing_paper":{"arxiv_id":"2607.07893","last_updated":"2026-07-08T20:04:46Z","snapshot_observed_at":"2026-08-19T14:51:08.169922Z","submitted_at":"2026-07-08T20:04:46Z","title":"Reachability-Preserving Bellman Operator for the Discounted Reach-Cost Value Function: Uniting Hamilton-Jacobi Reachability and Reinforcement Learning","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-10T15:54:48.026121Z"},"links":{"citing_paper":"/paper/2607.07893"},"observation_digest":"sha256:9af6cbb64193e8cf827696344246889a947f3f2b3db2eab056cdeb98ae951a5b","observation_id":"719103bd-57cb-48b1-80a6-feca0d57bc26","resolution":{"observed_at":"2026-07-10T15:57:20.856425Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T15:57:20.853019Z","title":"On reachability and minimum cost optimal control","venue":null,"work_id":"196ec5aa-f1f0-4539-86f2-6d856b6c9069","year":2004},"citing_paper":{"arxiv_id":"2607.07893","last_updated":"2026-07-08T20:04:46Z","snapshot_observed_at":"2026-08-19T14:51:08.169922Z","submitted_at":"2026-07-08T20:04:46Z","title":"Reachability-Preserving Bellman Operator for the Discounted Reach-Cost Value Function: Uniting Hamilton-Jacobi Reachability and Reinforcement Learning","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-10T15:54:48.026121Z"},"links":{"citing_paper":"/paper/2607.07893"},"observation_digest":"sha256:91c68fdf906cb045ec12100f1b22a45ebee0a015ebfaf2cac22d70a0d94770f6","observation_id":"4133079c-0d91-4963-b136-7679bc3b1bbf","resolution":{"observed_at":"2026-07-10T15:57:20.854303Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T15:57:20.848827Z","title":"Kavukcuoglu, David Silver, Andrei A","venue":null,"work_id":"38233b09-94fb-4af9-b34e-c61923e77e0e","year":2015},"citing_paper":{"arxiv_id":"2607.07893","last_updated":"2026-07-08T20:04:46Z","snapshot_observed_at":"2026-08-19T14:51:08.169922Z","submitted_at":"2026-07-08T20:04:46Z","title":"Reachability-Preserving Bellman Operator for the Discounted Reach-Cost Value Function: Uniting Hamilton-Jacobi Reachability and Reinforcement Learning","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-10T15:54:48.026121Z"},"links":{"citing_paper":"/paper/2607.07893"},"observation_digest":"sha256:b7bd3f30e907e40764c3f60db60173ab4ffaafa355f15f2727bf79b07edbfd4a","observation_id":"860eaa32-4e26-4a55-907b-cfa53d83af4a","resolution":{"observed_at":"2026-07-10T15:57:20.850254Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T15:57:20.870345Z","title":"Error bounds for approximate value iteration.Proceedings of the National Conference on Artificial Intelligence (AAAI), 2005","venue":null,"work_id":"d59d356e-bd25-4b59-a2c4-956ffb67d3a7","year":2005},"citing_paper":{"arxiv_id":"2607.07893","last_updated":"2026-07-08T20:04:46Z","snapshot_observed_at":"2026-08-19T14:51:08.169922Z","submitted_at":"2026-07-08T20:04:46Z","title":"Reachability-Preserving Bellman Operator for the Discounted Reach-Cost Value Function: Uniting Hamilton-Jacobi Reachability and Reinforcement Learning","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-10T15:54:48.026121Z"},"links":{"citing_paper":"/paper/2607.07893"},"observation_digest":"sha256:9a020a7e08a70c3d6549414dbd9f59ffa5e75ac3bac6c28ab84a432834f8f2e4","observation_id":"57591cb7-3f80-4b3c-8491-feb0580525fe","resolution":{"observed_at":"2026-07-10T15:57:20.871773Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T15:57:20.879881Z","title":"Finite-time bounds for fitted value iteration.Journal of Machine Learning Research, 9:815–857, 2008","venue":null,"work_id":"fb7267b2-ebc8-456f-88de-4944fab4a6b3","year":2008},"citing_paper":{"arxiv_id":"2607.07893","last_updated":"2026-07-08T20:04:46Z","snapshot_observed_at":"2026-08-19T14:51:08.169922Z","submitted_at":"2026-07-08T20:04:46Z","title":"Reachability-Preserving Bellman Operator for the Discounted Reach-Cost Value Function: Uniting Hamilton-Jacobi Reachability and Reinforcement Learning","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-10T15:54:48.026121Z"},"links":{"citing_paper":"/paper/2607.07893"},"observation_digest":"sha256:cbf1c2e3e73f5b312bf39bfff3e375b1b726ecc1974f2fc3048527a31b560d10","observation_id":"1949a59c-a52f-483d-87ed-1078e32999fa","resolution":{"observed_at":"2026-07-10T15:57:20.881449Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2506.16016","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T15:57:20.788162Z","title":"Dual- objective reinforcement learning with novel hamilton-jacobi-bellman formulations","venue":null,"work_id":"ddd9de40-a70b-40ea-8cf3-087424cc1a7a","year":2025},"citing_paper":{"arxiv_id":"2607.07893","last_updated":"2026-07-08T20:04:46Z","snapshot_observed_at":"2026-08-19T14:51:08.169922Z","submitted_at":"2026-07-08T20:04:46Z","title":"Reachability-Preserving Bellman Operator for the Discounted Reach-Cost Value Function: Uniting Hamilton-Jacobi Reachability and Reinforcement Learning","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-10T15:54:48.026121Z"},"links":{"citing_paper":"/paper/2607.07893"},"observation_digest":"sha256:f65a2bd4ccbc527485a8ebe9950374f14a5ef7e4ca71ae20dce67725cf3e2166","observation_id":"8bbdf55d-2fbf-4c44-9db7-8c54b052f23c","resolution":{"observed_at":"2026-07-10T15:57:20.789928Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2602.19532","last_updated":"2026-05-13T21:40:57Z","snapshot_observed_at":"2026-08-12T19:05:52.037299Z","submitted_at":"2026-02-23T05:48:58Z","title":"Bellman Value Decomposition for Task Logic in Safe Optimal Control","version":2},"cited_work":{"arxiv_id":"2602.19532","doi":null,"metadata_source":"pith","pith_arxiv_id":"2602.19532","snapshot_observed_at":"2026-07-10T15:57:20.785344Z","title":"Bellman value decomposition for task logic in safe optimal control","venue":"cs.RO","work_id":"31a5fdae-ff94-4985-bd91-cdb1955d05ab","year":2026},"citing_paper":{"arxiv_id":"2607.07893","last_updated":"2026-07-08T20:04:46Z","snapshot_observed_at":"2026-08-19T14:51:08.169922Z","submitted_at":"2026-07-08T20:04:46Z","title":"Reachability-Preserving Bellman Operator for the Discounted Reach-Cost Value Function: Uniting Hamilton-Jacobi Reachability and Reinforcement Learning","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-10T15:54:48.026121Z"},"links":{"cited_paper":"/paper/2602.19532","citing_paper":"/paper/2607.07893"},"observation_digest":"sha256:cb3c1768c49190d20f113978624de67171feb574faee54607cf653f1346d8c30","observation_id":"0f5c673a-92ba-4316-b7f1-cd270c973fc7","resolution":{"observed_at":"2026-07-10T15:57:20.786910Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T15:57:20.874089Z","title":"Mastering the game of go with deep neural networks and tree search.nature, 529(7587):484–489","venue":null,"work_id":"94442f51-1de4-4d84-ba91-41af742e773b","year":2016},"citing_paper":{"arxiv_id":"2607.07893","last_updated":"2026-07-08T20:04:46Z","snapshot_observed_at":"2026-08-19T14:51:08.169922Z","submitted_at":"2026-07-08T20:04:46Z","title":"Reachability-Preserving Bellman Operator for the Discounted Reach-Cost Value Function: Uniting Hamilton-Jacobi Reachability and Reinforcement Learning","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-10T15:54:48.026121Z"},"links":{"citing_paper":"/paper/2607.07893"},"observation_digest":"sha256:a87acda5bd71586384d5eff80cbacda3f7afdedf1bac154be28c1c160d1ffee4","observation_id":"17f03e30-3856-4236-aebf-2fd3250f22e8","resolution":{"observed_at":"2026-07-10T15:57:20.875412Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T15:57:20.850916Z","title":"A general reinforcement learning algorithm that masters chess, shogi, and go through self-play.Science, 362(6419):1140–1144","venue":null,"work_id":"3d44e526-3ec6-44af-a90e-a4641ab25ce3","year":2018},"citing_paper":{"arxiv_id":"2607.07893","last_updated":"2026-07-08T20:04:46Z","snapshot_observed_at":"2026-08-19T14:51:08.169922Z","submitted_at":"2026-07-08T20:04:46Z","title":"Reachability-Preserving Bellman Operator for the Discounted Reach-Cost Value Function: Uniting Hamilton-Jacobi Reachability and Reinforcement Learning","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-10T15:54:48.026121Z"},"links":{"citing_paper":"/paper/2607.07893"},"observation_digest":"sha256:c18a2e9acc2633c1d1fa289eaf315b531a4cb2be780889ce0ec99521cd47cb31","observation_id":"bddd4168-2700-4c01-809b-6fc710ecc10f","resolution":{"observed_at":"2026-07-10T15:57:20.852280Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T15:57:20.840637Z","title":"Mastering the game of go without human knowledge.nature, 550(7676):354–359","venue":null,"work_id":"99f06a00-9236-49f4-aabd-25fc245cc146","year":2017},"citing_paper":{"arxiv_id":"2607.07893","last_updated":"2026-07-08T20:04:46Z","snapshot_observed_at":"2026-08-19T14:51:08.169922Z","submitted_at":"2026-07-08T20:04:46Z","title":"Reachability-Preserving Bellman Operator for the Discounted Reach-Cost Value Function: Uniting Hamilton-Jacobi Reachability and Reinforcement Learning","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-10T15:54:48.026121Z"},"links":{"citing_paper":"/paper/2607.07893"},"observation_digest":"sha256:44827523ef77f20f43fddda69dcd9d20cca825886fe03782a84c4e2a41dc7397","observation_id":"e00f0114-5384-4481-9069-e10bed96447e","resolution":{"observed_at":"2026-07-10T15:57:20.841939Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.08050","last_updated":"2026-05-10T11:12:34Z","snapshot_observed_at":"2026-08-12T15:02:16.621833Z","submitted_at":"2026-01-12T22:39:12Z","title":"Unifying Hamilton-Jacobi Reachability and Reinforcement Learning","version":2},"cited_work":{"arxiv_id":"2601.08050","doi":null,"metadata_source":"pith","pith_arxiv_id":"2601.08050","snapshot_observed_at":"2026-07-10T15:57:20.793927Z","title":"Unifying Hamilton-Jacobi Reachability and Reinforcement Learning","venue":"eess.SY","work_id":"454b5675-d320-4d15-8f4f-bde9e9276f2f","year":2026},"citing_paper":{"arxiv_id":"2607.07893","last_updated":"2026-07-08T20:04:46Z","snapshot_observed_at":"2026-08-19T14:51:08.169922Z","submitted_at":"2026-07-08T20:04:46Z","title":"Reachability-Preserving Bellman Operator for the Discounted Reach-Cost Value Function: Uniting Hamilton-Jacobi Reachability and Reinforcement Learning","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-10T15:54:48.026121Z"},"links":{"cited_paper":"/paper/2601.08050","citing_paper":"/paper/2607.07893"},"observation_digest":"sha256:2919988bd16cb51a5b832ef5b28f21dd9675f2f6e937583e713690705c804851","observation_id":"6afb4f47-709c-4ae5-b52f-1e973520d1da","resolution":{"observed_at":"2026-07-10T15:57:20.795345Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2602.16475","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T15:57:20.790995Z","title":"van Beers, Erik-Jan van Kampen, and Coen C","venue":null,"work_id":"03a1fb8c-8a71-40f1-975e-0363fe00952b","year":2026},"citing_paper":{"arxiv_id":"2607.07893","last_updated":"2026-07-08T20:04:46Z","snapshot_observed_at":"2026-08-19T14:51:08.169922Z","submitted_at":"2026-07-08T20:04:46Z","title":"Reachability-Preserving Bellman Operator for the Discounted Reach-Cost Value Function: Uniting Hamilton-Jacobi Reachability and Reinforcement Learning","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-10T15:54:48.026121Z"},"links":{"citing_paper":"/paper/2607.07893"},"observation_digest":"sha256:80513694fc3b1997856e2ab378774437c74986077dacb44616df101a242d0b67","observation_id":"3f4b3fb4-1966-403a-b305-229a93dd243e","resolution":{"observed_at":"2026-07-10T15:57:20.792784Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T15:57:20.875994Z","title":"Grandmaster level in starcraft ii using multi-agent reinforcement learning.nature, 575(7782):350–354, 2019","venue":null,"work_id":"dc0596e8-2a9c-48ad-a42f-9afcfc36ce49","year":2019},"citing_paper":{"arxiv_id":"2607.07893","last_updated":"2026-07-08T20:04:46Z","snapshot_observed_at":"2026-08-19T14:51:08.169922Z","submitted_at":"2026-07-08T20:04:46Z","title":"Reachability-Preserving Bellman Operator for the Discounted Reach-Cost Value Function: Uniting Hamilton-Jacobi Reachability and Reinforcement Learning","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-10T15:54:48.026121Z"},"links":{"citing_paper":"/paper/2607.07893"},"observation_digest":"sha256:b7cf0ca70ed64ba964e2bc1e05ecf5870011f15677a862e43b3aaaa5ff5d24e0","observation_id":"7e98bfa6-0e3e-4679-a9bb-72c82b5c0dde","resolution":{"observed_at":"2026-07-10T15:57:20.877361Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T15:57:20.878084Z","title":"Inner-approximating reachable sets for polynomial systems with time-varying uncertainties","venue":null,"work_id":"4a26095e-2b8b-40d4-9e86-ed4d33da603d","year":2019},"citing_paper":{"arxiv_id":"2607.07893","last_updated":"2026-07-08T20:04:46Z","snapshot_observed_at":"2026-08-19T14:51:08.169922Z","submitted_at":"2026-07-08T20:04:46Z","title":"Reachability-Preserving Bellman Operator for the Discounted Reach-Cost Value Function: Uniting Hamilton-Jacobi Reachability and Reinforcement Learning","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-10T15:54:48.026121Z"},"links":{"citing_paper":"/paper/2607.07893"},"observation_digest":"sha256:2ed33972ff2f0b12e2b4f794169625a8c62ba82e1ae2ab2398e2beaa54481f62","observation_id":"c9cfd346-4651-4383-a569-d5fbeb452048","resolution":{"observed_at":"2026-07-10T15:57:20.879312Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2607.07893","last_updated":"2026-07-08T20:04:46Z","latest_version":1,"primary_category":"eess.SY","snapshot_observed_at":"2026-08-19T14:51:08.169922Z","submitted_at":"2026-07-08T20:04:46Z","title":"Reachability-Preserving Bellman Operator for the Discounted Reach-Cost Value Function: Uniting Hamilton-Jacobi Reachability and Reinforcement Learning"},"reference_resolution":{"displayed":30,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":5,"verified_fuzzy":24},"total_outbound_references":30},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 0 inbound Pith citation observations for arXiv:2607.07893."}