{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DHTIFOI7ILUHA5Q6T5WAOUGH7W","short_pith_number":"pith:DHTIFOI7","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"},"canonical_sha256":"19e682b91f42e870761e9f6c0750c7fd83d8e553b95cfe008b6ed1925ef382bf","source":{"kind":"arxiv","id":"1811.03643","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.03643","created_at":"2026-05-18T00:01:12Z"},{"alias_kind":"arxiv_version","alias_value":"1811.03643v1","created_at":"2026-05-18T00:01:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03643","created_at":"2026-05-18T00:01:12Z"},{"alias_kind":"pith_short_12","alias_value":"DHTIFOI7ILUH","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DHTIFOI7ILUHA5Q6","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DHTIFOI7","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DHTIFOI7ILUHA5Q6T5WAOUGH7W","target":"record","payload":{"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"},"canonical_sha256":"19e682b91f42e870761e9f6c0750c7fd83d8e553b95cfe008b6ed1925ef382bf","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"},"source_kind":"arxiv","source_id":"1811.03643","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:01:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nlZyXkPAMovPK4u6MlH+GDbx4LgOotyRcoWyYi8WsaAh+ZR3L3PoBFTt3eUq14mKHEORlNuSxQvoNqQz6Q3DDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:28:30.387024Z"},"content_sha256":"b1153712b8801837972a1c4ab34fe91bfc18844fabd353b790975883bc1d1c9b","schema_version":"1.0","event_id":"sha256:b1153712b8801837972a1c4ab34fe91bfc18844fabd353b790975883bc1d1c9b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DHTIFOI7ILUHA5Q6T5WAOUGH7W","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:01:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hR7nZ0GSq9tLVJr0dhKuV2/2olkYSCT2Mjd8oPfu0H5vLKHQsDN3iE1mqQbRNjOYl9HtR8yClXmyDIpOr5DDCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:28:30.387377Z"},"content_sha256":"ff75ed468aaf910ddba779df9bf7ec3d9d8eb8306bfca2df1db87c1eb36fdc66","schema_version":"1.0","event_id":"sha256:ff75ed468aaf910ddba779df9bf7ec3d9d8eb8306bfca2df1db87c1eb36fdc66"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DHTIFOI7ILUHA5Q6T5WAOUGH7W/bundle.json","state_url":"https://pith.science/pith/DHTIFOI7ILUHA5Q6T5WAOUGH7W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DHTIFOI7ILUHA5Q6T5WAOUGH7W/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T14:28:30Z","links":{"resolver":"https://pith.science/pith/DHTIFOI7ILUHA5Q6T5WAOUGH7W","bundle":"https://pith.science/pith/DHTIFOI7ILUHA5Q6T5WAOUGH7W/bundle.json","state":"https://pith.science/pith/DHTIFOI7ILUHA5Q6T5WAOUGH7W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DHTIFOI7ILUHA5Q6T5WAOUGH7W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DHTIFOI7ILUHA5Q6T5WAOUGH7W","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0dd0311b4969a270492402d997255969b724b83df0db404977f8608ea7df4612","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-08T19:05:03Z","title_canon_sha256":"59a871bd9a3ee803541d3b6c3b41c288536851022681c6e1550d758b4005ec4b"},"schema_version":"1.0","source":{"id":"1811.03643","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.03643","created_at":"2026-05-18T00:01:12Z"},{"alias_kind":"arxiv_version","alias_value":"1811.03643v1","created_at":"2026-05-18T00:01:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03643","created_at":"2026-05-18T00:01:12Z"},{"alias_kind":"pith_short_12","alias_value":"DHTIFOI7ILUH","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DHTIFOI7ILUHA5Q6","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DHTIFOI7","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:ff75ed468aaf910ddba779df9bf7ec3d9d8eb8306bfca2df1db87c1eb36fdc66","target":"graph","created_at":"2026-05-18T00:01:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Abraham P. Vinod, Behcet Acikmese, Hossein Sartipizadeh, Meeko Oishi","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-08T19:05:03Z","title":"Voronoi Partition-based Scenario Reduction for Fast Sampling-based Stochastic Reachability Computation of LTI Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.03643","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b1153712b8801837972a1c4ab34fe91bfc18844fabd353b790975883bc1d1c9b","target":"record","created_at":"2026-05-18T00:01:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"0dd0311b4969a270492402d997255969b724b83df0db404977f8608ea7df4612","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-08T19:05:03Z","title_canon_sha256":"59a871bd9a3ee803541d3b6c3b41c288536851022681c6e1550d758b4005ec4b"},"schema_version":"1.0","source":{"id":"1811.03643","kind":"arxiv","version":1}},"canonical_sha256":"19e682b91f42e870761e9f6c0750c7fd83d8e553b95cfe008b6ed1925ef382bf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"19e682b91f42e870761e9f6c0750c7fd83d8e553b95cfe008b6ed1925ef382bf","first_computed_at":"2026-05-18T00:01:12.462037Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:12.462037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"e59wRbCwS3TgrZRoLYcx4tlQT8samJxiDSXCwiYsNlp0U26w4cE70vOWv63/+ZnHcl4SWU1KVkZc5vDZVVKWBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:12.462566Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.03643","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b1153712b8801837972a1c4ab34fe91bfc18844fabd353b790975883bc1d1c9b","sha256:ff75ed468aaf910ddba779df9bf7ec3d9d8eb8306bfca2df1db87c1eb36fdc66"],"state_sha256":"e5b0f034eeaadea8a094e7b12a9a0555723168ef7ced2092f6b88b4d677682bc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"amjvIf/GIawZjVinZahykxteNy3FXlJ6Gpw+XS9x7Gwh6/yYyMZvsoK6EvgHkCmo0bAd84JjfTpyTjbRVWh6BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T14:28:30.389236Z","bundle_sha256":"ac3cebfcf05c29015e2335e1c8b34c41a1dafa6e225350600862ba9919ffc7e1"}}