{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:GTUQSQGFYJG54DD5UWEXAKF5OA","short_pith_number":"pith:GTUQSQGF","canonical_record":{"source":{"id":"1206.3233","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-06-13T12:34:35Z","cross_cats_sorted":[],"title_canon_sha256":"db5a746384cd6d46d8339a2bc00b841f60fae7d69d8a138a11562bc14b95b8b8","abstract_canon_sha256":"5121dcb0f87eddbb19dbc5233ff177f88d28055cbcdd0d651cf8607d7e015765"},"schema_version":"1.0"},"canonical_sha256":"34e90940c5c24dde0c7da5897028bd702d220c9b323799425ed7dfab45edc219","source":{"kind":"arxiv","id":"1206.3233","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.3233","created_at":"2026-05-18T03:53:31Z"},{"alias_kind":"arxiv_version","alias_value":"1206.3233v1","created_at":"2026-05-18T03:53:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3233","created_at":"2026-05-18T03:53:31Z"},{"alias_kind":"pith_short_12","alias_value":"GTUQSQGFYJG5","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GTUQSQGFYJG54DD5","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GTUQSQGF","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:GTUQSQGFYJG54DD5UWEXAKF5OA","target":"record","payload":{"canonical_record":{"source":{"id":"1206.3233","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-06-13T12:34:35Z","cross_cats_sorted":[],"title_canon_sha256":"db5a746384cd6d46d8339a2bc00b841f60fae7d69d8a138a11562bc14b95b8b8","abstract_canon_sha256":"5121dcb0f87eddbb19dbc5233ff177f88d28055cbcdd0d651cf8607d7e015765"},"schema_version":"1.0"},"canonical_sha256":"34e90940c5c24dde0c7da5897028bd702d220c9b323799425ed7dfab45edc219","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:31.166913Z","signature_b64":"T9UFZacI899V6iVLhL/L9WB5kD6e1gzPkVzIuuq3SoIloafEQ3ntZhtXCTxewYsp+4/5sPDLjnM+fsUIhFrABA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34e90940c5c24dde0c7da5897028bd702d220c9b323799425ed7dfab45edc219","last_reissued_at":"2026-05-18T03:53:31.166396Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:31.166396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.3233","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:53:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hb0qX1V7zX9yANub6LDDgTOiZ9/FoQkvgI/UiBnOv57nkLYPcDpx5606MZvRyuH8NQifgRGOdnfvA7gEPBW7Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T09:40:30.637044Z"},"content_sha256":"519417c8fbf3be0e584437e8c12f0335ab521dd1e7d07f8413e4f7aab55de71a","schema_version":"1.0","event_id":"sha256:519417c8fbf3be0e584437e8c12f0335ab521dd1e7d07f8413e4f7aab55de71a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:GTUQSQGFYJG54DD5UWEXAKF5OA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Speeding Up Planning in Markov Decision Processes via Automatically Constructed Abstractions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Alejandro Isaza, Csaba Szepesvari, Russell Greiner, Vadim Bulitko","submitted_at":"2012-06-13T12:34:35Z","abstract_excerpt":"In this paper, we consider planning in stochastic shortest path (SSP) problems, a subclass of Markov Decision Problems (MDP). We focus on medium-size problems whose state space can be fully enumerated. This problem has numerous important applications, such as navigation and planning under uncertainty. We propose a new approach for constructing a multi-level hierarchy of progressively simpler abstractions of the original problem. Once computed, the hierarchy can be used to speed up planning by first finding a policy for the most abstract level and then recursively refining it into a solution to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.3233","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:53:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TRRs+2JE+WeyxEx/TTuMySU2gGDWIKgOS/fDp3BK29T/eA2q/hotqwXoo1qELelzOCOlTVlDmW+jYVrGQsHADQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T09:40:30.637784Z"},"content_sha256":"96947667cbed3fd44e87a3f1e3b09650bc46b8c968cab29a391595b6fedf74df","schema_version":"1.0","event_id":"sha256:96947667cbed3fd44e87a3f1e3b09650bc46b8c968cab29a391595b6fedf74df"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GTUQSQGFYJG54DD5UWEXAKF5OA/bundle.json","state_url":"https://pith.science/pith/GTUQSQGFYJG54DD5UWEXAKF5OA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GTUQSQGFYJG54DD5UWEXAKF5OA/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-08T09:40:30Z","links":{"resolver":"https://pith.science/pith/GTUQSQGFYJG54DD5UWEXAKF5OA","bundle":"https://pith.science/pith/GTUQSQGFYJG54DD5UWEXAKF5OA/bundle.json","state":"https://pith.science/pith/GTUQSQGFYJG54DD5UWEXAKF5OA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GTUQSQGFYJG54DD5UWEXAKF5OA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:GTUQSQGFYJG54DD5UWEXAKF5OA","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":"5121dcb0f87eddbb19dbc5233ff177f88d28055cbcdd0d651cf8607d7e015765","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-06-13T12:34:35Z","title_canon_sha256":"db5a746384cd6d46d8339a2bc00b841f60fae7d69d8a138a11562bc14b95b8b8"},"schema_version":"1.0","source":{"id":"1206.3233","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.3233","created_at":"2026-05-18T03:53:31Z"},{"alias_kind":"arxiv_version","alias_value":"1206.3233v1","created_at":"2026-05-18T03:53:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3233","created_at":"2026-05-18T03:53:31Z"},{"alias_kind":"pith_short_12","alias_value":"GTUQSQGFYJG5","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GTUQSQGFYJG54DD5","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GTUQSQGF","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:96947667cbed3fd44e87a3f1e3b09650bc46b8c968cab29a391595b6fedf74df","target":"graph","created_at":"2026-05-18T03:53:31Z","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":"In this paper, we consider planning in stochastic shortest path (SSP) problems, a subclass of Markov Decision Problems (MDP). We focus on medium-size problems whose state space can be fully enumerated. This problem has numerous important applications, such as navigation and planning under uncertainty. We propose a new approach for constructing a multi-level hierarchy of progressively simpler abstractions of the original problem. Once computed, the hierarchy can be used to speed up planning by first finding a policy for the most abstract level and then recursively refining it into a solution to","authors_text":"Alejandro Isaza, Csaba Szepesvari, Russell Greiner, Vadim Bulitko","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-06-13T12:34:35Z","title":"Speeding Up Planning in Markov Decision Processes via Automatically Constructed Abstractions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.3233","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:519417c8fbf3be0e584437e8c12f0335ab521dd1e7d07f8413e4f7aab55de71a","target":"record","created_at":"2026-05-18T03:53:31Z","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":"5121dcb0f87eddbb19dbc5233ff177f88d28055cbcdd0d651cf8607d7e015765","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-06-13T12:34:35Z","title_canon_sha256":"db5a746384cd6d46d8339a2bc00b841f60fae7d69d8a138a11562bc14b95b8b8"},"schema_version":"1.0","source":{"id":"1206.3233","kind":"arxiv","version":1}},"canonical_sha256":"34e90940c5c24dde0c7da5897028bd702d220c9b323799425ed7dfab45edc219","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"34e90940c5c24dde0c7da5897028bd702d220c9b323799425ed7dfab45edc219","first_computed_at":"2026-05-18T03:53:31.166396Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:53:31.166396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T9UFZacI899V6iVLhL/L9WB5kD6e1gzPkVzIuuq3SoIloafEQ3ntZhtXCTxewYsp+4/5sPDLjnM+fsUIhFrABA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:53:31.166913Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.3233","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:519417c8fbf3be0e584437e8c12f0335ab521dd1e7d07f8413e4f7aab55de71a","sha256:96947667cbed3fd44e87a3f1e3b09650bc46b8c968cab29a391595b6fedf74df"],"state_sha256":"73c3c124bbfcc23a4be16932a114b361e4acae7c3dac4affb41f085038d13fd3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VHDZOmgtW1zKNcjWSXINSAc8Kn9v4pvXICrNQUZxhOtxOJrxmszr6lW5OmNoMO3Kzz4oMgh/ecOpouILkBjiDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T09:40:30.641840Z","bundle_sha256":"c2e7fec20365dd4e39eea0ce83b88a32f809e0448bac7a42f08eff4be5d9b9d6"}}