{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:GTFAHH2AQKIPMD4W6HK7S5543P","short_pith_number":"pith:GTFAHH2A","schema_version":"1.0","canonical_sha256":"34ca039f408290f60f96f1d5f977bcdbf22d2f6946c4c02afffc686e6b9e9887","source":{"kind":"arxiv","id":"1109.5256","version":2},"attestation_state":"computed","paper":{"title":"Time discretization and quantization methods for optimal multiple switching problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Huy\\^en Pham, Idris Kharroubi, Paul Gassiat","submitted_at":"2011-09-24T11:57:45Z","abstract_excerpt":"In this paper, we study probabilistic numerical methods based on optimal quantization algorithms for computing the solution to optimal multiple switching problems with regime-dependent state process. We first consider a discrete-time approximation of the optimal switching problem, and analyze its rate of convergence. Given a time step $h$, the error is in general of order $(h \\log(1/h))^{1/2}$, and of order $h^{1/2}$ when the switching costs do not depend on the state process. We next propose quantization numerical schemes for the space discretization of the discrete-time Euler state process. "},"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":"1109.5256","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-09-24T11:57:45Z","cross_cats_sorted":[],"title_canon_sha256":"1cbd80e1d0929d6cea1ac0c080e77899a584c761ccc23e77968c7da99d36ca64","abstract_canon_sha256":"3904ecda68d1244a454d5eef43dd42478c264318d6de84154770a7850e4d19b9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:27.085340Z","signature_b64":"pt1/W/OcSM28gwwp7e1xq7u8GQmn9tHvlvjlM8t+8cN2Yo09KqIg7leu6F6qt2JvO+w4icbKMDPFDtB7j0XQAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34ca039f408290f60f96f1d5f977bcdbf22d2f6946c4c02afffc686e6b9e9887","last_reissued_at":"2026-05-18T04:02:27.084801Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:27.084801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Time discretization and quantization methods for optimal multiple switching problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Huy\\^en Pham, Idris Kharroubi, Paul Gassiat","submitted_at":"2011-09-24T11:57:45Z","abstract_excerpt":"In this paper, we study probabilistic numerical methods based on optimal quantization algorithms for computing the solution to optimal multiple switching problems with regime-dependent state process. We first consider a discrete-time approximation of the optimal switching problem, and analyze its rate of convergence. Given a time step $h$, the error is in general of order $(h \\log(1/h))^{1/2}$, and of order $h^{1/2}$ when the switching costs do not depend on the state process. We next propose quantization numerical schemes for the space discretization of the discrete-time Euler state process. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.5256","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":"1109.5256","created_at":"2026-05-18T04:02:27.084896+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.5256v2","created_at":"2026-05-18T04:02:27.084896+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.5256","created_at":"2026-05-18T04:02:27.084896+00:00"},{"alias_kind":"pith_short_12","alias_value":"GTFAHH2AQKIP","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"GTFAHH2AQKIPMD4W","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"GTFAHH2A","created_at":"2026-05-18T12:26:30.835961+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/GTFAHH2AQKIPMD4W6HK7S5543P","json":"https://pith.science/pith/GTFAHH2AQKIPMD4W6HK7S5543P.json","graph_json":"https://pith.science/api/pith-number/GTFAHH2AQKIPMD4W6HK7S5543P/graph.json","events_json":"https://pith.science/api/pith-number/GTFAHH2AQKIPMD4W6HK7S5543P/events.json","paper":"https://pith.science/paper/GTFAHH2A"},"agent_actions":{"view_html":"https://pith.science/pith/GTFAHH2AQKIPMD4W6HK7S5543P","download_json":"https://pith.science/pith/GTFAHH2AQKIPMD4W6HK7S5543P.json","view_paper":"https://pith.science/paper/GTFAHH2A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.5256&json=true","fetch_graph":"https://pith.science/api/pith-number/GTFAHH2AQKIPMD4W6HK7S5543P/graph.json","fetch_events":"https://pith.science/api/pith-number/GTFAHH2AQKIPMD4W6HK7S5543P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GTFAHH2AQKIPMD4W6HK7S5543P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GTFAHH2AQKIPMD4W6HK7S5543P/action/storage_attestation","attest_author":"https://pith.science/pith/GTFAHH2AQKIPMD4W6HK7S5543P/action/author_attestation","sign_citation":"https://pith.science/pith/GTFAHH2AQKIPMD4W6HK7S5543P/action/citation_signature","submit_replication":"https://pith.science/pith/GTFAHH2AQKIPMD4W6HK7S5543P/action/replication_record"}},"created_at":"2026-05-18T04:02:27.084896+00:00","updated_at":"2026-05-18T04:02:27.084896+00:00"}