{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:XYDSLG23XQVB6QM4FSJL7F24LW","short_pith_number":"pith:XYDSLG23","schema_version":"1.0","canonical_sha256":"be07259b5bbc2a1f419c2c92bf975c5db962f52054c457196119ce909655003e","source":{"kind":"arxiv","id":"1803.03302","version":1},"attestation_state":"computed","paper":{"title":"Super Compaction and Pluripotent Shape Transformation via Algorithmic Stacking for 3D Deployable Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Huangxin Wang, In-Suk Choi, Jyh-Ming Lien, Young-Chang Joo, Young-Joo Lee, Yue Hao, Yu-Ki Lee, Yun-hyeong Kim, Zhonghua Xi","submitted_at":"2018-03-08T20:54:21Z","abstract_excerpt":"Origami structures enabled by folding and unfolding can create complex 3D shapes. However, even a small 3D shape can have large 2D unfoldings. The huge initial dimension of the 2D flattened structure makes fabrication difficult, and defeats the main purpose, namely compactness, of many origami-inspired engineering. In this work, we propose a novel algorithmic kirigami method that provides super compaction of an arbitrary 3D shape with non-negligible surface thickness called \"algorithmic stacking\". Our approach computationally finds a way of cutting the thick surface of the shape into a strip. "},"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":"1803.03302","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-08T20:54:21Z","cross_cats_sorted":[],"title_canon_sha256":"dacb2e615060cadc8dd8e6893b6c40d0942cf182afc8d00dac6be9a0b71fe3b3","abstract_canon_sha256":"8b7634340fa4b84905d332127730415b1015daa8bfc7ca50297382db6a392f63"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:40.036629Z","signature_b64":"fAodnW2HiVtQl9eVOpMlp4tyjpP2fTCEeBNAjkvi5tdvMwoArHBwdrUug64MrQJJoMDDtHVgRT3S9JQAwY6XDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be07259b5bbc2a1f419c2c92bf975c5db962f52054c457196119ce909655003e","last_reissued_at":"2026-05-18T00:21:40.036056Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:40.036056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Super Compaction and Pluripotent Shape Transformation via Algorithmic Stacking for 3D Deployable Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Huangxin Wang, In-Suk Choi, Jyh-Ming Lien, Young-Chang Joo, Young-Joo Lee, Yue Hao, Yu-Ki Lee, Yun-hyeong Kim, Zhonghua Xi","submitted_at":"2018-03-08T20:54:21Z","abstract_excerpt":"Origami structures enabled by folding and unfolding can create complex 3D shapes. However, even a small 3D shape can have large 2D unfoldings. The huge initial dimension of the 2D flattened structure makes fabrication difficult, and defeats the main purpose, namely compactness, of many origami-inspired engineering. In this work, we propose a novel algorithmic kirigami method that provides super compaction of an arbitrary 3D shape with non-negligible surface thickness called \"algorithmic stacking\". Our approach computationally finds a way of cutting the thick surface of the shape into a strip. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03302","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":"1803.03302","created_at":"2026-05-18T00:21:40.036153+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.03302v1","created_at":"2026-05-18T00:21:40.036153+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03302","created_at":"2026-05-18T00:21:40.036153+00:00"},{"alias_kind":"pith_short_12","alias_value":"XYDSLG23XQVB","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"XYDSLG23XQVB6QM4","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"XYDSLG23","created_at":"2026-05-18T12:33:04.347982+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/XYDSLG23XQVB6QM4FSJL7F24LW","json":"https://pith.science/pith/XYDSLG23XQVB6QM4FSJL7F24LW.json","graph_json":"https://pith.science/api/pith-number/XYDSLG23XQVB6QM4FSJL7F24LW/graph.json","events_json":"https://pith.science/api/pith-number/XYDSLG23XQVB6QM4FSJL7F24LW/events.json","paper":"https://pith.science/paper/XYDSLG23"},"agent_actions":{"view_html":"https://pith.science/pith/XYDSLG23XQVB6QM4FSJL7F24LW","download_json":"https://pith.science/pith/XYDSLG23XQVB6QM4FSJL7F24LW.json","view_paper":"https://pith.science/paper/XYDSLG23","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.03302&json=true","fetch_graph":"https://pith.science/api/pith-number/XYDSLG23XQVB6QM4FSJL7F24LW/graph.json","fetch_events":"https://pith.science/api/pith-number/XYDSLG23XQVB6QM4FSJL7F24LW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XYDSLG23XQVB6QM4FSJL7F24LW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XYDSLG23XQVB6QM4FSJL7F24LW/action/storage_attestation","attest_author":"https://pith.science/pith/XYDSLG23XQVB6QM4FSJL7F24LW/action/author_attestation","sign_citation":"https://pith.science/pith/XYDSLG23XQVB6QM4FSJL7F24LW/action/citation_signature","submit_replication":"https://pith.science/pith/XYDSLG23XQVB6QM4FSJL7F24LW/action/replication_record"}},"created_at":"2026-05-18T00:21:40.036153+00:00","updated_at":"2026-05-18T00:21:40.036153+00:00"}