{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:WFRY3YG6NVRNHE2TNFOS7S5MW6","short_pith_number":"pith:WFRY3YG6","schema_version":"1.0","canonical_sha256":"b1638de0de6d62d39353695d2fcbacb78b6cfc39eab3083e12a2ea8b7ec7196c","source":{"kind":"arxiv","id":"2005.02645","version":1},"attestation_state":"computed","paper":{"title":"Search for developments of a box having multiple ways of folding by SAT solver","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CG"],"primary_cat":"cs.DM","authors_text":"Kazuyuki Amano, Riona Tadaki","submitted_at":"2020-05-06T08:15:07Z","abstract_excerpt":"A polyomino is called a development if it can make a box by folding edges of unit squares forming the polyomino. It is known that there are developments that can fold into a box (or boxes) in multiple ways. In this work, we conducted a computer search for finding such developments by using a SAT solver. As a result, we found thousands of such developments including a polyomino of area 52 that can fold into a box of size $1 \\times 2 \\times 8$ in five different ways."},"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":"2005.02645","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2020-05-06T08:15:07Z","cross_cats_sorted":["cs.AI","cs.CG"],"title_canon_sha256":"48afc6b5a3c8fb032b61ffeffe2eec5879c1ea54fe51a34ec3f0ca4730e1b119","abstract_canon_sha256":"b6eb61ca7d2930a653b4e7e9bc4c850e86c87d243a966036e47ddb5831d4c5fe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:00:54.539448Z","signature_b64":"CMHnWSBosAOFq/Yock70rD/Id7th0vKGyBgFEzFiXxH0Iaus8cMw590TJXosYpusxZY80D+zOFWVuyp3vIeHAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1638de0de6d62d39353695d2fcbacb78b6cfc39eab3083e12a2ea8b7ec7196c","last_reissued_at":"2026-07-05T01:00:54.539045Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:00:54.539045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Search for developments of a box having multiple ways of folding by SAT solver","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CG"],"primary_cat":"cs.DM","authors_text":"Kazuyuki Amano, Riona Tadaki","submitted_at":"2020-05-06T08:15:07Z","abstract_excerpt":"A polyomino is called a development if it can make a box by folding edges of unit squares forming the polyomino. It is known that there are developments that can fold into a box (or boxes) in multiple ways. In this work, we conducted a computer search for finding such developments by using a SAT solver. As a result, we found thousands of such developments including a polyomino of area 52 that can fold into a box of size $1 \\times 2 \\times 8$ in five different ways."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.02645","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2005.02645/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2005.02645","created_at":"2026-07-05T01:00:54.539106+00:00"},{"alias_kind":"arxiv_version","alias_value":"2005.02645v1","created_at":"2026-07-05T01:00:54.539106+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.02645","created_at":"2026-07-05T01:00:54.539106+00:00"},{"alias_kind":"pith_short_12","alias_value":"WFRY3YG6NVRN","created_at":"2026-07-05T01:00:54.539106+00:00"},{"alias_kind":"pith_short_16","alias_value":"WFRY3YG6NVRNHE2T","created_at":"2026-07-05T01:00:54.539106+00:00"},{"alias_kind":"pith_short_8","alias_value":"WFRY3YG6","created_at":"2026-07-05T01:00:54.539106+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.01079","citing_title":"Unfolding Boxes with Local Constraints","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WFRY3YG6NVRNHE2TNFOS7S5MW6","json":"https://pith.science/pith/WFRY3YG6NVRNHE2TNFOS7S5MW6.json","graph_json":"https://pith.science/api/pith-number/WFRY3YG6NVRNHE2TNFOS7S5MW6/graph.json","events_json":"https://pith.science/api/pith-number/WFRY3YG6NVRNHE2TNFOS7S5MW6/events.json","paper":"https://pith.science/paper/WFRY3YG6"},"agent_actions":{"view_html":"https://pith.science/pith/WFRY3YG6NVRNHE2TNFOS7S5MW6","download_json":"https://pith.science/pith/WFRY3YG6NVRNHE2TNFOS7S5MW6.json","view_paper":"https://pith.science/paper/WFRY3YG6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2005.02645&json=true","fetch_graph":"https://pith.science/api/pith-number/WFRY3YG6NVRNHE2TNFOS7S5MW6/graph.json","fetch_events":"https://pith.science/api/pith-number/WFRY3YG6NVRNHE2TNFOS7S5MW6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WFRY3YG6NVRNHE2TNFOS7S5MW6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WFRY3YG6NVRNHE2TNFOS7S5MW6/action/storage_attestation","attest_author":"https://pith.science/pith/WFRY3YG6NVRNHE2TNFOS7S5MW6/action/author_attestation","sign_citation":"https://pith.science/pith/WFRY3YG6NVRNHE2TNFOS7S5MW6/action/citation_signature","submit_replication":"https://pith.science/pith/WFRY3YG6NVRNHE2TNFOS7S5MW6/action/replication_record"}},"created_at":"2026-07-05T01:00:54.539106+00:00","updated_at":"2026-07-05T01:00:54.539106+00:00"}