{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:Q5AXVRJ6VYWQYXK5QFQLSZIATB","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":"bfd662f9404dce278a65d3c8fef3afc25d07a512fa2fec68c705032089f3b8ec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-07-12T00:59:26Z","title_canon_sha256":"2fbcc36d7dbb690231f919761f60be65ea9e539c6c6309f3a7fe181fc4c7d560"},"schema_version":"1.0","source":{"id":"1007.1812","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.1812","created_at":"2026-05-18T04:01:11Z"},{"alias_kind":"arxiv_version","alias_value":"1007.1812v3","created_at":"2026-05-18T04:01:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.1812","created_at":"2026-05-18T04:01:11Z"},{"alias_kind":"pith_short_12","alias_value":"Q5AXVRJ6VYWQ","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"Q5AXVRJ6VYWQYXK5","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"Q5AXVRJ6","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:c009755e7d05475e00abea2ddf7a56e1b1caa5c761ee274e43efa93c78566f8a","target":"graph","created_at":"2026-05-18T04:01:11Z","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":"Two standard algorithms for approximately solving two-player zero-sum concurrent reachability games are value iteration and strategy iteration. We prove upper and lower bounds of 2^(m^(Theta(N))) on the worst case number of iterations needed by both of these algorithms for providing non-trivial approximations to the value of a game with N non-terminal positions and m actions for each player in each position. In particular, both algorithms have doubly-exponential complexity. Even when the game given as input has only one non-terminal position, we prove an exponential lower bound on the worst ca","authors_text":"Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Rasmus Ibsen-Jensen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-07-12T00:59:26Z","title":"The complexity of solving reachability games using value and strategy iteration"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.1812","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:74fe431f9d8dda2a4964cd9f83858dd3e68299cb28767872656384465404d825","target":"record","created_at":"2026-05-18T04:01:11Z","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":"bfd662f9404dce278a65d3c8fef3afc25d07a512fa2fec68c705032089f3b8ec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-07-12T00:59:26Z","title_canon_sha256":"2fbcc36d7dbb690231f919761f60be65ea9e539c6c6309f3a7fe181fc4c7d560"},"schema_version":"1.0","source":{"id":"1007.1812","kind":"arxiv","version":3}},"canonical_sha256":"87417ac53eae2d0c5d5d8160b9650098579fa2008da0f2f2ca92f340bf930ebc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"87417ac53eae2d0c5d5d8160b9650098579fa2008da0f2f2ca92f340bf930ebc","first_computed_at":"2026-05-18T04:01:11.745914Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:01:11.745914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YR9xKBCeDq9kSkyvePmy+LlCy4QxG1IG8LOt7D+zIKMWeDmhqkdJgGiw3vErCLmLFaf5O+8DTR6b1GFy3avkAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:01:11.746571Z","signed_message":"canonical_sha256_bytes"},"source_id":"1007.1812","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:74fe431f9d8dda2a4964cd9f83858dd3e68299cb28767872656384465404d825","sha256:c009755e7d05475e00abea2ddf7a56e1b1caa5c761ee274e43efa93c78566f8a"],"state_sha256":"e40148400610a8b379541ad1cc81a736bbadf0ae1c990a657cf3e3a15cbb68da"}