{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:6FNQJG576AGCS3S2CHBT7ELU5Z","short_pith_number":"pith:6FNQJG57","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"},"canonical_sha256":"f15b049bbff00c296e5a11c33f9174ee5b9be79f6ab9b3c5444ffaf5d10d2504","source":{"kind":"arxiv","id":"0903.2114","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0903.2114","created_at":"2026-05-18T01:09:24Z"},{"alias_kind":"arxiv_version","alias_value":"0903.2114v2","created_at":"2026-05-18T01:09:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.2114","created_at":"2026-05-18T01:09:24Z"},{"alias_kind":"pith_short_12","alias_value":"6FNQJG576AGC","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"6FNQJG576AGCS3S2","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"6FNQJG57","created_at":"2026-05-18T12:25:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:6FNQJG576AGCS3S2CHBT7ELU5Z","target":"record","payload":{"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"},"canonical_sha256":"f15b049bbff00c296e5a11c33f9174ee5b9be79f6ab9b3c5444ffaf5d10d2504","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"},"source_kind":"arxiv","source_id":"0903.2114","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-18T01:09:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+e4Ic309JGPMzl1vBYbleC8x8EylmZEJT7UF6CCAVhyuPQjrZpnK6bwxDnI8bh2s1PWXf0swO6A+RrNIQZ4bCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:41:52.269591Z"},"content_sha256":"570a77a607fd17f3d93659e5f3008ae8f0c91534b3b8d02e4f923fb8e0dba860","schema_version":"1.0","event_id":"sha256:570a77a607fd17f3d93659e5f3008ae8f0c91534b3b8d02e4f923fb8e0dba860"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:6FNQJG576AGCS3S2CHBT7ELU5Z","target":"graph","payload":{"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"},"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-18T01:09:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q/KyK9tkgIRkDorTTX0TXUj43JOW+RVGFk1pMeWDD5i/6iGSFoVZ7ZQ86u5DJPC6gHPNLo4na6xJJx8n1UQdCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:41:52.270261Z"},"content_sha256":"ad17410d9c66de30f83104d2e80f19fe6c7bd54cf0f877d200a70eff63d89231","schema_version":"1.0","event_id":"sha256:ad17410d9c66de30f83104d2e80f19fe6c7bd54cf0f877d200a70eff63d89231"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6FNQJG576AGCS3S2CHBT7ELU5Z/bundle.json","state_url":"https://pith.science/pith/6FNQJG576AGCS3S2CHBT7ELU5Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6FNQJG576AGCS3S2CHBT7ELU5Z/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-04T22:41:52Z","links":{"resolver":"https://pith.science/pith/6FNQJG576AGCS3S2CHBT7ELU5Z","bundle":"https://pith.science/pith/6FNQJG576AGCS3S2CHBT7ELU5Z/bundle.json","state":"https://pith.science/pith/6FNQJG576AGCS3S2CHBT7ELU5Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6FNQJG576AGCS3S2CHBT7ELU5Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:6FNQJG576AGCS3S2CHBT7ELU5Z","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":"dd76f295114d78bf07c56727c40e719be9def89b455ecb7a784843e92212e174","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2009-03-12T08:50:04Z","title_canon_sha256":"4ff1a77dfc1fedb21a3da1e75e8a2d46fd89de1a21ef12c82d54609e752a212c"},"schema_version":"1.0","source":{"id":"0903.2114","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0903.2114","created_at":"2026-05-18T01:09:24Z"},{"alias_kind":"arxiv_version","alias_value":"0903.2114v2","created_at":"2026-05-18T01:09:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.2114","created_at":"2026-05-18T01:09:24Z"},{"alias_kind":"pith_short_12","alias_value":"6FNQJG576AGC","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"6FNQJG576AGCS3S2","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"6FNQJG57","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:ad17410d9c66de30f83104d2e80f19fe6c7bd54cf0f877d200a70eff63d89231","target":"graph","created_at":"2026-05-18T01:09:24Z","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":"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.","authors_text":"Beno\\^ite de Saporta, Fran\\c{c}ois Dufour, Karen Gonzalez","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2009-03-12T08:50:04Z","title":"Numerical method for optimal stopping of piecewise deterministic Markov processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.2114","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:570a77a607fd17f3d93659e5f3008ae8f0c91534b3b8d02e4f923fb8e0dba860","target":"record","created_at":"2026-05-18T01:09:24Z","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":"dd76f295114d78bf07c56727c40e719be9def89b455ecb7a784843e92212e174","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2009-03-12T08:50:04Z","title_canon_sha256":"4ff1a77dfc1fedb21a3da1e75e8a2d46fd89de1a21ef12c82d54609e752a212c"},"schema_version":"1.0","source":{"id":"0903.2114","kind":"arxiv","version":2}},"canonical_sha256":"f15b049bbff00c296e5a11c33f9174ee5b9be79f6ab9b3c5444ffaf5d10d2504","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f15b049bbff00c296e5a11c33f9174ee5b9be79f6ab9b3c5444ffaf5d10d2504","first_computed_at":"2026-05-18T01:09:24.313787Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:24.313787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QFaNX2U5kdlMBY9WX/nIB0Y88ix/GhgpFm/TZ6AVAyBMv3Q447d5vZGIp+uCIa0iv8mXPaCHrsuOZ7AEDyuDAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:24.314343Z","signed_message":"canonical_sha256_bytes"},"source_id":"0903.2114","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:570a77a607fd17f3d93659e5f3008ae8f0c91534b3b8d02e4f923fb8e0dba860","sha256:ad17410d9c66de30f83104d2e80f19fe6c7bd54cf0f877d200a70eff63d89231"],"state_sha256":"1cedb61b51ea09c57fecc5816146e9d152d2d90568b02ccc634ff15f240777c1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"23c1HYlh/+IIGy1tLLT4GN2BK2k1UfUruZimYCfOwYq5YZQBAseuejoFNQHZglkf/wg1pO/oqJ2445rZ4luKAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T22:41:52.273884Z","bundle_sha256":"be819e2880cbee153829c253e44b9268fbdbf56dc1c5c68fcd6aaeed31b706cd"}}