{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:5IT53NRMYKZSTD3HZTQ3M2OHYN","short_pith_number":"pith:5IT53NRM","canonical_record":{"source":{"id":"1802.06215","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-02-17T08:59:56Z","cross_cats_sorted":[],"title_canon_sha256":"1715d0287d694cb4f26cb39d3361cef6e92dc7231037800e1e1e939b5f91b65b","abstract_canon_sha256":"14704cce2de69626ac735c7c6de6442e8bbb773fcfc50bdf67f2a848190bfbbd"},"schema_version":"1.0"},"canonical_sha256":"ea27ddb62cc2b3298f67cce1b669c7c36e8ea47eccbc8f42cc2de20cd65b3284","source":{"kind":"arxiv","id":"1802.06215","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06215","created_at":"2026-05-18T00:23:04Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06215v1","created_at":"2026-05-18T00:23:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06215","created_at":"2026-05-18T00:23:04Z"},{"alias_kind":"pith_short_12","alias_value":"5IT53NRMYKZS","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5IT53NRMYKZSTD3H","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5IT53NRM","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:5IT53NRMYKZSTD3HZTQ3M2OHYN","target":"record","payload":{"canonical_record":{"source":{"id":"1802.06215","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-02-17T08:59:56Z","cross_cats_sorted":[],"title_canon_sha256":"1715d0287d694cb4f26cb39d3361cef6e92dc7231037800e1e1e939b5f91b65b","abstract_canon_sha256":"14704cce2de69626ac735c7c6de6442e8bbb773fcfc50bdf67f2a848190bfbbd"},"schema_version":"1.0"},"canonical_sha256":"ea27ddb62cc2b3298f67cce1b669c7c36e8ea47eccbc8f42cc2de20cd65b3284","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:04.004699Z","signature_b64":"PBqpMaM83gxpbPSQoMeRMKJB77Sv17q0r0UQIuqfQD6Pkeh9BKUJUolN+POemhT+XgzvgdMhkmogxLd/2KOtAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea27ddb62cc2b3298f67cce1b669c7c36e8ea47eccbc8f42cc2de20cd65b3284","last_reissued_at":"2026-05-18T00:23:04.003971Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:04.003971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.06215","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-18T00:23:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QqeZg6kWS/SBrAWExOL8ZXyKkgiQC9RzB3gUulIvxApGPqND2Yac1KCFDWD8kEhDYg2boYy8PB4nWHmpEpVxAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:29:02.588904Z"},"content_sha256":"8f44b97c2550a601d0e1a952cd4d7187ff9d7b87f5d3fb88b81ae87b4540c99f","schema_version":"1.0","event_id":"sha256:8f44b97c2550a601d0e1a952cd4d7187ff9d7b87f5d3fb88b81ae87b4540c99f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:5IT53NRMYKZSTD3HZTQ3M2OHYN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"HyP-DESPOT: A Hybrid Parallel Algorithm for Online Planning under Uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"David Hsu, Panpan Cai, Wee Sun Lee, Yuanfu Luo","submitted_at":"2018-02-17T08:59:56Z","abstract_excerpt":"Planning under uncertainty is critical for robust robot performance in uncertain, dynamic environments, but it incurs high computational cost. State-of-the-art online search algorithms, such as DESPOT, have vastly improved the computational efficiency of planning under uncertainty and made it a valuable tool for robotics in practice. This work takes one step further by leveraging both CPU and GPU parallelization in order to achieve near real-time online planning performance for complex tasks with large state, action, and observation spaces. Specifically, we propose Hybrid Parallel DESPOT (HyP-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06215","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-18T00:23:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"25VvvShKBo+TsM+VTMRYfHoewU/DSSrZsu7N2zqrozTLZgwzRHquXQzkYyiyeKGXlbQ2/oIMlWj0FxUNR/RRBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:29:02.589565Z"},"content_sha256":"a52fa5777cfb76d85be53aede8328387c8c921df158c0304e6ca67ccb46c7e02","schema_version":"1.0","event_id":"sha256:a52fa5777cfb76d85be53aede8328387c8c921df158c0304e6ca67ccb46c7e02"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5IT53NRMYKZSTD3HZTQ3M2OHYN/bundle.json","state_url":"https://pith.science/pith/5IT53NRMYKZSTD3HZTQ3M2OHYN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5IT53NRMYKZSTD3HZTQ3M2OHYN/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-05-27T23:29:02Z","links":{"resolver":"https://pith.science/pith/5IT53NRMYKZSTD3HZTQ3M2OHYN","bundle":"https://pith.science/pith/5IT53NRMYKZSTD3HZTQ3M2OHYN/bundle.json","state":"https://pith.science/pith/5IT53NRMYKZSTD3HZTQ3M2OHYN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5IT53NRMYKZSTD3HZTQ3M2OHYN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5IT53NRMYKZSTD3HZTQ3M2OHYN","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":"14704cce2de69626ac735c7c6de6442e8bbb773fcfc50bdf67f2a848190bfbbd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-02-17T08:59:56Z","title_canon_sha256":"1715d0287d694cb4f26cb39d3361cef6e92dc7231037800e1e1e939b5f91b65b"},"schema_version":"1.0","source":{"id":"1802.06215","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06215","created_at":"2026-05-18T00:23:04Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06215v1","created_at":"2026-05-18T00:23:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06215","created_at":"2026-05-18T00:23:04Z"},{"alias_kind":"pith_short_12","alias_value":"5IT53NRMYKZS","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5IT53NRMYKZSTD3H","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5IT53NRM","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:a52fa5777cfb76d85be53aede8328387c8c921df158c0304e6ca67ccb46c7e02","target":"graph","created_at":"2026-05-18T00:23:04Z","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":"Planning under uncertainty is critical for robust robot performance in uncertain, dynamic environments, but it incurs high computational cost. State-of-the-art online search algorithms, such as DESPOT, have vastly improved the computational efficiency of planning under uncertainty and made it a valuable tool for robotics in practice. This work takes one step further by leveraging both CPU and GPU parallelization in order to achieve near real-time online planning performance for complex tasks with large state, action, and observation spaces. Specifically, we propose Hybrid Parallel DESPOT (HyP-","authors_text":"David Hsu, Panpan Cai, Wee Sun Lee, Yuanfu Luo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-02-17T08:59:56Z","title":"HyP-DESPOT: A Hybrid Parallel Algorithm for Online Planning under Uncertainty"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06215","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:8f44b97c2550a601d0e1a952cd4d7187ff9d7b87f5d3fb88b81ae87b4540c99f","target":"record","created_at":"2026-05-18T00:23:04Z","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":"14704cce2de69626ac735c7c6de6442e8bbb773fcfc50bdf67f2a848190bfbbd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-02-17T08:59:56Z","title_canon_sha256":"1715d0287d694cb4f26cb39d3361cef6e92dc7231037800e1e1e939b5f91b65b"},"schema_version":"1.0","source":{"id":"1802.06215","kind":"arxiv","version":1}},"canonical_sha256":"ea27ddb62cc2b3298f67cce1b669c7c36e8ea47eccbc8f42cc2de20cd65b3284","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ea27ddb62cc2b3298f67cce1b669c7c36e8ea47eccbc8f42cc2de20cd65b3284","first_computed_at":"2026-05-18T00:23:04.003971Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:04.003971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PBqpMaM83gxpbPSQoMeRMKJB77Sv17q0r0UQIuqfQD6Pkeh9BKUJUolN+POemhT+XgzvgdMhkmogxLd/2KOtAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:04.004699Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.06215","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8f44b97c2550a601d0e1a952cd4d7187ff9d7b87f5d3fb88b81ae87b4540c99f","sha256:a52fa5777cfb76d85be53aede8328387c8c921df158c0304e6ca67ccb46c7e02"],"state_sha256":"df01d299d0a1a702d1cc7e59d995b27da3d5176ed56136f5b3999b99f8d33b86"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LvWupsRhjMGpvePSRMACbelLooVv63xAZiiMN0aSom6kwWTsgVertnIQLD7aDX2fbF1vE+Wc4BzqnkCQ3qezAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T23:29:02.593040Z","bundle_sha256":"b7e30a5165098154e8f837223bc42b24924a648530f79f1bcd042a905d0a67d5"}}