{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:N53KYFH75TLQ5J3MISCAB3JER6","short_pith_number":"pith:N53KYFH7","schema_version":"1.0","canonical_sha256":"6f76ac14ffecd70ea76c448400ed248f897c04e10b36e0e5cf7bee5062acd838","source":{"kind":"arxiv","id":"2107.07599","version":1},"attestation_state":"computed","paper":{"title":"Partially Observable Markov Decision Processes (POMDPs) and Robotics","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Hanna Kurniawati","submitted_at":"2021-07-15T20:38:22Z","abstract_excerpt":"Planning under uncertainty is critical to robotics. The Partially Observable Markov Decision Process (POMDP) is a mathematical framework for such planning problems. It is powerful due to its careful quantification of the non-deterministic effects of actions and partial observability of the states. But precisely because of this, POMDP is notorious for its high computational complexity and deemed impractical for robotics. However, since early 2000, POMDPs solving capabilities have advanced tremendously, thanks to sampling-based approximate solvers. Although these solvers do not generate the opti"},"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":"2107.07599","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2021-07-15T20:38:22Z","cross_cats_sorted":[],"title_canon_sha256":"04a5b8dc085431374fdd5d4437b3884f1aaf5da1ea141ec2ac122fe3b1e1cc1d","abstract_canon_sha256":"916eab1464bfcfc18d52e717b434d6e432b4fa7a9da44d8aaec83bf5b0c3610f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T01:05:02.074909Z","signature_b64":"xILhUqRq68cnrZsnTHeL4WI2I0esZpystBHNIBpbIleH1x3hiei6HKeMsNWFg9IUGxs1eNGsEapbrKlBO+QpCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f76ac14ffecd70ea76c448400ed248f897c04e10b36e0e5cf7bee5062acd838","last_reissued_at":"2026-06-09T01:05:02.074430Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T01:05:02.074430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partially Observable Markov Decision Processes (POMDPs) and Robotics","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Hanna Kurniawati","submitted_at":"2021-07-15T20:38:22Z","abstract_excerpt":"Planning under uncertainty is critical to robotics. The Partially Observable Markov Decision Process (POMDP) is a mathematical framework for such planning problems. It is powerful due to its careful quantification of the non-deterministic effects of actions and partial observability of the states. But precisely because of this, POMDP is notorious for its high computational complexity and deemed impractical for robotics. However, since early 2000, POMDPs solving capabilities have advanced tremendously, thanks to sampling-based approximate solvers. Although these solvers do not generate the opti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.07599","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2107.07599/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2107.07599","created_at":"2026-06-09T01:05:02.074487+00:00"},{"alias_kind":"arxiv_version","alias_value":"2107.07599v1","created_at":"2026-06-09T01:05:02.074487+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.07599","created_at":"2026-06-09T01:05:02.074487+00:00"},{"alias_kind":"pith_short_12","alias_value":"N53KYFH75TLQ","created_at":"2026-06-09T01:05:02.074487+00:00"},{"alias_kind":"pith_short_16","alias_value":"N53KYFH75TLQ5J3M","created_at":"2026-06-09T01:05:02.074487+00:00"},{"alias_kind":"pith_short_8","alias_value":"N53KYFH7","created_at":"2026-06-09T01:05:02.074487+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2605.22189","citing_title":"Learning A Unified Risk Map for Autonomous Driving in Partially Observable Environments","ref_index":15,"is_internal_anchor":true},{"citing_arxiv_id":"2511.14427","citing_title":"Self-Supervised Multisensory Pretraining for Contact-Rich Robot Reinforcement Learning","ref_index":42,"is_internal_anchor":true},{"citing_arxiv_id":"2505.06111","citing_title":"UniVLA: Learning to Act Anywhere with Task-centric Latent Actions","ref_index":42,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N53KYFH75TLQ5J3MISCAB3JER6","json":"https://pith.science/pith/N53KYFH75TLQ5J3MISCAB3JER6.json","graph_json":"https://pith.science/api/pith-number/N53KYFH75TLQ5J3MISCAB3JER6/graph.json","events_json":"https://pith.science/api/pith-number/N53KYFH75TLQ5J3MISCAB3JER6/events.json","paper":"https://pith.science/paper/N53KYFH7"},"agent_actions":{"view_html":"https://pith.science/pith/N53KYFH75TLQ5J3MISCAB3JER6","download_json":"https://pith.science/pith/N53KYFH75TLQ5J3MISCAB3JER6.json","view_paper":"https://pith.science/paper/N53KYFH7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2107.07599&json=true","fetch_graph":"https://pith.science/api/pith-number/N53KYFH75TLQ5J3MISCAB3JER6/graph.json","fetch_events":"https://pith.science/api/pith-number/N53KYFH75TLQ5J3MISCAB3JER6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N53KYFH75TLQ5J3MISCAB3JER6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N53KYFH75TLQ5J3MISCAB3JER6/action/storage_attestation","attest_author":"https://pith.science/pith/N53KYFH75TLQ5J3MISCAB3JER6/action/author_attestation","sign_citation":"https://pith.science/pith/N53KYFH75TLQ5J3MISCAB3JER6/action/citation_signature","submit_replication":"https://pith.science/pith/N53KYFH75TLQ5J3MISCAB3JER6/action/replication_record"}},"created_at":"2026-06-09T01:05:02.074487+00:00","updated_at":"2026-06-09T01:05:02.074487+00:00"}