{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:QVPYBWNQCCWGGDOXXZ3LEWWADI","short_pith_number":"pith:QVPYBWNQ","schema_version":"1.0","canonical_sha256":"855f80d9b010ac630dd7be76b25ac01a3a4c0ffd5e46463e226931df759d9a10","source":{"kind":"arxiv","id":"1610.05922","version":1},"attestation_state":"computed","paper":{"title":"Risk-Sensitive Stopping Problems for Continuous-Time Markov Chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Anton Popp, Nicole B\\\"auerle","submitted_at":"2016-10-19T09:16:02Z","abstract_excerpt":"In this paper we consider stopping problems for continuous-time Markov chains under a general risk-sensitive optimization criterion for problems with finite and infinite time horizon. More precisely our aim is to maximize the certainty equivalent of the stopping reward minus cost over the time horizon. We derive optimality equations for the value functions and prove the existence of optimal stopping times. The exponential utility is treated as a special case. In contrast to risk-neutral stopping problems it may be optimal to stop between jumps of the Markov chain. We briefly discuss the influe"},"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":"1610.05922","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-10-19T09:16:02Z","cross_cats_sorted":[],"title_canon_sha256":"fb4b4f48ee27cc250ebada90b7d8309052eb8f063b92c0b8235609a6debcf580","abstract_canon_sha256":"fbf08483057e87cf743699e785705b3a362d9035a3e2a260062e70b78abbf043"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:31.528643Z","signature_b64":"/6ntHNEvld4KWvPlAzpFl4yzw4Es/eweQparL6ciYUmNEgpSh6Vma6LUdhg5X/uNQCMtCqcwAjH1KtgxKIk5DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"855f80d9b010ac630dd7be76b25ac01a3a4c0ffd5e46463e226931df759d9a10","last_reissued_at":"2026-05-17T23:41:31.527840Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:31.527840Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Risk-Sensitive Stopping Problems for Continuous-Time Markov Chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Anton Popp, Nicole B\\\"auerle","submitted_at":"2016-10-19T09:16:02Z","abstract_excerpt":"In this paper we consider stopping problems for continuous-time Markov chains under a general risk-sensitive optimization criterion for problems with finite and infinite time horizon. More precisely our aim is to maximize the certainty equivalent of the stopping reward minus cost over the time horizon. We derive optimality equations for the value functions and prove the existence of optimal stopping times. The exponential utility is treated as a special case. In contrast to risk-neutral stopping problems it may be optimal to stop between jumps of the Markov chain. We briefly discuss the influe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.05922","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":"1610.05922","created_at":"2026-05-17T23:41:31.527970+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.05922v1","created_at":"2026-05-17T23:41:31.527970+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.05922","created_at":"2026-05-17T23:41:31.527970+00:00"},{"alias_kind":"pith_short_12","alias_value":"QVPYBWNQCCWG","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"QVPYBWNQCCWGGDOX","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"QVPYBWNQ","created_at":"2026-05-18T12:30:41.710351+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/QVPYBWNQCCWGGDOXXZ3LEWWADI","json":"https://pith.science/pith/QVPYBWNQCCWGGDOXXZ3LEWWADI.json","graph_json":"https://pith.science/api/pith-number/QVPYBWNQCCWGGDOXXZ3LEWWADI/graph.json","events_json":"https://pith.science/api/pith-number/QVPYBWNQCCWGGDOXXZ3LEWWADI/events.json","paper":"https://pith.science/paper/QVPYBWNQ"},"agent_actions":{"view_html":"https://pith.science/pith/QVPYBWNQCCWGGDOXXZ3LEWWADI","download_json":"https://pith.science/pith/QVPYBWNQCCWGGDOXXZ3LEWWADI.json","view_paper":"https://pith.science/paper/QVPYBWNQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.05922&json=true","fetch_graph":"https://pith.science/api/pith-number/QVPYBWNQCCWGGDOXXZ3LEWWADI/graph.json","fetch_events":"https://pith.science/api/pith-number/QVPYBWNQCCWGGDOXXZ3LEWWADI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QVPYBWNQCCWGGDOXXZ3LEWWADI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QVPYBWNQCCWGGDOXXZ3LEWWADI/action/storage_attestation","attest_author":"https://pith.science/pith/QVPYBWNQCCWGGDOXXZ3LEWWADI/action/author_attestation","sign_citation":"https://pith.science/pith/QVPYBWNQCCWGGDOXXZ3LEWWADI/action/citation_signature","submit_replication":"https://pith.science/pith/QVPYBWNQCCWGGDOXXZ3LEWWADI/action/replication_record"}},"created_at":"2026-05-17T23:41:31.527970+00:00","updated_at":"2026-05-17T23:41:31.527970+00:00"}