{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:XL4VSH2F5DWJGXFGSRRJIP7CHX","short_pith_number":"pith:XL4VSH2F","schema_version":"1.0","canonical_sha256":"baf9591f45e8ec935ca69462943fe23dcda80166564fe63c15b71b05ff87fffa","source":{"kind":"arxiv","id":"2504.06541","version":2},"attestation_state":"computed","paper":{"title":"Data-Driven Reachability with Scenario Optimization and the Holdout Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Elizabeth Dietrich, Murat Arcak, Rosalyn Devonport, Stephen Tu","submitted_at":"2025-04-09T02:46:03Z","abstract_excerpt":"Reachability analysis is an important method in providing safety guarantees for systems with unknown or uncertain dynamics. Due to the computational intractability of exact reachability analysis for general nonlinear, high-dimensional systems, recent work has focused on the use of probabilistic methods for computing approximate reachable sets. In this work, we advocate for the use of a general purpose, practical, and sharp method for data-driven reachability: the holdout method. Despite the simplicity of the holdout method, we show -- on several numerical examples including scenario-based 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":"2504.06541","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2025-04-09T02:46:03Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"ae7522534ce9340586026f64ae37aebde30b379a4dc544ef7235c8a6e50c9c6e","abstract_canon_sha256":"aa9239621c6d288b717bf49f0dd3530261e4e5fb870a05828c3f54c427d1e77a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:09:16.347469Z","signature_b64":"JKNQyr+gtAb2kQOK4JvgvaXRMVzxnzxkYHkZLgdDhMY8vV09sNE3GyQM2/F3Iw5f8V9oaKwGpFB7OMHbaDkKDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"baf9591f45e8ec935ca69462943fe23dcda80166564fe63c15b71b05ff87fffa","last_reissued_at":"2026-07-05T12:09:16.346734Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:09:16.346734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Data-Driven Reachability with Scenario Optimization and the Holdout Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Elizabeth Dietrich, Murat Arcak, Rosalyn Devonport, Stephen Tu","submitted_at":"2025-04-09T02:46:03Z","abstract_excerpt":"Reachability analysis is an important method in providing safety guarantees for systems with unknown or uncertain dynamics. Due to the computational intractability of exact reachability analysis for general nonlinear, high-dimensional systems, recent work has focused on the use of probabilistic methods for computing approximate reachable sets. In this work, we advocate for the use of a general purpose, practical, and sharp method for data-driven reachability: the holdout method. Despite the simplicity of the holdout method, we show -- on several numerical examples including scenario-based reac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.06541","kind":"arxiv","version":2},"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/2504.06541/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":"2504.06541","created_at":"2026-07-05T12:09:16.346819+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.06541v2","created_at":"2026-07-05T12:09:16.346819+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.06541","created_at":"2026-07-05T12:09:16.346819+00:00"},{"alias_kind":"pith_short_12","alias_value":"XL4VSH2F5DWJ","created_at":"2026-07-05T12:09:16.346819+00:00"},{"alias_kind":"pith_short_16","alias_value":"XL4VSH2F5DWJGXFG","created_at":"2026-07-05T12:09:16.346819+00:00"},{"alias_kind":"pith_short_8","alias_value":"XL4VSH2F","created_at":"2026-07-05T12:09:16.346819+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.17292","citing_title":"Robust Direct Data-Driven Hamiltonian for Safe Set Computation under Measurement Noise and Disturbances","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2512.06600","citing_title":"Learning Reachability of Energy Storage Arbitrage","ref_index":33,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XL4VSH2F5DWJGXFGSRRJIP7CHX","json":"https://pith.science/pith/XL4VSH2F5DWJGXFGSRRJIP7CHX.json","graph_json":"https://pith.science/api/pith-number/XL4VSH2F5DWJGXFGSRRJIP7CHX/graph.json","events_json":"https://pith.science/api/pith-number/XL4VSH2F5DWJGXFGSRRJIP7CHX/events.json","paper":"https://pith.science/paper/XL4VSH2F"},"agent_actions":{"view_html":"https://pith.science/pith/XL4VSH2F5DWJGXFGSRRJIP7CHX","download_json":"https://pith.science/pith/XL4VSH2F5DWJGXFGSRRJIP7CHX.json","view_paper":"https://pith.science/paper/XL4VSH2F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.06541&json=true","fetch_graph":"https://pith.science/api/pith-number/XL4VSH2F5DWJGXFGSRRJIP7CHX/graph.json","fetch_events":"https://pith.science/api/pith-number/XL4VSH2F5DWJGXFGSRRJIP7CHX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XL4VSH2F5DWJGXFGSRRJIP7CHX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XL4VSH2F5DWJGXFGSRRJIP7CHX/action/storage_attestation","attest_author":"https://pith.science/pith/XL4VSH2F5DWJGXFGSRRJIP7CHX/action/author_attestation","sign_citation":"https://pith.science/pith/XL4VSH2F5DWJGXFGSRRJIP7CHX/action/citation_signature","submit_replication":"https://pith.science/pith/XL4VSH2F5DWJGXFGSRRJIP7CHX/action/replication_record"}},"created_at":"2026-07-05T12:09:16.346819+00:00","updated_at":"2026-07-05T12:09:16.346819+00:00"}