{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:A5Z3IGM6LSAKU6TUO3Z5QLJXED","short_pith_number":"pith:A5Z3IGM6","schema_version":"1.0","canonical_sha256":"0773b4199e5c80aa7a7476f3d82d3720c04acbf705eb5dd6e2e35ef7974fe279","source":{"kind":"arxiv","id":"1305.2796","version":1},"attestation_state":"computed","paper":{"title":"Tiling simply connected regions with rectangles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CG"],"primary_cat":"math.CO","authors_text":"Igor Pak, Jed Yang","submitted_at":"2013-05-13T14:47:57Z","abstract_excerpt":"In [BNRR], it was shown that tiling of general regions with two rectangles is NP-complete, except for a few trivial special cases. In a different direction, R\\'emila showed that for simply connected regions by two rectangles, the tileability can be solved in quadratic time (in the area). We prove that there is a finite set of at most 10^6 rectangles for which the tileability problem of simply connected regions is NP-complete, closing the gap between positive and negative results in the field. We also prove that counting such rectangular tilings is #P-complete, a first result of this kind."},"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":"1305.2796","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-13T14:47:57Z","cross_cats_sorted":["cs.CC","cs.CG"],"title_canon_sha256":"dfe63960133b91e1247870b3a0083f883671668eb81b68ba82d1cc7b5cc7b889","abstract_canon_sha256":"61113e7bfcf16471505368b60e75d3578dda638679597ce98b5d6d0bfef9ed8d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:47.272345Z","signature_b64":"dBFbbqFY9if0fpC+1r0QQDH9Xtk3xhlj57D7xOVI6yu8BGHXh/FERVcq/dhLtOKsc19YT8D6WU+umPFZptadBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0773b4199e5c80aa7a7476f3d82d3720c04acbf705eb5dd6e2e35ef7974fe279","last_reissued_at":"2026-05-18T03:25:47.271440Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:47.271440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tiling simply connected regions with rectangles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CG"],"primary_cat":"math.CO","authors_text":"Igor Pak, Jed Yang","submitted_at":"2013-05-13T14:47:57Z","abstract_excerpt":"In [BNRR], it was shown that tiling of general regions with two rectangles is NP-complete, except for a few trivial special cases. In a different direction, R\\'emila showed that for simply connected regions by two rectangles, the tileability can be solved in quadratic time (in the area). We prove that there is a finite set of at most 10^6 rectangles for which the tileability problem of simply connected regions is NP-complete, closing the gap between positive and negative results in the field. We also prove that counting such rectangular tilings is #P-complete, a first result of this kind."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.2796","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":"1305.2796","created_at":"2026-05-18T03:25:47.271602+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.2796v1","created_at":"2026-05-18T03:25:47.271602+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.2796","created_at":"2026-05-18T03:25:47.271602+00:00"},{"alias_kind":"pith_short_12","alias_value":"A5Z3IGM6LSAK","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"A5Z3IGM6LSAKU6TU","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"A5Z3IGM6","created_at":"2026-05-18T12:27:38.830355+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/A5Z3IGM6LSAKU6TUO3Z5QLJXED","json":"https://pith.science/pith/A5Z3IGM6LSAKU6TUO3Z5QLJXED.json","graph_json":"https://pith.science/api/pith-number/A5Z3IGM6LSAKU6TUO3Z5QLJXED/graph.json","events_json":"https://pith.science/api/pith-number/A5Z3IGM6LSAKU6TUO3Z5QLJXED/events.json","paper":"https://pith.science/paper/A5Z3IGM6"},"agent_actions":{"view_html":"https://pith.science/pith/A5Z3IGM6LSAKU6TUO3Z5QLJXED","download_json":"https://pith.science/pith/A5Z3IGM6LSAKU6TUO3Z5QLJXED.json","view_paper":"https://pith.science/paper/A5Z3IGM6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.2796&json=true","fetch_graph":"https://pith.science/api/pith-number/A5Z3IGM6LSAKU6TUO3Z5QLJXED/graph.json","fetch_events":"https://pith.science/api/pith-number/A5Z3IGM6LSAKU6TUO3Z5QLJXED/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A5Z3IGM6LSAKU6TUO3Z5QLJXED/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A5Z3IGM6LSAKU6TUO3Z5QLJXED/action/storage_attestation","attest_author":"https://pith.science/pith/A5Z3IGM6LSAKU6TUO3Z5QLJXED/action/author_attestation","sign_citation":"https://pith.science/pith/A5Z3IGM6LSAKU6TUO3Z5QLJXED/action/citation_signature","submit_replication":"https://pith.science/pith/A5Z3IGM6LSAKU6TUO3Z5QLJXED/action/replication_record"}},"created_at":"2026-05-18T03:25:47.271602+00:00","updated_at":"2026-05-18T03:25:47.271602+00:00"}