{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:ME626WOULW52UQXUHSG6DAHFP6","short_pith_number":"pith:ME626WOU","schema_version":"1.0","canonical_sha256":"613daf59d45dbbaa42f43c8de180e57fa9e792c1245c91db682dad7ce5bbbb7c","source":{"kind":"arxiv","id":"1207.2886","version":2},"attestation_state":"computed","paper":{"title":"Optimal stopping for partially observed piecewise-deterministic Markov processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Adrien Brandejsky, Beno\\^ite de Saporta, Fran\\c{c}ois Dufour","submitted_at":"2012-07-12T09:21:36Z","abstract_excerpt":"This paper deals with the optimal stopping problem under partial observation for piecewise-deterministic Markov processes. We first obtain a recursive formulation of the optimal filter process and derive the dynamic programming equation of the partially observed optimal stopping problem. Then, we propose a numerical method, based on the quantization of the discrete-time filter process and the inter-jump times, to approximate the value function and to compute an actual $\\epsilon$-optimal stopping time. We prove the convergence of the algorithms and bound the rates of convergence."},"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":"1207.2886","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-07-12T09:21:36Z","cross_cats_sorted":[],"title_canon_sha256":"33b29054cac73e1529eb3c3ddd704e5b344388dda9eda07e3650196f5b88300a","abstract_canon_sha256":"5d6a115befcee67d29bc515ef349ad2e11078c614460099df97f7f4ba3d9a9d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:24:52.653718Z","signature_b64":"e9L2vfYC86pktNu/6Ws+gMJwJoSIag8KTQHHrFZ04MdsFFULZDUdSpiQKhIwngahr5EJ47PS7MKn0Q+S86GbCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"613daf59d45dbbaa42f43c8de180e57fa9e792c1245c91db682dad7ce5bbbb7c","last_reissued_at":"2026-05-18T03:24:52.652906Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:24:52.652906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal stopping for partially observed piecewise-deterministic Markov processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Adrien Brandejsky, Beno\\^ite de Saporta, Fran\\c{c}ois Dufour","submitted_at":"2012-07-12T09:21:36Z","abstract_excerpt":"This paper deals with the optimal stopping problem under partial observation for piecewise-deterministic Markov processes. We first obtain a recursive formulation of the optimal filter process and derive the dynamic programming equation of the partially observed optimal stopping problem. Then, we propose a numerical method, based on the quantization of the discrete-time filter process and the inter-jump times, to approximate the value function and to compute an actual $\\epsilon$-optimal stopping time. We prove the convergence of the algorithms and bound the rates of convergence."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.2886","kind":"arxiv","version":2},"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":"1207.2886","created_at":"2026-05-18T03:24:52.653036+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.2886v2","created_at":"2026-05-18T03:24:52.653036+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.2886","created_at":"2026-05-18T03:24:52.653036+00:00"},{"alias_kind":"pith_short_12","alias_value":"ME626WOULW52","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"ME626WOULW52UQXU","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"ME626WOU","created_at":"2026-05-18T12:27:14.488303+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/ME626WOULW52UQXUHSG6DAHFP6","json":"https://pith.science/pith/ME626WOULW52UQXUHSG6DAHFP6.json","graph_json":"https://pith.science/api/pith-number/ME626WOULW52UQXUHSG6DAHFP6/graph.json","events_json":"https://pith.science/api/pith-number/ME626WOULW52UQXUHSG6DAHFP6/events.json","paper":"https://pith.science/paper/ME626WOU"},"agent_actions":{"view_html":"https://pith.science/pith/ME626WOULW52UQXUHSG6DAHFP6","download_json":"https://pith.science/pith/ME626WOULW52UQXUHSG6DAHFP6.json","view_paper":"https://pith.science/paper/ME626WOU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.2886&json=true","fetch_graph":"https://pith.science/api/pith-number/ME626WOULW52UQXUHSG6DAHFP6/graph.json","fetch_events":"https://pith.science/api/pith-number/ME626WOULW52UQXUHSG6DAHFP6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ME626WOULW52UQXUHSG6DAHFP6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ME626WOULW52UQXUHSG6DAHFP6/action/storage_attestation","attest_author":"https://pith.science/pith/ME626WOULW52UQXUHSG6DAHFP6/action/author_attestation","sign_citation":"https://pith.science/pith/ME626WOULW52UQXUHSG6DAHFP6/action/citation_signature","submit_replication":"https://pith.science/pith/ME626WOULW52UQXUHSG6DAHFP6/action/replication_record"}},"created_at":"2026-05-18T03:24:52.653036+00:00","updated_at":"2026-05-18T03:24:52.653036+00:00"}