{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:4Z3BHD5BOWMZ5VDEOZMQ6BJ6EG","short_pith_number":"pith:4Z3BHD5B","canonical_record":{"source":{"id":"1309.2125","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-09-09T12:02:04Z","cross_cats_sorted":[],"title_canon_sha256":"5293b1bcf8a659fd7c86fb3e7731a07f56931f807dc880e3f86d9f0cfe98ba0b","abstract_canon_sha256":"972632990e477921d9f582237fc46f7b3f1e261cd6aa38e297556e6f800b6381"},"schema_version":"1.0"},"canonical_sha256":"e676138fa175999ed46476590f053e21ac4ec45d363001ccf037537fc45566e4","source":{"kind":"arxiv","id":"1309.2125","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.2125","created_at":"2026-05-18T03:13:47Z"},{"alias_kind":"arxiv_version","alias_value":"1309.2125v1","created_at":"2026-05-18T03:13:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.2125","created_at":"2026-05-18T03:13:47Z"},{"alias_kind":"pith_short_12","alias_value":"4Z3BHD5BOWMZ","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4Z3BHD5BOWMZ5VDE","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4Z3BHD5B","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:4Z3BHD5BOWMZ5VDEOZMQ6BJ6EG","target":"record","payload":{"canonical_record":{"source":{"id":"1309.2125","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-09-09T12:02:04Z","cross_cats_sorted":[],"title_canon_sha256":"5293b1bcf8a659fd7c86fb3e7731a07f56931f807dc880e3f86d9f0cfe98ba0b","abstract_canon_sha256":"972632990e477921d9f582237fc46f7b3f1e261cd6aa38e297556e6f800b6381"},"schema_version":"1.0"},"canonical_sha256":"e676138fa175999ed46476590f053e21ac4ec45d363001ccf037537fc45566e4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:47.076259Z","signature_b64":"EIDjy3hPgMXfDcmoPcom6XkEGMSncCXW4gv/M000zmWIMAodhTJcwXn1wmcCimZ7KSL7fzlmd4A2mARVCM5JCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e676138fa175999ed46476590f053e21ac4ec45d363001ccf037537fc45566e4","last_reissued_at":"2026-05-18T03:13:47.075672Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:47.075672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.2125","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-18T03:13:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JCEKYnRwrOv0J6TGgh7ipewvbA1Y3s9MNXkfDL+4q2OBPsmeyLvJTzIS8jzTMMi1D8dbsuQ4cXE/2pVU+C1JDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:32:07.213994Z"},"content_sha256":"a3477927f335678a330258c0987a19368eb210dbe0e5ca424b26e85c539b754c","schema_version":"1.0","event_id":"sha256:a3477927f335678a330258c0987a19368eb210dbe0e5ca424b26e85c539b754c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:4Z3BHD5BOWMZ5VDEOZMQ6BJ6EG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving optimal stopping problems via empirical dual optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Denis Belomestny","submitted_at":"2013-09-09T12:02:04Z","abstract_excerpt":"In this paper we consider a method of solving optimal stopping problems in discrete and continuous time based on their dual representation. A novel and generic simulation-based optimization algorithm not involving nested simulations is proposed and studied. The algorithm involves the optimization of a genuinely penalized dual objective functional over a class of adapted martingales. We prove the convergence of the proposed algorithm and demonstrate its efficiency for optimal stopping problems arising in option pricing."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.2125","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-18T03:13:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fp2qvtpnFzssj9n9Ko8MqvfkGmVgjMRPArqXDMqIKUZVpO90cX/hLjG50lI/F+QYhBTvkSFrUbf2Q8+pBpyKCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:32:07.214368Z"},"content_sha256":"e5dc3ae050aeaabe29e903be5ca4f68550c7dda9b6d2020c27f58799f4027adb","schema_version":"1.0","event_id":"sha256:e5dc3ae050aeaabe29e903be5ca4f68550c7dda9b6d2020c27f58799f4027adb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4Z3BHD5BOWMZ5VDEOZMQ6BJ6EG/bundle.json","state_url":"https://pith.science/pith/4Z3BHD5BOWMZ5VDEOZMQ6BJ6EG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4Z3BHD5BOWMZ5VDEOZMQ6BJ6EG/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-03T07:32:07Z","links":{"resolver":"https://pith.science/pith/4Z3BHD5BOWMZ5VDEOZMQ6BJ6EG","bundle":"https://pith.science/pith/4Z3BHD5BOWMZ5VDEOZMQ6BJ6EG/bundle.json","state":"https://pith.science/pith/4Z3BHD5BOWMZ5VDEOZMQ6BJ6EG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4Z3BHD5BOWMZ5VDEOZMQ6BJ6EG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:4Z3BHD5BOWMZ5VDEOZMQ6BJ6EG","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":"972632990e477921d9f582237fc46f7b3f1e261cd6aa38e297556e6f800b6381","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-09-09T12:02:04Z","title_canon_sha256":"5293b1bcf8a659fd7c86fb3e7731a07f56931f807dc880e3f86d9f0cfe98ba0b"},"schema_version":"1.0","source":{"id":"1309.2125","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.2125","created_at":"2026-05-18T03:13:47Z"},{"alias_kind":"arxiv_version","alias_value":"1309.2125v1","created_at":"2026-05-18T03:13:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.2125","created_at":"2026-05-18T03:13:47Z"},{"alias_kind":"pith_short_12","alias_value":"4Z3BHD5BOWMZ","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4Z3BHD5BOWMZ5VDE","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4Z3BHD5B","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:e5dc3ae050aeaabe29e903be5ca4f68550c7dda9b6d2020c27f58799f4027adb","target":"graph","created_at":"2026-05-18T03:13:47Z","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 paper we consider a method of solving optimal stopping problems in discrete and continuous time based on their dual representation. A novel and generic simulation-based optimization algorithm not involving nested simulations is proposed and studied. The algorithm involves the optimization of a genuinely penalized dual objective functional over a class of adapted martingales. We prove the convergence of the proposed algorithm and demonstrate its efficiency for optimal stopping problems arising in option pricing.","authors_text":"Denis Belomestny","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-09-09T12:02:04Z","title":"Solving optimal stopping problems via empirical dual optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.2125","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:a3477927f335678a330258c0987a19368eb210dbe0e5ca424b26e85c539b754c","target":"record","created_at":"2026-05-18T03:13:47Z","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":"972632990e477921d9f582237fc46f7b3f1e261cd6aa38e297556e6f800b6381","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-09-09T12:02:04Z","title_canon_sha256":"5293b1bcf8a659fd7c86fb3e7731a07f56931f807dc880e3f86d9f0cfe98ba0b"},"schema_version":"1.0","source":{"id":"1309.2125","kind":"arxiv","version":1}},"canonical_sha256":"e676138fa175999ed46476590f053e21ac4ec45d363001ccf037537fc45566e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e676138fa175999ed46476590f053e21ac4ec45d363001ccf037537fc45566e4","first_computed_at":"2026-05-18T03:13:47.075672Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:13:47.075672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EIDjy3hPgMXfDcmoPcom6XkEGMSncCXW4gv/M000zmWIMAodhTJcwXn1wmcCimZ7KSL7fzlmd4A2mARVCM5JCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:13:47.076259Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.2125","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a3477927f335678a330258c0987a19368eb210dbe0e5ca424b26e85c539b754c","sha256:e5dc3ae050aeaabe29e903be5ca4f68550c7dda9b6d2020c27f58799f4027adb"],"state_sha256":"416541cb4b3b9072dfd8c29c9654a444bfdba18828329769b24280b4758d8ca4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NKitpwRsSkIuEVYI/yPub3YzNGxKOGM7L9AMP0yBX7kMTGbNzJhqJB/i5iqgacqOxtPMB6YZGZ8s+L+iZ1hkDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T07:32:07.216453Z","bundle_sha256":"7d0c5c3f1b34a3059940ba1dddac072d665e2ca2e6b6f3770352341262c8cef9"}}