{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:5L4KCJE4HEA6GTXPD3H77O7CE6","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":"72cd13ed25ea1ed3c5c120849c1f44af4be750c51604a39a544a5223b5241437","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-05-29T12:40:40Z","title_canon_sha256":"3c2e17837fb5d517a343e2d1345fb2dacea6cf2858b2bff2f2110f5badeff581"},"schema_version":"1.0","source":{"id":"1405.7539","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.7539","created_at":"2026-05-18T02:50:51Z"},{"alias_kind":"arxiv_version","alias_value":"1405.7539v1","created_at":"2026-05-18T02:50:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.7539","created_at":"2026-05-18T02:50:51Z"},{"alias_kind":"pith_short_12","alias_value":"5L4KCJE4HEA6","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5L4KCJE4HEA6GTXP","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5L4KCJE4","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:8ad841aa1d5fb653a3fb866318bd6da7200f6a1bff6d2f3e76a79ff9d754a676","target":"graph","created_at":"2026-05-18T02:50:51Z","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 consider the optimal stopping problem consisting in, given a strong Markov process, a reward function and a discount rate, finding the stopping time such that the expected reward at the stopping time is maximum. The approach we follow, has two main components: the Dynkin's characterization of the value function as the smallest excessive function dominating the reward; and the Riesz representation of excessive functions in terms of the Green kernel, the main reference being Salminen 85. In the context of one-dimensional diffusions we give a complete characterization of the solution under som","authors_text":"Fabi\\'an Crocce","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-05-29T12:40:40Z","title":"Optimal Stopping for Strong Markov Processes: Explicit solutions and verification theorems for diffusions, multidimensional diffusions, and jump-processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.7539","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:b5070eb43d5f65f945e15b046ceb76a7ad55539566b1d86341aa8c85afc03a63","target":"record","created_at":"2026-05-18T02:50:51Z","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":"72cd13ed25ea1ed3c5c120849c1f44af4be750c51604a39a544a5223b5241437","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-05-29T12:40:40Z","title_canon_sha256":"3c2e17837fb5d517a343e2d1345fb2dacea6cf2858b2bff2f2110f5badeff581"},"schema_version":"1.0","source":{"id":"1405.7539","kind":"arxiv","version":1}},"canonical_sha256":"eaf8a1249c3901e34eef1ecfffbbe227951110044b74c74b9024e0d730a49a68","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eaf8a1249c3901e34eef1ecfffbbe227951110044b74c74b9024e0d730a49a68","first_computed_at":"2026-05-18T02:50:51.022496Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:50:51.022496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tmqV6bxyCkjEhwGhWAB/RrcxV+wiiSN6BjxyDyP5qO7DqEA+Jbxra2KrifQwDZznnH6nqSaujLdm6q/7kubQAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:50:51.023233Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.7539","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b5070eb43d5f65f945e15b046ceb76a7ad55539566b1d86341aa8c85afc03a63","sha256:8ad841aa1d5fb653a3fb866318bd6da7200f6a1bff6d2f3e76a79ff9d754a676"],"state_sha256":"0ea26bf5b2d28bb807d064a681cfacf3ef6b5988f08627b351dcbb21e98ca837"}