{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DHTIFOI7ILUHA5Q6T5WAOUGH7W","short_pith_number":"pith:DHTIFOI7","schema_version":"1.0","canonical_sha256":"19e682b91f42e870761e9f6c0750c7fd83d8e553b95cfe008b6ed1925ef382bf","source":{"kind":"arxiv","id":"1811.03643","version":1},"attestation_state":"computed","paper":{"title":"Voronoi Partition-based Scenario Reduction for Fast Sampling-based Stochastic Reachability Computation of LTI Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Abraham P. Vinod, Behcet Acikmese, Hossein Sartipizadeh, Meeko Oishi","submitted_at":"2018-11-08T19:05:03Z","abstract_excerpt":"In this paper, we address the stochastic reach-avoid problem for linear systems with additive stochastic uncertainty. We seek to compute the maximum probability that the states remain in a safe set over a finite time horizon and reach a target set at the final time. We employ sampling-based methods and provide a lower bound on the number of scenarios required to guarantee that our estimate provides an underapproximation. Due to the probabilistic nature of the sampling-based methods, our underapproximation guarantee is probabilistic, and the proposed lower bound can be used to satisfy a prescri"},"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":"1811.03643","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-08T19:05:03Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"59a871bd9a3ee803541d3b6c3b41c288536851022681c6e1550d758b4005ec4b","abstract_canon_sha256":"0dd0311b4969a270492402d997255969b724b83df0db404977f8608ea7df4612"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:12.462566Z","signature_b64":"e59wRbCwS3TgrZRoLYcx4tlQT8samJxiDSXCwiYsNlp0U26w4cE70vOWv63/+ZnHcl4SWU1KVkZc5vDZVVKWBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19e682b91f42e870761e9f6c0750c7fd83d8e553b95cfe008b6ed1925ef382bf","last_reissued_at":"2026-05-18T00:01:12.462037Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:12.462037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Voronoi Partition-based Scenario Reduction for Fast Sampling-based Stochastic Reachability Computation of LTI Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Abraham P. Vinod, Behcet Acikmese, Hossein Sartipizadeh, Meeko Oishi","submitted_at":"2018-11-08T19:05:03Z","abstract_excerpt":"In this paper, we address the stochastic reach-avoid problem for linear systems with additive stochastic uncertainty. We seek to compute the maximum probability that the states remain in a safe set over a finite time horizon and reach a target set at the final time. We employ sampling-based methods and provide a lower bound on the number of scenarios required to guarantee that our estimate provides an underapproximation. Due to the probabilistic nature of the sampling-based methods, our underapproximation guarantee is probabilistic, and the proposed lower bound can be used to satisfy a prescri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.03643","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":""},"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":"1811.03643","created_at":"2026-05-18T00:01:12.462117+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.03643v1","created_at":"2026-05-18T00:01:12.462117+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03643","created_at":"2026-05-18T00:01:12.462117+00:00"},{"alias_kind":"pith_short_12","alias_value":"DHTIFOI7ILUH","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DHTIFOI7ILUHA5Q6","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DHTIFOI7","created_at":"2026-05-18T12:32:19.392346+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/DHTIFOI7ILUHA5Q6T5WAOUGH7W","json":"https://pith.science/pith/DHTIFOI7ILUHA5Q6T5WAOUGH7W.json","graph_json":"https://pith.science/api/pith-number/DHTIFOI7ILUHA5Q6T5WAOUGH7W/graph.json","events_json":"https://pith.science/api/pith-number/DHTIFOI7ILUHA5Q6T5WAOUGH7W/events.json","paper":"https://pith.science/paper/DHTIFOI7"},"agent_actions":{"view_html":"https://pith.science/pith/DHTIFOI7ILUHA5Q6T5WAOUGH7W","download_json":"https://pith.science/pith/DHTIFOI7ILUHA5Q6T5WAOUGH7W.json","view_paper":"https://pith.science/paper/DHTIFOI7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.03643&json=true","fetch_graph":"https://pith.science/api/pith-number/DHTIFOI7ILUHA5Q6T5WAOUGH7W/graph.json","fetch_events":"https://pith.science/api/pith-number/DHTIFOI7ILUHA5Q6T5WAOUGH7W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DHTIFOI7ILUHA5Q6T5WAOUGH7W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DHTIFOI7ILUHA5Q6T5WAOUGH7W/action/storage_attestation","attest_author":"https://pith.science/pith/DHTIFOI7ILUHA5Q6T5WAOUGH7W/action/author_attestation","sign_citation":"https://pith.science/pith/DHTIFOI7ILUHA5Q6T5WAOUGH7W/action/citation_signature","submit_replication":"https://pith.science/pith/DHTIFOI7ILUHA5Q6T5WAOUGH7W/action/replication_record"}},"created_at":"2026-05-18T00:01:12.462117+00:00","updated_at":"2026-05-18T00:01:12.462117+00:00"}