{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:MSDIMIGMK2QX7UY64NWS4EWWYF","short_pith_number":"pith:MSDIMIGM","schema_version":"1.0","canonical_sha256":"64868620cc56a17fd31ee36d2e12d6c15eb2c7e39446fbe9c599de3635f6798a","source":{"kind":"arxiv","id":"1209.5307","version":1},"attestation_state":"computed","paper":{"title":"Packing identical simple polygons is NP-hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"John Iacono, Sarah R. Allen","submitted_at":"2012-09-24T15:43:11Z","abstract_excerpt":"Given a small polygon S, a big simple polygon B and a positive integer k, it is shown to be NP-hard to determine whether k copies of the small polygon (allowing translation and rotation) can be placed in the big polygon without overlap. Previous NP-hardness results were only known in the case where the big polygon is allowed to be non-simple. A novel reduction from Planar-Circuit-SAT is presented where a small polygon is constructed to encode the entire circuit."},"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":"1209.5307","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-09-24T15:43:11Z","cross_cats_sorted":[],"title_canon_sha256":"776c9742ea1b4924756f72512dc1a4db78600859df9794168d32ef605115f5f8","abstract_canon_sha256":"66aafa7cf2669ad6fb39c1d70bf38f8b6833f6536293de9094ac5e9e700b99ea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:58.540850Z","signature_b64":"Skcrmuo/+5sr06FMbdkw5czK6989X7m0XGuYdQKCcVO2Z1a/+nDLiGHH6DuTzVR2l7qxEJG9lIrnnmpNNmUnAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64868620cc56a17fd31ee36d2e12d6c15eb2c7e39446fbe9c599de3635f6798a","last_reissued_at":"2026-05-18T03:44:58.540090Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:58.540090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Packing identical simple polygons is NP-hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"John Iacono, Sarah R. Allen","submitted_at":"2012-09-24T15:43:11Z","abstract_excerpt":"Given a small polygon S, a big simple polygon B and a positive integer k, it is shown to be NP-hard to determine whether k copies of the small polygon (allowing translation and rotation) can be placed in the big polygon without overlap. Previous NP-hardness results were only known in the case where the big polygon is allowed to be non-simple. A novel reduction from Planar-Circuit-SAT is presented where a small polygon is constructed to encode the entire circuit."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.5307","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":"1209.5307","created_at":"2026-05-18T03:44:58.540207+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.5307v1","created_at":"2026-05-18T03:44:58.540207+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.5307","created_at":"2026-05-18T03:44:58.540207+00:00"},{"alias_kind":"pith_short_12","alias_value":"MSDIMIGMK2QX","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"MSDIMIGMK2QX7UY6","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"MSDIMIGM","created_at":"2026-05-18T12:27:14.488303+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/MSDIMIGMK2QX7UY64NWS4EWWYF","json":"https://pith.science/pith/MSDIMIGMK2QX7UY64NWS4EWWYF.json","graph_json":"https://pith.science/api/pith-number/MSDIMIGMK2QX7UY64NWS4EWWYF/graph.json","events_json":"https://pith.science/api/pith-number/MSDIMIGMK2QX7UY64NWS4EWWYF/events.json","paper":"https://pith.science/paper/MSDIMIGM"},"agent_actions":{"view_html":"https://pith.science/pith/MSDIMIGMK2QX7UY64NWS4EWWYF","download_json":"https://pith.science/pith/MSDIMIGMK2QX7UY64NWS4EWWYF.json","view_paper":"https://pith.science/paper/MSDIMIGM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.5307&json=true","fetch_graph":"https://pith.science/api/pith-number/MSDIMIGMK2QX7UY64NWS4EWWYF/graph.json","fetch_events":"https://pith.science/api/pith-number/MSDIMIGMK2QX7UY64NWS4EWWYF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MSDIMIGMK2QX7UY64NWS4EWWYF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MSDIMIGMK2QX7UY64NWS4EWWYF/action/storage_attestation","attest_author":"https://pith.science/pith/MSDIMIGMK2QX7UY64NWS4EWWYF/action/author_attestation","sign_citation":"https://pith.science/pith/MSDIMIGMK2QX7UY64NWS4EWWYF/action/citation_signature","submit_replication":"https://pith.science/pith/MSDIMIGMK2QX7UY64NWS4EWWYF/action/replication_record"}},"created_at":"2026-05-18T03:44:58.540207+00:00","updated_at":"2026-05-18T03:44:58.540207+00:00"}