{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:6YZIBRFTWGFXZ7MN2QTJZN3AO3","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":"0518abf24a9dd41687a439fe8a63f485bbb80c0701ec1b726952a305271b91df","cross_cats_sorted":["math.OC","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2023-12-10T13:16:01Z","title_canon_sha256":"2d55e5b20e9dd736c1bf6e6b596bca8dc295a893915e576c2163884a91384594"},"schema_version":"1.0","source":{"id":"2312.05880","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.05880","created_at":"2026-07-05T07:22:34Z"},{"alias_kind":"arxiv_version","alias_value":"2312.05880v1","created_at":"2026-07-05T07:22:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.05880","created_at":"2026-07-05T07:22:34Z"},{"alias_kind":"pith_short_12","alias_value":"6YZIBRFTWGFX","created_at":"2026-07-05T07:22:34Z"},{"alias_kind":"pith_short_16","alias_value":"6YZIBRFTWGFXZ7MN","created_at":"2026-07-05T07:22:34Z"},{"alias_kind":"pith_short_8","alias_value":"6YZIBRFT","created_at":"2026-07-05T07:22:34Z"}],"graph_snapshots":[{"event_id":"sha256:1b9d73572526f90a3810f9ab345d5e210221baaca42d1e3459e3cf09a04ad619","target":"graph","created_at":"2026-07-05T07:22:34Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2312.05880/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The standard theory of optimal stopping is based on the idealised assumption that the underlying process is essentially known. In this paper, we drop this restriction and study data-driven optimal stopping for a general diffusion process, focusing on investigating the statistical performance of the proposed estimator of the optimal stopping barrier. More specifically, we derive non-asymptotic upper bounds on the simple regret, along with uniform and non-asymptotic PAC bounds. Minimax optimality is verified by completing the upper bound results with matching lower bounds on the simple regret. A","authors_text":"Claudia Strauch, Niklas Dexheimer, S\\\"oren Christensen","cross_cats":["math.OC","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2023-12-10T13:16:01Z","title":"Data-driven optimal stopping: A pure exploration analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.05880","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:2b0c02caa2a9a71f0fdbd54bfd63be9ca305f3bfa14b9060cc888d7361b2ec95","target":"record","created_at":"2026-07-05T07:22:34Z","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":"0518abf24a9dd41687a439fe8a63f485bbb80c0701ec1b726952a305271b91df","cross_cats_sorted":["math.OC","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2023-12-10T13:16:01Z","title_canon_sha256":"2d55e5b20e9dd736c1bf6e6b596bca8dc295a893915e576c2163884a91384594"},"schema_version":"1.0","source":{"id":"2312.05880","kind":"arxiv","version":1}},"canonical_sha256":"f63280c4b3b18b7cfd8dd4269cb76076eec394193e514457becf6407afeab58c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f63280c4b3b18b7cfd8dd4269cb76076eec394193e514457becf6407afeab58c","first_computed_at":"2026-07-05T07:22:34.536934Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:22:34.536934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+nk7DY26TpvJNLHJIQWFbey90IDicMWdCebJxXRwZTj807qcixBwuotc6TuH/9cdB1kFKa4xW96n+BRugxNSDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:22:34.537437Z","signed_message":"canonical_sha256_bytes"},"source_id":"2312.05880","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2b0c02caa2a9a71f0fdbd54bfd63be9ca305f3bfa14b9060cc888d7361b2ec95","sha256:1b9d73572526f90a3810f9ab345d5e210221baaca42d1e3459e3cf09a04ad619"],"state_sha256":"67d4a34000e782050a30963278938403de7920634d763784402aa767337c63a3"}