{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:3MN2EIOVO2KJ5V6PVG65LYPBJ5","short_pith_number":"pith:3MN2EIOV","schema_version":"1.0","canonical_sha256":"db1ba221d576949ed7cfa9bdd5e1e14f5a703c6c0d10e7118fc911f738abf822","source":{"kind":"arxiv","id":"0905.2419","version":2},"attestation_state":"computed","paper":{"title":"The Quantum and Classical Complexity of Translationally Invariant Tiling and Hamiltonian Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Daniel Gottesman, Sandy Irani","submitted_at":"2009-05-14T20:28:03Z","abstract_excerpt":"We study the complexity of a class of problems involving satisfying constraints which remain the same under translations in one or more spatial directions. In this paper, we show hardness of a classical tiling problem on an N x N 2-dimensional grid and a quantum problem involving finding the ground state energy of a 1-dimensional quantum system of N particles. In both cases, the only input is N, provided in binary. We show that the classical problem is NEXP-complete and the quantum problem is QMA_EXP-complete. Thus, an algorithm for these problems which runs in time polynomial in N (exponentia"},"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":"0905.2419","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-05-14T20:28:03Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"2ff4225bbc140c33893ffe995b854d44110c53308b381fb16a4ddfa375a97cf6","abstract_canon_sha256":"856d9736ad6e2913e9eaf13e6b31731bf562bfd823e1a6b5a09c7123d15c23bb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:54.885099Z","signature_b64":"b8makxvFdFZ19ia7YadBiH9sJtJtZw70zHMJRxhx5skxbsbt0rnQ7ZmK6cxrZ8nKm1MDRKTW/fLFBV2YRTvYAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db1ba221d576949ed7cfa9bdd5e1e14f5a703c6c0d10e7118fc911f738abf822","last_reissued_at":"2026-05-18T04:41:54.884453Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:54.884453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Quantum and Classical Complexity of Translationally Invariant Tiling and Hamiltonian Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Daniel Gottesman, Sandy Irani","submitted_at":"2009-05-14T20:28:03Z","abstract_excerpt":"We study the complexity of a class of problems involving satisfying constraints which remain the same under translations in one or more spatial directions. In this paper, we show hardness of a classical tiling problem on an N x N 2-dimensional grid and a quantum problem involving finding the ground state energy of a 1-dimensional quantum system of N particles. In both cases, the only input is N, provided in binary. We show that the classical problem is NEXP-complete and the quantum problem is QMA_EXP-complete. Thus, an algorithm for these problems which runs in time polynomial in N (exponentia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0905.2419","kind":"arxiv","version":2},"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":"0905.2419","created_at":"2026-05-18T04:41:54.884539+00:00"},{"alias_kind":"arxiv_version","alias_value":"0905.2419v2","created_at":"2026-05-18T04:41:54.884539+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0905.2419","created_at":"2026-05-18T04:41:54.884539+00:00"},{"alias_kind":"pith_short_12","alias_value":"3MN2EIOVO2KJ","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_16","alias_value":"3MN2EIOVO2KJ5V6P","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_8","alias_value":"3MN2EIOV","created_at":"2026-05-18T12:25:58.018023+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/3MN2EIOVO2KJ5V6PVG65LYPBJ5","json":"https://pith.science/pith/3MN2EIOVO2KJ5V6PVG65LYPBJ5.json","graph_json":"https://pith.science/api/pith-number/3MN2EIOVO2KJ5V6PVG65LYPBJ5/graph.json","events_json":"https://pith.science/api/pith-number/3MN2EIOVO2KJ5V6PVG65LYPBJ5/events.json","paper":"https://pith.science/paper/3MN2EIOV"},"agent_actions":{"view_html":"https://pith.science/pith/3MN2EIOVO2KJ5V6PVG65LYPBJ5","download_json":"https://pith.science/pith/3MN2EIOVO2KJ5V6PVG65LYPBJ5.json","view_paper":"https://pith.science/paper/3MN2EIOV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0905.2419&json=true","fetch_graph":"https://pith.science/api/pith-number/3MN2EIOVO2KJ5V6PVG65LYPBJ5/graph.json","fetch_events":"https://pith.science/api/pith-number/3MN2EIOVO2KJ5V6PVG65LYPBJ5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3MN2EIOVO2KJ5V6PVG65LYPBJ5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3MN2EIOVO2KJ5V6PVG65LYPBJ5/action/storage_attestation","attest_author":"https://pith.science/pith/3MN2EIOVO2KJ5V6PVG65LYPBJ5/action/author_attestation","sign_citation":"https://pith.science/pith/3MN2EIOVO2KJ5V6PVG65LYPBJ5/action/citation_signature","submit_replication":"https://pith.science/pith/3MN2EIOVO2KJ5V6PVG65LYPBJ5/action/replication_record"}},"created_at":"2026-05-18T04:41:54.884539+00:00","updated_at":"2026-05-18T04:41:54.884539+00:00"}