{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:4KMCV4IXRTL3O2ZKKSAXIJWOWJ","short_pith_number":"pith:4KMCV4IX","canonical_record":{"source":{"id":"1302.4971","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-20T15:22:36Z","cross_cats_sorted":[],"title_canon_sha256":"950df81d03a574283411e27104210a56763309236a01b668baa392a85654826c","abstract_canon_sha256":"cc32259a1d33a5a748e9dec0f434bf3e63152e11e39119a12d9035c06f0db8aa"},"schema_version":"1.0"},"canonical_sha256":"e2982af1178cd7b76b2a54817426ceb27b4564f0a4a3129b4aa589792d08afbd","source":{"kind":"arxiv","id":"1302.4971","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.4971","created_at":"2026-05-18T03:33:00Z"},{"alias_kind":"arxiv_version","alias_value":"1302.4971v1","created_at":"2026-05-18T03:33:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4971","created_at":"2026-05-18T03:33:00Z"},{"alias_kind":"pith_short_12","alias_value":"4KMCV4IXRTL3","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4KMCV4IXRTL3O2ZK","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4KMCV4IX","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:4KMCV4IXRTL3O2ZKKSAXIJWOWJ","target":"record","payload":{"canonical_record":{"source":{"id":"1302.4971","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-20T15:22:36Z","cross_cats_sorted":[],"title_canon_sha256":"950df81d03a574283411e27104210a56763309236a01b668baa392a85654826c","abstract_canon_sha256":"cc32259a1d33a5a748e9dec0f434bf3e63152e11e39119a12d9035c06f0db8aa"},"schema_version":"1.0"},"canonical_sha256":"e2982af1178cd7b76b2a54817426ceb27b4564f0a4a3129b4aa589792d08afbd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:00.739237Z","signature_b64":"GhHUOWI6wYVQej9Sc+Tlqvug6+JNsNdL8TYZFzkna1sHuLzGGA69sgFjvfu9Qau0stzeNP4QhXkfxoST8klhCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2982af1178cd7b76b2a54817426ceb27b4564f0a4a3129b4aa589792d08afbd","last_reissued_at":"2026-05-18T03:33:00.738406Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:00.738406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.4971","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:33:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3PXqseWcWQV0ZkW5JGJEaCgO65lrgWG6bSnyIo2+VXFi4az82hASgUq/7oMnv0I+0KHN0B/qsVYNOvXmPtxJBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:07:02.013223Z"},"content_sha256":"0d0f23b56faad77b7cd4a46079bff3a62f4a204785facfdab4294ae4a81c4172","schema_version":"1.0","event_id":"sha256:0d0f23b56faad77b7cd4a46079bff3a62f4a204785facfdab4294ae4a81c4172"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:4KMCV4IXRTL3O2ZKKSAXIJWOWJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Complexity of Solving Markov Decision Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Leslie Pack Kaelbling, Michael L. Littman, Thomas L. Dean","submitted_at":"2013-02-20T15:22:36Z","abstract_excerpt":"Markov decision problems (MDPs) provide the foundations for a number of problems of interest to AI researchers studying automated planning and reinforcement learning.  In this paper, we summarize results regarding the complexity of solving MDPs and the running time of MDP solution algorithms.  We argue that, although MDPs can be solved efficiently in theory, more study is needed to reveal practical algorithms for solving large problems quickly.  To encourage future research, we sketch some alternative methods of analysis that rely on the structure of MDPs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4971","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:33:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i9CIRwqF71fEQ/p3ME9Lh4U1H/OY+9MVHBj7aKg0ZQiXV2YJRKgSxzVs56ApTiDSqrS8SYGP5H82TygjlPyeAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:07:02.013815Z"},"content_sha256":"bf96446ed7d5c8253810f25932fab05bde18d86360f6a8fff4d1a4fb36fee9d8","schema_version":"1.0","event_id":"sha256:bf96446ed7d5c8253810f25932fab05bde18d86360f6a8fff4d1a4fb36fee9d8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4KMCV4IXRTL3O2ZKKSAXIJWOWJ/bundle.json","state_url":"https://pith.science/pith/4KMCV4IXRTL3O2ZKKSAXIJWOWJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4KMCV4IXRTL3O2ZKKSAXIJWOWJ/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-07T14:07:02Z","links":{"resolver":"https://pith.science/pith/4KMCV4IXRTL3O2ZKKSAXIJWOWJ","bundle":"https://pith.science/pith/4KMCV4IXRTL3O2ZKKSAXIJWOWJ/bundle.json","state":"https://pith.science/pith/4KMCV4IXRTL3O2ZKKSAXIJWOWJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4KMCV4IXRTL3O2ZKKSAXIJWOWJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:4KMCV4IXRTL3O2ZKKSAXIJWOWJ","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":"cc32259a1d33a5a748e9dec0f434bf3e63152e11e39119a12d9035c06f0db8aa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-20T15:22:36Z","title_canon_sha256":"950df81d03a574283411e27104210a56763309236a01b668baa392a85654826c"},"schema_version":"1.0","source":{"id":"1302.4971","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.4971","created_at":"2026-05-18T03:33:00Z"},{"alias_kind":"arxiv_version","alias_value":"1302.4971v1","created_at":"2026-05-18T03:33:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4971","created_at":"2026-05-18T03:33:00Z"},{"alias_kind":"pith_short_12","alias_value":"4KMCV4IXRTL3","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4KMCV4IXRTL3O2ZK","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4KMCV4IX","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:bf96446ed7d5c8253810f25932fab05bde18d86360f6a8fff4d1a4fb36fee9d8","target":"graph","created_at":"2026-05-18T03:33:00Z","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":"Markov decision problems (MDPs) provide the foundations for a number of problems of interest to AI researchers studying automated planning and reinforcement learning.  In this paper, we summarize results regarding the complexity of solving MDPs and the running time of MDP solution algorithms.  We argue that, although MDPs can be solved efficiently in theory, more study is needed to reveal practical algorithms for solving large problems quickly.  To encourage future research, we sketch some alternative methods of analysis that rely on the structure of MDPs.","authors_text":"Leslie Pack Kaelbling, Michael L. Littman, Thomas L. Dean","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-20T15:22:36Z","title":"On the Complexity of Solving Markov Decision Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4971","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:0d0f23b56faad77b7cd4a46079bff3a62f4a204785facfdab4294ae4a81c4172","target":"record","created_at":"2026-05-18T03:33:00Z","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":"cc32259a1d33a5a748e9dec0f434bf3e63152e11e39119a12d9035c06f0db8aa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-20T15:22:36Z","title_canon_sha256":"950df81d03a574283411e27104210a56763309236a01b668baa392a85654826c"},"schema_version":"1.0","source":{"id":"1302.4971","kind":"arxiv","version":1}},"canonical_sha256":"e2982af1178cd7b76b2a54817426ceb27b4564f0a4a3129b4aa589792d08afbd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e2982af1178cd7b76b2a54817426ceb27b4564f0a4a3129b4aa589792d08afbd","first_computed_at":"2026-05-18T03:33:00.738406Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:00.738406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GhHUOWI6wYVQej9Sc+Tlqvug6+JNsNdL8TYZFzkna1sHuLzGGA69sgFjvfu9Qau0stzeNP4QhXkfxoST8klhCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:00.739237Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.4971","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0d0f23b56faad77b7cd4a46079bff3a62f4a204785facfdab4294ae4a81c4172","sha256:bf96446ed7d5c8253810f25932fab05bde18d86360f6a8fff4d1a4fb36fee9d8"],"state_sha256":"159fd1351c4c72782b7e33b2ccf9ab11dbb568dd8269094a42444c5add7b6e1e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uq8ynV8iNh5Drni4YRHxLNBfeDEGnybXufgAiY0Z+vZpS79tAYadhHVO7frVy/QI+LBsqqODGIU/GeEifBTeBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T14:07:02.016874Z","bundle_sha256":"ac65181f89178702cb6d2bd70e61558992e967847a2452fd60c39d1db98ba80d"}}