{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:UQRFRFBVWYQTEXRLBN2LB4N5C4","short_pith_number":"pith:UQRFRFBV","schema_version":"1.0","canonical_sha256":"a422589435b621325e2b0b74b0f1bd17045a5099634c0e8b5fac2e2db4fbe6e2","source":{"kind":"arxiv","id":"2407.20532","version":2},"attestation_state":"computed","paper":{"title":"Scalable Synthesis of Formally Verified Neural Value Function for Hamilton-Jacobi Reachability Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Changliu Liu, Hanjiang Hu, Shengbo Eben Li, Tianhao Wei, Yujie Yang","submitted_at":"2024-07-30T04:14:52Z","abstract_excerpt":"Hamilton-Jacobi (HJ) reachability analysis provides a formal method for guaranteeing safety in constrained control problems. It synthesizes a value function to represent a long-term safe set called feasible region. Early synthesis methods based on state space discretization cannot scale to high-dimensional problems, while recent methods that use neural networks to approximate value functions result in unverifiable feasible regions. To achieve both scalability and verifiability, we propose a framework for synthesizing verified neural value functions for HJ reachability analysis. Our framework c"},"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":"2407.20532","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2024-07-30T04:14:52Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"5aedd650562afc51cb801013b02bd576ea820d7426a4787219118827680c68b4","abstract_canon_sha256":"60387b1a69f651ef21e4d5bdbe96c1fffd61dcc1b9372d60df6c2555be913182"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:46:19.870271Z","signature_b64":"WdghkZuDWN1e2VOtThxMfL0AShaj0MFe9BMR7WPL6NSfKtntKUXuNZ9wgySx6lEPCWCD36vU+gYQ5AHNJNhQDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a422589435b621325e2b0b74b0f1bd17045a5099634c0e8b5fac2e2db4fbe6e2","last_reissued_at":"2026-07-05T11:46:19.869780Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:46:19.869780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Synthesis of Formally Verified Neural Value Function for Hamilton-Jacobi Reachability Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Changliu Liu, Hanjiang Hu, Shengbo Eben Li, Tianhao Wei, Yujie Yang","submitted_at":"2024-07-30T04:14:52Z","abstract_excerpt":"Hamilton-Jacobi (HJ) reachability analysis provides a formal method for guaranteeing safety in constrained control problems. It synthesizes a value function to represent a long-term safe set called feasible region. Early synthesis methods based on state space discretization cannot scale to high-dimensional problems, while recent methods that use neural networks to approximate value functions result in unverifiable feasible regions. To achieve both scalability and verifiability, we propose a framework for synthesizing verified neural value functions for HJ reachability analysis. Our framework c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.20532","kind":"arxiv","version":2},"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/2407.20532/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":"2407.20532","created_at":"2026-07-05T11:46:19.869838+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.20532v2","created_at":"2026-07-05T11:46:19.869838+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.20532","created_at":"2026-07-05T11:46:19.869838+00:00"},{"alias_kind":"pith_short_12","alias_value":"UQRFRFBVWYQT","created_at":"2026-07-05T11:46:19.869838+00:00"},{"alias_kind":"pith_short_16","alias_value":"UQRFRFBVWYQTEXRL","created_at":"2026-07-05T11:46:19.869838+00:00"},{"alias_kind":"pith_short_8","alias_value":"UQRFRFBV","created_at":"2026-07-05T11:46:19.869838+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.07757","citing_title":"Efficient Verification of Neural Control Barrier Functions with Smooth Nonlinear Activations","ref_index":19,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UQRFRFBVWYQTEXRLBN2LB4N5C4","json":"https://pith.science/pith/UQRFRFBVWYQTEXRLBN2LB4N5C4.json","graph_json":"https://pith.science/api/pith-number/UQRFRFBVWYQTEXRLBN2LB4N5C4/graph.json","events_json":"https://pith.science/api/pith-number/UQRFRFBVWYQTEXRLBN2LB4N5C4/events.json","paper":"https://pith.science/paper/UQRFRFBV"},"agent_actions":{"view_html":"https://pith.science/pith/UQRFRFBVWYQTEXRLBN2LB4N5C4","download_json":"https://pith.science/pith/UQRFRFBVWYQTEXRLBN2LB4N5C4.json","view_paper":"https://pith.science/paper/UQRFRFBV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.20532&json=true","fetch_graph":"https://pith.science/api/pith-number/UQRFRFBVWYQTEXRLBN2LB4N5C4/graph.json","fetch_events":"https://pith.science/api/pith-number/UQRFRFBVWYQTEXRLBN2LB4N5C4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UQRFRFBVWYQTEXRLBN2LB4N5C4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UQRFRFBVWYQTEXRLBN2LB4N5C4/action/storage_attestation","attest_author":"https://pith.science/pith/UQRFRFBVWYQTEXRLBN2LB4N5C4/action/author_attestation","sign_citation":"https://pith.science/pith/UQRFRFBVWYQTEXRLBN2LB4N5C4/action/citation_signature","submit_replication":"https://pith.science/pith/UQRFRFBVWYQTEXRLBN2LB4N5C4/action/replication_record"}},"created_at":"2026-07-05T11:46:19.869838+00:00","updated_at":"2026-07-05T11:46:19.869838+00:00"}