{"as_of":"2026-08-10T06:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:662105e4932f8a8511e8ca57495be7a1a05085721cf49ec85de89747e076584b","coverage":[{"denominator":24,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":24,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:35:51.819676Z","state":"measured"},{"denominator":25,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":25,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-01T01:19:12.424654Z","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-07-01T13:05:44.247464Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.15693","last_updated":"2025-05-27T18:12:50Z","snapshot_observed_at":"2026-08-07T13:23:49.564352Z","submitted_at":"2025-05-27T18:12:50Z","title":"Verifiable Safety Q-Filters via Hamilton-Jacobi Reachability and Multiplicative Q-Networks","version":1},"cited_work":{"arxiv_id":"2506.15693","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.15693","snapshot_observed_at":"2026-07-01T13:05:44.247464Z","title":"Verifiable safety q-filters via hamilton-jacobi reachability and multiplicative q-networks,","venue":null,"work_id":"af036d9c-e41f-4267-bbdb-9684242f5364","year":2025},"citing_paper":{"arxiv_id":"2606.30935","last_updated":"2026-06-29T21:38:44Z","snapshot_observed_at":"2026-08-07T16:47:28.559653Z","submitted_at":"2026-06-29T21:38:44Z","title":"ShardNet: Training Neural Controllers with Hard, Non-Convex Constraints","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-01T01:19:12.424654Z"},"links":{"cited_paper":"/paper/2506.15693","citing_paper":"/paper/2606.30935"},"observation_digest":"sha256:dc670b31b6af32d74d061190a216d3d5a97df9445a31cea07ceb75fac01f2c2a","observation_id":"fccd5646-33a9-4858-b134-bb3114f025b2","resolution":{"observed_at":"2026-07-01T13:05:44.249451Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2506.15693/citation-record","integrity":"/paper/2506.15693/integrity","json":"/paper/2506.15693/citation-record.json","paper":"/paper/2506.15693"},"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-07T13:35:56.081094Z","title":"Control barrier functions: Theory and applications","venue":null,"work_id":"a49a38e7-c2f6-498f-9728-0a6cb3c53b61","year":2019},"citing_paper":{"arxiv_id":"2506.15693","last_updated":"2025-05-27T18:12:50Z","snapshot_observed_at":"2026-08-07T13:23:49.564352Z","submitted_at":"2025-05-27T18:12:50Z","title":"Verifiable Safety Q-Filters via Hamilton-Jacobi Reachability and Multiplicative Q-Networks","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T13:35:49.207008Z"},"links":{"citing_paper":"/paper/2506.15693"},"observation_digest":"sha256:7ea1d35f3e3a8ac5ed0721879725bc245366fd9fe5abc9e92f0d8570732ddf38","observation_id":"2fbd3cc5-6894-486f-916e-d71b5a4655ea","resolution":{"observed_at":"2026-08-07T13:35:56.169656Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:35:55.929426Z","title":"Robust control barrier–value functions for safety- critical control","venue":null,"work_id":"1b077330-43ac-4f55-b1a2-eaddef99faed","year":2021},"citing_paper":{"arxiv_id":"2506.15693","last_updated":"2025-05-27T18:12:50Z","snapshot_observed_at":"2026-08-07T13:23:49.564352Z","submitted_at":"2025-05-27T18:12:50Z","title":"Verifiable Safety Q-Filters via Hamilton-Jacobi Reachability and Multiplicative Q-Networks","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T13:35:49.299062Z"},"links":{"citing_paper":"/paper/2506.15693"},"observation_digest":"sha256:832b64ea6dff74d0166c6066821bf13d5a2a4602d5018dd36a1b833ef572206c","observation_id":"d2f5a5e3-9871-47ba-b34a-963866c08cc0","resolution":{"observed_at":"2026-08-07T13:35:55.980398Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:35:49.372262Z","title":"Safe control with learned certificates: A survey of neural lyapunov, barrier, and contrac- tion methods for robotics and control","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.15693","last_updated":"2025-05-27T18:12:50Z","snapshot_observed_at":"2026-08-07T13:23:49.564352Z","submitted_at":"2025-05-27T18:12:50Z","title":"Verifiable Safety Q-Filters via Hamilton-Jacobi Reachability and Multiplicative Q-Networks","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T13:35:49.372262Z"},"links":{"citing_paper":"/paper/2506.15693"},"observation_digest":"sha256:e8715a1076f56924f288a785416d92653591831dae57f66f07b13599629cb901","observation_id":"96548dce-dc70-4b0d-bbfa-57f86b29b40d","resolution":{"observed_at":"2026-08-07T13:35:49.372262Z","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-07T13:35:55.753724Z","title":"Fisac, Neil F","venue":null,"work_id":"d39ebd5c-5c7b-4d75-8a32-764ba72753c7","year":2019},"citing_paper":{"arxiv_id":"2506.15693","last_updated":"2025-05-27T18:12:50Z","snapshot_observed_at":"2026-08-07T13:23:49.564352Z","submitted_at":"2025-05-27T18:12:50Z","title":"Verifiable Safety Q-Filters via Hamilton-Jacobi Reachability and Multiplicative Q-Networks","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T13:35:49.456326Z"},"links":{"citing_paper":"/paper/2506.15693"},"observation_digest":"sha256:39bf94ed63fcfc571cdff69d8b8b101d8e4fd6814cd4b1461d8316bd6d87d373","observation_id":"ab0d5b9b-0339-449c-9b37-5bf3d2ae782a","resolution":{"observed_at":"2026-08-07T13:35:55.844298Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.09645","last_updated":"2024-08-21T19:45:41Z","snapshot_observed_at":"2026-08-09T16:48:05.641573Z","submitted_at":"2024-07-12T19:04:39Z","title":"Hamilton-Jacobi Reachability in Reinforcement Learning: A Survey","version":2},"cited_work":{"arxiv_id":"2407.09645","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.09645","snapshot_observed_at":"2026-08-07T13:35:52.633863Z","title":"Hamilton-Jacobi Reachability in Reinforcement Learning: A Survey","venue":"eess.SY","work_id":"9c815de0-102c-4a1f-a3f4-13fc984f6426","year":2024},"citing_paper":{"arxiv_id":"2506.15693","last_updated":"2025-05-27T18:12:50Z","snapshot_observed_at":"2026-08-07T13:23:49.564352Z","submitted_at":"2025-05-27T18:12:50Z","title":"Verifiable Safety Q-Filters via Hamilton-Jacobi Reachability and Multiplicative Q-Networks","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T13:35:49.567353Z"},"links":{"cited_paper":"/paper/2407.09645","citing_paper":"/paper/2506.15693"},"observation_digest":"sha256:1d58abd99f195d9632fb0dd06aa4afb3492e9a7650808fb803990a6f651c02de","observation_id":"c3655757-be72-43ef-a0fb-7d4e8e1d34d1","resolution":{"observed_at":"2026-08-07T13:35:52.684774Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2010.14603","last_updated":"2020-10-27T20:53:20Z","snapshot_observed_at":"2026-07-06T10:09:10.434213Z","submitted_at":"2020-10-27T20:53:20Z","title":"Learning to be Safe: Deep RL with a Safety Critic","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.14603","snapshot_observed_at":"2026-08-07T13:35:49.671135Z","title":"Learning to be safe: Deep rl with a safety critic","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2506.15693","last_updated":"2025-05-27T18:12:50Z","snapshot_observed_at":"2026-08-07T13:23:49.564352Z","submitted_at":"2025-05-27T18:12:50Z","title":"Verifiable Safety Q-Filters via Hamilton-Jacobi Reachability and Multiplicative Q-Networks","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T13:35:49.671135Z"},"links":{"cited_paper":"/paper/2010.14603","citing_paper":"/paper/2506.15693"},"observation_digest":"sha256:681c9790af7d9fcb814c6dfd2bec1852b6fe53a37f5d90af50d96cbbe126bb0e","observation_id":"aa990a63-3cce-495c-a024-54dd8ea96872","resolution":{"observed_at":"2026-08-07T13:35:49.671135Z","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-07T13:35:55.508260Z","title":"Real-time safe control of neural network dynamic models with sound approximation","venue":null,"work_id":"0df6ee65-b06d-427e-83ec-9d215c932e57","year":2024},"citing_paper":{"arxiv_id":"2506.15693","last_updated":"2025-05-27T18:12:50Z","snapshot_observed_at":"2026-08-07T13:23:49.564352Z","submitted_at":"2025-05-27T18:12:50Z","title":"Verifiable Safety Q-Filters via Hamilton-Jacobi Reachability and Multiplicative Q-Networks","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T13:35:49.780643Z"},"links":{"citing_paper":"/paper/2506.15693"},"observation_digest":"sha256:2c3ae2ab6350895fc6941a7ce4c2fdbb135446b843f5c7a0aeb4a7a41dc521ee","observation_id":"b9aa0a19-8f82-4431-8c08-f5dd8cf8e781","resolution":{"observed_at":"2026-08-07T13:35:55.615762Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:35:55.259905Z","title":"Verification of neural control barrier functions with symbolic derivative bounds propagation","venue":null,"work_id":"5f76e0fa-ac41-4f6e-9b3a-0942786b4119","year":2024},"citing_paper":{"arxiv_id":"2506.15693","last_updated":"2025-05-27T18:12:50Z","snapshot_observed_at":"2026-08-07T13:23:49.564352Z","submitted_at":"2025-05-27T18:12:50Z","title":"Verifiable Safety Q-Filters via Hamilton-Jacobi Reachability and Multiplicative Q-Networks","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T13:35:49.904966Z"},"links":{"citing_paper":"/paper/2506.15693"},"observation_digest":"sha256:a9dd6690e939ee2f7e3c424a607212feb293639feb3412284f36e8fbca7c93e3","observation_id":"2856e483-8af5-43e8-b5b1-948c7d94edf9","resolution":{"observed_at":"2026-08-07T13:35:55.409438Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1611.05709","last_updated":"2017-09-04T08:14:01Z","snapshot_observed_at":"2026-08-03T15:28:25.723744Z","submitted_at":"2016-11-17T14:40:57Z","title":"Factorized Bilinear Models for Image Recognition","version":2},"cited_work":{"arxiv_id":"1611.05709","doi":null,"metadata_source":"pith","pith_arxiv_id":"1611.05709","snapshot_observed_at":"2026-08-07T13:35:52.429754Z","title":"Factorized Bilinear Models for Image Recognition","venue":"cs.CV","work_id":"fc472003-1831-4bd2-8889-588fa865092d","year":2016},"citing_paper":{"arxiv_id":"2506.15693","last_updated":"2025-05-27T18:12:50Z","snapshot_observed_at":"2026-08-07T13:23:49.564352Z","submitted_at":"2025-05-27T18:12:50Z","title":"Verifiable Safety Q-Filters via Hamilton-Jacobi Reachability and Multiplicative Q-Networks","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T13:35:50.014258Z"},"links":{"cited_paper":"/paper/1611.05709","citing_paper":"/paper/2506.15693"},"observation_digest":"sha256:9cae800e4a3c5c3bf3221ddefd45ab87934dc37f528a9809c4b401cf51cecfc0","observation_id":"2a5e0557-462b-4203-a235-e45121d5b6f0","resolution":{"observed_at":"2026-08-07T13:35:52.526930Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1903.06758","last_updated":"2020-10-15T21:06:08Z","snapshot_observed_at":"2026-07-06T07:39:40.106046Z","submitted_at":"2019-03-15T19:02:38Z","title":"Algorithms for Verifying Deep Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1903.06758","snapshot_observed_at":"2026-08-07T13:35:50.157809Z","title":"Kochenderfer","venue":null,"work_id":null,"year":1903},"citing_paper":{"arxiv_id":"2506.15693","last_updated":"2025-05-27T18:12:50Z","snapshot_observed_at":"2026-08-07T13:23:49.564352Z","submitted_at":"2025-05-27T18:12:50Z","title":"Verifiable Safety Q-Filters via Hamilton-Jacobi Reachability and Multiplicative Q-Networks","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T13:35:50.157809Z"},"links":{"cited_paper":"/paper/1903.06758","citing_paper":"/paper/2506.15693"},"observation_digest":"sha256:65ec8883b9689d7640844612086e27ece3ef10e020628d6e4289cb2875e64a6e","observation_id":"aeab106f-690f-43dc-bd56-26351dff7755","resolution":{"observed_at":"2026-08-07T13:35:50.157809Z","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-07T13:35:55.045323Z","title":"Control in a safe set: Ad- dressing safety in human-robot interactions","venue":null,"work_id":"57e40539-1b5b-4c7c-9f56-15b52f757976","year":2014},"citing_paper":{"arxiv_id":"2506.15693","last_updated":"2025-05-27T18:12:50Z","snapshot_observed_at":"2026-08-07T13:23:49.564352Z","submitted_at":"2025-05-27T18:12:50Z","title":"Verifiable Safety Q-Filters via Hamilton-Jacobi Reachability and Multiplicative Q-Networks","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T13:35:50.302400Z"},"links":{"citing_paper":"/paper/2506.15693"},"observation_digest":"sha256:e0afa4e8a214e4290f92d3e39b4eb8e8417c82c4d5d0f0778f5ee9bda259dbd4","observation_id":"9e599f86-db14-416b-9ea3-2aa869941b9f","resolution":{"observed_at":"2026-08-07T13:35:55.132644Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:35:54.844531Z","title":"The flexible, extensible and efficient toolbox of level set methods","venue":null,"work_id":"03dbfa90-042e-4df5-8550-003a2c27de8f","year":2008},"citing_paper":{"arxiv_id":"2506.15693","last_updated":"2025-05-27T18:12:50Z","snapshot_observed_at":"2026-08-07T13:23:49.564352Z","submitted_at":"2025-05-27T18:12:50Z","title":"Verifiable Safety Q-Filters via Hamilton-Jacobi Reachability and Multiplicative Q-Networks","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T13:35:50.451408Z"},"links":{"citing_paper":"/paper/2506.15693"},"observation_digest":"sha256:ad8ed72e86c8bca7ebeead8ad3c011ad695f25d4a0bd4460f75a534776c4122a","observation_id":"a61981b7-d904-46ad-8425-ab14bd483236","resolution":{"observed_at":"2026-08-07T13:35:54.953835Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:35:54.555093Z","title":"A time-dependent hamilton-jacobi formulation of reachable sets for continuous dynamic games","venue":null,"work_id":"989d4e9f-2f91-4f08-9edb-ada514d3381b","year":2005},"citing_paper":{"arxiv_id":"2506.15693","last_updated":"2025-05-27T18:12:50Z","snapshot_observed_at":"2026-08-07T13:23:49.564352Z","submitted_at":"2025-05-27T18:12:50Z","title":"Verifiable Safety Q-Filters via Hamilton-Jacobi Reachability and Multiplicative Q-Networks","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T13:35:50.610564Z"},"links":{"citing_paper":"/paper/2506.15693"},"observation_digest":"sha256:175d82cf58d826bdda5efe8362f01fca26c200a2463ae3312a7efe9820e3e17d","observation_id":"a7162695-3f2e-45ca-b832-f59350b53cdc","resolution":{"observed_at":"2026-08-07T13:35:54.659987Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:35:54.355065Z","title":"Rawlings, David Q","venue":null,"work_id":"7e5edefe-dc26-49d3-92d8-2022c7959a8b","year":2017},"citing_paper":{"arxiv_id":"2506.15693","last_updated":"2025-05-27T18:12:50Z","snapshot_observed_at":"2026-08-07T13:23:49.564352Z","submitted_at":"2025-05-27T18:12:50Z","title":"Verifiable Safety Q-Filters via Hamilton-Jacobi Reachability and Multiplicative Q-Networks","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T13:35:50.690255Z"},"links":{"citing_paper":"/paper/2506.15693"},"observation_digest":"sha256:a174371f0098d1892b982a848b82ebdd75c811c4d62a1f44d6f9017290c44f67","observation_id":"e99585f3-4c27-4dda-aff6-76b02ab28d42","resolution":{"observed_at":"2026-08-07T13:35:54.445561Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:35:54.178059Z","title":null,"venue":null,"work_id":"9dd62293-7591-4c16-94ba-b01b63e03bf8","year":2019},"citing_paper":{"arxiv_id":"2506.15693","last_updated":"2025-05-27T18:12:50Z","snapshot_observed_at":"2026-08-07T13:23:49.564352Z","submitted_at":"2025-05-27T18:12:50Z","title":"Verifiable Safety Q-Filters via Hamilton-Jacobi Reachability and Multiplicative Q-Networks","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T13:35:50.841336Z"},"links":{"citing_paper":"/paper/2506.15693"},"observation_digest":"sha256:df5350e64912a6407ff8f54673c005917b013339dceb231a6e72bd53e8158afb","observation_id":"0492399c-3376-4b85-bcb8-155b7de2c982","resolution":{"observed_at":"2026-08-07T13:35:54.273220Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.19809","last_updated":"2024-11-29T16:16:59Z","snapshot_observed_at":"2026-07-06T19:58:57.119904Z","submitted_at":"2024-11-29T16:16:59Z","title":"Q-learning-based Model-free Safety Filter","version":1},"cited_work":{"arxiv_id":"2411.19809","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.19809","snapshot_observed_at":"2026-08-07T13:35:52.227123Z","title":"Q-learning-based Model-free Safety Filter","venue":"cs.RO","work_id":"22142dc0-1d51-4a95-8d90-aad3ccdb4dcc","year":2024},"citing_paper":{"arxiv_id":"2506.15693","last_updated":"2025-05-27T18:12:50Z","snapshot_observed_at":"2026-08-07T13:23:49.564352Z","submitted_at":"2025-05-27T18:12:50Z","title":"Verifiable Safety Q-Filters via Hamilton-Jacobi Reachability and Multiplicative Q-Networks","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T13:35:50.981161Z"},"links":{"cited_paper":"/paper/2411.19809","citing_paper":"/paper/2506.15693"},"observation_digest":"sha256:d034dc08e8a637d767dddf84c67a1f6702f4a3586c3a21d92e2fed415e4124a7","observation_id":"85f2e082-e725-4692-8836-3ec34871f147","resolution":{"observed_at":"2026-08-07T13:35:52.284753Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:35:53.967208Z","title":"Evaluating robustness of neural networks with mixed integer programming, 2019","venue":null,"work_id":"bf839986-6027-4de9-ac4e-1696e8b7ef5b","year":2019},"citing_paper":{"arxiv_id":"2506.15693","last_updated":"2025-05-27T18:12:50Z","snapshot_observed_at":"2026-08-07T13:23:49.564352Z","submitted_at":"2025-05-27T18:12:50Z","title":"Verifiable Safety Q-Filters via Hamilton-Jacobi Reachability and Multiplicative Q-Networks","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T13:35:51.082492Z"},"links":{"citing_paper":"/paper/2506.15693"},"observation_digest":"sha256:2b4175bc9f0352bb9c53edfcb92c7981657d5b3fe587ab09b8d5133bb88d3394","observation_id":"ddcb117f-d7b9-46c8-a7f7-75ca179fa84c","resolution":{"observed_at":"2026-08-07T13:35:54.074743Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:35:53.734982Z","title":"Refining control barrier functions through hamilton-jacobi reachability","venue":null,"work_id":"4afb7386-3d86-43a9-bd6d-7f1a619b1844","year":2022},"citing_paper":{"arxiv_id":"2506.15693","last_updated":"2025-05-27T18:12:50Z","snapshot_observed_at":"2026-08-07T13:23:49.564352Z","submitted_at":"2025-05-27T18:12:50Z","title":"Verifiable Safety Q-Filters via Hamilton-Jacobi Reachability and Multiplicative Q-Networks","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T13:35:51.208120Z"},"links":{"citing_paper":"/paper/2506.15693"},"observation_digest":"sha256:48b638b2687edfcbd8d9b9f1f720ff9a12a93ea3226a1e9dc183d704c38f1cfb","observation_id":"2b995149-8620-4e4f-a176-cbffcc9df94b","resolution":{"observed_at":"2026-08-07T13:35:53.861928Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:35:53.537496Z","title":"Safe control algorithms using energy functions: A unified framework, benchmark, and new directions","venue":null,"work_id":"244f1e7f-f0ac-43d9-8263-441884a61cfa","year":2019},"citing_paper":{"arxiv_id":"2506.15693","last_updated":"2025-05-27T18:12:50Z","snapshot_observed_at":"2026-08-07T13:23:49.564352Z","submitted_at":"2025-05-27T18:12:50Z","title":"Verifiable Safety Q-Filters via Hamilton-Jacobi Reachability and Multiplicative Q-Networks","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T13:35:51.327458Z"},"links":{"citing_paper":"/paper/2506.15693"},"observation_digest":"sha256:65c08bcf25777f478a98d1f3278c8df4b2450681e517f8d708736297e7a558fc","observation_id":"61b37ffd-d4cc-4480-9261-056eb0395814","resolution":{"observed_at":"2026-08-07T13:35:53.646961Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.01639","last_updated":"2025-07-20T19:00:22Z","snapshot_observed_at":"2026-07-06T18:39:52.378049Z","submitted_at":"2024-06-30T20:15:31Z","title":"ModelVerification.jl: a Comprehensive Toolbox for Formally Verifying Deep Neural Networks","version":2},"cited_work":{"arxiv_id":"2407.01639","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.01639","snapshot_observed_at":"2026-08-07T13:35:52.045455Z","title":"ModelVerification.jl: a Comprehensive Toolbox for Formally Verifying Deep Neural Networks","venue":"cs.LG","work_id":"5cd94f1f-428c-4e7c-b547-225c9d06f263","year":2024},"citing_paper":{"arxiv_id":"2506.15693","last_updated":"2025-05-27T18:12:50Z","snapshot_observed_at":"2026-08-07T13:23:49.564352Z","submitted_at":"2025-05-27T18:12:50Z","title":"Verifiable Safety Q-Filters via Hamilton-Jacobi Reachability and Multiplicative Q-Networks","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T13:35:51.426375Z"},"links":{"cited_paper":"/paper/2407.01639","citing_paper":"/paper/2506.15693"},"observation_digest":"sha256:5c8ebadb2e183938b52c5f292f2ba51ff42f3606c1d1dbf1812bce06233cd633","observation_id":"a3c0c1c8-44ba-4442-9eed-11e995395e64","resolution":{"observed_at":"2026-08-07T13:35:52.104192Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:35:53.377988Z","title":"High-order control barrier functions","venue":null,"work_id":"a780bab2-6b21-4c54-8b19-87b6acfc3692","year":2021},"citing_paper":{"arxiv_id":"2506.15693","last_updated":"2025-05-27T18:12:50Z","snapshot_observed_at":"2026-08-07T13:23:49.564352Z","submitted_at":"2025-05-27T18:12:50Z","title":"Verifiable Safety Q-Filters via Hamilton-Jacobi Reachability and Multiplicative Q-Networks","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T13:35:51.526604Z"},"links":{"citing_paper":"/paper/2506.15693"},"observation_digest":"sha256:ed27ac72fe2612d673b29637fadf98316c36151801852411b4e7987cefd75272","observation_id":"40051687-8aff-4968-b03e-00dfc6887bc1","resolution":{"observed_at":"2026-08-07T13:35:53.437816Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.20532","last_updated":"2024-07-31T16:22:00Z","snapshot_observed_at":"2026-08-09T19:33:43.621731Z","submitted_at":"2024-07-30T04:14:52Z","title":"Scalable Synthesis of Formally Verified Neural Value Function for Hamilton-Jacobi Reachability Analysis","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.20532","snapshot_observed_at":"2026-08-07T13:35:51.600102Z","title":"Scalable synthesis of formally verified neural value function for hamilton-jacobi reachability analysis","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.15693","last_updated":"2025-05-27T18:12:50Z","snapshot_observed_at":"2026-08-07T13:23:49.564352Z","submitted_at":"2025-05-27T18:12:50Z","title":"Verifiable Safety Q-Filters via Hamilton-Jacobi Reachability and Multiplicative Q-Networks","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T13:35:51.600102Z"},"links":{"cited_paper":"/paper/2407.20532","citing_paper":"/paper/2506.15693"},"observation_digest":"sha256:ff570fcc0a25762c0b9ae7207636bacbfaddbebd4b3141e181afe405720fdde3","observation_id":"331ba3c3-5a96-4922-88a9-8dcb1592c899","resolution":{"observed_at":"2026-08-07T13:35:51.600102Z","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-07T13:35:53.111608Z","title":"Efficient neural network robustness certification with general activation functions, 2018","venue":null,"work_id":"7588ac5e-4bab-4357-bdc7-f97980f9838c","year":2018},"citing_paper":{"arxiv_id":"2506.15693","last_updated":"2025-05-27T18:12:50Z","snapshot_observed_at":"2026-08-07T13:23:49.564352Z","submitted_at":"2025-05-27T18:12:50Z","title":"Verifiable Safety Q-Filters via Hamilton-Jacobi Reachability and Multiplicative Q-Networks","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T13:35:51.708520Z"},"links":{"citing_paper":"/paper/2506.15693"},"observation_digest":"sha256:a01a545c3f7de3eaf79bd6b2b82acef0e643f9ef79bd18fec03114ad64993dd8","observation_id":"790ececd-18ec-4913-bd27-0b0bb3b18571","resolution":{"observed_at":"2026-08-07T13:35:53.235405Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:35:52.846342Z","title":"Safety index synthesis via sum-of-squares programming","venue":null,"work_id":"6e4c6a25-c975-472a-af55-fa21b363ba2a","year":2023},"citing_paper":{"arxiv_id":"2506.15693","last_updated":"2025-05-27T18:12:50Z","snapshot_observed_at":"2026-08-07T13:23:49.564352Z","submitted_at":"2025-05-27T18:12:50Z","title":"Verifiable Safety Q-Filters via Hamilton-Jacobi Reachability and Multiplicative Q-Networks","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T13:35:51.819676Z"},"links":{"citing_paper":"/paper/2506.15693"},"observation_digest":"sha256:7968999bb84e5a4357cd0a1164e9b9ff54d9eef7d61037dc266c7f3b0f5c91de","observation_id":"d91299dd-6621-4a70-a06e-7692a4047e80","resolution":{"observed_at":"2026-08-07T13:35:52.954813Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.15693","last_updated":"2025-05-27T18:12:50Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T13:23:49.564352Z","submitted_at":"2025-05-27T18:12:50Z","title":"Verifiable Safety Q-Filters via Hamilton-Jacobi Reachability and Multiplicative Q-Networks"},"reference_resolution":{"displayed":24,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":5,"verified_exact":3,"verified_fuzzy":15},"total_outbound_references":24},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 24 of 24 outbound references and 1 inbound Pith citation observation for arXiv:2506.15693."}