{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:R35EX66UTXFSS7BUZPMXT2RYFD","short_pith_number":"pith:R35EX66U","schema_version":"1.0","canonical_sha256":"8efa4bfbd49dcb297c34cbd979ea3828c97248cba32095510310037920eebeff","source":{"kind":"arxiv","id":"1701.00146","version":1},"attestation_state":"computed","paper":{"title":"Even $1 \\times n$ Edge-Matching and Jigsaw Puzzles are Really Hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.CC","authors_text":"Adam Hesterberg, Anak Yodpinyanee, Erik D. Demaine, Jeffrey Bosboom, Martin L. Demaine, Pasin Manurangsi","submitted_at":"2016-12-31T17:05:53Z","abstract_excerpt":"We prove the computational intractability of rotating and placing $n$ square tiles into a $1 \\times n$ array such that adjacent tiles are compatible--either equal edge colors, as in edge-matching puzzles, or matching tab/pocket shapes, as in jigsaw puzzles. Beyond basic NP-hardness, we prove that it is NP-hard even to approximately maximize the number of placed tiles (allowing blanks), while satisfying the compatibility constraint between nonblank tiles, within a factor of 0.9999999851. (On the other hand, there is an easy $1 \\over 2$-approximation.) This is the first (correct) proof of inappr"},"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":"1701.00146","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-12-31T17:05:53Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"4dc1517e6bf0b1edc05e90d77a97bbd560e34bc42671037beb1db77856e473eb","abstract_canon_sha256":"f1ce07dea28f6226b8de39ff74fc743a0822a8aae744b5a55b4776e792838518"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:36.248813Z","signature_b64":"8zNKkeAdfOMg+cdYOeRI6bSTlgw+d61R8+5j9D91VGdnAC8QXLJz6Gr2cdNCwMtUZFs6Ee8nxr3fv5+dmYPiAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8efa4bfbd49dcb297c34cbd979ea3828c97248cba32095510310037920eebeff","last_reissued_at":"2026-05-18T00:53:36.248412Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:36.248412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Even $1 \\times n$ Edge-Matching and Jigsaw Puzzles are Really Hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.CC","authors_text":"Adam Hesterberg, Anak Yodpinyanee, Erik D. Demaine, Jeffrey Bosboom, Martin L. Demaine, Pasin Manurangsi","submitted_at":"2016-12-31T17:05:53Z","abstract_excerpt":"We prove the computational intractability of rotating and placing $n$ square tiles into a $1 \\times n$ array such that adjacent tiles are compatible--either equal edge colors, as in edge-matching puzzles, or matching tab/pocket shapes, as in jigsaw puzzles. Beyond basic NP-hardness, we prove that it is NP-hard even to approximately maximize the number of placed tiles (allowing blanks), while satisfying the compatibility constraint between nonblank tiles, within a factor of 0.9999999851. (On the other hand, there is an easy $1 \\over 2$-approximation.) This is the first (correct) proof of inappr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.00146","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":"1701.00146","created_at":"2026-05-18T00:53:36.248480+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.00146v1","created_at":"2026-05-18T00:53:36.248480+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.00146","created_at":"2026-05-18T00:53:36.248480+00:00"},{"alias_kind":"pith_short_12","alias_value":"R35EX66UTXFS","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"R35EX66UTXFSS7BU","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"R35EX66U","created_at":"2026-05-18T12:30:41.710351+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/R35EX66UTXFSS7BUZPMXT2RYFD","json":"https://pith.science/pith/R35EX66UTXFSS7BUZPMXT2RYFD.json","graph_json":"https://pith.science/api/pith-number/R35EX66UTXFSS7BUZPMXT2RYFD/graph.json","events_json":"https://pith.science/api/pith-number/R35EX66UTXFSS7BUZPMXT2RYFD/events.json","paper":"https://pith.science/paper/R35EX66U"},"agent_actions":{"view_html":"https://pith.science/pith/R35EX66UTXFSS7BUZPMXT2RYFD","download_json":"https://pith.science/pith/R35EX66UTXFSS7BUZPMXT2RYFD.json","view_paper":"https://pith.science/paper/R35EX66U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.00146&json=true","fetch_graph":"https://pith.science/api/pith-number/R35EX66UTXFSS7BUZPMXT2RYFD/graph.json","fetch_events":"https://pith.science/api/pith-number/R35EX66UTXFSS7BUZPMXT2RYFD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R35EX66UTXFSS7BUZPMXT2RYFD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R35EX66UTXFSS7BUZPMXT2RYFD/action/storage_attestation","attest_author":"https://pith.science/pith/R35EX66UTXFSS7BUZPMXT2RYFD/action/author_attestation","sign_citation":"https://pith.science/pith/R35EX66UTXFSS7BUZPMXT2RYFD/action/citation_signature","submit_replication":"https://pith.science/pith/R35EX66UTXFSS7BUZPMXT2RYFD/action/replication_record"}},"created_at":"2026-05-18T00:53:36.248480+00:00","updated_at":"2026-05-18T00:53:36.248480+00:00"}