{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:WOFB7GOTW4WO43TAD62P2EZ65W","short_pith_number":"pith:WOFB7GOT","schema_version":"1.0","canonical_sha256":"b38a1f99d3b72cee6e601fb4fd133eed81ca359bf07bee150cc741d8b908283e","source":{"kind":"arxiv","id":"2404.08334","version":1},"attestation_state":"computed","paper":{"title":"Guaranteed Completion of Complex Tasks via Temporal Logic Trees and Hamilton-Jacobi Reachability","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.RO","cs.SY"],"primary_cat":"eess.SY","authors_text":"Chong He, Frank J. Jiang, Kaj Munhoz Arfvidsson, Karl H. Johansson, Mo Chen","submitted_at":"2024-04-12T08:56:16Z","abstract_excerpt":"In this paper, we present an approach for guaranteeing the completion of complex tasks with cyber-physical systems (CPS). Specifically, we leverage temporal logic trees constructed using Hamilton-Jacobi reachability analysis to (1) check for the existence of control policies that complete a specified task and (2) develop a computationally-efficient approach to synthesize the full set of control inputs the CPS can implement in real-time to ensure the task is completed. We show that, by checking the approximation directions of each state set in the temporal logic tree, we can check if the tempor"},"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":"2404.08334","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2024-04-12T08:56:16Z","cross_cats_sorted":["cs.RO","cs.SY"],"title_canon_sha256":"c738b5f1f249947924e7bada710a3dcb3a7f0cf3e17acdc601beb20c3bffaf6f","abstract_canon_sha256":"1589a934d91d6d4d72da9c4fa14d1bfd7735e2d88eeb633e9e04153f688ca044"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:07:20.788391Z","signature_b64":"nZEZXP6mRwtQczXmN4/KB4NBhiFd5hFVIrqjVHivgpkhrWenYYWrCnIVgDt/Iu4TctFJpVNaFQglQN4ye6tgBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b38a1f99d3b72cee6e601fb4fd133eed81ca359bf07bee150cc741d8b908283e","last_reissued_at":"2026-07-05T08:07:20.788021Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:07:20.788021Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Guaranteed Completion of Complex Tasks via Temporal Logic Trees and Hamilton-Jacobi Reachability","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.RO","cs.SY"],"primary_cat":"eess.SY","authors_text":"Chong He, Frank J. Jiang, Kaj Munhoz Arfvidsson, Karl H. Johansson, Mo Chen","submitted_at":"2024-04-12T08:56:16Z","abstract_excerpt":"In this paper, we present an approach for guaranteeing the completion of complex tasks with cyber-physical systems (CPS). Specifically, we leverage temporal logic trees constructed using Hamilton-Jacobi reachability analysis to (1) check for the existence of control policies that complete a specified task and (2) develop a computationally-efficient approach to synthesize the full set of control inputs the CPS can implement in real-time to ensure the task is completed. We show that, by checking the approximation directions of each state set in the temporal logic tree, we can check if the tempor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.08334","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/2404.08334/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":"2404.08334","created_at":"2026-07-05T08:07:20.788083+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.08334v1","created_at":"2026-07-05T08:07:20.788083+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.08334","created_at":"2026-07-05T08:07:20.788083+00:00"},{"alias_kind":"pith_short_12","alias_value":"WOFB7GOTW4WO","created_at":"2026-07-05T08:07:20.788083+00:00"},{"alias_kind":"pith_short_16","alias_value":"WOFB7GOTW4WO43TA","created_at":"2026-07-05T08:07:20.788083+00:00"},{"alias_kind":"pith_short_8","alias_value":"WOFB7GOT","created_at":"2026-07-05T08:07:20.788083+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.10896","citing_title":"Control Synthesis for Multiple Reach-Avoid Tasks via Hamilton-Jacobi Reachability Analysis","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WOFB7GOTW4WO43TAD62P2EZ65W","json":"https://pith.science/pith/WOFB7GOTW4WO43TAD62P2EZ65W.json","graph_json":"https://pith.science/api/pith-number/WOFB7GOTW4WO43TAD62P2EZ65W/graph.json","events_json":"https://pith.science/api/pith-number/WOFB7GOTW4WO43TAD62P2EZ65W/events.json","paper":"https://pith.science/paper/WOFB7GOT"},"agent_actions":{"view_html":"https://pith.science/pith/WOFB7GOTW4WO43TAD62P2EZ65W","download_json":"https://pith.science/pith/WOFB7GOTW4WO43TAD62P2EZ65W.json","view_paper":"https://pith.science/paper/WOFB7GOT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.08334&json=true","fetch_graph":"https://pith.science/api/pith-number/WOFB7GOTW4WO43TAD62P2EZ65W/graph.json","fetch_events":"https://pith.science/api/pith-number/WOFB7GOTW4WO43TAD62P2EZ65W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WOFB7GOTW4WO43TAD62P2EZ65W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WOFB7GOTW4WO43TAD62P2EZ65W/action/storage_attestation","attest_author":"https://pith.science/pith/WOFB7GOTW4WO43TAD62P2EZ65W/action/author_attestation","sign_citation":"https://pith.science/pith/WOFB7GOTW4WO43TAD62P2EZ65W/action/citation_signature","submit_replication":"https://pith.science/pith/WOFB7GOTW4WO43TAD62P2EZ65W/action/replication_record"}},"created_at":"2026-07-05T08:07:20.788083+00:00","updated_at":"2026-07-05T08:07:20.788083+00:00"}