{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:FQVVFKNDFQROZYHWPZAJ3ZOK4K","short_pith_number":"pith:FQVVFKND","schema_version":"1.0","canonical_sha256":"2c2b52a9a32c22ece0f67e409de5cae29f89a5d47316f3d616e691d091e56821","source":{"kind":"arxiv","id":"1207.1412","version":1},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1207.1412","created_at":"2026-05-18T03:51:37.187559+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.1412v1","created_at":"2026-05-18T03:51:37.187559+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1412","created_at":"2026-05-18T03:51:37.187559+00:00"},{"alias_kind":"pith_short_12","alias_value":"FQVVFKNDFQRO","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"FQVVFKNDFQROZYHW","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"FQVVFKND","created_at":"2026-05-18T12:27:06.952714+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FQVVFKNDFQROZYHWPZAJ3ZOK4K","json":"https://pith.science/pith/FQVVFKNDFQROZYHWPZAJ3ZOK4K.json","graph_json":"https://pith.science/api/pith-number/FQVVFKNDFQROZYHWPZAJ3ZOK4K/graph.json","events_json":"https://pith.science/api/pith-number/FQVVFKNDFQROZYHWPZAJ3ZOK4K/events.json","paper":"https://pith.science/paper/FQVVFKND"},"agent_actions":{"view_html":"https://pith.science/pith/FQVVFKNDFQROZYHWPZAJ3ZOK4K","download_json":"https://pith.science/pith/FQVVFKNDFQROZYHWPZAJ3ZOK4K.json","view_paper":"https://pith.science/paper/FQVVFKND","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.1412&json=true","fetch_graph":"https://pith.science/api/pith-number/FQVVFKNDFQROZYHWPZAJ3ZOK4K/graph.json","fetch_events":"https://pith.science/api/pith-number/FQVVFKNDFQROZYHWPZAJ3ZOK4K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FQVVFKNDFQROZYHWPZAJ3ZOK4K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FQVVFKNDFQROZYHWPZAJ3ZOK4K/action/storage_attestation","attest_author":"https://pith.science/pith/FQVVFKNDFQROZYHWPZAJ3ZOK4K/action/author_attestation","sign_citation":"https://pith.science/pith/FQVVFKNDFQROZYHWPZAJ3ZOK4K/action/citation_signature","submit_replication":"https://pith.science/pith/FQVVFKNDFQROZYHWPZAJ3ZOK4K/action/replication_record"}},"created_at":"2026-05-18T03:51:37.187559+00:00","updated_at":"2026-05-18T03:51:37.187559+00:00"}