{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:GJUQY3VDN47ND225GXYSDHEJAG","short_pith_number":"pith:GJUQY3VD","canonical_record":{"source":{"id":"1602.04609","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-15T10:19:00Z","cross_cats_sorted":[],"title_canon_sha256":"ea86775073cdba07c821e44dcf334102c6df255ae4683e5cfb345d0590f6e152","abstract_canon_sha256":"6273e6d62e3687ae14bd38d7484387d05c9eb31216a021dca3d60a0806f71330"},"schema_version":"1.0"},"canonical_sha256":"32690c6ea36f3ed1eb5d35f1219c8901a665e45f92fcb2793585fd9dc8fdd958","source":{"kind":"arxiv","id":"1602.04609","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04609","created_at":"2026-05-18T01:20:49Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04609v1","created_at":"2026-05-18T01:20:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04609","created_at":"2026-05-18T01:20:49Z"},{"alias_kind":"pith_short_12","alias_value":"GJUQY3VDN47N","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GJUQY3VDN47ND225","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GJUQY3VD","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:GJUQY3VDN47ND225GXYSDHEJAG","target":"record","payload":{"canonical_record":{"source":{"id":"1602.04609","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-15T10:19:00Z","cross_cats_sorted":[],"title_canon_sha256":"ea86775073cdba07c821e44dcf334102c6df255ae4683e5cfb345d0590f6e152","abstract_canon_sha256":"6273e6d62e3687ae14bd38d7484387d05c9eb31216a021dca3d60a0806f71330"},"schema_version":"1.0"},"canonical_sha256":"32690c6ea36f3ed1eb5d35f1219c8901a665e45f92fcb2793585fd9dc8fdd958","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:49.540575Z","signature_b64":"kgr0nyEFxSgZ0NPf4QVsnX2n4if6OVGkFKYfrlnM7ToSeWncfW4o7BcgfjQYcUQraCb5HmcVkVu0ZdouAvhPCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32690c6ea36f3ed1eb5d35f1219c8901a665e45f92fcb2793585fd9dc8fdd958","last_reissued_at":"2026-05-18T01:20:49.540013Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:49.540013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.04609","source_version":1,"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:20:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GkOlp74AMbjSBDMi4fyMWtm24n/71Uo/lzc7lRtK+ZYaICQFBjy6HkI8rYdu3rkVsz78u/Hj9Uk3/+tA4aTgAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T14:26:21.177912Z"},"content_sha256":"f0db8103db5a60bd45f4d14d8726f3b86c2830ff5939d0572c36ef9933d2e79e","schema_version":"1.0","event_id":"sha256:f0db8103db5a60bd45f4d14d8726f3b86c2830ff5939d0572c36ef9933d2e79e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:GJUQY3VDN47ND225GXYSDHEJAG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Partially observed optimal stopping problem for discrete-time Markov processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Beno\\^ite de Saporta, Christophe Nivot, Fran\\c{c}ois Dufour","submitted_at":"2016-02-15T10:19:00Z","abstract_excerpt":"This paper is dedicated to the investigation of a new numerical method to approximate the optimal stopping problem for a discrete-time continuous state space Markov chain under partial observations. It is based on a two-step discretization procedure based on optimal quantization. First,we discretize the state space of the unobserved variable by quantizing an underlying reference measure. Then we jointly discretize the resulting approximate filter and the observation process. We obtain a fully computable approximation of the value function with explicit error bounds for its convergence towards "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04609","kind":"arxiv","version":1},"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:20:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KbWuWvH71sC8e46bdjuukov2c28+QIGTo/xNjcmVSniUc2Ot+YmhrjuAm9jlX1IJeIV5Gymb/PAQRpnpEoovBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T14:26:21.178259Z"},"content_sha256":"456fa42b5c39571e0e460c0c0ecaa1cc5e9a6ba49f2109c4f6ebed9430d2f5af","schema_version":"1.0","event_id":"sha256:456fa42b5c39571e0e460c0c0ecaa1cc5e9a6ba49f2109c4f6ebed9430d2f5af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GJUQY3VDN47ND225GXYSDHEJAG/bundle.json","state_url":"https://pith.science/pith/GJUQY3VDN47ND225GXYSDHEJAG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GJUQY3VDN47ND225GXYSDHEJAG/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-25T14:26:21Z","links":{"resolver":"https://pith.science/pith/GJUQY3VDN47ND225GXYSDHEJAG","bundle":"https://pith.science/pith/GJUQY3VDN47ND225GXYSDHEJAG/bundle.json","state":"https://pith.science/pith/GJUQY3VDN47ND225GXYSDHEJAG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GJUQY3VDN47ND225GXYSDHEJAG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:GJUQY3VDN47ND225GXYSDHEJAG","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":"6273e6d62e3687ae14bd38d7484387d05c9eb31216a021dca3d60a0806f71330","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-15T10:19:00Z","title_canon_sha256":"ea86775073cdba07c821e44dcf334102c6df255ae4683e5cfb345d0590f6e152"},"schema_version":"1.0","source":{"id":"1602.04609","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04609","created_at":"2026-05-18T01:20:49Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04609v1","created_at":"2026-05-18T01:20:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04609","created_at":"2026-05-18T01:20:49Z"},{"alias_kind":"pith_short_12","alias_value":"GJUQY3VDN47N","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GJUQY3VDN47ND225","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GJUQY3VD","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:456fa42b5c39571e0e460c0c0ecaa1cc5e9a6ba49f2109c4f6ebed9430d2f5af","target":"graph","created_at":"2026-05-18T01:20:49Z","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 is dedicated to the investigation of a new numerical method to approximate the optimal stopping problem for a discrete-time continuous state space Markov chain under partial observations. It is based on a two-step discretization procedure based on optimal quantization. First,we discretize the state space of the unobserved variable by quantizing an underlying reference measure. Then we jointly discretize the resulting approximate filter and the observation process. We obtain a fully computable approximation of the value function with explicit error bounds for its convergence towards ","authors_text":"Beno\\^ite de Saporta, Christophe Nivot, Fran\\c{c}ois Dufour","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-15T10:19:00Z","title":"Partially observed optimal stopping problem for discrete-time Markov processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04609","kind":"arxiv","version":1},"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:f0db8103db5a60bd45f4d14d8726f3b86c2830ff5939d0572c36ef9933d2e79e","target":"record","created_at":"2026-05-18T01:20:49Z","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":"6273e6d62e3687ae14bd38d7484387d05c9eb31216a021dca3d60a0806f71330","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-15T10:19:00Z","title_canon_sha256":"ea86775073cdba07c821e44dcf334102c6df255ae4683e5cfb345d0590f6e152"},"schema_version":"1.0","source":{"id":"1602.04609","kind":"arxiv","version":1}},"canonical_sha256":"32690c6ea36f3ed1eb5d35f1219c8901a665e45f92fcb2793585fd9dc8fdd958","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"32690c6ea36f3ed1eb5d35f1219c8901a665e45f92fcb2793585fd9dc8fdd958","first_computed_at":"2026-05-18T01:20:49.540013Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:49.540013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kgr0nyEFxSgZ0NPf4QVsnX2n4if6OVGkFKYfrlnM7ToSeWncfW4o7BcgfjQYcUQraCb5HmcVkVu0ZdouAvhPCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:49.540575Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.04609","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f0db8103db5a60bd45f4d14d8726f3b86c2830ff5939d0572c36ef9933d2e79e","sha256:456fa42b5c39571e0e460c0c0ecaa1cc5e9a6ba49f2109c4f6ebed9430d2f5af"],"state_sha256":"9657eb10f47e45ace99236af436201baba508a4b5be7d06f2a6520098bccd06a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+F7QTNQctmNUVN6L06Fd28RWth7Zh9KIyeRZQoggk66wrtfWz/H83cwk7MH2nU56rpavsesvX1fc4g8sjwouBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T14:26:21.180402Z","bundle_sha256":"d2927efc2a92bdf3ad8f3102ff2e0a6a16a2d8408727f4aee37ee81c1e2023ed"}}