{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:MTCDDY6J7PJIZ52O4CNVUHNBJS","short_pith_number":"pith:MTCDDY6J","schema_version":"1.0","canonical_sha256":"64c431e3c9fbd28cf74ee09b5a1da14c8b34831fae100fa726e857107884505d","source":{"kind":"arxiv","id":"2504.03233","version":1},"attestation_state":"computed","paper":{"title":"Data-Driven Hamiltonian for Direct Construction of Safe Set from Trajectory Data","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Christopher A. Strong, Claire J. Tomlin, Jason J. Choi, Koushil Sreenath, Namhoon Cho","submitted_at":"2025-04-04T07:29:11Z","abstract_excerpt":"In continuous-time optimal control, evaluating the Hamiltonian requires solving a constrained optimization problem using the system's dynamics model. Hamilton-Jacobi reachability analysis for safety verification has demonstrated practical utility only when efficient evaluation of the Hamiltonian over a large state-time grid is possible. In this study, we introduce the concept of a data-driven Hamiltonian (DDH), which circumvents the need for an explicit dynamics model by relying only on mild prior knowledge (e.g., Lipschitz constants), thus enabling the construction of reachable sets directly "},"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":"2504.03233","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2025-04-04T07:29:11Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"48b22da5098050600c197afb90003412a1924b7a7f000d258646b12f81a20a5c","abstract_canon_sha256":"458bab38b40d2c89ff10e99f625c6032e9efee130e03a3233926ec5a48eaca0e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:44:28.478980Z","signature_b64":"4es7+10Zs2B7gMfyjTIAbdptG9Wo0BPhRKbiWKKOVCCvXpwZrOh6I1lRun1NCtnqOqKiQ9arj+Iq9LjM4OX/BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64c431e3c9fbd28cf74ee09b5a1da14c8b34831fae100fa726e857107884505d","last_reissued_at":"2026-07-05T10:44:28.478477Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:44:28.478477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Data-Driven Hamiltonian for Direct Construction of Safe Set from Trajectory Data","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Christopher A. Strong, Claire J. Tomlin, Jason J. Choi, Koushil Sreenath, Namhoon Cho","submitted_at":"2025-04-04T07:29:11Z","abstract_excerpt":"In continuous-time optimal control, evaluating the Hamiltonian requires solving a constrained optimization problem using the system's dynamics model. Hamilton-Jacobi reachability analysis for safety verification has demonstrated practical utility only when efficient evaluation of the Hamiltonian over a large state-time grid is possible. In this study, we introduce the concept of a data-driven Hamiltonian (DDH), which circumvents the need for an explicit dynamics model by relying only on mild prior knowledge (e.g., Lipschitz constants), thus enabling the construction of reachable sets directly "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.03233","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/2504.03233/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":"2504.03233","created_at":"2026-07-05T10:44:28.478530+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.03233v1","created_at":"2026-07-05T10:44:28.478530+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.03233","created_at":"2026-07-05T10:44:28.478530+00:00"},{"alias_kind":"pith_short_12","alias_value":"MTCDDY6J7PJI","created_at":"2026-07-05T10:44:28.478530+00:00"},{"alias_kind":"pith_short_16","alias_value":"MTCDDY6J7PJIZ52O","created_at":"2026-07-05T10:44:28.478530+00:00"},{"alias_kind":"pith_short_8","alias_value":"MTCDDY6J","created_at":"2026-07-05T10:44:28.478530+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.17292","citing_title":"Robust Direct Data-Driven Hamiltonian for Safe Set Computation under Measurement Noise and Disturbances","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2602.02924","citing_title":"How Does the Lagrangian Guide Safe Reinforcement Learning through Diffusion Models?","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MTCDDY6J7PJIZ52O4CNVUHNBJS","json":"https://pith.science/pith/MTCDDY6J7PJIZ52O4CNVUHNBJS.json","graph_json":"https://pith.science/api/pith-number/MTCDDY6J7PJIZ52O4CNVUHNBJS/graph.json","events_json":"https://pith.science/api/pith-number/MTCDDY6J7PJIZ52O4CNVUHNBJS/events.json","paper":"https://pith.science/paper/MTCDDY6J"},"agent_actions":{"view_html":"https://pith.science/pith/MTCDDY6J7PJIZ52O4CNVUHNBJS","download_json":"https://pith.science/pith/MTCDDY6J7PJIZ52O4CNVUHNBJS.json","view_paper":"https://pith.science/paper/MTCDDY6J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.03233&json=true","fetch_graph":"https://pith.science/api/pith-number/MTCDDY6J7PJIZ52O4CNVUHNBJS/graph.json","fetch_events":"https://pith.science/api/pith-number/MTCDDY6J7PJIZ52O4CNVUHNBJS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MTCDDY6J7PJIZ52O4CNVUHNBJS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MTCDDY6J7PJIZ52O4CNVUHNBJS/action/storage_attestation","attest_author":"https://pith.science/pith/MTCDDY6J7PJIZ52O4CNVUHNBJS/action/author_attestation","sign_citation":"https://pith.science/pith/MTCDDY6J7PJIZ52O4CNVUHNBJS/action/citation_signature","submit_replication":"https://pith.science/pith/MTCDDY6J7PJIZ52O4CNVUHNBJS/action/replication_record"}},"created_at":"2026-07-05T10:44:28.478530+00:00","updated_at":"2026-07-05T10:44:28.478530+00:00"}