{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:2HIAFQMQ55MTXEB2YUGLSKIMTF","short_pith_number":"pith:2HIAFQMQ","schema_version":"1.0","canonical_sha256":"d1d002c190ef593b903ac50cb9290c997c2c554b601a4bf29fc1ce9128cab8fc","source":{"kind":"arxiv","id":"2409.09334","version":1},"attestation_state":"computed","paper":{"title":"Probabilistic Reachability of Discrete-Time Nonlinear Stochastic Systems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"eess.SY","authors_text":"Saber Jafarpour, Yongxin Chen, Zishun Liu","submitted_at":"2024-09-14T06:44:04Z","abstract_excerpt":"In this paper we study the reachability problem for discrete-time nonlinear stochastic systems. Our goal is to present a unified framework for calculating the probabilistic reachable set of discrete-time systems in the presence of both deterministic input and stochastic noise. By adopting a suitable separation strategy, the probabilistic reachable set is decoupled into a deterministic reachable set and the effect of the stochastic noise. To capture the effect of the stochastic noise, in particular sub-Gaussian noise, we provide a probabilistic bound on the distance between a stochastic traject"},"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":"2409.09334","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2024-09-14T06:44:04Z","cross_cats_sorted":["cs.SY","math.OC"],"title_canon_sha256":"da04114b99637438d684e270e04f3ed45007c3fbe6f81f0e8051fe8332e9235b","abstract_canon_sha256":"14f354967835a7dcd5e360ac42a7ff1e54d4e3ac8134861b8709127973c5274c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:07:08.268960Z","signature_b64":"fyKGiZj8ohb7wlrqvdGTmnKoOCiK11gngOetI7vN8P7QQhiQNWZoRqpEMFyATRmojwSjF30QudL+7V6zGZUNCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1d002c190ef593b903ac50cb9290c997c2c554b601a4bf29fc1ce9128cab8fc","last_reissued_at":"2026-07-05T09:07:08.268509Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:07:08.268509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Probabilistic Reachability of Discrete-Time Nonlinear Stochastic Systems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"eess.SY","authors_text":"Saber Jafarpour, Yongxin Chen, Zishun Liu","submitted_at":"2024-09-14T06:44:04Z","abstract_excerpt":"In this paper we study the reachability problem for discrete-time nonlinear stochastic systems. Our goal is to present a unified framework for calculating the probabilistic reachable set of discrete-time systems in the presence of both deterministic input and stochastic noise. By adopting a suitable separation strategy, the probabilistic reachable set is decoupled into a deterministic reachable set and the effect of the stochastic noise. To capture the effect of the stochastic noise, in particular sub-Gaussian noise, we provide a probabilistic bound on the distance between a stochastic traject"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.09334","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/2409.09334/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":"2409.09334","created_at":"2026-07-05T09:07:08.268570+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.09334v1","created_at":"2026-07-05T09:07:08.268570+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.09334","created_at":"2026-07-05T09:07:08.268570+00:00"},{"alias_kind":"pith_short_12","alias_value":"2HIAFQMQ55MT","created_at":"2026-07-05T09:07:08.268570+00:00"},{"alias_kind":"pith_short_16","alias_value":"2HIAFQMQ55MTXEB2","created_at":"2026-07-05T09:07:08.268570+00:00"},{"alias_kind":"pith_short_8","alias_value":"2HIAFQMQ","created_at":"2026-07-05T09:07:08.268570+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2503.04762","citing_title":"Safety Verification of Stochastic Systems under Signal Temporal Logic Specifications","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2HIAFQMQ55MTXEB2YUGLSKIMTF","json":"https://pith.science/pith/2HIAFQMQ55MTXEB2YUGLSKIMTF.json","graph_json":"https://pith.science/api/pith-number/2HIAFQMQ55MTXEB2YUGLSKIMTF/graph.json","events_json":"https://pith.science/api/pith-number/2HIAFQMQ55MTXEB2YUGLSKIMTF/events.json","paper":"https://pith.science/paper/2HIAFQMQ"},"agent_actions":{"view_html":"https://pith.science/pith/2HIAFQMQ55MTXEB2YUGLSKIMTF","download_json":"https://pith.science/pith/2HIAFQMQ55MTXEB2YUGLSKIMTF.json","view_paper":"https://pith.science/paper/2HIAFQMQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.09334&json=true","fetch_graph":"https://pith.science/api/pith-number/2HIAFQMQ55MTXEB2YUGLSKIMTF/graph.json","fetch_events":"https://pith.science/api/pith-number/2HIAFQMQ55MTXEB2YUGLSKIMTF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2HIAFQMQ55MTXEB2YUGLSKIMTF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2HIAFQMQ55MTXEB2YUGLSKIMTF/action/storage_attestation","attest_author":"https://pith.science/pith/2HIAFQMQ55MTXEB2YUGLSKIMTF/action/author_attestation","sign_citation":"https://pith.science/pith/2HIAFQMQ55MTXEB2YUGLSKIMTF/action/citation_signature","submit_replication":"https://pith.science/pith/2HIAFQMQ55MTXEB2YUGLSKIMTF/action/replication_record"}},"created_at":"2026-07-05T09:07:08.268570+00:00","updated_at":"2026-07-05T09:07:08.268570+00:00"}