{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:OTLHMHZV5KJ57GACD4MBSFCBIZ","short_pith_number":"pith:OTLHMHZV","schema_version":"1.0","canonical_sha256":"74d6761f35ea93df98021f181914414677dd91204072d77c0464e05c7a7cb79c","source":{"kind":"arxiv","id":"1301.3771","version":1},"attestation_state":"computed","paper":{"title":"Combinatorial Optimization in Pattern Assembly","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Shinnosuke Seki","submitted_at":"2013-01-16T18:02:07Z","abstract_excerpt":"Pattern self-assembly tile set synthesis (PATS) is a combinatorial optimization problem which aim at minimizing a rectilinear tile assembly system (RTAS) that uniquely self-assembles a given rectangular pattern, and is known to be NP-hard. PATS gets practically meaningful when it is parameterized by a constant c such that any given pattern is guaranteed to contain at most c colors (c-PATS). We first investigate simple patterns and properties of minimum RTASs for them. Then based on them, we design a 59-colored pattern to which 3SAT is reduced, and prove that 59-PATS is 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":"1301.3771","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-01-16T18:02:07Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"e3cf20ba0d23bac00ee7e1577111fb973a1db4cc4e7986874ccd8673c06b3577","abstract_canon_sha256":"b69508070d45530e98e8d546f46d4b7532cc0d803545ea5d2cd918d17ab40b1c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:16.782416Z","signature_b64":"c4cV8sCdztZQyxurGbWWsO5qs83m8pgJAe8NOoKQqrkZs14tt+9fjphk/MHUs2PKlBqk47MS/aeSUjFkPbkcAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74d6761f35ea93df98021f181914414677dd91204072d77c0464e05c7a7cb79c","last_reissued_at":"2026-05-18T03:36:16.781647Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:16.781647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Combinatorial Optimization in Pattern Assembly","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Shinnosuke Seki","submitted_at":"2013-01-16T18:02:07Z","abstract_excerpt":"Pattern self-assembly tile set synthesis (PATS) is a combinatorial optimization problem which aim at minimizing a rectilinear tile assembly system (RTAS) that uniquely self-assembles a given rectangular pattern, and is known to be NP-hard. PATS gets practically meaningful when it is parameterized by a constant c such that any given pattern is guaranteed to contain at most c colors (c-PATS). We first investigate simple patterns and properties of minimum RTASs for them. Then based on them, we design a 59-colored pattern to which 3SAT is reduced, and prove that 59-PATS is NP-hard."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.3771","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":"1301.3771","created_at":"2026-05-18T03:36:16.781797+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.3771v1","created_at":"2026-05-18T03:36:16.781797+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3771","created_at":"2026-05-18T03:36:16.781797+00:00"},{"alias_kind":"pith_short_12","alias_value":"OTLHMHZV5KJ5","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OTLHMHZV5KJ57GAC","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OTLHMHZV","created_at":"2026-05-18T12:27:54.935989+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/OTLHMHZV5KJ57GACD4MBSFCBIZ","json":"https://pith.science/pith/OTLHMHZV5KJ57GACD4MBSFCBIZ.json","graph_json":"https://pith.science/api/pith-number/OTLHMHZV5KJ57GACD4MBSFCBIZ/graph.json","events_json":"https://pith.science/api/pith-number/OTLHMHZV5KJ57GACD4MBSFCBIZ/events.json","paper":"https://pith.science/paper/OTLHMHZV"},"agent_actions":{"view_html":"https://pith.science/pith/OTLHMHZV5KJ57GACD4MBSFCBIZ","download_json":"https://pith.science/pith/OTLHMHZV5KJ57GACD4MBSFCBIZ.json","view_paper":"https://pith.science/paper/OTLHMHZV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.3771&json=true","fetch_graph":"https://pith.science/api/pith-number/OTLHMHZV5KJ57GACD4MBSFCBIZ/graph.json","fetch_events":"https://pith.science/api/pith-number/OTLHMHZV5KJ57GACD4MBSFCBIZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OTLHMHZV5KJ57GACD4MBSFCBIZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OTLHMHZV5KJ57GACD4MBSFCBIZ/action/storage_attestation","attest_author":"https://pith.science/pith/OTLHMHZV5KJ57GACD4MBSFCBIZ/action/author_attestation","sign_citation":"https://pith.science/pith/OTLHMHZV5KJ57GACD4MBSFCBIZ/action/citation_signature","submit_replication":"https://pith.science/pith/OTLHMHZV5KJ57GACD4MBSFCBIZ/action/replication_record"}},"created_at":"2026-05-18T03:36:16.781797+00:00","updated_at":"2026-05-18T03:36:16.781797+00:00"}