{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:FQVVFKNDFQROZYHWPZAJ3ZOK4K","short_pith_number":"pith:FQVVFKND","canonical_record":{"source":{"id":"1207.1412","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-04T16:23:13Z","cross_cats_sorted":[],"title_canon_sha256":"032c1194c8ba79075d48c715e556cb7a50545e2f22fb750d3b9b22ef08c01c3f","abstract_canon_sha256":"782696eb6f077927023929929e88212ad3cd7fa009643fa2cc438201e90f5614"},"schema_version":"1.0"},"canonical_sha256":"2c2b52a9a32c22ece0f67e409de5cae29f89a5d47316f3d616e691d091e56821","source":{"kind":"arxiv","id":"1207.1412","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.1412","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"arxiv_version","alias_value":"1207.1412v1","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1412","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"pith_short_12","alias_value":"FQVVFKNDFQRO","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FQVVFKNDFQROZYHW","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FQVVFKND","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:FQVVFKNDFQROZYHWPZAJ3ZOK4K","target":"record","payload":{"canonical_record":{"source":{"id":"1207.1412","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-04T16:23:13Z","cross_cats_sorted":[],"title_canon_sha256":"032c1194c8ba79075d48c715e556cb7a50545e2f22fb750d3b9b22ef08c01c3f","abstract_canon_sha256":"782696eb6f077927023929929e88212ad3cd7fa009643fa2cc438201e90f5614"},"schema_version":"1.0"},"canonical_sha256":"2c2b52a9a32c22ece0f67e409de5cae29f89a5d47316f3d616e691d091e56821","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:37.187975Z","signature_b64":"Y+gIsZqPOSToocA/V95yaQsE+pJKnC23R0fsCAQ3XIAAWlIhM41MG18gZZauziuOE4TzbJ+OCLZ2Lhy9VrWfBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c2b52a9a32c22ece0f67e409de5cae29f89a5d47316f3d616e691d091e56821","last_reissued_at":"2026-05-18T03:51:37.187487Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:37.187487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.1412","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:51:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Amp9Buzv9Dn1+ciY3U0qUQ3fY+lczp9PEbwLe37ElOeRkQRTGCv1JoABltnpxoS3IdV+FrE9aMdMBoA3mpeVAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T07:39:41.666401Z"},"content_sha256":"d951b0db5aebae90dfe5c528c843b7f37322b81404c9294f7f18e23fc2a3b6b4","schema_version":"1.0","event_id":"sha256:d951b0db5aebae90dfe5c528c843b7f37322b81404c9294f7f18e23fc2a3b6b4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:FQVVFKNDFQROZYHWPZAJ3ZOK4K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Point-Based POMDP Algorithms: Improved Analysis and Implementation","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-04T16:23:13Z","abstract_excerpt":"Existing complexity bounds for point-based POMDP value iteration algorithms focus either on the curse of dimensionality or the curse of history. We derive a new bound that relies on both and uses the concept of discounted reachability; our conclusions may help guide future algorithm design. We also discuss recent improvements to our (point-based) heuristic search value iteration algorithm. Our new implementation calculates tighter initial bounds, avoids solving linear programs, and makes more effective use of sparsity."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1412","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:51:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0lUnFSsSqYWqlXU5GQBTmKWgAPKLX1gIeVCb6RprDhu6FPIolsVCqVX5v2XnGGvENp8GeGFlLRC3kuW59zw/Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T07:39:41.667109Z"},"content_sha256":"85420fa839e76eeeccf2617e3c4719939113539590e510a87dda847f09d02f7e","schema_version":"1.0","event_id":"sha256:85420fa839e76eeeccf2617e3c4719939113539590e510a87dda847f09d02f7e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FQVVFKNDFQROZYHWPZAJ3ZOK4K/bundle.json","state_url":"https://pith.science/pith/FQVVFKNDFQROZYHWPZAJ3ZOK4K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FQVVFKNDFQROZYHWPZAJ3ZOK4K/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-05T07:39:41Z","links":{"resolver":"https://pith.science/pith/FQVVFKNDFQROZYHWPZAJ3ZOK4K","bundle":"https://pith.science/pith/FQVVFKNDFQROZYHWPZAJ3ZOK4K/bundle.json","state":"https://pith.science/pith/FQVVFKNDFQROZYHWPZAJ3ZOK4K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FQVVFKNDFQROZYHWPZAJ3ZOK4K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:FQVVFKNDFQROZYHWPZAJ3ZOK4K","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":"782696eb6f077927023929929e88212ad3cd7fa009643fa2cc438201e90f5614","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-04T16:23:13Z","title_canon_sha256":"032c1194c8ba79075d48c715e556cb7a50545e2f22fb750d3b9b22ef08c01c3f"},"schema_version":"1.0","source":{"id":"1207.1412","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.1412","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"arxiv_version","alias_value":"1207.1412v1","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1412","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"pith_short_12","alias_value":"FQVVFKNDFQRO","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FQVVFKNDFQROZYHW","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FQVVFKND","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:85420fa839e76eeeccf2617e3c4719939113539590e510a87dda847f09d02f7e","target":"graph","created_at":"2026-05-18T03:51: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":"Existing complexity bounds for point-based POMDP value iteration algorithms focus either on the curse of dimensionality or the curse of history. We derive a new bound that relies on both and uses the concept of discounted reachability; our conclusions may help guide future algorithm design. We also discuss recent improvements to our (point-based) heuristic search value iteration algorithm. Our new implementation calculates tighter initial bounds, avoids solving linear programs, and makes more effective use of sparsity.","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-04T16:23:13Z","title":"Point-Based POMDP Algorithms: Improved Analysis and Implementation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1412","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:d951b0db5aebae90dfe5c528c843b7f37322b81404c9294f7f18e23fc2a3b6b4","target":"record","created_at":"2026-05-18T03:51: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":"782696eb6f077927023929929e88212ad3cd7fa009643fa2cc438201e90f5614","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-04T16:23:13Z","title_canon_sha256":"032c1194c8ba79075d48c715e556cb7a50545e2f22fb750d3b9b22ef08c01c3f"},"schema_version":"1.0","source":{"id":"1207.1412","kind":"arxiv","version":1}},"canonical_sha256":"2c2b52a9a32c22ece0f67e409de5cae29f89a5d47316f3d616e691d091e56821","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2c2b52a9a32c22ece0f67e409de5cae29f89a5d47316f3d616e691d091e56821","first_computed_at":"2026-05-18T03:51:37.187487Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:51:37.187487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y+gIsZqPOSToocA/V95yaQsE+pJKnC23R0fsCAQ3XIAAWlIhM41MG18gZZauziuOE4TzbJ+OCLZ2Lhy9VrWfBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:51:37.187975Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.1412","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d951b0db5aebae90dfe5c528c843b7f37322b81404c9294f7f18e23fc2a3b6b4","sha256:85420fa839e76eeeccf2617e3c4719939113539590e510a87dda847f09d02f7e"],"state_sha256":"58b7ce8a499db13c74e0b504f71c4b91ef5db74cf38fe60e9e78b78defb7cfa8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0+IioLJD2dBRNE/5z8op/vXp6uucjV/dXrX84n60m42TVoY9ffiUICq69iY6cWAM1e4DMQHtSIvqt9nah5pkBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T07:39:41.672400Z","bundle_sha256":"5765b8427aabc56dc2444bc2b6b715d9b744b42d6191b9175113ce50555e9fd2"}}