{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:6FNQJG576AGCS3S2CHBT7ELU5Z","short_pith_number":"pith:6FNQJG57","schema_version":"1.0","canonical_sha256":"f15b049bbff00c296e5a11c33f9174ee5b9be79f6ab9b3c5444ffaf5d10d2504","source":{"kind":"arxiv","id":"0903.2114","version":2},"attestation_state":"computed","paper":{"title":"Numerical method for optimal stopping of piecewise deterministic Markov processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Beno\\^ite de Saporta, Fran\\c{c}ois Dufour, Karen Gonzalez","submitted_at":"2009-03-12T08:50:04Z","abstract_excerpt":"We propose a numerical method to approximate the value function for the optimal stopping problem of a piecewise deterministic Markov process (PDMP). Our approach is based on quantization of the post jump location---inter-arrival time Markov chain naturally embedded in the PDMP, and path-adapted time discretization grids. It allows us to derive bounds for the convergence rate of the algorithm and to provide a computable $\\epsilon$-optimal stopping time. The paper is illustrated by a numerical example."},"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":"0903.2114","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2009-03-12T08:50:04Z","cross_cats_sorted":[],"title_canon_sha256":"4ff1a77dfc1fedb21a3da1e75e8a2d46fd89de1a21ef12c82d54609e752a212c","abstract_canon_sha256":"dd76f295114d78bf07c56727c40e719be9def89b455ecb7a784843e92212e174"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:24.314343Z","signature_b64":"QFaNX2U5kdlMBY9WX/nIB0Y88ix/GhgpFm/TZ6AVAyBMv3Q447d5vZGIp+uCIa0iv8mXPaCHrsuOZ7AEDyuDAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f15b049bbff00c296e5a11c33f9174ee5b9be79f6ab9b3c5444ffaf5d10d2504","last_reissued_at":"2026-05-18T01:09:24.313787Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:24.313787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Numerical method for optimal stopping of piecewise deterministic Markov processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Beno\\^ite de Saporta, Fran\\c{c}ois Dufour, Karen Gonzalez","submitted_at":"2009-03-12T08:50:04Z","abstract_excerpt":"We propose a numerical method to approximate the value function for the optimal stopping problem of a piecewise deterministic Markov process (PDMP). Our approach is based on quantization of the post jump location---inter-arrival time Markov chain naturally embedded in the PDMP, and path-adapted time discretization grids. It allows us to derive bounds for the convergence rate of the algorithm and to provide a computable $\\epsilon$-optimal stopping time. The paper is illustrated by a numerical example."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.2114","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":"0903.2114","created_at":"2026-05-18T01:09:24.313874+00:00"},{"alias_kind":"arxiv_version","alias_value":"0903.2114v2","created_at":"2026-05-18T01:09:24.313874+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.2114","created_at":"2026-05-18T01:09:24.313874+00:00"},{"alias_kind":"pith_short_12","alias_value":"6FNQJG576AGC","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_16","alias_value":"6FNQJG576AGCS3S2","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_8","alias_value":"6FNQJG57","created_at":"2026-05-18T12:25:58.837520+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/6FNQJG576AGCS3S2CHBT7ELU5Z","json":"https://pith.science/pith/6FNQJG576AGCS3S2CHBT7ELU5Z.json","graph_json":"https://pith.science/api/pith-number/6FNQJG576AGCS3S2CHBT7ELU5Z/graph.json","events_json":"https://pith.science/api/pith-number/6FNQJG576AGCS3S2CHBT7ELU5Z/events.json","paper":"https://pith.science/paper/6FNQJG57"},"agent_actions":{"view_html":"https://pith.science/pith/6FNQJG576AGCS3S2CHBT7ELU5Z","download_json":"https://pith.science/pith/6FNQJG576AGCS3S2CHBT7ELU5Z.json","view_paper":"https://pith.science/paper/6FNQJG57","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0903.2114&json=true","fetch_graph":"https://pith.science/api/pith-number/6FNQJG576AGCS3S2CHBT7ELU5Z/graph.json","fetch_events":"https://pith.science/api/pith-number/6FNQJG576AGCS3S2CHBT7ELU5Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6FNQJG576AGCS3S2CHBT7ELU5Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6FNQJG576AGCS3S2CHBT7ELU5Z/action/storage_attestation","attest_author":"https://pith.science/pith/6FNQJG576AGCS3S2CHBT7ELU5Z/action/author_attestation","sign_citation":"https://pith.science/pith/6FNQJG576AGCS3S2CHBT7ELU5Z/action/citation_signature","submit_replication":"https://pith.science/pith/6FNQJG576AGCS3S2CHBT7ELU5Z/action/replication_record"}},"created_at":"2026-05-18T01:09:24.313874+00:00","updated_at":"2026-05-18T01:09:24.313874+00:00"}