{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:LN7OQ5DL5MPNQGITBWZX4Q2MOG","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":"5db9904c081c9f279a5dcd2fe5cf7646434a5bfe0ba4cc5e609c0e5795fc03d7","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-10-28T11:07:54Z","title_canon_sha256":"b89272e8844b9918b469ad2d18d9dfd08efa1c9caf6b97985c3548dd760ea5d9"},"schema_version":"1.0","source":{"id":"1410.7583","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.7583","created_at":"2026-05-18T02:39:09Z"},{"alias_kind":"arxiv_version","alias_value":"1410.7583v1","created_at":"2026-05-18T02:39:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.7583","created_at":"2026-05-18T02:39:09Z"},{"alias_kind":"pith_short_12","alias_value":"LN7OQ5DL5MPN","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LN7OQ5DL5MPNQGIT","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LN7OQ5DL","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:1d8ed668a622043d88fb01817725b8a587c596f28718a4116546c4fa59e6a31f","target":"graph","created_at":"2026-05-18T02:39:09Z","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":"Solving Markov Decision Processes (MDPs) is a recurrent task in engineering. Even though it is known that solutions for minimizing the infinite horizon expected reward can be found in polynomial time using Linear Programming techniques, iterative methods like the Policy Iteration algorithm (PI) remain usually the most efficient in practice. This method is guaranteed to converge in a finite number of steps. Unfortunately, it is known that it may require an exponential number of steps in the size of the problem to converge. On the other hand, many open questions remain considering the actual wor","authors_text":"Bal\\'azs Gerencs\\'er, Jean-Charles Delvenne, Rapha\\\"el M. Jungers, Romain Hollanders","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-10-28T11:07:54Z","title":"Improved bound on the worst case complexity of Policy Iteration"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.7583","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:d98bb0ccf3cd0e3a6a1324452891f0d97f16b8969d4448035db359da5ddb357c","target":"record","created_at":"2026-05-18T02:39:09Z","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":"5db9904c081c9f279a5dcd2fe5cf7646434a5bfe0ba4cc5e609c0e5795fc03d7","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-10-28T11:07:54Z","title_canon_sha256":"b89272e8844b9918b469ad2d18d9dfd08efa1c9caf6b97985c3548dd760ea5d9"},"schema_version":"1.0","source":{"id":"1410.7583","kind":"arxiv","version":1}},"canonical_sha256":"5b7ee8746beb1ed819130db37e434c71ab61bd623d301aaabede8a4d016c5739","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b7ee8746beb1ed819130db37e434c71ab61bd623d301aaabede8a4d016c5739","first_computed_at":"2026-05-18T02:39:09.950094Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:09.950094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QA/n4W3Xh2QiqFH7CM5z9ch8qFMKIsGOjvxzgZm5kXQg3oTT3Sa5XZGZZDIgi7e51l3DuAcTHM2mt3UDaE/OBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:09.950703Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.7583","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d98bb0ccf3cd0e3a6a1324452891f0d97f16b8969d4448035db359da5ddb357c","sha256:1d8ed668a622043d88fb01817725b8a587c596f28718a4116546c4fa59e6a31f"],"state_sha256":"7881277e61422010f36af971fe5e8672eed08e5c8b51d0550c3d2bd729102939"}