{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:ASDZV3ML4DUU6VFE3QVFU6SFW4","short_pith_number":"pith:ASDZV3ML","canonical_record":{"source":{"id":"1207.4166","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-11T15:04:47Z","cross_cats_sorted":[],"title_canon_sha256":"3aaccc0cf623a82d012bbd3a89c5146d6e4e497046f6c715d078a8938fa5539d","abstract_canon_sha256":"61ea628813801c89fe4a028172b74471034c22c074d46a36fb05c7e2cd864903"},"schema_version":"1.0"},"canonical_sha256":"04879aed8be0e94f54a4dc2a5a7a45b721af63533533417f0c792490607613f3","source":{"kind":"arxiv","id":"1207.4166","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.4166","created_at":"2026-05-18T03:50:47Z"},{"alias_kind":"arxiv_version","alias_value":"1207.4166v1","created_at":"2026-05-18T03:50:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4166","created_at":"2026-05-18T03:50:47Z"},{"alias_kind":"pith_short_12","alias_value":"ASDZV3ML4DUU","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"ASDZV3ML4DUU6VFE","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"ASDZV3ML","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:ASDZV3ML4DUU6VFE3QVFU6SFW4","target":"record","payload":{"canonical_record":{"source":{"id":"1207.4166","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-11T15:04:47Z","cross_cats_sorted":[],"title_canon_sha256":"3aaccc0cf623a82d012bbd3a89c5146d6e4e497046f6c715d078a8938fa5539d","abstract_canon_sha256":"61ea628813801c89fe4a028172b74471034c22c074d46a36fb05c7e2cd864903"},"schema_version":"1.0"},"canonical_sha256":"04879aed8be0e94f54a4dc2a5a7a45b721af63533533417f0c792490607613f3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:47.497978Z","signature_b64":"Rw4cfO5PwnKJUo3SSyZIskz/OmuHQ0FOzB+EIo+Ad10IPdVGqkVMzr/4hks66mZNZiynMqAMzZf28Bx8F65bBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04879aed8be0e94f54a4dc2a5a7a45b721af63533533417f0c792490607613f3","last_reissued_at":"2026-05-18T03:50:47.497290Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:47.497290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.4166","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:50:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mb5HWYTYjDU0kZfPiJWRM7wy+mVj15upyVDP9t5vJg60XcjZPuEygBzVHjAiNFwllxs59mlJPr1i7W/k8AW9BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:19:53.748393Z"},"content_sha256":"d171febebe160f770163654e1f913e214950cb36c256210b5a5c19ecec224986","schema_version":"1.0","event_id":"sha256:d171febebe160f770163654e1f913e214950cb36c256210b5a5c19ecec224986"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:ASDZV3ML4DUU6VFE3QVFU6SFW4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Heuristic Search Value Iteration for POMDPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Reid Simmons, Trey Smith","submitted_at":"2012-07-11T15:04:47Z","abstract_excerpt":"We present a novel POMDP planning algorithm called heuristic search value iteration (HSVI).HSVI is an anytime algorithm that returns a policy and a provable bound on its regret with respect to the optimal policy. HSVI gets its power by combining two well-known techniques: attention-focusing search heuristics and piecewise linear convex representations of the value function. HSVI's soundness and convergence have been proven. On some benchmark problems from the literature, HSVI displays speedups of greater than 100 with respect to other state-of-the-art POMDP value iteration algorithms. We also "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4166","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:50:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iXE5MSiFfztWADDs0zew6omZpZTpgWZneT/f/EvJwVy+rOV6yq7+DxamDKEtvbnCDWc9rFi6x0CLGqCJrabTCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:19:53.748787Z"},"content_sha256":"dce2b7184709150eb740fafc71d902cdcf28e164c90a9203d68fa95c5936db2b","schema_version":"1.0","event_id":"sha256:dce2b7184709150eb740fafc71d902cdcf28e164c90a9203d68fa95c5936db2b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ASDZV3ML4DUU6VFE3QVFU6SFW4/bundle.json","state_url":"https://pith.science/pith/ASDZV3ML4DUU6VFE3QVFU6SFW4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ASDZV3ML4DUU6VFE3QVFU6SFW4/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-05T01:19:53Z","links":{"resolver":"https://pith.science/pith/ASDZV3ML4DUU6VFE3QVFU6SFW4","bundle":"https://pith.science/pith/ASDZV3ML4DUU6VFE3QVFU6SFW4/bundle.json","state":"https://pith.science/pith/ASDZV3ML4DUU6VFE3QVFU6SFW4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ASDZV3ML4DUU6VFE3QVFU6SFW4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ASDZV3ML4DUU6VFE3QVFU6SFW4","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":"61ea628813801c89fe4a028172b74471034c22c074d46a36fb05c7e2cd864903","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-11T15:04:47Z","title_canon_sha256":"3aaccc0cf623a82d012bbd3a89c5146d6e4e497046f6c715d078a8938fa5539d"},"schema_version":"1.0","source":{"id":"1207.4166","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.4166","created_at":"2026-05-18T03:50:47Z"},{"alias_kind":"arxiv_version","alias_value":"1207.4166v1","created_at":"2026-05-18T03:50:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4166","created_at":"2026-05-18T03:50:47Z"},{"alias_kind":"pith_short_12","alias_value":"ASDZV3ML4DUU","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"ASDZV3ML4DUU6VFE","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"ASDZV3ML","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:dce2b7184709150eb740fafc71d902cdcf28e164c90a9203d68fa95c5936db2b","target":"graph","created_at":"2026-05-18T03:50:47Z","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 present a novel POMDP planning algorithm called heuristic search value iteration (HSVI).HSVI is an anytime algorithm that returns a policy and a provable bound on its regret with respect to the optimal policy. HSVI gets its power by combining two well-known techniques: attention-focusing search heuristics and piecewise linear convex representations of the value function. HSVI's soundness and convergence have been proven. On some benchmark problems from the literature, HSVI displays speedups of greater than 100 with respect to other state-of-the-art POMDP value iteration algorithms. We also ","authors_text":"Reid Simmons, Trey Smith","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-11T15:04:47Z","title":"Heuristic Search Value Iteration for POMDPs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4166","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:d171febebe160f770163654e1f913e214950cb36c256210b5a5c19ecec224986","target":"record","created_at":"2026-05-18T03:50:47Z","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":"61ea628813801c89fe4a028172b74471034c22c074d46a36fb05c7e2cd864903","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-11T15:04:47Z","title_canon_sha256":"3aaccc0cf623a82d012bbd3a89c5146d6e4e497046f6c715d078a8938fa5539d"},"schema_version":"1.0","source":{"id":"1207.4166","kind":"arxiv","version":1}},"canonical_sha256":"04879aed8be0e94f54a4dc2a5a7a45b721af63533533417f0c792490607613f3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"04879aed8be0e94f54a4dc2a5a7a45b721af63533533417f0c792490607613f3","first_computed_at":"2026-05-18T03:50:47.497290Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:50:47.497290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Rw4cfO5PwnKJUo3SSyZIskz/OmuHQ0FOzB+EIo+Ad10IPdVGqkVMzr/4hks66mZNZiynMqAMzZf28Bx8F65bBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:50:47.497978Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.4166","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d171febebe160f770163654e1f913e214950cb36c256210b5a5c19ecec224986","sha256:dce2b7184709150eb740fafc71d902cdcf28e164c90a9203d68fa95c5936db2b"],"state_sha256":"beb174ec250f3115f9a82652a9b8596a6aa222149b61019fcb690e80fd1ac2bb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZQZfVH1ub7EwTO9wuFSOYmtZq8jV903waix1NVsPWIFNQ5bqJ6yG+Vu8H+gtvp14/V4Oitv2eGHgj0dDn0jHBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T01:19:53.751509Z","bundle_sha256":"8735b9528beedb2a7fb49320bffc3b844becbc069ea82b5cfb752ef3b8ce5287"}}