{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:FY5AUFOWIT62I6476ZDRMNMFY5","short_pith_number":"pith:FY5AUFOW","canonical_record":{"source":{"id":"1301.6720","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-23T15:59:42Z","cross_cats_sorted":[],"title_canon_sha256":"09dfb05777513754d79ba9bb3a3a0d8f4f2ed08429d24ff66d2795dead68699e","abstract_canon_sha256":"13c937bb7e69b6154058ebd4f61fb1641f8315ceebcb7093cac6e22c6841e6e7"},"schema_version":"1.0"},"canonical_sha256":"2e3a0a15d644fda47b9ff647163585c746ba5853c10bb2deb95ac9d3d6fb3467","source":{"kind":"arxiv","id":"1301.6720","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6720","created_at":"2026-05-18T03:35:12Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6720v1","created_at":"2026-05-18T03:35:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6720","created_at":"2026-05-18T03:35:12Z"},{"alias_kind":"pith_short_12","alias_value":"FY5AUFOWIT62","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FY5AUFOWIT62I647","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FY5AUFOW","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:FY5AUFOWIT62I6476ZDRMNMFY5","target":"record","payload":{"canonical_record":{"source":{"id":"1301.6720","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-23T15:59:42Z","cross_cats_sorted":[],"title_canon_sha256":"09dfb05777513754d79ba9bb3a3a0d8f4f2ed08429d24ff66d2795dead68699e","abstract_canon_sha256":"13c937bb7e69b6154058ebd4f61fb1641f8315ceebcb7093cac6e22c6841e6e7"},"schema_version":"1.0"},"canonical_sha256":"2e3a0a15d644fda47b9ff647163585c746ba5853c10bb2deb95ac9d3d6fb3467","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:12.743549Z","signature_b64":"bFds+6gxSzLTyE0JjrLBtYQpbePMmuRRZdoC9ikWmCERZVZvLHwmZpBrtvsqSmsg5dEr47/GPBTaJ8uTYXzNDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e3a0a15d644fda47b9ff647163585c746ba5853c10bb2deb95ac9d3d6fb3467","last_reissued_at":"2026-05-18T03:35:12.742919Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:12.742919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.6720","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-18T03:35:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FUozD/Z+YfQnEnFTcmD/Hyknmna+ezszGEZg/KO67em2BY64pu3PKPs9IIQPDjayr8c9NTkgAeNTjfHvWVHRBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:58:15.706130Z"},"content_sha256":"979f15ddd64fca414887fa90afeaab326af520e15d1d533ea5b3365efa48f2a0","schema_version":"1.0","event_id":"sha256:979f15ddd64fca414887fa90afeaab326af520e15d1d533ea5b3365efa48f2a0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:FY5AUFOWIT62I6476ZDRMNMFY5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving POMDPs by Searching the Space of Finite Policies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Anthony R. Cassandra, Kee-Eung Kim, Leslie Pack Kaelbling, Nicolas Meuleau","submitted_at":"2013-01-23T15:59:42Z","abstract_excerpt":"Solving partially observable Markov decision processes (POMDPs) is highly intractable in general, at least in part because the optimal policy may be infinitely large. In this paper, we explore the problem of finding the optimal policy from a restricted set of policies, represented as finite state automata of a given size. This problem is also intractable, but we show that the complexity can be greatly reduced when the POMDP and/or policy are further constrained. We demonstrate good empirical results with a branch-and-bound method for finding globally optimal deterministic policies, and a gradi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6720","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-18T03:35:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jS3TPlCPbnhRWNrUENF/GYxWfqA29gkLKuWFbYX3F+RG9rVnQrqDeGaBXgalGGpVzNDAPuCosTp6B7S/MpHsDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:58:15.706822Z"},"content_sha256":"f119cf0410a630b993f769448f755ed040c45b3c9fa689ef760b79e723822acc","schema_version":"1.0","event_id":"sha256:f119cf0410a630b993f769448f755ed040c45b3c9fa689ef760b79e723822acc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FY5AUFOWIT62I6476ZDRMNMFY5/bundle.json","state_url":"https://pith.science/pith/FY5AUFOWIT62I6476ZDRMNMFY5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FY5AUFOWIT62I6476ZDRMNMFY5/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-27T19:58:15Z","links":{"resolver":"https://pith.science/pith/FY5AUFOWIT62I6476ZDRMNMFY5","bundle":"https://pith.science/pith/FY5AUFOWIT62I6476ZDRMNMFY5/bundle.json","state":"https://pith.science/pith/FY5AUFOWIT62I6476ZDRMNMFY5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FY5AUFOWIT62I6476ZDRMNMFY5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:FY5AUFOWIT62I6476ZDRMNMFY5","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":"13c937bb7e69b6154058ebd4f61fb1641f8315ceebcb7093cac6e22c6841e6e7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-23T15:59:42Z","title_canon_sha256":"09dfb05777513754d79ba9bb3a3a0d8f4f2ed08429d24ff66d2795dead68699e"},"schema_version":"1.0","source":{"id":"1301.6720","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6720","created_at":"2026-05-18T03:35:12Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6720v1","created_at":"2026-05-18T03:35:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6720","created_at":"2026-05-18T03:35:12Z"},{"alias_kind":"pith_short_12","alias_value":"FY5AUFOWIT62","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FY5AUFOWIT62I647","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FY5AUFOW","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:f119cf0410a630b993f769448f755ed040c45b3c9fa689ef760b79e723822acc","target":"graph","created_at":"2026-05-18T03:35:12Z","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":"Solving partially observable Markov decision processes (POMDPs) is highly intractable in general, at least in part because the optimal policy may be infinitely large. In this paper, we explore the problem of finding the optimal policy from a restricted set of policies, represented as finite state automata of a given size. This problem is also intractable, but we show that the complexity can be greatly reduced when the POMDP and/or policy are further constrained. We demonstrate good empirical results with a branch-and-bound method for finding globally optimal deterministic policies, and a gradi","authors_text":"Anthony R. Cassandra, Kee-Eung Kim, Leslie Pack Kaelbling, Nicolas Meuleau","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-23T15:59:42Z","title":"Solving POMDPs by Searching the Space of Finite Policies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6720","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:979f15ddd64fca414887fa90afeaab326af520e15d1d533ea5b3365efa48f2a0","target":"record","created_at":"2026-05-18T03:35:12Z","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":"13c937bb7e69b6154058ebd4f61fb1641f8315ceebcb7093cac6e22c6841e6e7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-23T15:59:42Z","title_canon_sha256":"09dfb05777513754d79ba9bb3a3a0d8f4f2ed08429d24ff66d2795dead68699e"},"schema_version":"1.0","source":{"id":"1301.6720","kind":"arxiv","version":1}},"canonical_sha256":"2e3a0a15d644fda47b9ff647163585c746ba5853c10bb2deb95ac9d3d6fb3467","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2e3a0a15d644fda47b9ff647163585c746ba5853c10bb2deb95ac9d3d6fb3467","first_computed_at":"2026-05-18T03:35:12.742919Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:12.742919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bFds+6gxSzLTyE0JjrLBtYQpbePMmuRRZdoC9ikWmCERZVZvLHwmZpBrtvsqSmsg5dEr47/GPBTaJ8uTYXzNDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:12.743549Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.6720","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:979f15ddd64fca414887fa90afeaab326af520e15d1d533ea5b3365efa48f2a0","sha256:f119cf0410a630b993f769448f755ed040c45b3c9fa689ef760b79e723822acc"],"state_sha256":"a2ecc495a8250d0ab3873c7fdbb914099317155c5cbfd5a96532958cf9ccffe2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1ng7vz2mepduOs206Zek/k88rC60LvZuLVYcs4DQ6EEtdUNq7cqO0SbADzP7xqyHL0l81juYJAoG5ZdzZuWAAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T19:58:15.709948Z","bundle_sha256":"8d67a03913843534445ee15ded543f0ef55f1256c5b24d4114f8433d161ddf6c"}}