{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YQJVS3HXHLWXPEJYI7ARDSE6EV","short_pith_number":"pith:YQJVS3HX","canonical_record":{"source":{"id":"1702.06238","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-02-21T02:14:47Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"795a1d4953cd362d89a6cc85a1fe043b5bb4306cb85d4a5a7e8e9df6f54e4822","abstract_canon_sha256":"5c09aa0ffe434199537b1726cc6d51583b7eeb8f8a03f02bbf75de3c2a54833c"},"schema_version":"1.0"},"canonical_sha256":"c413596cf73aed77913847c111c89e257a2f64d5cad098e3ed7e83bfb25dd1e0","source":{"kind":"arxiv","id":"1702.06238","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06238","created_at":"2026-05-18T00:43:45Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06238v2","created_at":"2026-05-18T00:43:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06238","created_at":"2026-05-18T00:43:45Z"},{"alias_kind":"pith_short_12","alias_value":"YQJVS3HXHLWX","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YQJVS3HXHLWXPEJY","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YQJVS3HX","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YQJVS3HXHLWXPEJYI7ARDSE6EV","target":"record","payload":{"canonical_record":{"source":{"id":"1702.06238","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-02-21T02:14:47Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"795a1d4953cd362d89a6cc85a1fe043b5bb4306cb85d4a5a7e8e9df6f54e4822","abstract_canon_sha256":"5c09aa0ffe434199537b1726cc6d51583b7eeb8f8a03f02bbf75de3c2a54833c"},"schema_version":"1.0"},"canonical_sha256":"c413596cf73aed77913847c111c89e257a2f64d5cad098e3ed7e83bfb25dd1e0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:45.046734Z","signature_b64":"D+gK3ANbWpMDxrvwUu794P/vdSJtVY4lbTbRxORgI72n6ebS0rEY5KRQetMTT9DlR2yK+i/j/LclOI/DmVRmBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c413596cf73aed77913847c111c89e257a2f64d5cad098e3ed7e83bfb25dd1e0","last_reissued_at":"2026-05-18T00:43:45.046301Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:45.046301Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.06238","source_version":2,"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:43:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZYw8FDMTdxGaQ3Z2jGN9MeCpg5c9UCYs/Gjdwn8iAzPdIVUDd7HLioClzx3okRtKwiYk5jrSfbcuUB37q4PXDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:55:21.261415Z"},"content_sha256":"b5a5cbd94ca6ea22efb28e0794bee84d0f461669caefcba3fa8b09aae5a69fe6","schema_version":"1.0","event_id":"sha256:b5a5cbd94ca6ea22efb28e0794bee84d0f461669caefcba3fa8b09aae5a69fe6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YQJVS3HXHLWXPEJYI7ARDSE6EV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sample Efficient Policy Search for Optimal Stopping Domains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Christoph Dann, Emma Brunskill, Karan Goel","submitted_at":"2017-02-21T02:14:47Z","abstract_excerpt":"Optimal stopping problems consider the question of deciding when to stop an observation-generating process in order to maximize a return. We examine the problem of simultaneously learning and planning in such domains, when data is collected directly from the environment. We propose GFSE, a simple and flexible model-free policy search method that reuses data for sample efficiency by leveraging problem structure. We bound the sample complexity of our approach to guarantee uniform convergence of policy value estimates, tightening existing PAC bounds to achieve logarithmic dependence on horizon le"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06238","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":""},"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:43:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jjRBjIOP2NQ8d4/bsw/OToJYSQYU1mIENznS5J+vLhXga8ykR16UHQ/iTEb+gtXWLTeApGQ1ryQtVGgqEKtiAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:55:21.261783Z"},"content_sha256":"1fedea8889295d9bf0d75c5d97a1faeff5d7611ae2ae1fd128ec59445d145b89","schema_version":"1.0","event_id":"sha256:1fedea8889295d9bf0d75c5d97a1faeff5d7611ae2ae1fd128ec59445d145b89"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YQJVS3HXHLWXPEJYI7ARDSE6EV/bundle.json","state_url":"https://pith.science/pith/YQJVS3HXHLWXPEJYI7ARDSE6EV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YQJVS3HXHLWXPEJYI7ARDSE6EV/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-05-28T07:55:21Z","links":{"resolver":"https://pith.science/pith/YQJVS3HXHLWXPEJYI7ARDSE6EV","bundle":"https://pith.science/pith/YQJVS3HXHLWXPEJYI7ARDSE6EV/bundle.json","state":"https://pith.science/pith/YQJVS3HXHLWXPEJYI7ARDSE6EV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YQJVS3HXHLWXPEJYI7ARDSE6EV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YQJVS3HXHLWXPEJYI7ARDSE6EV","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":"5c09aa0ffe434199537b1726cc6d51583b7eeb8f8a03f02bbf75de3c2a54833c","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-02-21T02:14:47Z","title_canon_sha256":"795a1d4953cd362d89a6cc85a1fe043b5bb4306cb85d4a5a7e8e9df6f54e4822"},"schema_version":"1.0","source":{"id":"1702.06238","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06238","created_at":"2026-05-18T00:43:45Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06238v2","created_at":"2026-05-18T00:43:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06238","created_at":"2026-05-18T00:43:45Z"},{"alias_kind":"pith_short_12","alias_value":"YQJVS3HXHLWX","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YQJVS3HXHLWXPEJY","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YQJVS3HX","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:1fedea8889295d9bf0d75c5d97a1faeff5d7611ae2ae1fd128ec59445d145b89","target":"graph","created_at":"2026-05-18T00:43:45Z","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":"Optimal stopping problems consider the question of deciding when to stop an observation-generating process in order to maximize a return. We examine the problem of simultaneously learning and planning in such domains, when data is collected directly from the environment. We propose GFSE, a simple and flexible model-free policy search method that reuses data for sample efficiency by leveraging problem structure. We bound the sample complexity of our approach to guarantee uniform convergence of policy value estimates, tightening existing PAC bounds to achieve logarithmic dependence on horizon le","authors_text":"Christoph Dann, Emma Brunskill, Karan Goel","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-02-21T02:14:47Z","title":"Sample Efficient Policy Search for Optimal Stopping Domains"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06238","kind":"arxiv","version":2},"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:b5a5cbd94ca6ea22efb28e0794bee84d0f461669caefcba3fa8b09aae5a69fe6","target":"record","created_at":"2026-05-18T00:43:45Z","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":"5c09aa0ffe434199537b1726cc6d51583b7eeb8f8a03f02bbf75de3c2a54833c","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-02-21T02:14:47Z","title_canon_sha256":"795a1d4953cd362d89a6cc85a1fe043b5bb4306cb85d4a5a7e8e9df6f54e4822"},"schema_version":"1.0","source":{"id":"1702.06238","kind":"arxiv","version":2}},"canonical_sha256":"c413596cf73aed77913847c111c89e257a2f64d5cad098e3ed7e83bfb25dd1e0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c413596cf73aed77913847c111c89e257a2f64d5cad098e3ed7e83bfb25dd1e0","first_computed_at":"2026-05-18T00:43:45.046301Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:45.046301Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D+gK3ANbWpMDxrvwUu794P/vdSJtVY4lbTbRxORgI72n6ebS0rEY5KRQetMTT9DlR2yK+i/j/LclOI/DmVRmBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:45.046734Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.06238","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b5a5cbd94ca6ea22efb28e0794bee84d0f461669caefcba3fa8b09aae5a69fe6","sha256:1fedea8889295d9bf0d75c5d97a1faeff5d7611ae2ae1fd128ec59445d145b89"],"state_sha256":"4d8603c82e251ceeb091a5a491c403b331d19e52f87429ecf07a45a6acd360a1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4gTy9qxQzJkafnPtyNpV/BR8Sj1phvULJ6OYgUYObUnR5SwQ6L9lAUHwG7uuOMqpfgZwNG8lYM+4Zm6iuDJBDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T07:55:21.263922Z","bundle_sha256":"b7d5131007414eed5e9a7d354bc2dec0ebc3b39ddb65cd52d54ed3f3ff999a10"}}