{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:FG6L3TPR4FC52LOW67QTRCVIQN","short_pith_number":"pith:FG6L3TPR","schema_version":"1.0","canonical_sha256":"29bcbdcdf1e145dd2dd6f7e1388aa8835e60cb688081fd42a5f4d4afd36a7d63","source":{"kind":"arxiv","id":"1203.1633","version":1},"attestation_state":"computed","paper":{"title":"The Complexity of the Puzzles of Final Fantasy XIII-2","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Nathaniel Johnston","submitted_at":"2012-03-07T21:05:24Z","abstract_excerpt":"We analyze the computational complexity of solving the three \"temporal rift\" puzzles in the recent popular video game Final Fantasy XIII-2. We show that the Tile Trial puzzle is NP-hard and we provide an efficient algorithm for solving the Crystal Bonds puzzle. We also show that slight generalizations of the Crystal Bonds and Hands of Time puzzles are NP-hard."},"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":"1203.1633","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-03-07T21:05:24Z","cross_cats_sorted":[],"title_canon_sha256":"75e6789c2d5c5b0f11f858f717605e0e5a35f1402185dd9e74e0204af3b02123","abstract_canon_sha256":"233997476dbf51d5df05bb215bb0112358b3ab52760df0b5f3e2915bd7835281"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:37.463653Z","signature_b64":"kZJoNne4gYz2yhbMXwBYoe0Si+7Sfg5iwWqMoy8etVrO2ph0eqb1lmew8b3vqQJaFxaKZ9OVWSbVrYfXnTquCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29bcbdcdf1e145dd2dd6f7e1388aa8835e60cb688081fd42a5f4d4afd36a7d63","last_reissued_at":"2026-05-18T04:00:37.462829Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:37.462829Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Complexity of the Puzzles of Final Fantasy XIII-2","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Nathaniel Johnston","submitted_at":"2012-03-07T21:05:24Z","abstract_excerpt":"We analyze the computational complexity of solving the three \"temporal rift\" puzzles in the recent popular video game Final Fantasy XIII-2. We show that the Tile Trial puzzle is NP-hard and we provide an efficient algorithm for solving the Crystal Bonds puzzle. We also show that slight generalizations of the Crystal Bonds and Hands of Time puzzles are NP-hard."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.1633","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":"1203.1633","created_at":"2026-05-18T04:00:37.462982+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.1633v1","created_at":"2026-05-18T04:00:37.462982+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.1633","created_at":"2026-05-18T04:00:37.462982+00:00"},{"alias_kind":"pith_short_12","alias_value":"FG6L3TPR4FC5","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"FG6L3TPR4FC52LOW","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"FG6L3TPR","created_at":"2026-05-18T12:27:06.952714+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/FG6L3TPR4FC52LOW67QTRCVIQN","json":"https://pith.science/pith/FG6L3TPR4FC52LOW67QTRCVIQN.json","graph_json":"https://pith.science/api/pith-number/FG6L3TPR4FC52LOW67QTRCVIQN/graph.json","events_json":"https://pith.science/api/pith-number/FG6L3TPR4FC52LOW67QTRCVIQN/events.json","paper":"https://pith.science/paper/FG6L3TPR"},"agent_actions":{"view_html":"https://pith.science/pith/FG6L3TPR4FC52LOW67QTRCVIQN","download_json":"https://pith.science/pith/FG6L3TPR4FC52LOW67QTRCVIQN.json","view_paper":"https://pith.science/paper/FG6L3TPR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.1633&json=true","fetch_graph":"https://pith.science/api/pith-number/FG6L3TPR4FC52LOW67QTRCVIQN/graph.json","fetch_events":"https://pith.science/api/pith-number/FG6L3TPR4FC52LOW67QTRCVIQN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FG6L3TPR4FC52LOW67QTRCVIQN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FG6L3TPR4FC52LOW67QTRCVIQN/action/storage_attestation","attest_author":"https://pith.science/pith/FG6L3TPR4FC52LOW67QTRCVIQN/action/author_attestation","sign_citation":"https://pith.science/pith/FG6L3TPR4FC52LOW67QTRCVIQN/action/citation_signature","submit_replication":"https://pith.science/pith/FG6L3TPR4FC52LOW67QTRCVIQN/action/replication_record"}},"created_at":"2026-05-18T04:00:37.462982+00:00","updated_at":"2026-05-18T04:00:37.462982+00:00"}