{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:OA5RHZJBZYCCJUC2B5C36W6UX3","short_pith_number":"pith:OA5RHZJB","schema_version":"1.0","canonical_sha256":"703b13e521ce0424d05a0f45bf5bd4bee49a377ca50a8e8183a3163fd85ae820","source":{"kind":"arxiv","id":"2509.10896","version":1},"attestation_state":"computed","paper":{"title":"Control Synthesis for Multiple Reach-Avoid Tasks via Hamilton-Jacobi Reachability Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Shaoyuan Li, Xiang Yin, Yu Chen","submitted_at":"2025-09-13T16:54:27Z","abstract_excerpt":"We investigate the control synthesis problem for continuous-time time-varying nonlinear systems with disturbance under a class of multiple reach-avoid (MRA) tasks. Specifically, the MRA task requires the system to reach a series of target regions in a specified order while satisfying state constraints between each pair of target arrivals. This problem is more challenging than standard reach-avoid tasks, as it requires considering the feasibility of future reach-avoid tasks during the planning process. To solve this problem, we define a series of value functions by solving a cascade of time-var"},"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":"2509.10896","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2025-09-13T16:54:27Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"8a61b1e1cf2fa96a4ee86c6c5515c4eecb973652d3d661a781a417661d1060a4","abstract_canon_sha256":"d72d631cef45a27f2828a2617e1a572ba9d483478631cb5d2fca9d6256b7fc1c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:11:30.012026Z","signature_b64":"Jl2HazSrIP8LQcNAPCIqHkRvkRCc113G/rq0GTq/YFP9leIOGVGGlQyAwKU3erqdEuie7Rq09iA9C1KbinODAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"703b13e521ce0424d05a0f45bf5bd4bee49a377ca50a8e8183a3163fd85ae820","last_reissued_at":"2026-07-05T12:11:30.011566Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:11:30.011566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Control Synthesis for Multiple Reach-Avoid Tasks via Hamilton-Jacobi Reachability Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Shaoyuan Li, Xiang Yin, Yu Chen","submitted_at":"2025-09-13T16:54:27Z","abstract_excerpt":"We investigate the control synthesis problem for continuous-time time-varying nonlinear systems with disturbance under a class of multiple reach-avoid (MRA) tasks. Specifically, the MRA task requires the system to reach a series of target regions in a specified order while satisfying state constraints between each pair of target arrivals. This problem is more challenging than standard reach-avoid tasks, as it requires considering the feasibility of future reach-avoid tasks during the planning process. To solve this problem, we define a series of value functions by solving a cascade of time-var"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.10896","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/2509.10896/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":"2509.10896","created_at":"2026-07-05T12:11:30.011618+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.10896v1","created_at":"2026-07-05T12:11:30.011618+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.10896","created_at":"2026-07-05T12:11:30.011618+00:00"},{"alias_kind":"pith_short_12","alias_value":"OA5RHZJBZYCC","created_at":"2026-07-05T12:11:30.011618+00:00"},{"alias_kind":"pith_short_16","alias_value":"OA5RHZJBZYCCJUC2","created_at":"2026-07-05T12:11:30.011618+00:00"},{"alias_kind":"pith_short_8","alias_value":"OA5RHZJB","created_at":"2026-07-05T12:11:30.011618+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/OA5RHZJBZYCCJUC2B5C36W6UX3","json":"https://pith.science/pith/OA5RHZJBZYCCJUC2B5C36W6UX3.json","graph_json":"https://pith.science/api/pith-number/OA5RHZJBZYCCJUC2B5C36W6UX3/graph.json","events_json":"https://pith.science/api/pith-number/OA5RHZJBZYCCJUC2B5C36W6UX3/events.json","paper":"https://pith.science/paper/OA5RHZJB"},"agent_actions":{"view_html":"https://pith.science/pith/OA5RHZJBZYCCJUC2B5C36W6UX3","download_json":"https://pith.science/pith/OA5RHZJBZYCCJUC2B5C36W6UX3.json","view_paper":"https://pith.science/paper/OA5RHZJB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.10896&json=true","fetch_graph":"https://pith.science/api/pith-number/OA5RHZJBZYCCJUC2B5C36W6UX3/graph.json","fetch_events":"https://pith.science/api/pith-number/OA5RHZJBZYCCJUC2B5C36W6UX3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OA5RHZJBZYCCJUC2B5C36W6UX3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OA5RHZJBZYCCJUC2B5C36W6UX3/action/storage_attestation","attest_author":"https://pith.science/pith/OA5RHZJBZYCCJUC2B5C36W6UX3/action/author_attestation","sign_citation":"https://pith.science/pith/OA5RHZJBZYCCJUC2B5C36W6UX3/action/citation_signature","submit_replication":"https://pith.science/pith/OA5RHZJBZYCCJUC2B5C36W6UX3/action/replication_record"}},"created_at":"2026-07-05T12:11:30.011618+00:00","updated_at":"2026-07-05T12:11:30.011618+00:00"}