{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:Z6NP2O3JWMMDQWZBSACCTQ6WYS","short_pith_number":"pith:Z6NP2O3J","schema_version":"1.0","canonical_sha256":"cf9afd3b69b318385b21900429c3d6c49324365964f51c16a35b16c3632fca12","source":{"kind":"arxiv","id":"2104.13669","version":4},"attestation_state":"computed","paper":{"title":"Optimal Stopping via Randomized Neural Networks","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.NA","math.PR","q-fin.CP"],"primary_cat":"stat.ML","authors_text":"Calypso Herrera, Florian Krach, Josef Teichmann, Pierre Ruyssen","submitted_at":"2021-04-28T09:47:21Z","abstract_excerpt":"This paper presents the benefits of using randomized neural networks instead of standard basis functions or deep neural networks to approximate the solutions of optimal stopping problems. The key idea is to use neural networks, where the parameters of the hidden layers are generated randomly and only the last layer is trained, in order to approximate the continuation value. Our approaches are applicable to high dimensional problems where the existing approaches become increasingly impractical. In addition, since our approaches can be optimized using simple linear regression, they are easy to i"},"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":"2104.13669","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"stat.ML","submitted_at":"2021-04-28T09:47:21Z","cross_cats_sorted":["cs.LG","cs.NA","math.NA","math.PR","q-fin.CP"],"title_canon_sha256":"ec2843c9ce7e2bc716b2f589869cddd70515617d36291718b671529dac7e2b90","abstract_canon_sha256":"3e55344e68a2b9d8f1abcbc98770352c135d19c3a032c11c2ba89dc7e7da9e5a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:18:53.276638Z","signature_b64":"1fzv4WXw+iCYTbW7x1LvkOYPQd90szubjHDy3cEtnTuZyPJEPAB9y6d01Ll9AfhQce6tR5CI+QqXoTDJEBxbDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf9afd3b69b318385b21900429c3d6c49324365964f51c16a35b16c3632fca12","last_reissued_at":"2026-07-05T07:18:53.276199Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:18:53.276199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Stopping via Randomized Neural Networks","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.NA","math.PR","q-fin.CP"],"primary_cat":"stat.ML","authors_text":"Calypso Herrera, Florian Krach, Josef Teichmann, Pierre Ruyssen","submitted_at":"2021-04-28T09:47:21Z","abstract_excerpt":"This paper presents the benefits of using randomized neural networks instead of standard basis functions or deep neural networks to approximate the solutions of optimal stopping problems. The key idea is to use neural networks, where the parameters of the hidden layers are generated randomly and only the last layer is trained, in order to approximate the continuation value. Our approaches are applicable to high dimensional problems where the existing approaches become increasingly impractical. In addition, since our approaches can be optimized using simple linear regression, they are easy to i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.13669","kind":"arxiv","version":4},"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/2104.13669/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":"2104.13669","created_at":"2026-07-05T07:18:53.276254+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.13669v4","created_at":"2026-07-05T07:18:53.276254+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.13669","created_at":"2026-07-05T07:18:53.276254+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z6NP2O3JWMMD","created_at":"2026-07-05T07:18:53.276254+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z6NP2O3JWMMDQWZB","created_at":"2026-07-05T07:18:53.276254+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z6NP2O3J","created_at":"2026-07-05T07:18:53.276254+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2312.08410","citing_title":"Universal approximation property of Banach space-valued random feature models including random neural networks","ref_index":42,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Z6NP2O3JWMMDQWZBSACCTQ6WYS","json":"https://pith.science/pith/Z6NP2O3JWMMDQWZBSACCTQ6WYS.json","graph_json":"https://pith.science/api/pith-number/Z6NP2O3JWMMDQWZBSACCTQ6WYS/graph.json","events_json":"https://pith.science/api/pith-number/Z6NP2O3JWMMDQWZBSACCTQ6WYS/events.json","paper":"https://pith.science/paper/Z6NP2O3J"},"agent_actions":{"view_html":"https://pith.science/pith/Z6NP2O3JWMMDQWZBSACCTQ6WYS","download_json":"https://pith.science/pith/Z6NP2O3JWMMDQWZBSACCTQ6WYS.json","view_paper":"https://pith.science/paper/Z6NP2O3J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.13669&json=true","fetch_graph":"https://pith.science/api/pith-number/Z6NP2O3JWMMDQWZBSACCTQ6WYS/graph.json","fetch_events":"https://pith.science/api/pith-number/Z6NP2O3JWMMDQWZBSACCTQ6WYS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z6NP2O3JWMMDQWZBSACCTQ6WYS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z6NP2O3JWMMDQWZBSACCTQ6WYS/action/storage_attestation","attest_author":"https://pith.science/pith/Z6NP2O3JWMMDQWZBSACCTQ6WYS/action/author_attestation","sign_citation":"https://pith.science/pith/Z6NP2O3JWMMDQWZBSACCTQ6WYS/action/citation_signature","submit_replication":"https://pith.science/pith/Z6NP2O3JWMMDQWZBSACCTQ6WYS/action/replication_record"}},"created_at":"2026-07-05T07:18:53.276254+00:00","updated_at":"2026-07-05T07:18:53.276254+00:00"}