{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:463REEX22UH5N26ZC5GUY74QJO","short_pith_number":"pith:463REEX2","canonical_record":{"source":{"id":"1807.04920","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-07-13T05:28:11Z","cross_cats_sorted":["cs.AI","cs.CC"],"title_canon_sha256":"3d4bcd435233ef4d893229dfe7693dd4bb14cbb19a887ecabba3a49ceae2f039","abstract_canon_sha256":"54ac27e76624e74e20780d6f1a43ba329fda2ca435f735c3aa1e9b7e05bc31f1"},"schema_version":"1.0"},"canonical_sha256":"e7b71212fad50fd6ebd9174d4c7f904bb55bc015d454963293776722b6da1f3f","source":{"kind":"arxiv","id":"1807.04920","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.04920","created_at":"2026-05-17T23:47:39Z"},{"alias_kind":"arxiv_version","alias_value":"1807.04920v3","created_at":"2026-05-17T23:47:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04920","created_at":"2026-05-17T23:47:39Z"},{"alias_kind":"pith_short_12","alias_value":"463REEX22UH5","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"463REEX22UH5N26Z","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"463REEX2","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:463REEX22UH5N26ZC5GUY74QJO","target":"record","payload":{"canonical_record":{"source":{"id":"1807.04920","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-07-13T05:28:11Z","cross_cats_sorted":["cs.AI","cs.CC"],"title_canon_sha256":"3d4bcd435233ef4d893229dfe7693dd4bb14cbb19a887ecabba3a49ceae2f039","abstract_canon_sha256":"54ac27e76624e74e20780d6f1a43ba329fda2ca435f735c3aa1e9b7e05bc31f1"},"schema_version":"1.0"},"canonical_sha256":"e7b71212fad50fd6ebd9174d4c7f904bb55bc015d454963293776722b6da1f3f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:39.910920Z","signature_b64":"ZkTmJMgSOy7sEZDqCqQ7CPrX6B7oUiQEmrgNj5n21ef7+KWv8VbEKmxvnLZg5OC+/SFhycdms4JXlI0u+pi3BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7b71212fad50fd6ebd9174d4c7f904bb55bc015d454963293776722b6da1f3f","last_reissued_at":"2026-05-17T23:47:39.910378Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:39.910378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.04920","source_version":3,"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-17T23:47:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UfUnDEm8AmM8bZf4is9R+u9lh3a2JIDA/v5RzTr0wukNLJu2kC/H7ZkLW3jfR4SsuUftjHRUHtRrawe3tZPQAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T18:44:44.868998Z"},"content_sha256":"a9f3f7d33048cdc6fbf39e7bd31f0ce18c6cf4166baf60b118a51f7d3a1dea89","schema_version":"1.0","event_id":"sha256:a9f3f7d33048cdc6fbf39e7bd31f0ce18c6cf4166baf60b118a51f7d3a1dea89"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:463REEX22UH5N26ZC5GUY74QJO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Complexity of Value Iteration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CC"],"primary_cat":"cs.FL","authors_text":"Guillermo A. P\\'erez, Mahsa Shirmohammadi, Nikhil Balaji, Petr Novotn\\'y, Stefan Kiefer","submitted_at":"2018-07-13T05:28:11Z","abstract_excerpt":"Value iteration is a fundamental algorithm for solving Markov Decision Processes (MDPs). It computes the maximal $n$-step payoff by iterating $n$ times a recurrence equation which is naturally associated to the MDP. At the same time, value iteration provides a policy for the MDP that is optimal on a given finite horizon $n$. In this paper, we settle the computational complexity of value iteration. We show that, given a horizon $n$ in binary and an MDP, computing an optimal policy is EXP-complete, thus resolving an open problem that goes back to the seminal 1987 paper on the complexity of MDPs "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.04920","kind":"arxiv","version":3},"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-17T23:47:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NHqBkVFkoTbUy5BNzM7i5hv6h/yFxla0s2YzHeViTVtZgNGrj8v5NX5b9mOfgwXfAmnQWdV+OKsA2KqYoJMTAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T18:44:44.869705Z"},"content_sha256":"b67fff1d5548916348dac116cd10ea4af5b56beb4a0a0a405156a7b33172bb78","schema_version":"1.0","event_id":"sha256:b67fff1d5548916348dac116cd10ea4af5b56beb4a0a0a405156a7b33172bb78"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/463REEX22UH5N26ZC5GUY74QJO/bundle.json","state_url":"https://pith.science/pith/463REEX22UH5N26ZC5GUY74QJO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/463REEX22UH5N26ZC5GUY74QJO/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-23T18:44:44Z","links":{"resolver":"https://pith.science/pith/463REEX22UH5N26ZC5GUY74QJO","bundle":"https://pith.science/pith/463REEX22UH5N26ZC5GUY74QJO/bundle.json","state":"https://pith.science/pith/463REEX22UH5N26ZC5GUY74QJO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/463REEX22UH5N26ZC5GUY74QJO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:463REEX22UH5N26ZC5GUY74QJO","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":"54ac27e76624e74e20780d6f1a43ba329fda2ca435f735c3aa1e9b7e05bc31f1","cross_cats_sorted":["cs.AI","cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-07-13T05:28:11Z","title_canon_sha256":"3d4bcd435233ef4d893229dfe7693dd4bb14cbb19a887ecabba3a49ceae2f039"},"schema_version":"1.0","source":{"id":"1807.04920","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.04920","created_at":"2026-05-17T23:47:39Z"},{"alias_kind":"arxiv_version","alias_value":"1807.04920v3","created_at":"2026-05-17T23:47:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04920","created_at":"2026-05-17T23:47:39Z"},{"alias_kind":"pith_short_12","alias_value":"463REEX22UH5","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"463REEX22UH5N26Z","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"463REEX2","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:b67fff1d5548916348dac116cd10ea4af5b56beb4a0a0a405156a7b33172bb78","target":"graph","created_at":"2026-05-17T23:47:39Z","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":"Value iteration is a fundamental algorithm for solving Markov Decision Processes (MDPs). It computes the maximal $n$-step payoff by iterating $n$ times a recurrence equation which is naturally associated to the MDP. At the same time, value iteration provides a policy for the MDP that is optimal on a given finite horizon $n$. In this paper, we settle the computational complexity of value iteration. We show that, given a horizon $n$ in binary and an MDP, computing an optimal policy is EXP-complete, thus resolving an open problem that goes back to the seminal 1987 paper on the complexity of MDPs ","authors_text":"Guillermo A. P\\'erez, Mahsa Shirmohammadi, Nikhil Balaji, Petr Novotn\\'y, Stefan Kiefer","cross_cats":["cs.AI","cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-07-13T05:28:11Z","title":"On the Complexity of Value Iteration"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.04920","kind":"arxiv","version":3},"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:a9f3f7d33048cdc6fbf39e7bd31f0ce18c6cf4166baf60b118a51f7d3a1dea89","target":"record","created_at":"2026-05-17T23:47:39Z","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":"54ac27e76624e74e20780d6f1a43ba329fda2ca435f735c3aa1e9b7e05bc31f1","cross_cats_sorted":["cs.AI","cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-07-13T05:28:11Z","title_canon_sha256":"3d4bcd435233ef4d893229dfe7693dd4bb14cbb19a887ecabba3a49ceae2f039"},"schema_version":"1.0","source":{"id":"1807.04920","kind":"arxiv","version":3}},"canonical_sha256":"e7b71212fad50fd6ebd9174d4c7f904bb55bc015d454963293776722b6da1f3f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e7b71212fad50fd6ebd9174d4c7f904bb55bc015d454963293776722b6da1f3f","first_computed_at":"2026-05-17T23:47:39.910378Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:39.910378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZkTmJMgSOy7sEZDqCqQ7CPrX6B7oUiQEmrgNj5n21ef7+KWv8VbEKmxvnLZg5OC+/SFhycdms4JXlI0u+pi3BQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:39.910920Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.04920","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a9f3f7d33048cdc6fbf39e7bd31f0ce18c6cf4166baf60b118a51f7d3a1dea89","sha256:b67fff1d5548916348dac116cd10ea4af5b56beb4a0a0a405156a7b33172bb78"],"state_sha256":"5b2b48acf8b796ca89ce86ddbefa0fb362d3f15040396a884279f523c7194dcc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f8DQAotLLT1OKK8idiRIk7PbCCrUXJ375IJDHSaj0Hl5V+8toAfCxQSBuL6dFAUtV00n5GJmNs/g+9RtY/QBCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T18:44:44.873296Z","bundle_sha256":"66e9875d00416b516815c37e4e2b682448f0121495bfbb3215d41e35e8c13a49"}}