{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:TH5FOXBFQ6CXRLWFC67KCRRQC6","short_pith_number":"pith:TH5FOXBF","canonical_record":{"source":{"id":"1411.3880","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-11-14T12:13:45Z","cross_cats_sorted":[],"title_canon_sha256":"fe972f69c5dbe93ad6dc50aa6503037eccc8c82c099c187c550ba1fc58245384","abstract_canon_sha256":"7cf53cc2c2b5aa185204f185e95f5819c31857472bac7b642422538ba88cd4bc"},"schema_version":"1.0"},"canonical_sha256":"99fa575c25878578aec517bea1463017abe108d427a8159aa32d58e69cbace2f","source":{"kind":"arxiv","id":"1411.3880","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.3880","created_at":"2026-05-18T02:37:37Z"},{"alias_kind":"arxiv_version","alias_value":"1411.3880v1","created_at":"2026-05-18T02:37:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.3880","created_at":"2026-05-18T02:37:37Z"},{"alias_kind":"pith_short_12","alias_value":"TH5FOXBFQ6CX","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TH5FOXBFQ6CXRLWF","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TH5FOXBF","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:TH5FOXBFQ6CXRLWFC67KCRRQC6","target":"record","payload":{"canonical_record":{"source":{"id":"1411.3880","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-11-14T12:13:45Z","cross_cats_sorted":[],"title_canon_sha256":"fe972f69c5dbe93ad6dc50aa6503037eccc8c82c099c187c550ba1fc58245384","abstract_canon_sha256":"7cf53cc2c2b5aa185204f185e95f5819c31857472bac7b642422538ba88cd4bc"},"schema_version":"1.0"},"canonical_sha256":"99fa575c25878578aec517bea1463017abe108d427a8159aa32d58e69cbace2f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:37:37.457485Z","signature_b64":"QqaztQJzeR7Ecf0WL7RzdRc5h4ziJDk//Ilu/EQAZKaHNFDVA0dHFOs3bqF68g4Ya33KGMWJhddwwx2Th7SwBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99fa575c25878578aec517bea1463017abe108d427a8159aa32d58e69cbace2f","last_reissued_at":"2026-05-18T02:37:37.457054Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:37:37.457054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.3880","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-18T02:37:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ARrTbkdSdgoZvs1RAyd3rpmXspawiXeZDX7DnC1ZuzWo8He+H2IrPEP+GbBZQNlYn9/E4UFX1qm3JnggDu3ICQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:52:51.389834Z"},"content_sha256":"7845a4267438dad1b581680f80f76b2d38337ffa2e9d4b27bbb2ee5fcc38c1e8","schema_version":"1.0","event_id":"sha256:7845a4267438dad1b581680f80f76b2d38337ffa2e9d4b27bbb2ee5fcc38c1e8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:TH5FOXBFQ6CXRLWFC67KCRRQC6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Cost Almost-sure Reachability in POMDPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Ayush Kanodia, Krishnendu Chatterjee, Martin Chmel\\'ik, Raghav Gupta","submitted_at":"2014-11-14T12:13:45Z","abstract_excerpt":"We consider partially observable Markov decision processes (POMDPs) with a set of target states and every transition is associated with an integer cost. The optimization objective we study asks to minimize the expected total cost till the target set is reached, while ensuring that the target set is reached almost-surely (with probability 1). We show that for integer costs approximating the optimal cost is undecidable. For positive costs, our results are as follows: (i) we establish matching lower and upper bounds for the optimal cost and the bound is double exponential; (ii) we show that the p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.3880","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-18T02:37:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rUC95jjuA7IO/OVFUlHUQVUNSJhEvmkBMLzD/wAuyZQhWRjHNjfugLxnuHArZVQRkfe4HIBD5yJiA7jU1YHlBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:52:51.390483Z"},"content_sha256":"f3e4ae34032139f02272b5501d6f90d7b9f29dcc5a4a33172f4694bee05993ce","schema_version":"1.0","event_id":"sha256:f3e4ae34032139f02272b5501d6f90d7b9f29dcc5a4a33172f4694bee05993ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TH5FOXBFQ6CXRLWFC67KCRRQC6/bundle.json","state_url":"https://pith.science/pith/TH5FOXBFQ6CXRLWFC67KCRRQC6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TH5FOXBFQ6CXRLWFC67KCRRQC6/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-05-25T22:52:51Z","links":{"resolver":"https://pith.science/pith/TH5FOXBFQ6CXRLWFC67KCRRQC6","bundle":"https://pith.science/pith/TH5FOXBFQ6CXRLWFC67KCRRQC6/bundle.json","state":"https://pith.science/pith/TH5FOXBFQ6CXRLWFC67KCRRQC6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TH5FOXBFQ6CXRLWFC67KCRRQC6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:TH5FOXBFQ6CXRLWFC67KCRRQC6","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":"7cf53cc2c2b5aa185204f185e95f5819c31857472bac7b642422538ba88cd4bc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-11-14T12:13:45Z","title_canon_sha256":"fe972f69c5dbe93ad6dc50aa6503037eccc8c82c099c187c550ba1fc58245384"},"schema_version":"1.0","source":{"id":"1411.3880","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.3880","created_at":"2026-05-18T02:37:37Z"},{"alias_kind":"arxiv_version","alias_value":"1411.3880v1","created_at":"2026-05-18T02:37:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.3880","created_at":"2026-05-18T02:37:37Z"},{"alias_kind":"pith_short_12","alias_value":"TH5FOXBFQ6CX","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TH5FOXBFQ6CXRLWF","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TH5FOXBF","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:f3e4ae34032139f02272b5501d6f90d7b9f29dcc5a4a33172f4694bee05993ce","target":"graph","created_at":"2026-05-18T02:37:37Z","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 consider partially observable Markov decision processes (POMDPs) with a set of target states and every transition is associated with an integer cost. The optimization objective we study asks to minimize the expected total cost till the target set is reached, while ensuring that the target set is reached almost-surely (with probability 1). We show that for integer costs approximating the optimal cost is undecidable. For positive costs, our results are as follows: (i) we establish matching lower and upper bounds for the optimal cost and the bound is double exponential; (ii) we show that the p","authors_text":"Ayush Kanodia, Krishnendu Chatterjee, Martin Chmel\\'ik, Raghav Gupta","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-11-14T12:13:45Z","title":"Optimal Cost Almost-sure Reachability in POMDPs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.3880","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:7845a4267438dad1b581680f80f76b2d38337ffa2e9d4b27bbb2ee5fcc38c1e8","target":"record","created_at":"2026-05-18T02:37:37Z","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":"7cf53cc2c2b5aa185204f185e95f5819c31857472bac7b642422538ba88cd4bc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-11-14T12:13:45Z","title_canon_sha256":"fe972f69c5dbe93ad6dc50aa6503037eccc8c82c099c187c550ba1fc58245384"},"schema_version":"1.0","source":{"id":"1411.3880","kind":"arxiv","version":1}},"canonical_sha256":"99fa575c25878578aec517bea1463017abe108d427a8159aa32d58e69cbace2f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"99fa575c25878578aec517bea1463017abe108d427a8159aa32d58e69cbace2f","first_computed_at":"2026-05-18T02:37:37.457054Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:37:37.457054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QqaztQJzeR7Ecf0WL7RzdRc5h4ziJDk//Ilu/EQAZKaHNFDVA0dHFOs3bqF68g4Ya33KGMWJhddwwx2Th7SwBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:37:37.457485Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.3880","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7845a4267438dad1b581680f80f76b2d38337ffa2e9d4b27bbb2ee5fcc38c1e8","sha256:f3e4ae34032139f02272b5501d6f90d7b9f29dcc5a4a33172f4694bee05993ce"],"state_sha256":"dbf688db764e7852a45533f35dfaa27cbb9929215e7e7692e8513aa6c3c33e35"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lOoMpp2TayELwoivkGMZpp8UrbTbjyCT1DcN/8E4Aj2hQnxMBY2n1ZX6NnR3bIyY8M7ttaprYqUNJm8DBVazBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:52:51.393771Z","bundle_sha256":"5b2a80c4fd6aa56195f153bb5c75bcd4b099f55919f0aa1c2d8c787ceef9fb72"}}