{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:BMBNLDYU3B6PBHRTOG7TTKR34B","short_pith_number":"pith:BMBNLDYU","canonical_record":{"source":{"id":"1609.06757","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2016-09-21T21:13:33Z","cross_cats_sorted":["cs.SY","math.ST","stat.TH"],"title_canon_sha256":"ca46f8a5657e0609521f4018d0ef11f8e97979f99f8950ed7b55562118c0036e","abstract_canon_sha256":"d13ade389345d00d55df0049b83cd24d49152bf58196f87affdd2cad23e97035"},"schema_version":"1.0"},"canonical_sha256":"0b02d58f14d87cf09e3371bf39aa3be064e468fabf890d763a8221ccf2e0b650","source":{"kind":"arxiv","id":"1609.06757","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.06757","created_at":"2026-05-18T00:49:42Z"},{"alias_kind":"arxiv_version","alias_value":"1609.06757v2","created_at":"2026-05-18T00:49:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.06757","created_at":"2026-05-18T00:49:42Z"},{"alias_kind":"pith_short_12","alias_value":"BMBNLDYU3B6P","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BMBNLDYU3B6PBHRT","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BMBNLDYU","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:BMBNLDYU3B6PBHRTOG7TTKR34B","target":"record","payload":{"canonical_record":{"source":{"id":"1609.06757","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2016-09-21T21:13:33Z","cross_cats_sorted":["cs.SY","math.ST","stat.TH"],"title_canon_sha256":"ca46f8a5657e0609521f4018d0ef11f8e97979f99f8950ed7b55562118c0036e","abstract_canon_sha256":"d13ade389345d00d55df0049b83cd24d49152bf58196f87affdd2cad23e97035"},"schema_version":"1.0"},"canonical_sha256":"0b02d58f14d87cf09e3371bf39aa3be064e468fabf890d763a8221ccf2e0b650","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:42.113352Z","signature_b64":"UrzOM7UUmZpP9ITOTQbyJzC0O8SrgJyYO8M3KFJpDDJLX2+V02ybBUK2uh+Qb6bmZiAEUuhL1DpQTGnVYB/sCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b02d58f14d87cf09e3371bf39aa3be064e468fabf890d763a8221ccf2e0b650","last_reissued_at":"2026-05-18T00:49:42.112855Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:42.112855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.06757","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-18T00:49:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YQ5ZL0T+/67f5qRjxcVhHX6Sd7AnBy22rNnDTouROqY5/A0Yl3/yKpUcX0S4mx1ym4RelbjQfCi7vUOcwsuSAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T13:31:10.017218Z"},"content_sha256":"917a12b6963e75091da57338af5825e4ee83395554333f78cc50b8963a473cf3","schema_version":"1.0","event_id":"sha256:917a12b6963e75091da57338af5825e4ee83395554333f78cc50b8963a473cf3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:BMBNLDYU3B6PBHRTOG7TTKR34B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quickest Change Detection Approach to Optimal Control in Markov Decision Processes with Model Changes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.ST","stat.TH"],"primary_cat":"stat.AP","authors_text":"Jonathan P. How, Miao Liu, Taposh Banerjee","submitted_at":"2016-09-21T21:13:33Z","abstract_excerpt":"Optimal control in non-stationary Markov decision processes (MDP) is a challenging problem. The aim in such a control problem is to maximize the long-term discounted reward when the transition dynamics or the reward function can change over time. When a prior knowledge of change statistics is available, the standard Bayesian approach to this problem is to reformulate it as a partially observable MDP (POMDP) and solve it using approximate POMDP solvers, which are typically computationally demanding. In this paper, the problem is analyzed through the viewpoint of quickest change detection (QCD),"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.06757","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-18T00:49:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uAUvgiGJpihqdEW/QlTjvn4SGfkXamr2/RSfPjZTTZv054xvuR8/pVQ/DsDa4lfk6yzCx1gsv3NaeQl5Qe/dCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T13:31:10.017572Z"},"content_sha256":"9eed05ff72766c0409c6f90b8787f04472620edab54ec4a6da30a267ecf8fd67","schema_version":"1.0","event_id":"sha256:9eed05ff72766c0409c6f90b8787f04472620edab54ec4a6da30a267ecf8fd67"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BMBNLDYU3B6PBHRTOG7TTKR34B/bundle.json","state_url":"https://pith.science/pith/BMBNLDYU3B6PBHRTOG7TTKR34B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BMBNLDYU3B6PBHRTOG7TTKR34B/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-07-07T13:31:10Z","links":{"resolver":"https://pith.science/pith/BMBNLDYU3B6PBHRTOG7TTKR34B","bundle":"https://pith.science/pith/BMBNLDYU3B6PBHRTOG7TTKR34B/bundle.json","state":"https://pith.science/pith/BMBNLDYU3B6PBHRTOG7TTKR34B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BMBNLDYU3B6PBHRTOG7TTKR34B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BMBNLDYU3B6PBHRTOG7TTKR34B","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":"d13ade389345d00d55df0049b83cd24d49152bf58196f87affdd2cad23e97035","cross_cats_sorted":["cs.SY","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2016-09-21T21:13:33Z","title_canon_sha256":"ca46f8a5657e0609521f4018d0ef11f8e97979f99f8950ed7b55562118c0036e"},"schema_version":"1.0","source":{"id":"1609.06757","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.06757","created_at":"2026-05-18T00:49:42Z"},{"alias_kind":"arxiv_version","alias_value":"1609.06757v2","created_at":"2026-05-18T00:49:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.06757","created_at":"2026-05-18T00:49:42Z"},{"alias_kind":"pith_short_12","alias_value":"BMBNLDYU3B6P","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BMBNLDYU3B6PBHRT","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BMBNLDYU","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:9eed05ff72766c0409c6f90b8787f04472620edab54ec4a6da30a267ecf8fd67","target":"graph","created_at":"2026-05-18T00:49:42Z","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":"Optimal control in non-stationary Markov decision processes (MDP) is a challenging problem. The aim in such a control problem is to maximize the long-term discounted reward when the transition dynamics or the reward function can change over time. When a prior knowledge of change statistics is available, the standard Bayesian approach to this problem is to reformulate it as a partially observable MDP (POMDP) and solve it using approximate POMDP solvers, which are typically computationally demanding. In this paper, the problem is analyzed through the viewpoint of quickest change detection (QCD),","authors_text":"Jonathan P. How, Miao Liu, Taposh Banerjee","cross_cats":["cs.SY","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2016-09-21T21:13:33Z","title":"Quickest Change Detection Approach to Optimal Control in Markov Decision Processes with Model Changes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.06757","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:917a12b6963e75091da57338af5825e4ee83395554333f78cc50b8963a473cf3","target":"record","created_at":"2026-05-18T00:49:42Z","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":"d13ade389345d00d55df0049b83cd24d49152bf58196f87affdd2cad23e97035","cross_cats_sorted":["cs.SY","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2016-09-21T21:13:33Z","title_canon_sha256":"ca46f8a5657e0609521f4018d0ef11f8e97979f99f8950ed7b55562118c0036e"},"schema_version":"1.0","source":{"id":"1609.06757","kind":"arxiv","version":2}},"canonical_sha256":"0b02d58f14d87cf09e3371bf39aa3be064e468fabf890d763a8221ccf2e0b650","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b02d58f14d87cf09e3371bf39aa3be064e468fabf890d763a8221ccf2e0b650","first_computed_at":"2026-05-18T00:49:42.112855Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:42.112855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UrzOM7UUmZpP9ITOTQbyJzC0O8SrgJyYO8M3KFJpDDJLX2+V02ybBUK2uh+Qb6bmZiAEUuhL1DpQTGnVYB/sCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:42.113352Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.06757","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:917a12b6963e75091da57338af5825e4ee83395554333f78cc50b8963a473cf3","sha256:9eed05ff72766c0409c6f90b8787f04472620edab54ec4a6da30a267ecf8fd67"],"state_sha256":"7254f2ce49dc3304592d33cbf89cdea523aee19f3a49df4082db7da702b650f4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ImcJvEOP/vo+Hn3E1gu89lUxkn3ZNWV1InL5MAooyTrcRLeidDdMJSnXiNsOHtBYe25jFQNsx3rQ3j1zSTVfAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T13:31:10.019440Z","bundle_sha256":"c56f304220c3674eaf2485fb782740c2a353e2fd69818e31a5ee07018f7094e7"}}