{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:IRQCS7KZTAWLWLID5BVY3562AW","short_pith_number":"pith:IRQCS7KZ","schema_version":"1.0","canonical_sha256":"4460297d59982cbb2d03e86b8df7da058f15d96624b51b5b8ee4a55890448f12","source":{"kind":"arxiv","id":"1512.06706","version":1},"attestation_state":"computed","paper":{"title":"Dissection with the Fewest Pieces is Hard, Even to Approximate","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Anak Yodpinyanee, Erik D. Demaine, Jayson Lynch, Jeffrey Bosboom, Martin L. Demaine, Mikhail Rudoy, Pasin Manurangsi","submitted_at":"2015-12-21T17:06:29Z","abstract_excerpt":"We prove that it is NP-hard to dissect one simple orthogonal polygon into another using a given number of pieces, as is approximating the fewest pieces to within a factor of $1+1/1080-\\varepsilon$."},"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":"1512.06706","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-12-21T17:06:29Z","cross_cats_sorted":[],"title_canon_sha256":"9fd4dc1196ac7f03e71a68e1b9d38061cd7be9b517fce8288cb52630e7f60e13","abstract_canon_sha256":"5c83f7b9909b1f13b0883c453b17fbaa755e55de81c4069b54699a85b0707ae5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:59.875007Z","signature_b64":"c7aBLNw3p9+x7YPH5yMtMaJZXQTPH5fOVa/7rKtFC5J5k7+qOOfyYvmJFJTjIzV6F7K4dcRBo7e4SR43J4n7Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4460297d59982cbb2d03e86b8df7da058f15d96624b51b5b8ee4a55890448f12","last_reissued_at":"2026-05-18T01:23:59.874164Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:59.874164Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dissection with the Fewest Pieces is Hard, Even to Approximate","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Anak Yodpinyanee, Erik D. Demaine, Jayson Lynch, Jeffrey Bosboom, Martin L. Demaine, Mikhail Rudoy, Pasin Manurangsi","submitted_at":"2015-12-21T17:06:29Z","abstract_excerpt":"We prove that it is NP-hard to dissect one simple orthogonal polygon into another using a given number of pieces, as is approximating the fewest pieces to within a factor of $1+1/1080-\\varepsilon$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.06706","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":"1512.06706","created_at":"2026-05-18T01:23:59.874293+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.06706v1","created_at":"2026-05-18T01:23:59.874293+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.06706","created_at":"2026-05-18T01:23:59.874293+00:00"},{"alias_kind":"pith_short_12","alias_value":"IRQCS7KZTAWL","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"IRQCS7KZTAWLWLID","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"IRQCS7KZ","created_at":"2026-05-18T12:29:25.134429+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/IRQCS7KZTAWLWLID5BVY3562AW","json":"https://pith.science/pith/IRQCS7KZTAWLWLID5BVY3562AW.json","graph_json":"https://pith.science/api/pith-number/IRQCS7KZTAWLWLID5BVY3562AW/graph.json","events_json":"https://pith.science/api/pith-number/IRQCS7KZTAWLWLID5BVY3562AW/events.json","paper":"https://pith.science/paper/IRQCS7KZ"},"agent_actions":{"view_html":"https://pith.science/pith/IRQCS7KZTAWLWLID5BVY3562AW","download_json":"https://pith.science/pith/IRQCS7KZTAWLWLID5BVY3562AW.json","view_paper":"https://pith.science/paper/IRQCS7KZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.06706&json=true","fetch_graph":"https://pith.science/api/pith-number/IRQCS7KZTAWLWLID5BVY3562AW/graph.json","fetch_events":"https://pith.science/api/pith-number/IRQCS7KZTAWLWLID5BVY3562AW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IRQCS7KZTAWLWLID5BVY3562AW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IRQCS7KZTAWLWLID5BVY3562AW/action/storage_attestation","attest_author":"https://pith.science/pith/IRQCS7KZTAWLWLID5BVY3562AW/action/author_attestation","sign_citation":"https://pith.science/pith/IRQCS7KZTAWLWLID5BVY3562AW/action/citation_signature","submit_replication":"https://pith.science/pith/IRQCS7KZTAWLWLID5BVY3562AW/action/replication_record"}},"created_at":"2026-05-18T01:23:59.874293+00:00","updated_at":"2026-05-18T01:23:59.874293+00:00"}