{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:SEWBGZEZ424XCSRKFIWKTNDVTZ","short_pith_number":"pith:SEWBGZEZ","schema_version":"1.0","canonical_sha256":"912c136499e6b9714a2a2a2ca9b4759e5fc63ecf0d7d465c0268edda7b9db465","source":{"kind":"arxiv","id":"1808.04725","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1808.04725","created_at":"2026-05-17T23:47:44.193278+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.04725v3","created_at":"2026-05-17T23:47:44.193278+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04725","created_at":"2026-05-17T23:47:44.193278+00:00"},{"alias_kind":"pith_short_12","alias_value":"SEWBGZEZ424X","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"SEWBGZEZ424XCSRK","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"SEWBGZEZ","created_at":"2026-05-18T12:32:53.628368+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/SEWBGZEZ424XCSRKFIWKTNDVTZ","json":"https://pith.science/pith/SEWBGZEZ424XCSRKFIWKTNDVTZ.json","graph_json":"https://pith.science/api/pith-number/SEWBGZEZ424XCSRKFIWKTNDVTZ/graph.json","events_json":"https://pith.science/api/pith-number/SEWBGZEZ424XCSRKFIWKTNDVTZ/events.json","paper":"https://pith.science/paper/SEWBGZEZ"},"agent_actions":{"view_html":"https://pith.science/pith/SEWBGZEZ424XCSRKFIWKTNDVTZ","download_json":"https://pith.science/pith/SEWBGZEZ424XCSRKFIWKTNDVTZ.json","view_paper":"https://pith.science/paper/SEWBGZEZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.04725&json=true","fetch_graph":"https://pith.science/api/pith-number/SEWBGZEZ424XCSRKFIWKTNDVTZ/graph.json","fetch_events":"https://pith.science/api/pith-number/SEWBGZEZ424XCSRKFIWKTNDVTZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SEWBGZEZ424XCSRKFIWKTNDVTZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SEWBGZEZ424XCSRKFIWKTNDVTZ/action/storage_attestation","attest_author":"https://pith.science/pith/SEWBGZEZ424XCSRKFIWKTNDVTZ/action/author_attestation","sign_citation":"https://pith.science/pith/SEWBGZEZ424XCSRKFIWKTNDVTZ/action/citation_signature","submit_replication":"https://pith.science/pith/SEWBGZEZ424XCSRKFIWKTNDVTZ/action/replication_record"}},"created_at":"2026-05-17T23:47:44.193278+00:00","updated_at":"2026-05-17T23:47:44.193278+00:00"}