{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:OD2LGOOHMJRSDIRXNX54XUCLXY","short_pith_number":"pith:OD2LGOOH","canonical_record":{"source":{"id":"1309.3832","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.CP","submitted_at":"2013-09-16T05:52:17Z","cross_cats_sorted":["q-fin.PR","stat.ML"],"title_canon_sha256":"9544b2ea68fe92fcf3c0ebc11de11282f6d1fe92a44ffb1e9ec30f247630594d","abstract_canon_sha256":"dfec7b8b4fa4a75c5fd59fc202db32efe33db9edfc585cf460f38bcb9fe68879"},"schema_version":"1.0"},"canonical_sha256":"70f4b339c7626321a2376dfbcbd04bbe23e2645939c30ed1236bff89cc036620","source":{"kind":"arxiv","id":"1309.3832","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.3832","created_at":"2026-05-18T01:34:05Z"},{"alias_kind":"arxiv_version","alias_value":"1309.3832v2","created_at":"2026-05-18T01:34:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.3832","created_at":"2026-05-18T01:34:05Z"},{"alias_kind":"pith_short_12","alias_value":"OD2LGOOHMJRS","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OD2LGOOHMJRSDIRX","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OD2LGOOH","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:OD2LGOOHMJRSDIRXNX54XUCLXY","target":"record","payload":{"canonical_record":{"source":{"id":"1309.3832","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.CP","submitted_at":"2013-09-16T05:52:17Z","cross_cats_sorted":["q-fin.PR","stat.ML"],"title_canon_sha256":"9544b2ea68fe92fcf3c0ebc11de11282f6d1fe92a44ffb1e9ec30f247630594d","abstract_canon_sha256":"dfec7b8b4fa4a75c5fd59fc202db32efe33db9edfc585cf460f38bcb9fe68879"},"schema_version":"1.0"},"canonical_sha256":"70f4b339c7626321a2376dfbcbd04bbe23e2645939c30ed1236bff89cc036620","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:05.743487Z","signature_b64":"3aF5yDiB5rMyYutC1qWuG5kz0HSy87MSRzFUx8+9n5smBi6xXPNdDx+eiXnSA6xn9TmO/FhoMVDVOL77CBInDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70f4b339c7626321a2376dfbcbd04bbe23e2645939c30ed1236bff89cc036620","last_reissued_at":"2026-05-18T01:34:05.743034Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:05.743034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.3832","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-18T01:34:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L9x10rKam63Rw2Y5aA8zuqOTTByco2I8b97xBT9NGY3/l85BT3X4Vu7w6+ECVtiXtA8GyrorVpaLegb0PtPKDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:01:52.569576Z"},"content_sha256":"0f2f16f6131dc22b28da9b76ffbc5598b965ff66e08eb422885a0b8eea8c631f","schema_version":"1.0","event_id":"sha256:0f2f16f6131dc22b28da9b76ffbc5598b965ff66e08eb422885a0b8eea8c631f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:OD2LGOOHMJRSDIRXNX54XUCLXY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sequential Design for Optimal Stopping Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-fin.PR","stat.ML"],"primary_cat":"q-fin.CP","authors_text":"Mike Ludkovski, Robert B. Gramacy","submitted_at":"2013-09-16T05:52:17Z","abstract_excerpt":"We propose a new approach to solve optimal stopping problems via simulation. Working within the backward dynamic programming/Snell envelope framework, we augment the methodology of Longstaff-Schwartz that focuses on approximating the stopping strategy. Namely, we introduce adaptive generation of the stochastic grids anchoring the simulated sample paths of the underlying state process. This allows for active learning of the classifiers partitioning the state space into the continuation and stopping regions. To this end, we examine sequential design schemes that adaptively place new design point"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.3832","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-18T01:34:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QSYZmj1HcAljN/EMv5ThbMEWVp1msoch1ob405xyUf3BH1kxpyxPlIJVzqEGxzbXjSa3dHCxsFpVdcTuY7RdBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:01:52.570267Z"},"content_sha256":"a3c8c11e66df0525afc949265f5416704264a1d835d459f2718b7281bad49833","schema_version":"1.0","event_id":"sha256:a3c8c11e66df0525afc949265f5416704264a1d835d459f2718b7281bad49833"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OD2LGOOHMJRSDIRXNX54XUCLXY/bundle.json","state_url":"https://pith.science/pith/OD2LGOOHMJRSDIRXNX54XUCLXY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OD2LGOOHMJRSDIRXNX54XUCLXY/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-06-07T09:01:52Z","links":{"resolver":"https://pith.science/pith/OD2LGOOHMJRSDIRXNX54XUCLXY","bundle":"https://pith.science/pith/OD2LGOOHMJRSDIRXNX54XUCLXY/bundle.json","state":"https://pith.science/pith/OD2LGOOHMJRSDIRXNX54XUCLXY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OD2LGOOHMJRSDIRXNX54XUCLXY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:OD2LGOOHMJRSDIRXNX54XUCLXY","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":"dfec7b8b4fa4a75c5fd59fc202db32efe33db9edfc585cf460f38bcb9fe68879","cross_cats_sorted":["q-fin.PR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.CP","submitted_at":"2013-09-16T05:52:17Z","title_canon_sha256":"9544b2ea68fe92fcf3c0ebc11de11282f6d1fe92a44ffb1e9ec30f247630594d"},"schema_version":"1.0","source":{"id":"1309.3832","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.3832","created_at":"2026-05-18T01:34:05Z"},{"alias_kind":"arxiv_version","alias_value":"1309.3832v2","created_at":"2026-05-18T01:34:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.3832","created_at":"2026-05-18T01:34:05Z"},{"alias_kind":"pith_short_12","alias_value":"OD2LGOOHMJRS","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OD2LGOOHMJRSDIRX","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OD2LGOOH","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:a3c8c11e66df0525afc949265f5416704264a1d835d459f2718b7281bad49833","target":"graph","created_at":"2026-05-18T01:34:05Z","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":"We propose a new approach to solve optimal stopping problems via simulation. Working within the backward dynamic programming/Snell envelope framework, we augment the methodology of Longstaff-Schwartz that focuses on approximating the stopping strategy. Namely, we introduce adaptive generation of the stochastic grids anchoring the simulated sample paths of the underlying state process. This allows for active learning of the classifiers partitioning the state space into the continuation and stopping regions. To this end, we examine sequential design schemes that adaptively place new design point","authors_text":"Mike Ludkovski, Robert B. Gramacy","cross_cats":["q-fin.PR","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.CP","submitted_at":"2013-09-16T05:52:17Z","title":"Sequential Design for Optimal Stopping Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.3832","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:0f2f16f6131dc22b28da9b76ffbc5598b965ff66e08eb422885a0b8eea8c631f","target":"record","created_at":"2026-05-18T01:34:05Z","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":"dfec7b8b4fa4a75c5fd59fc202db32efe33db9edfc585cf460f38bcb9fe68879","cross_cats_sorted":["q-fin.PR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.CP","submitted_at":"2013-09-16T05:52:17Z","title_canon_sha256":"9544b2ea68fe92fcf3c0ebc11de11282f6d1fe92a44ffb1e9ec30f247630594d"},"schema_version":"1.0","source":{"id":"1309.3832","kind":"arxiv","version":2}},"canonical_sha256":"70f4b339c7626321a2376dfbcbd04bbe23e2645939c30ed1236bff89cc036620","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"70f4b339c7626321a2376dfbcbd04bbe23e2645939c30ed1236bff89cc036620","first_computed_at":"2026-05-18T01:34:05.743034Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:05.743034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3aF5yDiB5rMyYutC1qWuG5kz0HSy87MSRzFUx8+9n5smBi6xXPNdDx+eiXnSA6xn9TmO/FhoMVDVOL77CBInDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:05.743487Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.3832","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f2f16f6131dc22b28da9b76ffbc5598b965ff66e08eb422885a0b8eea8c631f","sha256:a3c8c11e66df0525afc949265f5416704264a1d835d459f2718b7281bad49833"],"state_sha256":"d05d6dbeeb4c2ef8a2e73e9056cf475bb2d33397b0065f7344b6a1e7b74dad50"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Haw+YxXQNI02C3BxEvK1/zsry2CdDdMOQr2/uAKdzq3x3bKGbRAX4sZlXJIZd1HWdTNnyAYKHf5aeOuDy4VpDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T09:01:52.577859Z","bundle_sha256":"1fc6f1a26d15e790ea68a7dbf62266d91ca203b76f768f29ab0d0d9574418c27"}}