{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:ME626WOULW52UQXUHSG6DAHFP6","short_pith_number":"pith:ME626WOU","canonical_record":{"source":{"id":"1207.2886","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-07-12T09:21:36Z","cross_cats_sorted":[],"title_canon_sha256":"33b29054cac73e1529eb3c3ddd704e5b344388dda9eda07e3650196f5b88300a","abstract_canon_sha256":"5d6a115befcee67d29bc515ef349ad2e11078c614460099df97f7f4ba3d9a9d8"},"schema_version":"1.0"},"canonical_sha256":"613daf59d45dbbaa42f43c8de180e57fa9e792c1245c91db682dad7ce5bbbb7c","source":{"kind":"arxiv","id":"1207.2886","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.2886","created_at":"2026-05-18T03:24:52Z"},{"alias_kind":"arxiv_version","alias_value":"1207.2886v2","created_at":"2026-05-18T03:24:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.2886","created_at":"2026-05-18T03:24:52Z"},{"alias_kind":"pith_short_12","alias_value":"ME626WOULW52","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"ME626WOULW52UQXU","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"ME626WOU","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:ME626WOULW52UQXUHSG6DAHFP6","target":"record","payload":{"canonical_record":{"source":{"id":"1207.2886","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-07-12T09:21:36Z","cross_cats_sorted":[],"title_canon_sha256":"33b29054cac73e1529eb3c3ddd704e5b344388dda9eda07e3650196f5b88300a","abstract_canon_sha256":"5d6a115befcee67d29bc515ef349ad2e11078c614460099df97f7f4ba3d9a9d8"},"schema_version":"1.0"},"canonical_sha256":"613daf59d45dbbaa42f43c8de180e57fa9e792c1245c91db682dad7ce5bbbb7c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:24:52.653718Z","signature_b64":"e9L2vfYC86pktNu/6Ws+gMJwJoSIag8KTQHHrFZ04MdsFFULZDUdSpiQKhIwngahr5EJ47PS7MKn0Q+S86GbCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"613daf59d45dbbaa42f43c8de180e57fa9e792c1245c91db682dad7ce5bbbb7c","last_reissued_at":"2026-05-18T03:24:52.652906Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:24:52.652906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.2886","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-18T03:24:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LbwhmaUxtrLLNQQGyM8EYABbmOqoLxbfwv4EsyVg30b8HP1pryFyDsVyhMWUCUHNXs635Oxv8F665l8EIRleAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T00:29:06.167014Z"},"content_sha256":"7120d0632f0deb247d73a5de1cbfa59632ca1b80023c4108b91bcb9c0af9a27f","schema_version":"1.0","event_id":"sha256:7120d0632f0deb247d73a5de1cbfa59632ca1b80023c4108b91bcb9c0af9a27f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:ME626WOULW52UQXUHSG6DAHFP6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal stopping for partially observed piecewise-deterministic Markov processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Adrien Brandejsky, Beno\\^ite de Saporta, Fran\\c{c}ois Dufour","submitted_at":"2012-07-12T09:21:36Z","abstract_excerpt":"This paper deals with the optimal stopping problem under partial observation for piecewise-deterministic Markov processes. We first obtain a recursive formulation of the optimal filter process and derive the dynamic programming equation of the partially observed optimal stopping problem. Then, we propose a numerical method, based on the quantization of the discrete-time filter process and the inter-jump times, to approximate the value function and to compute an actual $\\epsilon$-optimal stopping time. We prove the convergence of the algorithms and bound the rates of convergence."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.2886","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-18T03:24:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SYyyR0b24nLVrOS2qHcUKisFKq05cTotd5aAQZMpcTAyrvTbISIYQihZaoWS81OpE/qCNIrTXwojmdQZdzKACw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T00:29:06.167373Z"},"content_sha256":"fd47e4ad34adc4d188006c171704b016d9b136d681f3e2243703a283bc31cbf1","schema_version":"1.0","event_id":"sha256:fd47e4ad34adc4d188006c171704b016d9b136d681f3e2243703a283bc31cbf1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ME626WOULW52UQXUHSG6DAHFP6/bundle.json","state_url":"https://pith.science/pith/ME626WOULW52UQXUHSG6DAHFP6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ME626WOULW52UQXUHSG6DAHFP6/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-05T00:29:06Z","links":{"resolver":"https://pith.science/pith/ME626WOULW52UQXUHSG6DAHFP6","bundle":"https://pith.science/pith/ME626WOULW52UQXUHSG6DAHFP6/bundle.json","state":"https://pith.science/pith/ME626WOULW52UQXUHSG6DAHFP6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ME626WOULW52UQXUHSG6DAHFP6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ME626WOULW52UQXUHSG6DAHFP6","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":"5d6a115befcee67d29bc515ef349ad2e11078c614460099df97f7f4ba3d9a9d8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-07-12T09:21:36Z","title_canon_sha256":"33b29054cac73e1529eb3c3ddd704e5b344388dda9eda07e3650196f5b88300a"},"schema_version":"1.0","source":{"id":"1207.2886","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.2886","created_at":"2026-05-18T03:24:52Z"},{"alias_kind":"arxiv_version","alias_value":"1207.2886v2","created_at":"2026-05-18T03:24:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.2886","created_at":"2026-05-18T03:24:52Z"},{"alias_kind":"pith_short_12","alias_value":"ME626WOULW52","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"ME626WOULW52UQXU","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"ME626WOU","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:fd47e4ad34adc4d188006c171704b016d9b136d681f3e2243703a283bc31cbf1","target":"graph","created_at":"2026-05-18T03:24:52Z","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":"This paper deals with the optimal stopping problem under partial observation for piecewise-deterministic Markov processes. We first obtain a recursive formulation of the optimal filter process and derive the dynamic programming equation of the partially observed optimal stopping problem. Then, we propose a numerical method, based on the quantization of the discrete-time filter process and the inter-jump times, to approximate the value function and to compute an actual $\\epsilon$-optimal stopping time. We prove the convergence of the algorithms and bound the rates of convergence.","authors_text":"Adrien Brandejsky, Beno\\^ite de Saporta, Fran\\c{c}ois Dufour","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-07-12T09:21:36Z","title":"Optimal stopping for partially observed piecewise-deterministic Markov processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.2886","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:7120d0632f0deb247d73a5de1cbfa59632ca1b80023c4108b91bcb9c0af9a27f","target":"record","created_at":"2026-05-18T03:24:52Z","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":"5d6a115befcee67d29bc515ef349ad2e11078c614460099df97f7f4ba3d9a9d8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-07-12T09:21:36Z","title_canon_sha256":"33b29054cac73e1529eb3c3ddd704e5b344388dda9eda07e3650196f5b88300a"},"schema_version":"1.0","source":{"id":"1207.2886","kind":"arxiv","version":2}},"canonical_sha256":"613daf59d45dbbaa42f43c8de180e57fa9e792c1245c91db682dad7ce5bbbb7c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"613daf59d45dbbaa42f43c8de180e57fa9e792c1245c91db682dad7ce5bbbb7c","first_computed_at":"2026-05-18T03:24:52.652906Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:24:52.652906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"e9L2vfYC86pktNu/6Ws+gMJwJoSIag8KTQHHrFZ04MdsFFULZDUdSpiQKhIwngahr5EJ47PS7MKn0Q+S86GbCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:24:52.653718Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.2886","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7120d0632f0deb247d73a5de1cbfa59632ca1b80023c4108b91bcb9c0af9a27f","sha256:fd47e4ad34adc4d188006c171704b016d9b136d681f3e2243703a283bc31cbf1"],"state_sha256":"73570674cf867a9ed14e0430005fd7ccdb86af181400b7e58648fd864a9ef577"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bOPfZ5h0WMcqVZD6zOJVZET/rk+fpgivzIYH/Jl7S9W8Cg/6hqNnAjww/d1vYDFPq07F+QvzzcLUDHAaC7rNAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T00:29:06.169449Z","bundle_sha256":"066e4e6e6f3c73f832821fcd3a461ebd5b95b7b12f32b80d78111ba62f21768e"}}