{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SEWBGZEZ424XCSRKFIWKTNDVTZ","short_pith_number":"pith:SEWBGZEZ","canonical_record":{"source":{"id":"1808.04725","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.CP","submitted_at":"2018-08-10T21:18:34Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"7c074df15a8334ca2438ddf7d97b90b83d27077df681ee3beafa752b8afa5048","abstract_canon_sha256":"0da17a64f382f9f807290a5a0974ca18c3e2a714a3ed3f2a69bc53ebf6842a6a"},"schema_version":"1.0"},"canonical_sha256":"912c136499e6b9714a2a2a2ca9b4759e5fc63ecf0d7d465c0268edda7b9db465","source":{"kind":"arxiv","id":"1808.04725","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.04725","created_at":"2026-05-17T23:47:44Z"},{"alias_kind":"arxiv_version","alias_value":"1808.04725v3","created_at":"2026-05-17T23:47:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04725","created_at":"2026-05-17T23:47:44Z"},{"alias_kind":"pith_short_12","alias_value":"SEWBGZEZ424X","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SEWBGZEZ424XCSRK","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SEWBGZEZ","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SEWBGZEZ424XCSRKFIWKTNDVTZ","target":"record","payload":{"canonical_record":{"source":{"id":"1808.04725","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.CP","submitted_at":"2018-08-10T21:18:34Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"7c074df15a8334ca2438ddf7d97b90b83d27077df681ee3beafa752b8afa5048","abstract_canon_sha256":"0da17a64f382f9f807290a5a0974ca18c3e2a714a3ed3f2a69bc53ebf6842a6a"},"schema_version":"1.0"},"canonical_sha256":"912c136499e6b9714a2a2a2ca9b4759e5fc63ecf0d7d465c0268edda7b9db465","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:44.193769Z","signature_b64":"zhqIeYKcm6OlP+ClGHbcL5Ydy4LIBIYnEETW9vDd8HcESY/X9mVc2IJUeeoZYLtUI7SnDBTYUeJ5VA5VYc2oCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"912c136499e6b9714a2a2a2ca9b4759e5fc63ecf0d7d465c0268edda7b9db465","last_reissued_at":"2026-05-17T23:47:44.193186Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:44.193186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.04725","source_version":3,"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-17T23:47:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pds8gKuwWBtkcVP4HJPdzZDDm36aOJNWydu7nSBh4N1PU8cxOsIIsNmAWI3s3p1l0hsALSWVNZsG2K/IfbEgDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T21:31:19.088474Z"},"content_sha256":"f9b758df2f5b4b28691b703e0493c2e3f1d5201c75ed2e0787b19ae145989a4c","schema_version":"1.0","event_id":"sha256:f9b758df2f5b4b28691b703e0493c2e3f1d5201c75ed2e0787b19ae145989a4c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SEWBGZEZ424XCSRKFIWKTNDVTZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic programming for optimal stopping via pseudo-regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"q-fin.CP","authors_text":"Christian Bayer, John Schoenmakers, Martin Redmann","submitted_at":"2018-08-10T21:18:34Z","abstract_excerpt":"We introduce new variants of classical regression-based algorithms for optimal stopping problems based on computation of regression coefficients by Monte Carlo approximation of the corresponding $L^2$ inner products instead of the least-squares error functional. Coupled with new proposals for simulation of the underlying samples, we call the approach \"pseudo regression\". A detailed convergence analysis is provided and it is shown that the approach asymptotically leads to less computational cost for a pre-specified error tolerance, hence to lower complexity. The method is justified by numerical"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04725","kind":"arxiv","version":3},"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-17T23:47:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VrR2L6+dob3sT/iFbsZVZn7MNPSC0PeJ8AO9s4oG2NtvTf+Hb1CSZ4cvLOMaFU+3hnl617ZkfGZgSeddslixAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T21:31:19.089069Z"},"content_sha256":"a864091f2af1cf039d85fdce775b0b75f12c689009212c374d86571383db9e7f","schema_version":"1.0","event_id":"sha256:a864091f2af1cf039d85fdce775b0b75f12c689009212c374d86571383db9e7f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SEWBGZEZ424XCSRKFIWKTNDVTZ/bundle.json","state_url":"https://pith.science/pith/SEWBGZEZ424XCSRKFIWKTNDVTZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SEWBGZEZ424XCSRKFIWKTNDVTZ/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-23T21:31:19Z","links":{"resolver":"https://pith.science/pith/SEWBGZEZ424XCSRKFIWKTNDVTZ","bundle":"https://pith.science/pith/SEWBGZEZ424XCSRKFIWKTNDVTZ/bundle.json","state":"https://pith.science/pith/SEWBGZEZ424XCSRKFIWKTNDVTZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SEWBGZEZ424XCSRKFIWKTNDVTZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SEWBGZEZ424XCSRKFIWKTNDVTZ","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":"0da17a64f382f9f807290a5a0974ca18c3e2a714a3ed3f2a69bc53ebf6842a6a","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.CP","submitted_at":"2018-08-10T21:18:34Z","title_canon_sha256":"7c074df15a8334ca2438ddf7d97b90b83d27077df681ee3beafa752b8afa5048"},"schema_version":"1.0","source":{"id":"1808.04725","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.04725","created_at":"2026-05-17T23:47:44Z"},{"alias_kind":"arxiv_version","alias_value":"1808.04725v3","created_at":"2026-05-17T23:47:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04725","created_at":"2026-05-17T23:47:44Z"},{"alias_kind":"pith_short_12","alias_value":"SEWBGZEZ424X","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SEWBGZEZ424XCSRK","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SEWBGZEZ","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:a864091f2af1cf039d85fdce775b0b75f12c689009212c374d86571383db9e7f","target":"graph","created_at":"2026-05-17T23:47:44Z","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 introduce new variants of classical regression-based algorithms for optimal stopping problems based on computation of regression coefficients by Monte Carlo approximation of the corresponding $L^2$ inner products instead of the least-squares error functional. Coupled with new proposals for simulation of the underlying samples, we call the approach \"pseudo regression\". A detailed convergence analysis is provided and it is shown that the approach asymptotically leads to less computational cost for a pre-specified error tolerance, hence to lower complexity. The method is justified by numerical","authors_text":"Christian Bayer, John Schoenmakers, Martin Redmann","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.CP","submitted_at":"2018-08-10T21:18:34Z","title":"Dynamic programming for optimal stopping via pseudo-regression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04725","kind":"arxiv","version":3},"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:f9b758df2f5b4b28691b703e0493c2e3f1d5201c75ed2e0787b19ae145989a4c","target":"record","created_at":"2026-05-17T23:47:44Z","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":"0da17a64f382f9f807290a5a0974ca18c3e2a714a3ed3f2a69bc53ebf6842a6a","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.CP","submitted_at":"2018-08-10T21:18:34Z","title_canon_sha256":"7c074df15a8334ca2438ddf7d97b90b83d27077df681ee3beafa752b8afa5048"},"schema_version":"1.0","source":{"id":"1808.04725","kind":"arxiv","version":3}},"canonical_sha256":"912c136499e6b9714a2a2a2ca9b4759e5fc63ecf0d7d465c0268edda7b9db465","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"912c136499e6b9714a2a2a2ca9b4759e5fc63ecf0d7d465c0268edda7b9db465","first_computed_at":"2026-05-17T23:47:44.193186Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:44.193186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zhqIeYKcm6OlP+ClGHbcL5Ydy4LIBIYnEETW9vDd8HcESY/X9mVc2IJUeeoZYLtUI7SnDBTYUeJ5VA5VYc2oCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:44.193769Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.04725","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f9b758df2f5b4b28691b703e0493c2e3f1d5201c75ed2e0787b19ae145989a4c","sha256:a864091f2af1cf039d85fdce775b0b75f12c689009212c374d86571383db9e7f"],"state_sha256":"763f1c5b1ff74a280ab42f9e2f033874dfaf6838f81fd5c3252d745a5c28ab75"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c8XWM5w7xQWW3/3+KCHIciS82DIdelYaPAYSCKHBwYujgCSZbiKW2kT6cAJrOZszfOpXmr+0lvWuuldE1VgvDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T21:31:19.093056Z","bundle_sha256":"9e3a901704c75f437e7de31a2cab4a7519426e5118c1013b20e4d5adb8163137"}}