{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:YYX3CJWU3ENCAR23SCWFW6O5U4","short_pith_number":"pith:YYX3CJWU","schema_version":"1.0","canonical_sha256":"c62fb126d4d91a20475b90ac5b79dda7303cc0732357aa10f30797c367a357a7","source":{"kind":"arxiv","id":"2108.03386","version":1},"attestation_state":"computed","paper":{"title":"Probabilistic Reach-Avoid Reachability in Nondeterministic Systems with Time-VaryingTargets and Obstacles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Qiaozhi Yin, Taotao Liang, Wei Liao, Xiaohui Wei","submitted_at":"2021-08-07T07:36:38Z","abstract_excerpt":"The probabilistic reachability problems of nondeterministic systems are studied. Based on the existing studies, the definition of probabilistic reachable sets is generalized by taking into account time-varying target set and obstacle. A numerical method is proposed to compute probabilistic reachable sets. First, a scalar function in the state space is constructed by backward recursion and grid interpolation, and then the probability reachable set is represented as a nonzero level set of this scalar function. In addition, based on the constructed scalar function, the optimal control policy can "},"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":"2108.03386","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2021-08-07T07:36:38Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"f19b5af7173589fcf311ca6dd9b3a5f688b4916498823f25056b103b093e350e","abstract_canon_sha256":"bc8e5a02499e9c7e697e4963c0fb925ef6d3ffe88e6b82e2d89fe59d71227d17"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:03:52.408869Z","signature_b64":"GXOuzfwCA+/foIta6v1n+4j5vRuWPvTSGKiQRSJ6bmDSbhX9suTz6btffK9pB1ISlE7hmabAxL7PfoDtj1eHDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c62fb126d4d91a20475b90ac5b79dda7303cc0732357aa10f30797c367a357a7","last_reissued_at":"2026-07-05T03:03:52.408393Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:03:52.408393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Probabilistic Reach-Avoid Reachability in Nondeterministic Systems with Time-VaryingTargets and Obstacles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Qiaozhi Yin, Taotao Liang, Wei Liao, Xiaohui Wei","submitted_at":"2021-08-07T07:36:38Z","abstract_excerpt":"The probabilistic reachability problems of nondeterministic systems are studied. Based on the existing studies, the definition of probabilistic reachable sets is generalized by taking into account time-varying target set and obstacle. A numerical method is proposed to compute probabilistic reachable sets. First, a scalar function in the state space is constructed by backward recursion and grid interpolation, and then the probability reachable set is represented as a nonzero level set of this scalar function. In addition, based on the constructed scalar function, the optimal control policy can "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.03386","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/2108.03386/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":"2108.03386","created_at":"2026-07-05T03:03:52.408450+00:00"},{"alias_kind":"arxiv_version","alias_value":"2108.03386v1","created_at":"2026-07-05T03:03:52.408450+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.03386","created_at":"2026-07-05T03:03:52.408450+00:00"},{"alias_kind":"pith_short_12","alias_value":"YYX3CJWU3ENC","created_at":"2026-07-05T03:03:52.408450+00:00"},{"alias_kind":"pith_short_16","alias_value":"YYX3CJWU3ENCAR23","created_at":"2026-07-05T03:03:52.408450+00:00"},{"alias_kind":"pith_short_8","alias_value":"YYX3CJWU","created_at":"2026-07-05T03:03:52.408450+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/YYX3CJWU3ENCAR23SCWFW6O5U4","json":"https://pith.science/pith/YYX3CJWU3ENCAR23SCWFW6O5U4.json","graph_json":"https://pith.science/api/pith-number/YYX3CJWU3ENCAR23SCWFW6O5U4/graph.json","events_json":"https://pith.science/api/pith-number/YYX3CJWU3ENCAR23SCWFW6O5U4/events.json","paper":"https://pith.science/paper/YYX3CJWU"},"agent_actions":{"view_html":"https://pith.science/pith/YYX3CJWU3ENCAR23SCWFW6O5U4","download_json":"https://pith.science/pith/YYX3CJWU3ENCAR23SCWFW6O5U4.json","view_paper":"https://pith.science/paper/YYX3CJWU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2108.03386&json=true","fetch_graph":"https://pith.science/api/pith-number/YYX3CJWU3ENCAR23SCWFW6O5U4/graph.json","fetch_events":"https://pith.science/api/pith-number/YYX3CJWU3ENCAR23SCWFW6O5U4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YYX3CJWU3ENCAR23SCWFW6O5U4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YYX3CJWU3ENCAR23SCWFW6O5U4/action/storage_attestation","attest_author":"https://pith.science/pith/YYX3CJWU3ENCAR23SCWFW6O5U4/action/author_attestation","sign_citation":"https://pith.science/pith/YYX3CJWU3ENCAR23SCWFW6O5U4/action/citation_signature","submit_replication":"https://pith.science/pith/YYX3CJWU3ENCAR23SCWFW6O5U4/action/replication_record"}},"created_at":"2026-07-05T03:03:52.408450+00:00","updated_at":"2026-07-05T03:03:52.408450+00:00"}