{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:CKYZANY6TWRF33W5FLTZA7T66G","short_pith_number":"pith:CKYZANY6","canonical_record":{"source":{"id":"1409.1619","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-09-04T21:29:02Z","cross_cats_sorted":[],"title_canon_sha256":"59c3ad125c0d0a3d5ecd61e76f86ca3e38c9af54ec539eef90df34faf218a0fb","abstract_canon_sha256":"a9979f468f2290403700b10d8d1268e63c67ac2bafa4dc85a5238fdbb1bc2b07"},"schema_version":"1.0"},"canonical_sha256":"12b190371e9da25deedd2ae7907e7ef1ac7a3659d26ce8b341cf667b3b59393d","source":{"kind":"arxiv","id":"1409.1619","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.1619","created_at":"2026-05-18T02:43:25Z"},{"alias_kind":"arxiv_version","alias_value":"1409.1619v1","created_at":"2026-05-18T02:43:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.1619","created_at":"2026-05-18T02:43:25Z"},{"alias_kind":"pith_short_12","alias_value":"CKYZANY6TWRF","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"CKYZANY6TWRF33W5","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"CKYZANY6","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:CKYZANY6TWRF33W5FLTZA7T66G","target":"record","payload":{"canonical_record":{"source":{"id":"1409.1619","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-09-04T21:29:02Z","cross_cats_sorted":[],"title_canon_sha256":"59c3ad125c0d0a3d5ecd61e76f86ca3e38c9af54ec539eef90df34faf218a0fb","abstract_canon_sha256":"a9979f468f2290403700b10d8d1268e63c67ac2bafa4dc85a5238fdbb1bc2b07"},"schema_version":"1.0"},"canonical_sha256":"12b190371e9da25deedd2ae7907e7ef1ac7a3659d26ce8b341cf667b3b59393d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:25.653727Z","signature_b64":"j1IDU4gngxynoBmIPuoBqAHtMf2efH8AmdT5yUU7ynBZfgzsUYnxrj9l3jX4urcJlEtHW4t/oaUNfY66gUkXBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12b190371e9da25deedd2ae7907e7ef1ac7a3659d26ce8b341cf667b3b59393d","last_reissued_at":"2026-05-18T02:43:25.653001Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:25.653001Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.1619","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:43:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hIEyEtSU2LJi1ojgwEBo2ctEcEb91IhTKJQCvyQ194sQa1rJL0eqiajQnFTeQ/MTRVKtMwV3dnrolZ4WaRsgAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:47:27.159769Z"},"content_sha256":"e9bbbd5b63f0fc535532739c00f7dbf234562218af0f14fcee192c487644a31a","schema_version":"1.0","event_id":"sha256:e9bbbd5b63f0fc535532739c00f7dbf234562218af0f14fcee192c487644a31a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:CKYZANY6TWRF33W5FLTZA7T66G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tile set synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Aleck Johnsen, Ming-Yang Kao, Shinnosuke Seki","submitted_at":"2014-09-04T21:29:02Z","abstract_excerpt":"Patterned self-assembly tile set synthesis (PATS) aims at finding a minimum tile set to uniquely self-assemble a given rectangular (color) pattern. For k >= 1, k-PATS is a variant of PATS that restricts input patterns to those with at most $k$ colors. A computer-assisted proof has been recently proposed for 2-PATS by Kari et al. [arXiv:1404.0967 (2014)]. In contrast, the best known manually-checkable proof is for the NP-hardness of 29-PATS by Johnsen, Kao, and Seki [ISAAC 2013, LNCS 8283, pp.~699-710]. We propose a manually-checkable proof for the NP-hardness of 11-PATS."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.1619","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:43:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1cE2zzuQuKLloM7evcSiaVPTkLwQZk7gC7IiUI/qtGwEKyh4m6J4LOddituChL+F6PKCxH3NZLf2R8wXyF8JAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:47:27.160190Z"},"content_sha256":"a65990844d1912098538fe28c0667f5d4a0633d7feef8ad0677324c3cfcbbefd","schema_version":"1.0","event_id":"sha256:a65990844d1912098538fe28c0667f5d4a0633d7feef8ad0677324c3cfcbbefd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CKYZANY6TWRF33W5FLTZA7T66G/bundle.json","state_url":"https://pith.science/pith/CKYZANY6TWRF33W5FLTZA7T66G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CKYZANY6TWRF33W5FLTZA7T66G/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T08:47:27Z","links":{"resolver":"https://pith.science/pith/CKYZANY6TWRF33W5FLTZA7T66G","bundle":"https://pith.science/pith/CKYZANY6TWRF33W5FLTZA7T66G/bundle.json","state":"https://pith.science/pith/CKYZANY6TWRF33W5FLTZA7T66G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CKYZANY6TWRF33W5FLTZA7T66G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:CKYZANY6TWRF33W5FLTZA7T66G","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a9979f468f2290403700b10d8d1268e63c67ac2bafa4dc85a5238fdbb1bc2b07","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-09-04T21:29:02Z","title_canon_sha256":"59c3ad125c0d0a3d5ecd61e76f86ca3e38c9af54ec539eef90df34faf218a0fb"},"schema_version":"1.0","source":{"id":"1409.1619","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.1619","created_at":"2026-05-18T02:43:25Z"},{"alias_kind":"arxiv_version","alias_value":"1409.1619v1","created_at":"2026-05-18T02:43:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.1619","created_at":"2026-05-18T02:43:25Z"},{"alias_kind":"pith_short_12","alias_value":"CKYZANY6TWRF","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"CKYZANY6TWRF33W5","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"CKYZANY6","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:a65990844d1912098538fe28c0667f5d4a0633d7feef8ad0677324c3cfcbbefd","target":"graph","created_at":"2026-05-18T02:43:25Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Patterned self-assembly tile set synthesis (PATS) aims at finding a minimum tile set to uniquely self-assemble a given rectangular (color) pattern. For k >= 1, k-PATS is a variant of PATS that restricts input patterns to those with at most $k$ colors. A computer-assisted proof has been recently proposed for 2-PATS by Kari et al. [arXiv:1404.0967 (2014)]. In contrast, the best known manually-checkable proof is for the NP-hardness of 29-PATS by Johnsen, Kao, and Seki [ISAAC 2013, LNCS 8283, pp.~699-710]. We propose a manually-checkable proof for the NP-hardness of 11-PATS.","authors_text":"Aleck Johnsen, Ming-Yang Kao, Shinnosuke Seki","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-09-04T21:29:02Z","title":"A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tile set synthesis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.1619","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e9bbbd5b63f0fc535532739c00f7dbf234562218af0f14fcee192c487644a31a","target":"record","created_at":"2026-05-18T02:43:25Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a9979f468f2290403700b10d8d1268e63c67ac2bafa4dc85a5238fdbb1bc2b07","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-09-04T21:29:02Z","title_canon_sha256":"59c3ad125c0d0a3d5ecd61e76f86ca3e38c9af54ec539eef90df34faf218a0fb"},"schema_version":"1.0","source":{"id":"1409.1619","kind":"arxiv","version":1}},"canonical_sha256":"12b190371e9da25deedd2ae7907e7ef1ac7a3659d26ce8b341cf667b3b59393d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"12b190371e9da25deedd2ae7907e7ef1ac7a3659d26ce8b341cf667b3b59393d","first_computed_at":"2026-05-18T02:43:25.653001Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:43:25.653001Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j1IDU4gngxynoBmIPuoBqAHtMf2efH8AmdT5yUU7ynBZfgzsUYnxrj9l3jX4urcJlEtHW4t/oaUNfY66gUkXBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:43:25.653727Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.1619","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e9bbbd5b63f0fc535532739c00f7dbf234562218af0f14fcee192c487644a31a","sha256:a65990844d1912098538fe28c0667f5d4a0633d7feef8ad0677324c3cfcbbefd"],"state_sha256":"889b8bd260660bf6b1b5481800c916b90a0c2a6a7ae8d08dce9203747b56a29d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"42yhsYvCWbvVgpCqB5Y9Ia1OcSpa1jW8ffBjptTR6Ck7o6o8sp8kReA8VZca/OUeH8v1REGFyb9a3XPC0CmQAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T08:47:27.162452Z","bundle_sha256":"532c7c8d19d0bfe2ca5c38f5802328014739d516d86cdf0c2e52540658a9af7e"}}