{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:Q5AXVRJ6VYWQYXK5QFQLSZIATB","short_pith_number":"pith:Q5AXVRJ6","schema_version":"1.0","canonical_sha256":"87417ac53eae2d0c5d5d8160b9650098579fa2008da0f2f2ca92f340bf930ebc","source":{"kind":"arxiv","id":"1007.1812","version":3},"attestation_state":"computed","paper":{"title":"The complexity of solving reachability games using value and strategy iteration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Rasmus Ibsen-Jensen","submitted_at":"2010-07-12T00:59:26Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1007.1812","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-07-12T00:59:26Z","cross_cats_sorted":[],"title_canon_sha256":"2fbcc36d7dbb690231f919761f60be65ea9e539c6c6309f3a7fe181fc4c7d560","abstract_canon_sha256":"bfd662f9404dce278a65d3c8fef3afc25d07a512fa2fec68c705032089f3b8ec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:11.746571Z","signature_b64":"YR9xKBCeDq9kSkyvePmy+LlCy4QxG1IG8LOt7D+zIKMWeDmhqkdJgGiw3vErCLmLFaf5O+8DTR6b1GFy3avkAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87417ac53eae2d0c5d5d8160b9650098579fa2008da0f2f2ca92f340bf930ebc","last_reissued_at":"2026-05-18T04:01:11.745914Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:11.745914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The complexity of solving reachability games using value and strategy iteration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Rasmus Ibsen-Jensen","submitted_at":"2010-07-12T00:59:26Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.1812","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1007.1812","created_at":"2026-05-18T04:01:11.746003+00:00"},{"alias_kind":"arxiv_version","alias_value":"1007.1812v3","created_at":"2026-05-18T04:01:11.746003+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.1812","created_at":"2026-05-18T04:01:11.746003+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q5AXVRJ6VYWQ","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q5AXVRJ6VYWQYXK5","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q5AXVRJ6","created_at":"2026-05-18T12:26:12.377268+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Q5AXVRJ6VYWQYXK5QFQLSZIATB","json":"https://pith.science/pith/Q5AXVRJ6VYWQYXK5QFQLSZIATB.json","graph_json":"https://pith.science/api/pith-number/Q5AXVRJ6VYWQYXK5QFQLSZIATB/graph.json","events_json":"https://pith.science/api/pith-number/Q5AXVRJ6VYWQYXK5QFQLSZIATB/events.json","paper":"https://pith.science/paper/Q5AXVRJ6"},"agent_actions":{"view_html":"https://pith.science/pith/Q5AXVRJ6VYWQYXK5QFQLSZIATB","download_json":"https://pith.science/pith/Q5AXVRJ6VYWQYXK5QFQLSZIATB.json","view_paper":"https://pith.science/paper/Q5AXVRJ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1007.1812&json=true","fetch_graph":"https://pith.science/api/pith-number/Q5AXVRJ6VYWQYXK5QFQLSZIATB/graph.json","fetch_events":"https://pith.science/api/pith-number/Q5AXVRJ6VYWQYXK5QFQLSZIATB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q5AXVRJ6VYWQYXK5QFQLSZIATB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q5AXVRJ6VYWQYXK5QFQLSZIATB/action/storage_attestation","attest_author":"https://pith.science/pith/Q5AXVRJ6VYWQYXK5QFQLSZIATB/action/author_attestation","sign_citation":"https://pith.science/pith/Q5AXVRJ6VYWQYXK5QFQLSZIATB/action/citation_signature","submit_replication":"https://pith.science/pith/Q5AXVRJ6VYWQYXK5QFQLSZIATB/action/replication_record"}},"created_at":"2026-05-18T04:01:11.746003+00:00","updated_at":"2026-05-18T04:01:11.746003+00:00"}