{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:K4RHWK62VRTRCJHDM7RH2FO44K","short_pith_number":"pith:K4RHWK62","schema_version":"1.0","canonical_sha256":"57227b2bdaac671124e367e27d15dce29840f22c4ad2682641a815919ea6a90e","source":{"kind":"arxiv","id":"1410.2231","version":1},"attestation_state":"computed","paper":{"title":"Minimum Forcing Sets for Miura Folding Patterns","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Brad Ballinger, David Eppstein, Jessica Ginepro, Mirela Damian, Robin Flatland, Thomas Hull","submitted_at":"2014-10-08T19:46:21Z","abstract_excerpt":"We introduce the study of forcing sets in mathematical origami. The origami material folds flat along straight line segments called creases, each of which is assigned a folding direction of mountain or valley. A subset $F$ of creases is forcing if the global folding mountain/valley assignment can be deduced from its restriction to $F$. In this paper we focus on one particular class of foldable patterns called Miura-ori, which divide the plane into congruent parallelograms using horizontal lines and zig-zag vertical lines. We develop efficient algorithms for constructing a minimum forcing set o"},"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":"1410.2231","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-08T19:46:21Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"ac3e25857554f09c986850a1cd7b65f00de79d393b9974ceeb4767de77377233","abstract_canon_sha256":"fe5602c4db654b3889ee5d2b32a040a96ee514109a6b7b25e9232c30848b4f19"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:28.896362Z","signature_b64":"eqcLYD1ioN06a2z4t8PS+JU6IFHcvLGX8CIdczSbjStfM6+0/lIZLiFTjT0fUVFMuLFmNM1+8msmoMp3EFFIDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57227b2bdaac671124e367e27d15dce29840f22c4ad2682641a815919ea6a90e","last_reissued_at":"2026-05-18T00:48:28.895839Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:28.895839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum Forcing Sets for Miura Folding Patterns","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Brad Ballinger, David Eppstein, Jessica Ginepro, Mirela Damian, Robin Flatland, Thomas Hull","submitted_at":"2014-10-08T19:46:21Z","abstract_excerpt":"We introduce the study of forcing sets in mathematical origami. The origami material folds flat along straight line segments called creases, each of which is assigned a folding direction of mountain or valley. A subset $F$ of creases is forcing if the global folding mountain/valley assignment can be deduced from its restriction to $F$. In this paper we focus on one particular class of foldable patterns called Miura-ori, which divide the plane into congruent parallelograms using horizontal lines and zig-zag vertical lines. We develop efficient algorithms for constructing a minimum forcing set o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.2231","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":"1410.2231","created_at":"2026-05-18T00:48:28.895910+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.2231v1","created_at":"2026-05-18T00:48:28.895910+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.2231","created_at":"2026-05-18T00:48:28.895910+00:00"},{"alias_kind":"pith_short_12","alias_value":"K4RHWK62VRTR","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"K4RHWK62VRTRCJHD","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"K4RHWK62","created_at":"2026-05-18T12:28:35.611951+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/K4RHWK62VRTRCJHDM7RH2FO44K","json":"https://pith.science/pith/K4RHWK62VRTRCJHDM7RH2FO44K.json","graph_json":"https://pith.science/api/pith-number/K4RHWK62VRTRCJHDM7RH2FO44K/graph.json","events_json":"https://pith.science/api/pith-number/K4RHWK62VRTRCJHDM7RH2FO44K/events.json","paper":"https://pith.science/paper/K4RHWK62"},"agent_actions":{"view_html":"https://pith.science/pith/K4RHWK62VRTRCJHDM7RH2FO44K","download_json":"https://pith.science/pith/K4RHWK62VRTRCJHDM7RH2FO44K.json","view_paper":"https://pith.science/paper/K4RHWK62","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.2231&json=true","fetch_graph":"https://pith.science/api/pith-number/K4RHWK62VRTRCJHDM7RH2FO44K/graph.json","fetch_events":"https://pith.science/api/pith-number/K4RHWK62VRTRCJHDM7RH2FO44K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K4RHWK62VRTRCJHDM7RH2FO44K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K4RHWK62VRTRCJHDM7RH2FO44K/action/storage_attestation","attest_author":"https://pith.science/pith/K4RHWK62VRTRCJHDM7RH2FO44K/action/author_attestation","sign_citation":"https://pith.science/pith/K4RHWK62VRTRCJHDM7RH2FO44K/action/citation_signature","submit_replication":"https://pith.science/pith/K4RHWK62VRTRCJHDM7RH2FO44K/action/replication_record"}},"created_at":"2026-05-18T00:48:28.895910+00:00","updated_at":"2026-05-18T00:48:28.895910+00:00"}