{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:K6R25TJADEEGFEQQG5FK7VNXGG","short_pith_number":"pith:K6R25TJA","schema_version":"1.0","canonical_sha256":"57a3aecd201908629210374aafd5b731ae02e562864fedc0685ba823d378fdfa","source":{"kind":"arxiv","id":"2303.11590","version":7},"attestation_state":"computed","paper":{"title":"Koopman-Hopf Hamilton-Jacobi Reachability and Control","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"eess.SY","authors_text":"Matthew Kim, Nikhil Shinde, Sylvia Herbert, Will Sharpless, Yat Tin Chow","submitted_at":"2023-03-21T04:42:06Z","abstract_excerpt":"The Hopf formula for Hamilton-Jacobi reachability (HJR) analysis has been proposed to solve high-dimensional differential games, producing the set of initial states and corresponding controller required to reach (or avoid) a target despite bounded disturbances. As a space-parallelizable method, the Hopf formula avoids the curse of dimensionality that afflicts standard dynamic-programming HJR, but is restricted to linear time-varying systems. To compute reachable sets for high-dimensional nonlinear systems, we pair the Hopf solution with Koopman theory for global linearization. By first lifting"},"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":"2303.11590","kind":"arxiv","version":7},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"eess.SY","submitted_at":"2023-03-21T04:42:06Z","cross_cats_sorted":["cs.SY","math.OC"],"title_canon_sha256":"e342b95a749bede6724587baee63f21592ca5294faa9f3a80b34ba7be93cfecd","abstract_canon_sha256":"416c6f5b69ee041299ed828753b504b9b78af0d97ab65196be227caf3f933a23"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:24:00.156162Z","signature_b64":"TRBy+b/SSC7spOeQSoulsdibPmmSY4NDxIPHOjbKzJ5agzfT22tdCEtzVQbs4QSiKi5nBfDKq9hxBDHkonKhDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57a3aecd201908629210374aafd5b731ae02e562864fedc0685ba823d378fdfa","last_reissued_at":"2026-07-05T11:24:00.155400Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:24:00.155400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Koopman-Hopf Hamilton-Jacobi Reachability and Control","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"eess.SY","authors_text":"Matthew Kim, Nikhil Shinde, Sylvia Herbert, Will Sharpless, Yat Tin Chow","submitted_at":"2023-03-21T04:42:06Z","abstract_excerpt":"The Hopf formula for Hamilton-Jacobi reachability (HJR) analysis has been proposed to solve high-dimensional differential games, producing the set of initial states and corresponding controller required to reach (or avoid) a target despite bounded disturbances. As a space-parallelizable method, the Hopf formula avoids the curse of dimensionality that afflicts standard dynamic-programming HJR, but is restricted to linear time-varying systems. To compute reachable sets for high-dimensional nonlinear systems, we pair the Hopf solution with Koopman theory for global linearization. By first lifting"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.11590","kind":"arxiv","version":7},"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/2303.11590/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":"2303.11590","created_at":"2026-07-05T11:24:00.155484+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.11590v7","created_at":"2026-07-05T11:24:00.155484+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.11590","created_at":"2026-07-05T11:24:00.155484+00:00"},{"alias_kind":"pith_short_12","alias_value":"K6R25TJADEEG","created_at":"2026-07-05T11:24:00.155484+00:00"},{"alias_kind":"pith_short_16","alias_value":"K6R25TJADEEGFEQQ","created_at":"2026-07-05T11:24:00.155484+00:00"},{"alias_kind":"pith_short_8","alias_value":"K6R25TJA","created_at":"2026-07-05T11:24:00.155484+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.02033","citing_title":"Linear Supervision for Nonlinear, High-Dimensional Neural Control and Differential Games","ref_index":40,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/K6R25TJADEEGFEQQG5FK7VNXGG","json":"https://pith.science/pith/K6R25TJADEEGFEQQG5FK7VNXGG.json","graph_json":"https://pith.science/api/pith-number/K6R25TJADEEGFEQQG5FK7VNXGG/graph.json","events_json":"https://pith.science/api/pith-number/K6R25TJADEEGFEQQG5FK7VNXGG/events.json","paper":"https://pith.science/paper/K6R25TJA"},"agent_actions":{"view_html":"https://pith.science/pith/K6R25TJADEEGFEQQG5FK7VNXGG","download_json":"https://pith.science/pith/K6R25TJADEEGFEQQG5FK7VNXGG.json","view_paper":"https://pith.science/paper/K6R25TJA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.11590&json=true","fetch_graph":"https://pith.science/api/pith-number/K6R25TJADEEGFEQQG5FK7VNXGG/graph.json","fetch_events":"https://pith.science/api/pith-number/K6R25TJADEEGFEQQG5FK7VNXGG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K6R25TJADEEGFEQQG5FK7VNXGG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K6R25TJADEEGFEQQG5FK7VNXGG/action/storage_attestation","attest_author":"https://pith.science/pith/K6R25TJADEEGFEQQG5FK7VNXGG/action/author_attestation","sign_citation":"https://pith.science/pith/K6R25TJADEEGFEQQG5FK7VNXGG/action/citation_signature","submit_replication":"https://pith.science/pith/K6R25TJADEEGFEQQG5FK7VNXGG/action/replication_record"}},"created_at":"2026-07-05T11:24:00.155484+00:00","updated_at":"2026-07-05T11:24:00.155484+00:00"}