{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:R35EX66UTXFSS7BUZPMXT2RYFD","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":"f1ce07dea28f6226b8de39ff74fc743a0822a8aae744b5a55b4776e792838518","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-12-31T17:05:53Z","title_canon_sha256":"4dc1517e6bf0b1edc05e90d77a97bbd560e34bc42671037beb1db77856e473eb"},"schema_version":"1.0","source":{"id":"1701.00146","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.00146","created_at":"2026-05-18T00:53:36Z"},{"alias_kind":"arxiv_version","alias_value":"1701.00146v1","created_at":"2026-05-18T00:53:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.00146","created_at":"2026-05-18T00:53:36Z"},{"alias_kind":"pith_short_12","alias_value":"R35EX66UTXFS","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"R35EX66UTXFSS7BU","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"R35EX66U","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:e1bc5c641b8037aae67ba57f0d58e7bf4d2fabe5a514f2d463c1562ed979ae5f","target":"graph","created_at":"2026-05-18T00:53:36Z","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":"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","authors_text":"Adam Hesterberg, Anak Yodpinyanee, Erik D. Demaine, Jeffrey Bosboom, Martin L. Demaine, Pasin Manurangsi","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-12-31T17:05:53Z","title":"Even $1 \\times n$ Edge-Matching and Jigsaw Puzzles are Really Hard"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.00146","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:da8d126a2b3310817e06ded87e757076c5743605dbe3d86b2ef0c9a3f9f95d66","target":"record","created_at":"2026-05-18T00:53:36Z","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":"f1ce07dea28f6226b8de39ff74fc743a0822a8aae744b5a55b4776e792838518","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-12-31T17:05:53Z","title_canon_sha256":"4dc1517e6bf0b1edc05e90d77a97bbd560e34bc42671037beb1db77856e473eb"},"schema_version":"1.0","source":{"id":"1701.00146","kind":"arxiv","version":1}},"canonical_sha256":"8efa4bfbd49dcb297c34cbd979ea3828c97248cba32095510310037920eebeff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8efa4bfbd49dcb297c34cbd979ea3828c97248cba32095510310037920eebeff","first_computed_at":"2026-05-18T00:53:36.248412Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:36.248412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8zNKkeAdfOMg+cdYOeRI6bSTlgw+d61R8+5j9D91VGdnAC8QXLJz6Gr2cdNCwMtUZFs6Ee8nxr3fv5+dmYPiAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:36.248813Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.00146","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da8d126a2b3310817e06ded87e757076c5743605dbe3d86b2ef0c9a3f9f95d66","sha256:e1bc5c641b8037aae67ba57f0d58e7bf4d2fabe5a514f2d463c1562ed979ae5f"],"state_sha256":"eb279b01499480d21bcb030bd5a273f6d40d0a95e89c2162ac8225b1adb8b326"}