{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:5YA2XUA6Z6M64UF6UWCX3OT4O7","short_pith_number":"pith:5YA2XUA6","canonical_record":{"source":{"id":"1906.09431","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.CP","submitted_at":"2019-06-22T10:53:47Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"770ad7272363bfa69be8cefd5c281d719a6d1ea5103d5b09eb1465cb85cc85af","abstract_canon_sha256":"e8464b5423971a1ba4f32dab72da5d2e71202dfb29cee96579cc4295f15741c1"},"schema_version":"1.0"},"canonical_sha256":"ee01abd01ecf99ee50bea5857dba7c77c3a7bac3f4cf563a717158c49d07d32b","source":{"kind":"arxiv","id":"1906.09431","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.09431","created_at":"2026-05-17T23:42:38Z"},{"alias_kind":"arxiv_version","alias_value":"1906.09431v1","created_at":"2026-05-17T23:42:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.09431","created_at":"2026-05-17T23:42:38Z"},{"alias_kind":"pith_short_12","alias_value":"5YA2XUA6Z6M6","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5YA2XUA6Z6M64UF6","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5YA2XUA6","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:5YA2XUA6Z6M64UF6UWCX3OT4O7","target":"record","payload":{"canonical_record":{"source":{"id":"1906.09431","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.CP","submitted_at":"2019-06-22T10:53:47Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"770ad7272363bfa69be8cefd5c281d719a6d1ea5103d5b09eb1465cb85cc85af","abstract_canon_sha256":"e8464b5423971a1ba4f32dab72da5d2e71202dfb29cee96579cc4295f15741c1"},"schema_version":"1.0"},"canonical_sha256":"ee01abd01ecf99ee50bea5857dba7c77c3a7bac3f4cf563a717158c49d07d32b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:38.080305Z","signature_b64":"+jyk60fDMDmkflwSADLBTSmU5vA4nO8KRTw1vTjQapEIy2Wqz9OCK195d6AIhxq+8/w4Y6xVbEb7cq9egwfpCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee01abd01ecf99ee50bea5857dba7c77c3a7bac3f4cf563a717158c49d07d32b","last_reissued_at":"2026-05-17T23:42:38.079624Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:38.079624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.09431","source_version":1,"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:42:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YN+eNyvlaXDhBCzEBiOkw3ClG2Vay/GQiqTd5/t4es8lsOkWqh9Jsu38zlqQLxuCVMJo38q4cdYl7wDy1RUQBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T03:54:27.763056Z"},"content_sha256":"9170c82182091c8e959dff209ac78be801f3a4867b209a74b5d8df35e023c228","schema_version":"1.0","event_id":"sha256:9170c82182091c8e959dff209ac78be801f3a4867b209a74b5d8df35e023c228"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:5YA2XUA6Z6M64UF6UWCX3OT4O7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Semi-tractability of optimal stopping problems via a weighted stochastic mesh algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"q-fin.CP","authors_text":"D. Belomestny, J. Schoenmakers, M. Kaledin","submitted_at":"2019-06-22T10:53:47Z","abstract_excerpt":"In this article we propose a Weighted Stochastic Mesh (WSM) Algorithm for approximating the value of a discrete and continuous time optimal stopping problem. We prove that in the discrete case the WSM algorithm leads to\n  semi-tractability of the corresponding optimal problems in the sense that its complexity is bounded in order by $\\varepsilon^{-4}\\log^{d+2}(1/\\varepsilon)$ with $d$ being the dimension of the underlying Markov chain. Furthermore we study the WSM approach in the context of continuous time optimal stopping problems and derive the corresponding complexity bounds. Although we can"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.09431","kind":"arxiv","version":1},"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:42:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CQlhRDLfiR+8GSS7Wk8sGai4OR2N0qh3SqMvse5ZU2B3FhaOPqgYpNV6DCwBEe+QNco1d9TlaJ3x+2IygO3PBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T03:54:27.763409Z"},"content_sha256":"fce6b2f8498a955aad87c9e5bdd7c5587c0c1b4efd6dafa0090722c8f190e9df","schema_version":"1.0","event_id":"sha256:fce6b2f8498a955aad87c9e5bdd7c5587c0c1b4efd6dafa0090722c8f190e9df"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5YA2XUA6Z6M64UF6UWCX3OT4O7/bundle.json","state_url":"https://pith.science/pith/5YA2XUA6Z6M64UF6UWCX3OT4O7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5YA2XUA6Z6M64UF6UWCX3OT4O7/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-27T03:54:27Z","links":{"resolver":"https://pith.science/pith/5YA2XUA6Z6M64UF6UWCX3OT4O7","bundle":"https://pith.science/pith/5YA2XUA6Z6M64UF6UWCX3OT4O7/bundle.json","state":"https://pith.science/pith/5YA2XUA6Z6M64UF6UWCX3OT4O7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5YA2XUA6Z6M64UF6UWCX3OT4O7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5YA2XUA6Z6M64UF6UWCX3OT4O7","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":"e8464b5423971a1ba4f32dab72da5d2e71202dfb29cee96579cc4295f15741c1","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.CP","submitted_at":"2019-06-22T10:53:47Z","title_canon_sha256":"770ad7272363bfa69be8cefd5c281d719a6d1ea5103d5b09eb1465cb85cc85af"},"schema_version":"1.0","source":{"id":"1906.09431","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.09431","created_at":"2026-05-17T23:42:38Z"},{"alias_kind":"arxiv_version","alias_value":"1906.09431v1","created_at":"2026-05-17T23:42:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.09431","created_at":"2026-05-17T23:42:38Z"},{"alias_kind":"pith_short_12","alias_value":"5YA2XUA6Z6M6","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5YA2XUA6Z6M64UF6","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5YA2XUA6","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:fce6b2f8498a955aad87c9e5bdd7c5587c0c1b4efd6dafa0090722c8f190e9df","target":"graph","created_at":"2026-05-17T23:42:38Z","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":"In this article we propose a Weighted Stochastic Mesh (WSM) Algorithm for approximating the value of a discrete and continuous time optimal stopping problem. We prove that in the discrete case the WSM algorithm leads to\n  semi-tractability of the corresponding optimal problems in the sense that its complexity is bounded in order by $\\varepsilon^{-4}\\log^{d+2}(1/\\varepsilon)$ with $d$ being the dimension of the underlying Markov chain. Furthermore we study the WSM approach in the context of continuous time optimal stopping problems and derive the corresponding complexity bounds. Although we can","authors_text":"D. Belomestny, J. Schoenmakers, M. Kaledin","cross_cats":["cs.NA","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.CP","submitted_at":"2019-06-22T10:53:47Z","title":"Semi-tractability of optimal stopping problems via a weighted stochastic mesh algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.09431","kind":"arxiv","version":1},"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:9170c82182091c8e959dff209ac78be801f3a4867b209a74b5d8df35e023c228","target":"record","created_at":"2026-05-17T23:42:38Z","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":"e8464b5423971a1ba4f32dab72da5d2e71202dfb29cee96579cc4295f15741c1","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.CP","submitted_at":"2019-06-22T10:53:47Z","title_canon_sha256":"770ad7272363bfa69be8cefd5c281d719a6d1ea5103d5b09eb1465cb85cc85af"},"schema_version":"1.0","source":{"id":"1906.09431","kind":"arxiv","version":1}},"canonical_sha256":"ee01abd01ecf99ee50bea5857dba7c77c3a7bac3f4cf563a717158c49d07d32b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee01abd01ecf99ee50bea5857dba7c77c3a7bac3f4cf563a717158c49d07d32b","first_computed_at":"2026-05-17T23:42:38.079624Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:38.079624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+jyk60fDMDmkflwSADLBTSmU5vA4nO8KRTw1vTjQapEIy2Wqz9OCK195d6AIhxq+8/w4Y6xVbEb7cq9egwfpCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:38.080305Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.09431","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9170c82182091c8e959dff209ac78be801f3a4867b209a74b5d8df35e023c228","sha256:fce6b2f8498a955aad87c9e5bdd7c5587c0c1b4efd6dafa0090722c8f190e9df"],"state_sha256":"e663dd2249ddfe7b8b053ac7c02362355084b23623dd6fd744eb0f7ace6ac8ae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lMah4tEKh8ffCy0bicABc0I9hvbYqTZsYkSqq9BY/XkSXchbptPz+F06BKWlYttaxe3MOlb4NfztzbvQTOa5Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T03:54:27.765335Z","bundle_sha256":"2975279f7ca9ddf4acd609416ed82479d2770ad9df3d13aad4ba74b9dc5f0a64"}}