{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:B5S273CHXWKPNIGECDGVA5BWHT","short_pith_number":"pith:B5S273CH","schema_version":"1.0","canonical_sha256":"0f65afec47bd94f6a0c410cd5074363cc81e88d4b750f1be2221d49dbb9f7808","source":{"kind":"arxiv","id":"1404.0967","version":1},"attestation_state":"computed","paper":{"title":"Binary pattern tile set synthesis is NP-hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Lila Kari, Matthew J. Patitz, Pierre-\\'Etienne Meunier, Shinnosuke Seki, Steffen Kopecki","submitted_at":"2014-04-03T15:26:13Z","abstract_excerpt":"In the field of algorithmic self-assembly, a long-standing unproven conjecture has been that of the NP-hardness of binary pattern tile set synthesis (2-PATS). The $k$-PATS problem is that of designing a tile assembly system with the smallest number of tile types which will self-assemble an input pattern of $k$ colors. Of both theoretical and practical significance, $k$-PATS has been studied in a series of papers which have shown $k$-PATS to be NP-hard for $k = 60$, $k = 29$, and then $k = 11$. In this paper, we close the fundamental conjecture that 2-PATS is NP-hard, concluding this line of st"},"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":"1404.0967","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-04-03T15:26:13Z","cross_cats_sorted":[],"title_canon_sha256":"ccee550c4b4b67b9ddc92c8fdd5c7d2800d5bc04c5e6af09fed1d2207c3506be","abstract_canon_sha256":"ef3c79a65dbbe402edff99237f6f60c77e698209d797890c8fd2021fd7af10e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:54.868577Z","signature_b64":"oSTD911VKTi3B9rT5AE5FLcR+h4djgyygX0couNnGn6jQPxniYYff85O2rrpzc4IARqb6azcrkwZE8H5SzJsCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f65afec47bd94f6a0c410cd5074363cc81e88d4b750f1be2221d49dbb9f7808","last_reissued_at":"2026-05-18T02:54:54.868046Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:54.868046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Binary pattern tile set synthesis is NP-hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Lila Kari, Matthew J. Patitz, Pierre-\\'Etienne Meunier, Shinnosuke Seki, Steffen Kopecki","submitted_at":"2014-04-03T15:26:13Z","abstract_excerpt":"In the field of algorithmic self-assembly, a long-standing unproven conjecture has been that of the NP-hardness of binary pattern tile set synthesis (2-PATS). The $k$-PATS problem is that of designing a tile assembly system with the smallest number of tile types which will self-assemble an input pattern of $k$ colors. Of both theoretical and practical significance, $k$-PATS has been studied in a series of papers which have shown $k$-PATS to be NP-hard for $k = 60$, $k = 29$, and then $k = 11$. In this paper, we close the fundamental conjecture that 2-PATS is NP-hard, concluding this line of st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.0967","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":"1404.0967","created_at":"2026-05-18T02:54:54.868133+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.0967v1","created_at":"2026-05-18T02:54:54.868133+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.0967","created_at":"2026-05-18T02:54:54.868133+00:00"},{"alias_kind":"pith_short_12","alias_value":"B5S273CHXWKP","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"B5S273CHXWKPNIGE","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"B5S273CH","created_at":"2026-05-18T12:28:22.404517+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/B5S273CHXWKPNIGECDGVA5BWHT","json":"https://pith.science/pith/B5S273CHXWKPNIGECDGVA5BWHT.json","graph_json":"https://pith.science/api/pith-number/B5S273CHXWKPNIGECDGVA5BWHT/graph.json","events_json":"https://pith.science/api/pith-number/B5S273CHXWKPNIGECDGVA5BWHT/events.json","paper":"https://pith.science/paper/B5S273CH"},"agent_actions":{"view_html":"https://pith.science/pith/B5S273CHXWKPNIGECDGVA5BWHT","download_json":"https://pith.science/pith/B5S273CHXWKPNIGECDGVA5BWHT.json","view_paper":"https://pith.science/paper/B5S273CH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.0967&json=true","fetch_graph":"https://pith.science/api/pith-number/B5S273CHXWKPNIGECDGVA5BWHT/graph.json","fetch_events":"https://pith.science/api/pith-number/B5S273CHXWKPNIGECDGVA5BWHT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B5S273CHXWKPNIGECDGVA5BWHT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B5S273CHXWKPNIGECDGVA5BWHT/action/storage_attestation","attest_author":"https://pith.science/pith/B5S273CHXWKPNIGECDGVA5BWHT/action/author_attestation","sign_citation":"https://pith.science/pith/B5S273CHXWKPNIGECDGVA5BWHT/action/citation_signature","submit_replication":"https://pith.science/pith/B5S273CHXWKPNIGECDGVA5BWHT/action/replication_record"}},"created_at":"2026-05-18T02:54:54.868133+00:00","updated_at":"2026-05-18T02:54:54.868133+00:00"}