{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:JIW5GZBQG5TUXHIWKA7A4RDU7B","short_pith_number":"pith:JIW5GZBQ","canonical_record":{"source":{"id":"2506.00285","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2025-05-30T22:26:26Z","cross_cats_sorted":[],"title_canon_sha256":"926ad2f9f675e8d542b52b65d097e179df2a62e4af6ff0d47f5ef467b4b0b2a0","abstract_canon_sha256":"74a973ba6163f179c57ef12feccfa12301d361bcfdadc9f8ce2dc999e7742aa9"},"schema_version":"1.0"},"canonical_sha256":"4a2dd3643037674b9d16503e0e4474f84cd25bc1e6ade5c29ee4c6b9696af3d3","source":{"kind":"arxiv","id":"2506.00285","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.00285","created_at":"2026-07-05T11:13:32Z"},{"alias_kind":"arxiv_version","alias_value":"2506.00285v1","created_at":"2026-07-05T11:13:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.00285","created_at":"2026-07-05T11:13:32Z"},{"alias_kind":"pith_short_12","alias_value":"JIW5GZBQG5TU","created_at":"2026-07-05T11:13:32Z"},{"alias_kind":"pith_short_16","alias_value":"JIW5GZBQG5TUXHIW","created_at":"2026-07-05T11:13:32Z"},{"alias_kind":"pith_short_8","alias_value":"JIW5GZBQ","created_at":"2026-07-05T11:13:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:JIW5GZBQG5TUXHIWKA7A4RDU7B","target":"record","payload":{"canonical_record":{"source":{"id":"2506.00285","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2025-05-30T22:26:26Z","cross_cats_sorted":[],"title_canon_sha256":"926ad2f9f675e8d542b52b65d097e179df2a62e4af6ff0d47f5ef467b4b0b2a0","abstract_canon_sha256":"74a973ba6163f179c57ef12feccfa12301d361bcfdadc9f8ce2dc999e7742aa9"},"schema_version":"1.0"},"canonical_sha256":"4a2dd3643037674b9d16503e0e4474f84cd25bc1e6ade5c29ee4c6b9696af3d3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:13:32.096120Z","signature_b64":"GNLn/fToCuKDAbj4cGygCcCGXwPXQ6M8GKLX+/apX4zBbRAlDix2Vhs3Jy3O03MALT5OpOW8zznDUgha9mbBDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a2dd3643037674b9d16503e0e4474f84cd25bc1e6ade5c29ee4c6b9696af3d3","last_reissued_at":"2026-07-05T11:13:32.095684Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:13:32.095684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.00285","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-07-05T11:13:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e364ah4COzkp2O03poGcI6asQNOYri3R+3I9LXm4hX+xcNCt1QoTL9g/l1fzhnN/m8hUUN/1naZCZjVPvuXAAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T21:10:46.693231Z"},"content_sha256":"cdca83a7f489b7300e2c0fcbc94b0888e2311fc261fef895187ab7f65a12a855","schema_version":"1.0","event_id":"sha256:cdca83a7f489b7300e2c0fcbc94b0888e2311fc261fef895187ab7f65a12a855"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:JIW5GZBQG5TUXHIWKA7A4RDU7B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lazy Heuristic Search for Solving POMDPs with Expensive-to-Compute Belief Transitions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Maxim Likhachev, Muhammad Suhail Saleem, Rishi Veerapaneni","submitted_at":"2025-05-30T22:26:26Z","abstract_excerpt":"Heuristic search solvers like RTDP-Bel and LAO* have proven effective for computing optimal and bounded sub-optimal solutions for Partially Observable Markov Decision Processes (POMDPs), which are typically formulated as belief MDPs. A belief represents a probability distribution over possible system states. Given a parent belief and an action, computing belief state transitions involves Bayesian updates that combine the transition and observation models of the POMDP to determine successor beliefs and their transition probabilities. However, there is a class of problems, specifically in roboti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.00285","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/2506.00285/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"},"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-07-05T11:13:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4g3njOicSrkO8+7sG0qZT1udsKUif4vt0UD7WaR+tkj+iyPIqYEBjNuzItMvILtfkV3jlastrjdS/2K41RE0CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T21:10:46.693633Z"},"content_sha256":"f36fd8c6aeadb6514edd7a94d29a7ec9f23c3183ff3d353d265a9b802b44be17","schema_version":"1.0","event_id":"sha256:f36fd8c6aeadb6514edd7a94d29a7ec9f23c3183ff3d353d265a9b802b44be17"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JIW5GZBQG5TUXHIWKA7A4RDU7B/bundle.json","state_url":"https://pith.science/pith/JIW5GZBQG5TUXHIWKA7A4RDU7B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JIW5GZBQG5TUXHIWKA7A4RDU7B/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-08-20T21:10:46Z","links":{"resolver":"https://pith.science/pith/JIW5GZBQG5TUXHIWKA7A4RDU7B","bundle":"https://pith.science/pith/JIW5GZBQG5TUXHIWKA7A4RDU7B/bundle.json","state":"https://pith.science/pith/JIW5GZBQG5TUXHIWKA7A4RDU7B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JIW5GZBQG5TUXHIWKA7A4RDU7B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:JIW5GZBQG5TUXHIWKA7A4RDU7B","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":"74a973ba6163f179c57ef12feccfa12301d361bcfdadc9f8ce2dc999e7742aa9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2025-05-30T22:26:26Z","title_canon_sha256":"926ad2f9f675e8d542b52b65d097e179df2a62e4af6ff0d47f5ef467b4b0b2a0"},"schema_version":"1.0","source":{"id":"2506.00285","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.00285","created_at":"2026-07-05T11:13:32Z"},{"alias_kind":"arxiv_version","alias_value":"2506.00285v1","created_at":"2026-07-05T11:13:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.00285","created_at":"2026-07-05T11:13:32Z"},{"alias_kind":"pith_short_12","alias_value":"JIW5GZBQG5TU","created_at":"2026-07-05T11:13:32Z"},{"alias_kind":"pith_short_16","alias_value":"JIW5GZBQG5TUXHIW","created_at":"2026-07-05T11:13:32Z"},{"alias_kind":"pith_short_8","alias_value":"JIW5GZBQ","created_at":"2026-07-05T11:13:32Z"}],"graph_snapshots":[{"event_id":"sha256:f36fd8c6aeadb6514edd7a94d29a7ec9f23c3183ff3d353d265a9b802b44be17","target":"graph","created_at":"2026-07-05T11:13:32Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2506.00285/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Heuristic search solvers like RTDP-Bel and LAO* have proven effective for computing optimal and bounded sub-optimal solutions for Partially Observable Markov Decision Processes (POMDPs), which are typically formulated as belief MDPs. A belief represents a probability distribution over possible system states. Given a parent belief and an action, computing belief state transitions involves Bayesian updates that combine the transition and observation models of the POMDP to determine successor beliefs and their transition probabilities. However, there is a class of problems, specifically in roboti","authors_text":"Maxim Likhachev, Muhammad Suhail Saleem, Rishi Veerapaneni","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2025-05-30T22:26:26Z","title":"Lazy Heuristic Search for Solving POMDPs with Expensive-to-Compute Belief Transitions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.00285","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:cdca83a7f489b7300e2c0fcbc94b0888e2311fc261fef895187ab7f65a12a855","target":"record","created_at":"2026-07-05T11:13:32Z","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":"74a973ba6163f179c57ef12feccfa12301d361bcfdadc9f8ce2dc999e7742aa9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2025-05-30T22:26:26Z","title_canon_sha256":"926ad2f9f675e8d542b52b65d097e179df2a62e4af6ff0d47f5ef467b4b0b2a0"},"schema_version":"1.0","source":{"id":"2506.00285","kind":"arxiv","version":1}},"canonical_sha256":"4a2dd3643037674b9d16503e0e4474f84cd25bc1e6ade5c29ee4c6b9696af3d3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a2dd3643037674b9d16503e0e4474f84cd25bc1e6ade5c29ee4c6b9696af3d3","first_computed_at":"2026-07-05T11:13:32.095684Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:13:32.095684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GNLn/fToCuKDAbj4cGygCcCGXwPXQ6M8GKLX+/apX4zBbRAlDix2Vhs3Jy3O03MALT5OpOW8zznDUgha9mbBDA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:13:32.096120Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.00285","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cdca83a7f489b7300e2c0fcbc94b0888e2311fc261fef895187ab7f65a12a855","sha256:f36fd8c6aeadb6514edd7a94d29a7ec9f23c3183ff3d353d265a9b802b44be17"],"state_sha256":"440235bc9bb32588f3a266b406ff858fce7110009b717e862ec4b528acba862f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RarvdwHB+XoCBqJ7+UyvefiIrUvpyHVZb6Qb6b289big2IwuKCtvOAR7GE38+bV78mZaitGPoozQT04srWhqCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T21:10:46.697300Z","bundle_sha256":"940c71005a8c9a45dc8c76f68218559db6ea2116a4ee3cb2082a2eb1e1bca20f"}}