{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:6YZIBRFTWGFXZ7MN2QTJZN3AO3","short_pith_number":"pith:6YZIBRFT","schema_version":"1.0","canonical_sha256":"f63280c4b3b18b7cfd8dd4269cb76076eec394193e514457becf6407afeab58c","source":{"kind":"arxiv","id":"2312.05880","version":1},"attestation_state":"computed","paper":{"title":"Data-driven optimal stopping: A pure exploration analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Claudia Strauch, Niklas Dexheimer, S\\\"oren Christensen","submitted_at":"2023-12-10T13:16:01Z","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"},"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":"2312.05880","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2023-12-10T13:16:01Z","cross_cats_sorted":["math.OC","stat.ML","stat.TH"],"title_canon_sha256":"2d55e5b20e9dd736c1bf6e6b596bca8dc295a893915e576c2163884a91384594","abstract_canon_sha256":"0518abf24a9dd41687a439fe8a63f485bbb80c0701ec1b726952a305271b91df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:22:34.537437Z","signature_b64":"+nk7DY26TpvJNLHJIQWFbey90IDicMWdCebJxXRwZTj807qcixBwuotc6TuH/9cdB1kFKa4xW96n+BRugxNSDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f63280c4b3b18b7cfd8dd4269cb76076eec394193e514457becf6407afeab58c","last_reissued_at":"2026-07-05T07:22:34.536934Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:22:34.536934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Data-driven optimal stopping: A pure exploration analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Claudia Strauch, Niklas Dexheimer, S\\\"oren Christensen","submitted_at":"2023-12-10T13:16:01Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.05880","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/2312.05880/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":"2312.05880","created_at":"2026-07-05T07:22:34.536997+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.05880v1","created_at":"2026-07-05T07:22:34.536997+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.05880","created_at":"2026-07-05T07:22:34.536997+00:00"},{"alias_kind":"pith_short_12","alias_value":"6YZIBRFTWGFX","created_at":"2026-07-05T07:22:34.536997+00:00"},{"alias_kind":"pith_short_16","alias_value":"6YZIBRFTWGFXZ7MN","created_at":"2026-07-05T07:22:34.536997+00:00"},{"alias_kind":"pith_short_8","alias_value":"6YZIBRFT","created_at":"2026-07-05T07:22:34.536997+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/6YZIBRFTWGFXZ7MN2QTJZN3AO3","json":"https://pith.science/pith/6YZIBRFTWGFXZ7MN2QTJZN3AO3.json","graph_json":"https://pith.science/api/pith-number/6YZIBRFTWGFXZ7MN2QTJZN3AO3/graph.json","events_json":"https://pith.science/api/pith-number/6YZIBRFTWGFXZ7MN2QTJZN3AO3/events.json","paper":"https://pith.science/paper/6YZIBRFT"},"agent_actions":{"view_html":"https://pith.science/pith/6YZIBRFTWGFXZ7MN2QTJZN3AO3","download_json":"https://pith.science/pith/6YZIBRFTWGFXZ7MN2QTJZN3AO3.json","view_paper":"https://pith.science/paper/6YZIBRFT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.05880&json=true","fetch_graph":"https://pith.science/api/pith-number/6YZIBRFTWGFXZ7MN2QTJZN3AO3/graph.json","fetch_events":"https://pith.science/api/pith-number/6YZIBRFTWGFXZ7MN2QTJZN3AO3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6YZIBRFTWGFXZ7MN2QTJZN3AO3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6YZIBRFTWGFXZ7MN2QTJZN3AO3/action/storage_attestation","attest_author":"https://pith.science/pith/6YZIBRFTWGFXZ7MN2QTJZN3AO3/action/author_attestation","sign_citation":"https://pith.science/pith/6YZIBRFTWGFXZ7MN2QTJZN3AO3/action/citation_signature","submit_replication":"https://pith.science/pith/6YZIBRFTWGFXZ7MN2QTJZN3AO3/action/replication_record"}},"created_at":"2026-07-05T07:22:34.536997+00:00","updated_at":"2026-07-05T07:22:34.536997+00:00"}