{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:CBAO2GMJ777NRYM6EZ2CZQR2EN","short_pith_number":"pith:CBAO2GMJ","schema_version":"1.0","canonical_sha256":"1040ed1989fffed8e19e26742cc23a2369b52dd8a19941707abb7848f53221c3","source":{"kind":"arxiv","id":"1703.06373","version":1},"attestation_state":"computed","paper":{"title":"Minimal forcing sets for 1D origami","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Erik Demaine, Hella Hoffman, Jayson Lynch, Mirela Damian, Muriel Dulieu, Robin Flatland, Suneeta Ramaswami, Thomas C. Hull","submitted_at":"2017-03-19T00:48:41Z","abstract_excerpt":"This paper addresses the problem of finding minimum forcing sets in origami. The origami material folds flat along straight lines called creases that can be labeled as mountains or valleys. A forcing set is a subset of creases that force all the other creases to fold according to their labels. The result is a flat folding of the origami material. In this paper we develop a linear time algorithm that finds minimum forcing sets in one dimensional origami."},"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":"1703.06373","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-03-19T00:48:41Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"7f2bdf01f0ff29bcf2c9c185329e8bd7e3975db1957cdeafb1a229fc92a9e5f1","abstract_canon_sha256":"64ddbd5b61c230eb9352d79268d5fa3b737c8ce107586670a2075fdaec233cfe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:23.119566Z","signature_b64":"I4TBTZAgAOoY5YJ+FDXAvEaZ+QTnUSmsf2SybrWX405B7nkM8x2wsi8elDXTTggjFh1/EblIHzXUL5wOog7KBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1040ed1989fffed8e19e26742cc23a2369b52dd8a19941707abb7848f53221c3","last_reissued_at":"2026-05-18T00:48:23.118928Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:23.118928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimal forcing sets for 1D origami","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Erik Demaine, Hella Hoffman, Jayson Lynch, Mirela Damian, Muriel Dulieu, Robin Flatland, Suneeta Ramaswami, Thomas C. Hull","submitted_at":"2017-03-19T00:48:41Z","abstract_excerpt":"This paper addresses the problem of finding minimum forcing sets in origami. The origami material folds flat along straight lines called creases that can be labeled as mountains or valleys. A forcing set is a subset of creases that force all the other creases to fold according to their labels. The result is a flat folding of the origami material. In this paper we develop a linear time algorithm that finds minimum forcing sets in one dimensional origami."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.06373","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":"1703.06373","created_at":"2026-05-18T00:48:23.119030+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.06373v1","created_at":"2026-05-18T00:48:23.119030+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.06373","created_at":"2026-05-18T00:48:23.119030+00:00"},{"alias_kind":"pith_short_12","alias_value":"CBAO2GMJ777N","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"CBAO2GMJ777NRYM6","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"CBAO2GMJ","created_at":"2026-05-18T12:31:10.602751+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/CBAO2GMJ777NRYM6EZ2CZQR2EN","json":"https://pith.science/pith/CBAO2GMJ777NRYM6EZ2CZQR2EN.json","graph_json":"https://pith.science/api/pith-number/CBAO2GMJ777NRYM6EZ2CZQR2EN/graph.json","events_json":"https://pith.science/api/pith-number/CBAO2GMJ777NRYM6EZ2CZQR2EN/events.json","paper":"https://pith.science/paper/CBAO2GMJ"},"agent_actions":{"view_html":"https://pith.science/pith/CBAO2GMJ777NRYM6EZ2CZQR2EN","download_json":"https://pith.science/pith/CBAO2GMJ777NRYM6EZ2CZQR2EN.json","view_paper":"https://pith.science/paper/CBAO2GMJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.06373&json=true","fetch_graph":"https://pith.science/api/pith-number/CBAO2GMJ777NRYM6EZ2CZQR2EN/graph.json","fetch_events":"https://pith.science/api/pith-number/CBAO2GMJ777NRYM6EZ2CZQR2EN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CBAO2GMJ777NRYM6EZ2CZQR2EN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CBAO2GMJ777NRYM6EZ2CZQR2EN/action/storage_attestation","attest_author":"https://pith.science/pith/CBAO2GMJ777NRYM6EZ2CZQR2EN/action/author_attestation","sign_citation":"https://pith.science/pith/CBAO2GMJ777NRYM6EZ2CZQR2EN/action/citation_signature","submit_replication":"https://pith.science/pith/CBAO2GMJ777NRYM6EZ2CZQR2EN/action/replication_record"}},"created_at":"2026-05-18T00:48:23.119030+00:00","updated_at":"2026-05-18T00:48:23.119030+00:00"}