{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7WAS7S2LJ4CULV4UXU6EZSLLIE","short_pith_number":"pith:7WAS7S2L","schema_version":"1.0","canonical_sha256":"fd812fcb4b4f0545d794bd3c4cc96b41206c29b324f0869a60263cd95f8f3062","source":{"kind":"arxiv","id":"1703.02671","version":2},"attestation_state":"computed","paper":{"title":"Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Andr\\'e van Renssen, Erik D. Demaine, Jason S. Ku, Joseph S. B. Mitchell, Marcel Roeloffzen, Matias Korman, Ryuhei Uehara, Yota Otachi, Yushi Uno","submitted_at":"2017-03-08T02:12:35Z","abstract_excerpt":"We study the complexity of symmetric assembly puzzles: given a collection of simple polygons, can we translate, rotate, and possibly flip them so that their interior-disjoint union is line symmetric? On the negative side, we show that the problem is strongly NP-complete even if the pieces are all polyominos. On the positive side, we show that the problem can be solved in polynomial time if the number of pieces is a fixed constant."},"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":"1703.02671","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-03-08T02:12:35Z","cross_cats_sorted":[],"title_canon_sha256":"d1faf7059d5c219bc96786701f0f90d293efb0a0a338db458c1ba879edcc4530","abstract_canon_sha256":"779a12070f4c020c3dc95885e6674f7543b11e356ba4467809ef554dee3359a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:12.127685Z","signature_b64":"elNQR+LzGRc2WKren/maaqiGiVT2Pmz8gsh1ikzKomcYMfDtjaAuOmy0K8gjGOrK75hcqPMFBDQznURAeYtCDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd812fcb4b4f0545d794bd3c4cc96b41206c29b324f0869a60263cd95f8f3062","last_reissued_at":"2026-05-17T23:49:12.127075Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:12.127075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Andr\\'e van Renssen, Erik D. Demaine, Jason S. Ku, Joseph S. B. Mitchell, Marcel Roeloffzen, Matias Korman, Ryuhei Uehara, Yota Otachi, Yushi Uno","submitted_at":"2017-03-08T02:12:35Z","abstract_excerpt":"We study the complexity of symmetric assembly puzzles: given a collection of simple polygons, can we translate, rotate, and possibly flip them so that their interior-disjoint union is line symmetric? On the negative side, we show that the problem is strongly NP-complete even if the pieces are all polyominos. On the positive side, we show that the problem can be solved in polynomial time if the number of pieces is a fixed constant."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.02671","kind":"arxiv","version":2},"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":"1703.02671","created_at":"2026-05-17T23:49:12.127145+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.02671v2","created_at":"2026-05-17T23:49:12.127145+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.02671","created_at":"2026-05-17T23:49:12.127145+00:00"},{"alias_kind":"pith_short_12","alias_value":"7WAS7S2LJ4CU","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7WAS7S2LJ4CULV4U","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7WAS7S2L","created_at":"2026-05-18T12:31:05.417338+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/7WAS7S2LJ4CULV4UXU6EZSLLIE","json":"https://pith.science/pith/7WAS7S2LJ4CULV4UXU6EZSLLIE.json","graph_json":"https://pith.science/api/pith-number/7WAS7S2LJ4CULV4UXU6EZSLLIE/graph.json","events_json":"https://pith.science/api/pith-number/7WAS7S2LJ4CULV4UXU6EZSLLIE/events.json","paper":"https://pith.science/paper/7WAS7S2L"},"agent_actions":{"view_html":"https://pith.science/pith/7WAS7S2LJ4CULV4UXU6EZSLLIE","download_json":"https://pith.science/pith/7WAS7S2LJ4CULV4UXU6EZSLLIE.json","view_paper":"https://pith.science/paper/7WAS7S2L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.02671&json=true","fetch_graph":"https://pith.science/api/pith-number/7WAS7S2LJ4CULV4UXU6EZSLLIE/graph.json","fetch_events":"https://pith.science/api/pith-number/7WAS7S2LJ4CULV4UXU6EZSLLIE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7WAS7S2LJ4CULV4UXU6EZSLLIE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7WAS7S2LJ4CULV4UXU6EZSLLIE/action/storage_attestation","attest_author":"https://pith.science/pith/7WAS7S2LJ4CULV4UXU6EZSLLIE/action/author_attestation","sign_citation":"https://pith.science/pith/7WAS7S2LJ4CULV4UXU6EZSLLIE/action/citation_signature","submit_replication":"https://pith.science/pith/7WAS7S2LJ4CULV4UXU6EZSLLIE/action/replication_record"}},"created_at":"2026-05-17T23:49:12.127145+00:00","updated_at":"2026-05-17T23:49:12.127145+00:00"}