{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:DZFKVI2A26GPBFLENG2GIVXKKR","short_pith_number":"pith:DZFKVI2A","schema_version":"1.0","canonical_sha256":"1e4aaaa340d78cf0956469b46456ea546fa163757581647adb6c122ab4dd45a9","source":{"kind":"arxiv","id":"1011.5812","version":2},"attestation_state":"computed","paper":{"title":"Numerical method for impulse control 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","submitted_at":"2010-11-26T14:59:51Z","abstract_excerpt":"This paper presents a numerical method to calculate the value function for a general discounted impulse control problem for piecewise deterministic Markov processes. Our approach is based on a quantization technique for the underlying Markov chain defined by the post jump location and inter-arrival time. Convergence results are obtained and more importantly we are able to give a convergence rate of the algorithm. 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":"1011.5812","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-11-26T14:59:51Z","cross_cats_sorted":[],"title_canon_sha256":"cce56d4eb0c504933ce7f0335d37b3f5132382b9c86bc10696ed46ecb0779cc3","abstract_canon_sha256":"5629f251d124dc4d5e209350b93d11ae19f6e7a0950d1fb02ca9931ac7fa7ef2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:14:29.395417Z","signature_b64":"TbqnRXKohS4XzsmGdFWoN273m/WARoKferWSBmsRPGgQGQRJRMMdM/dlIXYUAwuwY/sKQkWaRz23DjOCg3vGDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e4aaaa340d78cf0956469b46456ea546fa163757581647adb6c122ab4dd45a9","last_reissued_at":"2026-05-18T04:14:29.394905Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:14:29.394905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Numerical method for impulse control 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","submitted_at":"2010-11-26T14:59:51Z","abstract_excerpt":"This paper presents a numerical method to calculate the value function for a general discounted impulse control problem for piecewise deterministic Markov processes. Our approach is based on a quantization technique for the underlying Markov chain defined by the post jump location and inter-arrival time. Convergence results are obtained and more importantly we are able to give a convergence rate of the algorithm. The paper is illustrated by a numerical example."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.5812","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":"1011.5812","created_at":"2026-05-18T04:14:29.394981+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.5812v2","created_at":"2026-05-18T04:14:29.394981+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.5812","created_at":"2026-05-18T04:14:29.394981+00:00"},{"alias_kind":"pith_short_12","alias_value":"DZFKVI2A26GP","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"DZFKVI2A26GPBFLE","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"DZFKVI2A","created_at":"2026-05-18T12:26:06.534383+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/DZFKVI2A26GPBFLENG2GIVXKKR","json":"https://pith.science/pith/DZFKVI2A26GPBFLENG2GIVXKKR.json","graph_json":"https://pith.science/api/pith-number/DZFKVI2A26GPBFLENG2GIVXKKR/graph.json","events_json":"https://pith.science/api/pith-number/DZFKVI2A26GPBFLENG2GIVXKKR/events.json","paper":"https://pith.science/paper/DZFKVI2A"},"agent_actions":{"view_html":"https://pith.science/pith/DZFKVI2A26GPBFLENG2GIVXKKR","download_json":"https://pith.science/pith/DZFKVI2A26GPBFLENG2GIVXKKR.json","view_paper":"https://pith.science/paper/DZFKVI2A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.5812&json=true","fetch_graph":"https://pith.science/api/pith-number/DZFKVI2A26GPBFLENG2GIVXKKR/graph.json","fetch_events":"https://pith.science/api/pith-number/DZFKVI2A26GPBFLENG2GIVXKKR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DZFKVI2A26GPBFLENG2GIVXKKR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DZFKVI2A26GPBFLENG2GIVXKKR/action/storage_attestation","attest_author":"https://pith.science/pith/DZFKVI2A26GPBFLENG2GIVXKKR/action/author_attestation","sign_citation":"https://pith.science/pith/DZFKVI2A26GPBFLENG2GIVXKKR/action/citation_signature","submit_replication":"https://pith.science/pith/DZFKVI2A26GPBFLENG2GIVXKKR/action/replication_record"}},"created_at":"2026-05-18T04:14:29.394981+00:00","updated_at":"2026-05-18T04:14:29.394981+00:00"}