{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:AZUW5OUC6332VRZIJLLOIAPRFN","short_pith_number":"pith:AZUW5OUC","schema_version":"1.0","canonical_sha256":"06696eba82f6f7aac7284ad6e401f12b4fa729e90d363b9ab85c45288203c4b2","source":{"kind":"arxiv","id":"1303.3465","version":1},"attestation_state":"computed","paper":{"title":"A direct method for solving optimal stopping problems for L\\'evy processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Erik J. Baurdoux","submitted_at":"2013-03-14T14:45:45Z","abstract_excerpt":"We propose an alternative approach for solving a number of well-studied optimal stopping problems for L\\'evy processes. Instead of the usual method of guess-and-verify based on martingale properties of the value function, we suggest a more direct method by showing that the general theory of optimal stopping for strong Markov processes together with some elementary observations imply that the stopping set must be of a certain form for the optimal stopping problems we consider. The independence of increments and the strong Markov property of L\\'evy processes then allow us to use straightforward "},"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":"1303.3465","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-03-14T14:45:45Z","cross_cats_sorted":[],"title_canon_sha256":"54a00eb2c2d2d5c86747201c29f7b1e4bb51c89f39e4a6cb2cdf0d116a16b1bc","abstract_canon_sha256":"70927533b9f681b27312772369c3ded987b3f08153da32636339265bac189845"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:54.522937Z","signature_b64":"j9XTjML5wjnUSyOfX6/jouc1LuBHOX//wFwlk09Ulf8p5hzzJJwVq6SODHbbw3QZ3GlTqjpzucSZSuvtImw4Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06696eba82f6f7aac7284ad6e401f12b4fa729e90d363b9ab85c45288203c4b2","last_reissued_at":"2026-05-18T03:30:54.522419Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:54.522419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A direct method for solving optimal stopping problems for L\\'evy processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Erik J. Baurdoux","submitted_at":"2013-03-14T14:45:45Z","abstract_excerpt":"We propose an alternative approach for solving a number of well-studied optimal stopping problems for L\\'evy processes. Instead of the usual method of guess-and-verify based on martingale properties of the value function, we suggest a more direct method by showing that the general theory of optimal stopping for strong Markov processes together with some elementary observations imply that the stopping set must be of a certain form for the optimal stopping problems we consider. The independence of increments and the strong Markov property of L\\'evy processes then allow us to use straightforward "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.3465","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1303.3465","created_at":"2026-05-18T03:30:54.522497+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.3465v1","created_at":"2026-05-18T03:30:54.522497+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.3465","created_at":"2026-05-18T03:30:54.522497+00:00"},{"alias_kind":"pith_short_12","alias_value":"AZUW5OUC6332","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"AZUW5OUC6332VRZI","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"AZUW5OUC","created_at":"2026-05-18T12:27:38.830355+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/AZUW5OUC6332VRZIJLLOIAPRFN","json":"https://pith.science/pith/AZUW5OUC6332VRZIJLLOIAPRFN.json","graph_json":"https://pith.science/api/pith-number/AZUW5OUC6332VRZIJLLOIAPRFN/graph.json","events_json":"https://pith.science/api/pith-number/AZUW5OUC6332VRZIJLLOIAPRFN/events.json","paper":"https://pith.science/paper/AZUW5OUC"},"agent_actions":{"view_html":"https://pith.science/pith/AZUW5OUC6332VRZIJLLOIAPRFN","download_json":"https://pith.science/pith/AZUW5OUC6332VRZIJLLOIAPRFN.json","view_paper":"https://pith.science/paper/AZUW5OUC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.3465&json=true","fetch_graph":"https://pith.science/api/pith-number/AZUW5OUC6332VRZIJLLOIAPRFN/graph.json","fetch_events":"https://pith.science/api/pith-number/AZUW5OUC6332VRZIJLLOIAPRFN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AZUW5OUC6332VRZIJLLOIAPRFN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AZUW5OUC6332VRZIJLLOIAPRFN/action/storage_attestation","attest_author":"https://pith.science/pith/AZUW5OUC6332VRZIJLLOIAPRFN/action/author_attestation","sign_citation":"https://pith.science/pith/AZUW5OUC6332VRZIJLLOIAPRFN/action/citation_signature","submit_replication":"https://pith.science/pith/AZUW5OUC6332VRZIJLLOIAPRFN/action/replication_record"}},"created_at":"2026-05-18T03:30:54.522497+00:00","updated_at":"2026-05-18T03:30:54.522497+00:00"}