{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:OTLHMHZV5KJ57GACD4MBSFCBIZ","short_pith_number":"pith:OTLHMHZV","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"},"canonical_sha256":"74d6761f35ea93df98021f181914414677dd91204072d77c0464e05c7a7cb79c","source":{"kind":"arxiv","id":"1301.3771","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.3771","created_at":"2026-05-18T03:36:16Z"},{"alias_kind":"arxiv_version","alias_value":"1301.3771v1","created_at":"2026-05-18T03:36:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3771","created_at":"2026-05-18T03:36:16Z"},{"alias_kind":"pith_short_12","alias_value":"OTLHMHZV5KJ5","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OTLHMHZV5KJ57GAC","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OTLHMHZV","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:OTLHMHZV5KJ57GACD4MBSFCBIZ","target":"record","payload":{"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"},"canonical_sha256":"74d6761f35ea93df98021f181914414677dd91204072d77c0464e05c7a7cb79c","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"},"source_kind":"arxiv","source_id":"1301.3771","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-18T03:36:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dwMN00k4lSQxcCEdrN9WI3OgCsEI6mzpGoKbG3hJz8n9pVZIu4cLyiy5OK0kilpu0NUk3CrinAR/ByJFbcmuDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:49:05.387336Z"},"content_sha256":"1779a919ababb9643b7f6e598e9cdf1134120af8f8c1ab8f6a833dd8d1c59dee","schema_version":"1.0","event_id":"sha256:1779a919ababb9643b7f6e598e9cdf1134120af8f8c1ab8f6a833dd8d1c59dee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:OTLHMHZV5KJ57GACD4MBSFCBIZ","target":"graph","payload":{"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"},"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-18T03:36:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MEDS29bi827zWCUTuzY+m1VR42FQpEmsnb/FyNAFFS/mjCz3pae37joqt38snZLeLp11bSpvdSsXr++9/hT0DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:49:05.387970Z"},"content_sha256":"7b632ecfd468337e23ed8a656690bc222e763bd8ad4f03d5a448882a62da0f43","schema_version":"1.0","event_id":"sha256:7b632ecfd468337e23ed8a656690bc222e763bd8ad4f03d5a448882a62da0f43"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OTLHMHZV5KJ57GACD4MBSFCBIZ/bundle.json","state_url":"https://pith.science/pith/OTLHMHZV5KJ57GACD4MBSFCBIZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OTLHMHZV5KJ57GACD4MBSFCBIZ/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-30T18:49:05Z","links":{"resolver":"https://pith.science/pith/OTLHMHZV5KJ57GACD4MBSFCBIZ","bundle":"https://pith.science/pith/OTLHMHZV5KJ57GACD4MBSFCBIZ/bundle.json","state":"https://pith.science/pith/OTLHMHZV5KJ57GACD4MBSFCBIZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OTLHMHZV5KJ57GACD4MBSFCBIZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:OTLHMHZV5KJ57GACD4MBSFCBIZ","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":"b69508070d45530e98e8d546f46d4b7532cc0d803545ea5d2cd918d17ab40b1c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-01-16T18:02:07Z","title_canon_sha256":"e3cf20ba0d23bac00ee7e1577111fb973a1db4cc4e7986874ccd8673c06b3577"},"schema_version":"1.0","source":{"id":"1301.3771","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.3771","created_at":"2026-05-18T03:36:16Z"},{"alias_kind":"arxiv_version","alias_value":"1301.3771v1","created_at":"2026-05-18T03:36:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3771","created_at":"2026-05-18T03:36:16Z"},{"alias_kind":"pith_short_12","alias_value":"OTLHMHZV5KJ5","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OTLHMHZV5KJ57GAC","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OTLHMHZV","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:7b632ecfd468337e23ed8a656690bc222e763bd8ad4f03d5a448882a62da0f43","target":"graph","created_at":"2026-05-18T03:36:16Z","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":"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.","authors_text":"Shinnosuke Seki","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-01-16T18:02:07Z","title":"Combinatorial Optimization in Pattern Assembly"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.3771","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:1779a919ababb9643b7f6e598e9cdf1134120af8f8c1ab8f6a833dd8d1c59dee","target":"record","created_at":"2026-05-18T03:36:16Z","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":"b69508070d45530e98e8d546f46d4b7532cc0d803545ea5d2cd918d17ab40b1c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-01-16T18:02:07Z","title_canon_sha256":"e3cf20ba0d23bac00ee7e1577111fb973a1db4cc4e7986874ccd8673c06b3577"},"schema_version":"1.0","source":{"id":"1301.3771","kind":"arxiv","version":1}},"canonical_sha256":"74d6761f35ea93df98021f181914414677dd91204072d77c0464e05c7a7cb79c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"74d6761f35ea93df98021f181914414677dd91204072d77c0464e05c7a7cb79c","first_computed_at":"2026-05-18T03:36:16.781647Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:16.781647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c4cV8sCdztZQyxurGbWWsO5qs83m8pgJAe8NOoKQqrkZs14tt+9fjphk/MHUs2PKlBqk47MS/aeSUjFkPbkcAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:16.782416Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.3771","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1779a919ababb9643b7f6e598e9cdf1134120af8f8c1ab8f6a833dd8d1c59dee","sha256:7b632ecfd468337e23ed8a656690bc222e763bd8ad4f03d5a448882a62da0f43"],"state_sha256":"e46b5c50d13018f950351b3fb5f7628200666b5908217b071fdb1ec8fd89e58f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XYpBS24o1HGV4/MTGYek0t6R/omO0PoAvT4rHmv8VcQeq/XMQ8mY2NkhZxKA6E+XtBAHRZ93dqtBHvRqvjYLAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T18:49:05.391541Z","bundle_sha256":"d0b65eed84e87ac3d4b27cf2412a5d5d054f70c77b17bbe172062510b4b7a27f"}}