{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:TPFLSZU6JTRTDIJFNZ4LTJDTEJ","short_pith_number":"pith:TPFLSZU6","schema_version":"1.0","canonical_sha256":"9bcab9669e4ce331a1256e78b9a4732261639beb7dd53d1f3f4433850a1fd71a","source":{"kind":"arxiv","id":"1910.02500","version":1},"attestation_state":"computed","paper":{"title":"Data-Driven Reachable Set Computation using Adaptive Gaussian Process Classification and Monte Carlo Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Alex Devonport, Murat Arcak","submitted_at":"2019-10-06T18:39:57Z","abstract_excerpt":"We present two data-driven methods for estimating reachable sets with probabilistic guarantees. Both methods make use of a probabilistic formulation allowing for a formal definition of a data-driven reachable set approximation that is correct in a probabilistic sense. The first method recasts the reachability problem as a binary classification problem, using a Gaussian process classifier to represent the reachable set. The quantified uncertainty of the Gaussian process model allows for an adaptive approach to the selection of new sample points. The second method uses a Monte Carlo sampling app"},"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":"1910.02500","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2019-10-06T18:39:57Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"ddd9eff729035813f1d0647eb049eb7b17db8834806f30b71d532c6f11edd3b4","abstract_canon_sha256":"f2f32f3faf09232da31f575dd95e71540b55f9c43b1c5edc5f17e7568b8b50c7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:10:08.884934Z","signature_b64":"PGb5MhO+9J8uMpOW4BWnjuEzCSneXOafLsFL54lDKQ0SB9Tbx24WDcKNL6zSdf6E1XlOXzdcHq7Pnhk+KkAQBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9bcab9669e4ce331a1256e78b9a4732261639beb7dd53d1f3f4433850a1fd71a","last_reissued_at":"2026-07-05T00:10:08.884605Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:10:08.884605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Data-Driven Reachable Set Computation using Adaptive Gaussian Process Classification and Monte Carlo Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Alex Devonport, Murat Arcak","submitted_at":"2019-10-06T18:39:57Z","abstract_excerpt":"We present two data-driven methods for estimating reachable sets with probabilistic guarantees. Both methods make use of a probabilistic formulation allowing for a formal definition of a data-driven reachable set approximation that is correct in a probabilistic sense. The first method recasts the reachability problem as a binary classification problem, using a Gaussian process classifier to represent the reachable set. The quantified uncertainty of the Gaussian process model allows for an adaptive approach to the selection of new sample points. The second method uses a Monte Carlo sampling app"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.02500","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/1910.02500/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":"1910.02500","created_at":"2026-07-05T00:10:08.884659+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.02500v1","created_at":"2026-07-05T00:10:08.884659+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.02500","created_at":"2026-07-05T00:10:08.884659+00:00"},{"alias_kind":"pith_short_12","alias_value":"TPFLSZU6JTRT","created_at":"2026-07-05T00:10:08.884659+00:00"},{"alias_kind":"pith_short_16","alias_value":"TPFLSZU6JTRTDIJF","created_at":"2026-07-05T00:10:08.884659+00:00"},{"alias_kind":"pith_short_8","alias_value":"TPFLSZU6","created_at":"2026-07-05T00:10:08.884659+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/TPFLSZU6JTRTDIJFNZ4LTJDTEJ","json":"https://pith.science/pith/TPFLSZU6JTRTDIJFNZ4LTJDTEJ.json","graph_json":"https://pith.science/api/pith-number/TPFLSZU6JTRTDIJFNZ4LTJDTEJ/graph.json","events_json":"https://pith.science/api/pith-number/TPFLSZU6JTRTDIJFNZ4LTJDTEJ/events.json","paper":"https://pith.science/paper/TPFLSZU6"},"agent_actions":{"view_html":"https://pith.science/pith/TPFLSZU6JTRTDIJFNZ4LTJDTEJ","download_json":"https://pith.science/pith/TPFLSZU6JTRTDIJFNZ4LTJDTEJ.json","view_paper":"https://pith.science/paper/TPFLSZU6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.02500&json=true","fetch_graph":"https://pith.science/api/pith-number/TPFLSZU6JTRTDIJFNZ4LTJDTEJ/graph.json","fetch_events":"https://pith.science/api/pith-number/TPFLSZU6JTRTDIJFNZ4LTJDTEJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TPFLSZU6JTRTDIJFNZ4LTJDTEJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TPFLSZU6JTRTDIJFNZ4LTJDTEJ/action/storage_attestation","attest_author":"https://pith.science/pith/TPFLSZU6JTRTDIJFNZ4LTJDTEJ/action/author_attestation","sign_citation":"https://pith.science/pith/TPFLSZU6JTRTDIJFNZ4LTJDTEJ/action/citation_signature","submit_replication":"https://pith.science/pith/TPFLSZU6JTRTDIJFNZ4LTJDTEJ/action/replication_record"}},"created_at":"2026-07-05T00:10:08.884659+00:00","updated_at":"2026-07-05T00:10:08.884659+00:00"}