{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:IWDJTBNFRLUVP3GZ45ZTBJDRTR","short_pith_number":"pith:IWDJTBNF","schema_version":"1.0","canonical_sha256":"45869985a58ae957ecd9e77330a4719c655fcffc8514a13b92c5acf55e3239b5","source":{"kind":"arxiv","id":"2309.09187","version":1},"attestation_state":"computed","paper":{"title":"Data-Driven Reachability Analysis of Stochastic Dynamical Systems with Conformal Inference","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.LG","cs.RO","cs.SY"],"primary_cat":"eess.SY","authors_text":"Jyotirmoy V. Deshmukh, Lars Lindemann, Navid Hashemi, Xin Qin","submitted_at":"2023-09-17T07:23:01Z","abstract_excerpt":"We consider data-driven reachability analysis of discrete-time stochastic dynamical systems using conformal inference. We assume that we are not provided with a symbolic representation of the stochastic system, but instead have access to a dataset of $K$-step trajectories. The reachability problem is to construct a probabilistic flowpipe such that the probability that a $K$-step trajectory can violate the bounds of the flowpipe does not exceed a user-specified failure probability threshold. The key ideas in this paper are: (1) to learn a surrogate predictor model from data, (2) to perform reac"},"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":"2309.09187","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"eess.SY","submitted_at":"2023-09-17T07:23:01Z","cross_cats_sorted":["cs.LG","cs.RO","cs.SY"],"title_canon_sha256":"397b7e6e528c279ec1e667584522723f73e691b1239d71e4996abe2f5e4b0716","abstract_canon_sha256":"78d58f306cc0a3c2ce354ab829e7720084bd3da8ca6b2f8fbe6703137ab12c60"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:51:35.743276Z","signature_b64":"T2KxJJs+38zO4OQL0XEUBRIYbAHP/NnQI5k7F18P2C39hvA2isUVRy719oa1dL29u9ZdTlBxLFxpJP0/IaxTAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45869985a58ae957ecd9e77330a4719c655fcffc8514a13b92c5acf55e3239b5","last_reissued_at":"2026-07-05T06:51:35.742812Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:51:35.742812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Data-Driven Reachability Analysis of Stochastic Dynamical Systems with Conformal Inference","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.LG","cs.RO","cs.SY"],"primary_cat":"eess.SY","authors_text":"Jyotirmoy V. Deshmukh, Lars Lindemann, Navid Hashemi, Xin Qin","submitted_at":"2023-09-17T07:23:01Z","abstract_excerpt":"We consider data-driven reachability analysis of discrete-time stochastic dynamical systems using conformal inference. We assume that we are not provided with a symbolic representation of the stochastic system, but instead have access to a dataset of $K$-step trajectories. The reachability problem is to construct a probabilistic flowpipe such that the probability that a $K$-step trajectory can violate the bounds of the flowpipe does not exceed a user-specified failure probability threshold. The key ideas in this paper are: (1) to learn a surrogate predictor model from data, (2) to perform reac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.09187","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/2309.09187/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":"2309.09187","created_at":"2026-07-05T06:51:35.742866+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.09187v1","created_at":"2026-07-05T06:51:35.742866+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.09187","created_at":"2026-07-05T06:51:35.742866+00:00"},{"alias_kind":"pith_short_12","alias_value":"IWDJTBNFRLUV","created_at":"2026-07-05T06:51:35.742866+00:00"},{"alias_kind":"pith_short_16","alias_value":"IWDJTBNFRLUVP3GZ","created_at":"2026-07-05T06:51:35.742866+00:00"},{"alias_kind":"pith_short_8","alias_value":"IWDJTBNF","created_at":"2026-07-05T06:51:35.742866+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2512.02893","citing_title":"Statistical-Symbolic Verification of Perception-Based Autonomous Systems using State-Dependent Conformal Prediction","ref_index":29,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IWDJTBNFRLUVP3GZ45ZTBJDRTR","json":"https://pith.science/pith/IWDJTBNFRLUVP3GZ45ZTBJDRTR.json","graph_json":"https://pith.science/api/pith-number/IWDJTBNFRLUVP3GZ45ZTBJDRTR/graph.json","events_json":"https://pith.science/api/pith-number/IWDJTBNFRLUVP3GZ45ZTBJDRTR/events.json","paper":"https://pith.science/paper/IWDJTBNF"},"agent_actions":{"view_html":"https://pith.science/pith/IWDJTBNFRLUVP3GZ45ZTBJDRTR","download_json":"https://pith.science/pith/IWDJTBNFRLUVP3GZ45ZTBJDRTR.json","view_paper":"https://pith.science/paper/IWDJTBNF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.09187&json=true","fetch_graph":"https://pith.science/api/pith-number/IWDJTBNFRLUVP3GZ45ZTBJDRTR/graph.json","fetch_events":"https://pith.science/api/pith-number/IWDJTBNFRLUVP3GZ45ZTBJDRTR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IWDJTBNFRLUVP3GZ45ZTBJDRTR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IWDJTBNFRLUVP3GZ45ZTBJDRTR/action/storage_attestation","attest_author":"https://pith.science/pith/IWDJTBNFRLUVP3GZ45ZTBJDRTR/action/author_attestation","sign_citation":"https://pith.science/pith/IWDJTBNFRLUVP3GZ45ZTBJDRTR/action/citation_signature","submit_replication":"https://pith.science/pith/IWDJTBNFRLUVP3GZ45ZTBJDRTR/action/replication_record"}},"created_at":"2026-07-05T06:51:35.742866+00:00","updated_at":"2026-07-05T06:51:35.742866+00:00"}