{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:ZFYDESZXBM3MXRFRW2LGQGULFL","short_pith_number":"pith:ZFYDESZX","canonical_record":{"source":{"id":"1203.3538","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-03-15T11:25:52Z","cross_cats_sorted":[],"title_canon_sha256":"db9d73439a2c824cd99261a0b4d811528e1e545341390e783d0f7a3382660390","abstract_canon_sha256":"8565d6799b83fc7cecdbdac2dc959e63a484c202f14e9621ce40186419dc83ec"},"schema_version":"1.0"},"canonical_sha256":"c970324b370b36cbc4b1b696681a8b2ad825f4356f33fc75c40d6878b76f97d6","source":{"kind":"arxiv","id":"1203.3538","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.3538","created_at":"2026-05-18T03:59:59Z"},{"alias_kind":"arxiv_version","alias_value":"1203.3538v1","created_at":"2026-05-18T03:59:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.3538","created_at":"2026-05-18T03:59:59Z"},{"alias_kind":"pith_short_12","alias_value":"ZFYDESZXBM3M","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"ZFYDESZXBM3MXRFR","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"ZFYDESZX","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:ZFYDESZXBM3MXRFRW2LGQGULFL","target":"record","payload":{"canonical_record":{"source":{"id":"1203.3538","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-03-15T11:25:52Z","cross_cats_sorted":[],"title_canon_sha256":"db9d73439a2c824cd99261a0b4d811528e1e545341390e783d0f7a3382660390","abstract_canon_sha256":"8565d6799b83fc7cecdbdac2dc959e63a484c202f14e9621ce40186419dc83ec"},"schema_version":"1.0"},"canonical_sha256":"c970324b370b36cbc4b1b696681a8b2ad825f4356f33fc75c40d6878b76f97d6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:59:59.748064Z","signature_b64":"KE9YnHxppOEhtK5J7Kw6O5wTVL5Z8cqy7ItM/2J8oPNR5vyws7VYbLd3hEjSZ6lIw7xmU/XkFG4YE9k46UD1Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c970324b370b36cbc4b1b696681a8b2ad825f4356f33fc75c40d6878b76f97d6","last_reissued_at":"2026-05-18T03:59:59.747499Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:59:59.747499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.3538","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:59:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RZq2xMdl1Wmtimv6rop2HvjeRq4JXjKkKiS4kumVDm68U55xK/d1ct1z3OymeaPpGbLDcRJdlGAI8ibV785HDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T22:37:22.714551Z"},"content_sha256":"b4fe48faa2077edaaf0586ff0f4077779364efeb75aad8d8953678dd611290d4","schema_version":"1.0","event_id":"sha256:b4fe48faa2077edaaf0586ff0f4077779364efeb75aad8d8953678dd611290d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:ZFYDESZXBM3MXRFRW2LGQGULFL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"RAPID: A Reachable Anytime Planner for Imprecisely-sensed Domains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Emma Brunskill, Stuart Russell","submitted_at":"2012-03-15T11:25:52Z","abstract_excerpt":"Despite the intractability of generic optimal partially observable Markov decision process planning, there exist important problems that have highly structured models. Previous researchers have used this insight to construct more efficient algorithms for factored domains, and for domains with topological structure in the flat state dynamics model. In our work, motivated by findings from the education community relevant to automated tutoring, we consider problems that exhibit a form of topological structure in the factored dynamics model. Our Reachable Anytime Planner for Imprecisely-sensed Dom"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.3538","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:59:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KTgZ0c1KQkRRnejPevNY6hF6Qqx6ePSmIv6SA92Rhi6ttykRssM1sgFwSNbuSbLIK9qr+XZbvP/tdLVAovULBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T22:37:22.715228Z"},"content_sha256":"bba6e86e790bf3b8c249a63cf0abb81e341b0647bcfc6390f240871bc56e5520","schema_version":"1.0","event_id":"sha256:bba6e86e790bf3b8c249a63cf0abb81e341b0647bcfc6390f240871bc56e5520"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZFYDESZXBM3MXRFRW2LGQGULFL/bundle.json","state_url":"https://pith.science/pith/ZFYDESZXBM3MXRFRW2LGQGULFL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZFYDESZXBM3MXRFRW2LGQGULFL/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-10T22:37:22Z","links":{"resolver":"https://pith.science/pith/ZFYDESZXBM3MXRFRW2LGQGULFL","bundle":"https://pith.science/pith/ZFYDESZXBM3MXRFRW2LGQGULFL/bundle.json","state":"https://pith.science/pith/ZFYDESZXBM3MXRFRW2LGQGULFL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZFYDESZXBM3MXRFRW2LGQGULFL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ZFYDESZXBM3MXRFRW2LGQGULFL","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":"8565d6799b83fc7cecdbdac2dc959e63a484c202f14e9621ce40186419dc83ec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-03-15T11:25:52Z","title_canon_sha256":"db9d73439a2c824cd99261a0b4d811528e1e545341390e783d0f7a3382660390"},"schema_version":"1.0","source":{"id":"1203.3538","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.3538","created_at":"2026-05-18T03:59:59Z"},{"alias_kind":"arxiv_version","alias_value":"1203.3538v1","created_at":"2026-05-18T03:59:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.3538","created_at":"2026-05-18T03:59:59Z"},{"alias_kind":"pith_short_12","alias_value":"ZFYDESZXBM3M","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"ZFYDESZXBM3MXRFR","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"ZFYDESZX","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:bba6e86e790bf3b8c249a63cf0abb81e341b0647bcfc6390f240871bc56e5520","target":"graph","created_at":"2026-05-18T03:59:59Z","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":"Despite the intractability of generic optimal partially observable Markov decision process planning, there exist important problems that have highly structured models. Previous researchers have used this insight to construct more efficient algorithms for factored domains, and for domains with topological structure in the flat state dynamics model. In our work, motivated by findings from the education community relevant to automated tutoring, we consider problems that exhibit a form of topological structure in the factored dynamics model. Our Reachable Anytime Planner for Imprecisely-sensed Dom","authors_text":"Emma Brunskill, Stuart Russell","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-03-15T11:25:52Z","title":"RAPID: A Reachable Anytime Planner for Imprecisely-sensed Domains"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.3538","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:b4fe48faa2077edaaf0586ff0f4077779364efeb75aad8d8953678dd611290d4","target":"record","created_at":"2026-05-18T03:59:59Z","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":"8565d6799b83fc7cecdbdac2dc959e63a484c202f14e9621ce40186419dc83ec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-03-15T11:25:52Z","title_canon_sha256":"db9d73439a2c824cd99261a0b4d811528e1e545341390e783d0f7a3382660390"},"schema_version":"1.0","source":{"id":"1203.3538","kind":"arxiv","version":1}},"canonical_sha256":"c970324b370b36cbc4b1b696681a8b2ad825f4356f33fc75c40d6878b76f97d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c970324b370b36cbc4b1b696681a8b2ad825f4356f33fc75c40d6878b76f97d6","first_computed_at":"2026-05-18T03:59:59.747499Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:59:59.747499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KE9YnHxppOEhtK5J7Kw6O5wTVL5Z8cqy7ItM/2J8oPNR5vyws7VYbLd3hEjSZ6lIw7xmU/XkFG4YE9k46UD1Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:59:59.748064Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.3538","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b4fe48faa2077edaaf0586ff0f4077779364efeb75aad8d8953678dd611290d4","sha256:bba6e86e790bf3b8c249a63cf0abb81e341b0647bcfc6390f240871bc56e5520"],"state_sha256":"8b280691df57e4685bf9acf844c2d01ca0d8e0e09b438ad65d60bd5c1bb25ceb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e6MJByRd7jlnw6aIGzFUJVuAHxxB2jluPd91pACaJjWmzspU2yT8Wfgny2AbrcCFjNB0lbeFezHC2IEzm6IAAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T22:37:22.719919Z","bundle_sha256":"48a3bdd584bf95b0f55cabb394e4664421dcc4b8f85bc5c52737b25b842d7fd1"}}