{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:OIWBC3ZTHXLVUOC6377XZSM77D","short_pith_number":"pith:OIWBC3ZT","canonical_record":{"source":{"id":"1106.0234","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-06-01T16:24:43Z","cross_cats_sorted":[],"title_canon_sha256":"dfbe6cd42cce4a71188e84674ff21a69e440eb95480ba7359d1391df433ff392","abstract_canon_sha256":"6671410b269f48960df25f6a688086e5ec2d7f71bf64c77acff04972428c5e88"},"schema_version":"1.0"},"canonical_sha256":"722c116f333dd75a385edfff7cc99ff8ccb1904771bd9c70f4bc2487ce426c85","source":{"kind":"arxiv","id":"1106.0234","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.0234","created_at":"2026-05-18T04:20:51Z"},{"alias_kind":"arxiv_version","alias_value":"1106.0234v1","created_at":"2026-05-18T04:20:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.0234","created_at":"2026-05-18T04:20:51Z"},{"alias_kind":"pith_short_12","alias_value":"OIWBC3ZTHXLV","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"OIWBC3ZTHXLVUOC6","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"OIWBC3ZT","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:OIWBC3ZTHXLVUOC6377XZSM77D","target":"record","payload":{"canonical_record":{"source":{"id":"1106.0234","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-06-01T16:24:43Z","cross_cats_sorted":[],"title_canon_sha256":"dfbe6cd42cce4a71188e84674ff21a69e440eb95480ba7359d1391df433ff392","abstract_canon_sha256":"6671410b269f48960df25f6a688086e5ec2d7f71bf64c77acff04972428c5e88"},"schema_version":"1.0"},"canonical_sha256":"722c116f333dd75a385edfff7cc99ff8ccb1904771bd9c70f4bc2487ce426c85","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:51.837777Z","signature_b64":"FCiy3br7oCqIsHUC//tlS8WWKyZ+a0iVWMovGjyDvUjmzSML0Oe6PecGDopi2MpTvwsQi7eDBeTjROUF5PgfBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"722c116f333dd75a385edfff7cc99ff8ccb1904771bd9c70f4bc2487ce426c85","last_reissued_at":"2026-05-18T04:20:51.837174Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:51.837174Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.0234","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-18T04:20:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CSAcT2cQQU4fMP74rDa4cJK0FOEFYUwp1uFP2v82XE8Q/x2Wi1nqNRQYPZVu7GGpiJiGQJMvDGqdQGbvIv56Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T21:20:18.050498Z"},"content_sha256":"80091b93fdd997ad8ebe59f613a1d90b5ec1f05e6f6562541e34a95309180423","schema_version":"1.0","event_id":"sha256:80091b93fdd997ad8ebe59f613a1d90b5ec1f05e6f6562541e34a95309180423"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:OIWBC3ZTHXLVUOC6377XZSM77D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Value-Function Approximations for Partially Observable Markov Decision Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"M. Hauskrecht","submitted_at":"2011-06-01T16:24:43Z","abstract_excerpt":"Partially observable Markov decision processes (POMDPs)    provide an elegant mathematical framework for modeling complex    decision and planning problems in stochastic domains in which states    of the system are observable only indirectly, via a set of imperfect    or noisy observations. The modeling advantage of POMDPs, however,    comes at a price -- exact methods for solving them are computationally    very expensive and thus applicable in practice only to very simple    problems. We focus on efficient approximation (heuristic) methods that    attempt to alleviate the computational probl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.0234","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-18T04:20:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/EGxbdsUyVj3EU3zGxfVgCvWYp/c/Dyfi6yCn2Yt4+/yyuQU7nAkcBCA1aDFW1x0nSPOExwdvG69cuoFFyzNDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T21:20:18.050844Z"},"content_sha256":"cef4c617d405b435df2896398f6987b103bcf06c16b18d570a84f6a37330488f","schema_version":"1.0","event_id":"sha256:cef4c617d405b435df2896398f6987b103bcf06c16b18d570a84f6a37330488f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OIWBC3ZTHXLVUOC6377XZSM77D/bundle.json","state_url":"https://pith.science/pith/OIWBC3ZTHXLVUOC6377XZSM77D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OIWBC3ZTHXLVUOC6377XZSM77D/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-10T21:20:18Z","links":{"resolver":"https://pith.science/pith/OIWBC3ZTHXLVUOC6377XZSM77D","bundle":"https://pith.science/pith/OIWBC3ZTHXLVUOC6377XZSM77D/bundle.json","state":"https://pith.science/pith/OIWBC3ZTHXLVUOC6377XZSM77D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OIWBC3ZTHXLVUOC6377XZSM77D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:OIWBC3ZTHXLVUOC6377XZSM77D","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":"6671410b269f48960df25f6a688086e5ec2d7f71bf64c77acff04972428c5e88","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-06-01T16:24:43Z","title_canon_sha256":"dfbe6cd42cce4a71188e84674ff21a69e440eb95480ba7359d1391df433ff392"},"schema_version":"1.0","source":{"id":"1106.0234","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.0234","created_at":"2026-05-18T04:20:51Z"},{"alias_kind":"arxiv_version","alias_value":"1106.0234v1","created_at":"2026-05-18T04:20:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.0234","created_at":"2026-05-18T04:20:51Z"},{"alias_kind":"pith_short_12","alias_value":"OIWBC3ZTHXLV","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"OIWBC3ZTHXLVUOC6","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"OIWBC3ZT","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:cef4c617d405b435df2896398f6987b103bcf06c16b18d570a84f6a37330488f","target":"graph","created_at":"2026-05-18T04:20:51Z","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":"Partially observable Markov decision processes (POMDPs)    provide an elegant mathematical framework for modeling complex    decision and planning problems in stochastic domains in which states    of the system are observable only indirectly, via a set of imperfect    or noisy observations. The modeling advantage of POMDPs, however,    comes at a price -- exact methods for solving them are computationally    very expensive and thus applicable in practice only to very simple    problems. We focus on efficient approximation (heuristic) methods that    attempt to alleviate the computational probl","authors_text":"M. Hauskrecht","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-06-01T16:24:43Z","title":"Value-Function Approximations for Partially Observable Markov Decision Processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.0234","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:80091b93fdd997ad8ebe59f613a1d90b5ec1f05e6f6562541e34a95309180423","target":"record","created_at":"2026-05-18T04:20:51Z","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":"6671410b269f48960df25f6a688086e5ec2d7f71bf64c77acff04972428c5e88","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-06-01T16:24:43Z","title_canon_sha256":"dfbe6cd42cce4a71188e84674ff21a69e440eb95480ba7359d1391df433ff392"},"schema_version":"1.0","source":{"id":"1106.0234","kind":"arxiv","version":1}},"canonical_sha256":"722c116f333dd75a385edfff7cc99ff8ccb1904771bd9c70f4bc2487ce426c85","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"722c116f333dd75a385edfff7cc99ff8ccb1904771bd9c70f4bc2487ce426c85","first_computed_at":"2026-05-18T04:20:51.837174Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:20:51.837174Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FCiy3br7oCqIsHUC//tlS8WWKyZ+a0iVWMovGjyDvUjmzSML0Oe6PecGDopi2MpTvwsQi7eDBeTjROUF5PgfBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:20:51.837777Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.0234","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80091b93fdd997ad8ebe59f613a1d90b5ec1f05e6f6562541e34a95309180423","sha256:cef4c617d405b435df2896398f6987b103bcf06c16b18d570a84f6a37330488f"],"state_sha256":"36bcde4e2937abdde143e91ea5dbddc7faa45b696f9228db700076651b4a3e5b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WFhxJhLAQkYo2ot+4hRf43x/JaQFcIWaWK1tvnh/XxDe2NqV/iboL7oynitrifhzzpHarxqtpGq0vdJ5VHvvCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T21:20:18.052734Z","bundle_sha256":"4d9a07368f091ac7e5b2f16d8b5382cc8049f5c3370499de6c082bbc23ea055c"}}