{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:GTFAHH2AQKIPMD4W6HK7S5543P","short_pith_number":"pith:GTFAHH2A","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"},"canonical_sha256":"34ca039f408290f60f96f1d5f977bcdbf22d2f6946c4c02afffc686e6b9e9887","source":{"kind":"arxiv","id":"1109.5256","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.5256","created_at":"2026-05-18T04:02:27Z"},{"alias_kind":"arxiv_version","alias_value":"1109.5256v2","created_at":"2026-05-18T04:02:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.5256","created_at":"2026-05-18T04:02:27Z"},{"alias_kind":"pith_short_12","alias_value":"GTFAHH2AQKIP","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"GTFAHH2AQKIPMD4W","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"GTFAHH2A","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:GTFAHH2AQKIPMD4W6HK7S5543P","target":"record","payload":{"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"},"canonical_sha256":"34ca039f408290f60f96f1d5f977bcdbf22d2f6946c4c02afffc686e6b9e9887","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"},"source_kind":"arxiv","source_id":"1109.5256","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:02:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ShLb7SEhrIXMOWzeMXwkko0V+NJKbjkyy/+4AQW78ZE4NAPoyuRH9psUgAb8JIKx5OYIUKWcFZ2p9MRdcIOBBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:12:13.288530Z"},"content_sha256":"5f895b890166af7401558d5727caf669f6817f1736f8be7c2dac21c89c795340","schema_version":"1.0","event_id":"sha256:5f895b890166af7401558d5727caf669f6817f1736f8be7c2dac21c89c795340"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:GTFAHH2AQKIPMD4W6HK7S5543P","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:02:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NzZgl1Yh5xGGD1we1bclc8CH8SLoeCkENfLBnfWQcSJp/GiFheoe09IeRaWb6t5p4Y1vDKo7OFCA39UhzyLhBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:12:13.288943Z"},"content_sha256":"2acbd1c98d67b8ba7d72c5426e844e44f2a62fb7c892adfe23fd512672449f73","schema_version":"1.0","event_id":"sha256:2acbd1c98d67b8ba7d72c5426e844e44f2a62fb7c892adfe23fd512672449f73"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GTFAHH2AQKIPMD4W6HK7S5543P/bundle.json","state_url":"https://pith.science/pith/GTFAHH2AQKIPMD4W6HK7S5543P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GTFAHH2AQKIPMD4W6HK7S5543P/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T12:12:13Z","links":{"resolver":"https://pith.science/pith/GTFAHH2AQKIPMD4W6HK7S5543P","bundle":"https://pith.science/pith/GTFAHH2AQKIPMD4W6HK7S5543P/bundle.json","state":"https://pith.science/pith/GTFAHH2AQKIPMD4W6HK7S5543P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GTFAHH2AQKIPMD4W6HK7S5543P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:GTFAHH2AQKIPMD4W6HK7S5543P","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3904ecda68d1244a454d5eef43dd42478c264318d6de84154770a7850e4d19b9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-09-24T11:57:45Z","title_canon_sha256":"1cbd80e1d0929d6cea1ac0c080e77899a584c761ccc23e77968c7da99d36ca64"},"schema_version":"1.0","source":{"id":"1109.5256","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.5256","created_at":"2026-05-18T04:02:27Z"},{"alias_kind":"arxiv_version","alias_value":"1109.5256v2","created_at":"2026-05-18T04:02:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.5256","created_at":"2026-05-18T04:02:27Z"},{"alias_kind":"pith_short_12","alias_value":"GTFAHH2AQKIP","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"GTFAHH2AQKIPMD4W","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"GTFAHH2A","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:2acbd1c98d67b8ba7d72c5426e844e44f2a62fb7c892adfe23fd512672449f73","target":"graph","created_at":"2026-05-18T04:02:27Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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. ","authors_text":"Huy\\^en Pham, Idris Kharroubi, Paul Gassiat","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-09-24T11:57:45Z","title":"Time discretization and quantization methods for optimal multiple switching problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.5256","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5f895b890166af7401558d5727caf669f6817f1736f8be7c2dac21c89c795340","target":"record","created_at":"2026-05-18T04:02:27Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3904ecda68d1244a454d5eef43dd42478c264318d6de84154770a7850e4d19b9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-09-24T11:57:45Z","title_canon_sha256":"1cbd80e1d0929d6cea1ac0c080e77899a584c761ccc23e77968c7da99d36ca64"},"schema_version":"1.0","source":{"id":"1109.5256","kind":"arxiv","version":2}},"canonical_sha256":"34ca039f408290f60f96f1d5f977bcdbf22d2f6946c4c02afffc686e6b9e9887","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"34ca039f408290f60f96f1d5f977bcdbf22d2f6946c4c02afffc686e6b9e9887","first_computed_at":"2026-05-18T04:02:27.084801Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:02:27.084801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pt1/W/OcSM28gwwp7e1xq7u8GQmn9tHvlvjlM8t+8cN2Yo09KqIg7leu6F6qt2JvO+w4icbKMDPFDtB7j0XQAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:02:27.085340Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.5256","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f895b890166af7401558d5727caf669f6817f1736f8be7c2dac21c89c795340","sha256:2acbd1c98d67b8ba7d72c5426e844e44f2a62fb7c892adfe23fd512672449f73"],"state_sha256":"bef19d1a1e1aa8014f3eaa13a21a674df23d902959ce8b96b6805bb1212cd07a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hJmRm+5hc15wnAZITUyZUPz3x0hdKR7rXS3gipZlkzTTmTCwo8mvYk36pYXDNfRudwa8yOVSwEVb0y+lfRFyBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T12:12:13.291004Z","bundle_sha256":"3e95b376d95e7db2d273737ac3439dd852558afacb60516156a685cc42f778fe"}}