{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:MNZFFU3CR2MPUR2IOINMCAO325","short_pith_number":"pith:MNZFFU3C","schema_version":"1.0","canonical_sha256":"637252d3628e98fa4748721ac101dbd77e8089f93503f926225b3f766002a471","source":{"kind":"arxiv","id":"1611.10319","version":1},"attestation_state":"computed","paper":{"title":"The Computational Complexity of Portal and Other 3D Video Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Erik D. Demaine, Jayson Lynch, Joshua Lockhart","submitted_at":"2016-11-30T19:20:47Z","abstract_excerpt":"We classify the computational complexity of the popular video games Portal and Portal 2. We isolate individual mechanics of the game and prove NP-hardness, PSPACE-completeness, or (pseudo)polynomiality depending on the specific game mechanics allowed. One of our proofs generalizes to prove NP-hardness of many other video games such as Half-Life 2, Halo, Doom, Elder Scrolls, Fallout, Grand Theft Auto, Left 4 Dead, Mass Effect, Deus Ex, Metal Gear Solid, and Resident Evil.\n  These results build on the established literature on the complexity of video games."},"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":"1611.10319","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-11-30T19:20:47Z","cross_cats_sorted":[],"title_canon_sha256":"29378ff7434bd86986ee48f661bed689e515861a7946a9fd2f9d999ee93735a2","abstract_canon_sha256":"96cd1d1c45d45066eb119cf9fd6020ca9a77852f2dd608767c1ee3e43eb62212"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:10.749996Z","signature_b64":"qM/2fFvuypC6hsKZXOfF8NrRAScgOjaGsDKdjoW3TqBFKews5nqoAlW9k3HzeC5HBpAJP1ulHZ23WIbv/059Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"637252d3628e98fa4748721ac101dbd77e8089f93503f926225b3f766002a471","last_reissued_at":"2026-05-18T00:56:10.749552Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:10.749552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Computational Complexity of Portal and Other 3D Video Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Erik D. Demaine, Jayson Lynch, Joshua Lockhart","submitted_at":"2016-11-30T19:20:47Z","abstract_excerpt":"We classify the computational complexity of the popular video games Portal and Portal 2. We isolate individual mechanics of the game and prove NP-hardness, PSPACE-completeness, or (pseudo)polynomiality depending on the specific game mechanics allowed. One of our proofs generalizes to prove NP-hardness of many other video games such as Half-Life 2, Halo, Doom, Elder Scrolls, Fallout, Grand Theft Auto, Left 4 Dead, Mass Effect, Deus Ex, Metal Gear Solid, and Resident Evil.\n  These results build on the established literature on the complexity of video games."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.10319","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1611.10319","created_at":"2026-05-18T00:56:10.749635+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.10319v1","created_at":"2026-05-18T00:56:10.749635+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.10319","created_at":"2026-05-18T00:56:10.749635+00:00"},{"alias_kind":"pith_short_12","alias_value":"MNZFFU3CR2MP","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"MNZFFU3CR2MPUR2I","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"MNZFFU3C","created_at":"2026-05-18T12:30:32.724797+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/MNZFFU3CR2MPUR2IOINMCAO325","json":"https://pith.science/pith/MNZFFU3CR2MPUR2IOINMCAO325.json","graph_json":"https://pith.science/api/pith-number/MNZFFU3CR2MPUR2IOINMCAO325/graph.json","events_json":"https://pith.science/api/pith-number/MNZFFU3CR2MPUR2IOINMCAO325/events.json","paper":"https://pith.science/paper/MNZFFU3C"},"agent_actions":{"view_html":"https://pith.science/pith/MNZFFU3CR2MPUR2IOINMCAO325","download_json":"https://pith.science/pith/MNZFFU3CR2MPUR2IOINMCAO325.json","view_paper":"https://pith.science/paper/MNZFFU3C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.10319&json=true","fetch_graph":"https://pith.science/api/pith-number/MNZFFU3CR2MPUR2IOINMCAO325/graph.json","fetch_events":"https://pith.science/api/pith-number/MNZFFU3CR2MPUR2IOINMCAO325/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MNZFFU3CR2MPUR2IOINMCAO325/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MNZFFU3CR2MPUR2IOINMCAO325/action/storage_attestation","attest_author":"https://pith.science/pith/MNZFFU3CR2MPUR2IOINMCAO325/action/author_attestation","sign_citation":"https://pith.science/pith/MNZFFU3CR2MPUR2IOINMCAO325/action/citation_signature","submit_replication":"https://pith.science/pith/MNZFFU3CR2MPUR2IOINMCAO325/action/replication_record"}},"created_at":"2026-05-18T00:56:10.749635+00:00","updated_at":"2026-05-18T00:56:10.749635+00:00"}