{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:HPKZLDQIM6M5EKGPXBKBDV4GSR","short_pith_number":"pith:HPKZLDQI","schema_version":"1.0","canonical_sha256":"3bd5958e086799d228cfb85411d786946736261cfcf2d3f9c43677fb738306ca","source":{"kind":"arxiv","id":"2607.07893","version":1},"attestation_state":"computed","paper":{"title":"Reachability-Preserving Bellman Operator for the Discounted Reach-Cost Value Function: Uniting Hamilton-Jacobi Reachability and Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Coen de Visser, Erik-jan van Kampen, Isabelle El-Hajj, Jasper van Beers, Prashant Solanki","submitted_at":"2026-07-08T20:04:46Z","abstract_excerpt":"Hamilton-Jacobi (HJ) reachability provides rigorous safety and reachability guarantees for continuous-time dynamical systems, but its numerical solution suffers from the curse of dimensionality. Deep reinforcement learning (DRL), by contrast, offers scalable sample-based methods. However, RL is typically built around additive cumulative rewards; whereas, reachability objectives are inherently non-additive. This mismatch makes a direct bridge between HJ reachability and RL nontrivial. Recent discounted formulations have either introduced contraction by altering the original reachability semanti"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2607.07893","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2026-07-08T20:04:46Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"dcd4db3d7f99e6fed7377f147bab30aa39fe7432cc9691749fa1a6349af8fcd6","abstract_canon_sha256":"32f588d35e1de5fe114fe0e33247ba8e8950526f22893091ac6c0bdcafb8786b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-10T00:19:04.247190Z","signature_b64":"tiAJXGY7da0qctrAX/dC4HaQG3k0FEdF5B6Xd/G4zohjcr1U4e8HjanrpQBrUxSpVL32uuCW5be8xlUYsZ/TCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3bd5958e086799d228cfb85411d786946736261cfcf2d3f9c43677fb738306ca","last_reissued_at":"2026-07-10T00:19:04.246676Z","signature_status":"signed_v1","first_computed_at":"2026-07-10T00:19:04.246676Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reachability-Preserving Bellman Operator for the Discounted Reach-Cost Value Function: Uniting Hamilton-Jacobi Reachability and Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Coen de Visser, Erik-jan van Kampen, Isabelle El-Hajj, Jasper van Beers, Prashant Solanki","submitted_at":"2026-07-08T20:04:46Z","abstract_excerpt":"Hamilton-Jacobi (HJ) reachability provides rigorous safety and reachability guarantees for continuous-time dynamical systems, but its numerical solution suffers from the curse of dimensionality. Deep reinforcement learning (DRL), by contrast, offers scalable sample-based methods. However, RL is typically built around additive cumulative rewards; whereas, reachability objectives are inherently non-additive. This mismatch makes a direct bridge between HJ reachability and RL nontrivial. Recent discounted formulations have either introduced contraction by altering the original reachability semanti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.07893","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.07893/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2607.07893","created_at":"2026-07-10T00:19:04.246738+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.07893v1","created_at":"2026-07-10T00:19:04.246738+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.07893","created_at":"2026-07-10T00:19:04.246738+00:00"},{"alias_kind":"pith_short_12","alias_value":"HPKZLDQIM6M5","created_at":"2026-07-10T00:19:04.246738+00:00"},{"alias_kind":"pith_short_16","alias_value":"HPKZLDQIM6M5EKGP","created_at":"2026-07-10T00:19:04.246738+00:00"},{"alias_kind":"pith_short_8","alias_value":"HPKZLDQI","created_at":"2026-07-10T00:19:04.246738+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HPKZLDQIM6M5EKGPXBKBDV4GSR","json":"https://pith.science/pith/HPKZLDQIM6M5EKGPXBKBDV4GSR.json","graph_json":"https://pith.science/api/pith-number/HPKZLDQIM6M5EKGPXBKBDV4GSR/graph.json","events_json":"https://pith.science/api/pith-number/HPKZLDQIM6M5EKGPXBKBDV4GSR/events.json","paper":"https://pith.science/paper/HPKZLDQI"},"agent_actions":{"view_html":"https://pith.science/pith/HPKZLDQIM6M5EKGPXBKBDV4GSR","download_json":"https://pith.science/pith/HPKZLDQIM6M5EKGPXBKBDV4GSR.json","view_paper":"https://pith.science/paper/HPKZLDQI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.07893&json=true","fetch_graph":"https://pith.science/api/pith-number/HPKZLDQIM6M5EKGPXBKBDV4GSR/graph.json","fetch_events":"https://pith.science/api/pith-number/HPKZLDQIM6M5EKGPXBKBDV4GSR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HPKZLDQIM6M5EKGPXBKBDV4GSR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HPKZLDQIM6M5EKGPXBKBDV4GSR/action/storage_attestation","attest_author":"https://pith.science/pith/HPKZLDQIM6M5EKGPXBKBDV4GSR/action/author_attestation","sign_citation":"https://pith.science/pith/HPKZLDQIM6M5EKGPXBKBDV4GSR/action/citation_signature","submit_replication":"https://pith.science/pith/HPKZLDQIM6M5EKGPXBKBDV4GSR/action/replication_record"}},"created_at":"2026-07-10T00:19:04.246738+00:00","updated_at":"2026-07-10T00:19:04.246738+00:00"}