{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:CBAO2GMJ777NRYM6EZ2CZQR2EN","short_pith_number":"pith:CBAO2GMJ","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"},"canonical_sha256":"1040ed1989fffed8e19e26742cc23a2369b52dd8a19941707abb7848f53221c3","source":{"kind":"arxiv","id":"1703.06373","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.06373","created_at":"2026-05-18T00:48:23Z"},{"alias_kind":"arxiv_version","alias_value":"1703.06373v1","created_at":"2026-05-18T00:48:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.06373","created_at":"2026-05-18T00:48:23Z"},{"alias_kind":"pith_short_12","alias_value":"CBAO2GMJ777N","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CBAO2GMJ777NRYM6","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CBAO2GMJ","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:CBAO2GMJ777NRYM6EZ2CZQR2EN","target":"record","payload":{"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"},"canonical_sha256":"1040ed1989fffed8e19e26742cc23a2369b52dd8a19941707abb7848f53221c3","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"},"source_kind":"arxiv","source_id":"1703.06373","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:48:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IH3bih4G5t334ugJIbeGIwhdar2s1fq52XpZLXy9z6qg41Mxd+JsLNcJyEH6DyZghdYIn8/3KGT+j5Ip141lAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:36:15.524629Z"},"content_sha256":"0b12d9ad330fe2f93a8096c90453c9c9ba05b8c0b045f3f06259d7a6ca3647ee","schema_version":"1.0","event_id":"sha256:0b12d9ad330fe2f93a8096c90453c9c9ba05b8c0b045f3f06259d7a6ca3647ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:CBAO2GMJ777NRYM6EZ2CZQR2EN","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:48:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v4BsPxywa7vcaqUfbUFbbB53tY+q4Dpd6CD8YZwe1ok2EjQpgmscKhI2WPpXJ/pisPG1WXMqoisJBGj6oaWACQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:36:15.524996Z"},"content_sha256":"47fb9cb732b8639ab9bac8be92932b18c1dd1d100860facf5e7bd838a263df73","schema_version":"1.0","event_id":"sha256:47fb9cb732b8639ab9bac8be92932b18c1dd1d100860facf5e7bd838a263df73"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CBAO2GMJ777NRYM6EZ2CZQR2EN/bundle.json","state_url":"https://pith.science/pith/CBAO2GMJ777NRYM6EZ2CZQR2EN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CBAO2GMJ777NRYM6EZ2CZQR2EN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-05T11:36:15Z","links":{"resolver":"https://pith.science/pith/CBAO2GMJ777NRYM6EZ2CZQR2EN","bundle":"https://pith.science/pith/CBAO2GMJ777NRYM6EZ2CZQR2EN/bundle.json","state":"https://pith.science/pith/CBAO2GMJ777NRYM6EZ2CZQR2EN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CBAO2GMJ777NRYM6EZ2CZQR2EN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CBAO2GMJ777NRYM6EZ2CZQR2EN","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"64ddbd5b61c230eb9352d79268d5fa3b737c8ce107586670a2075fdaec233cfe","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-03-19T00:48:41Z","title_canon_sha256":"7f2bdf01f0ff29bcf2c9c185329e8bd7e3975db1957cdeafb1a229fc92a9e5f1"},"schema_version":"1.0","source":{"id":"1703.06373","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.06373","created_at":"2026-05-18T00:48:23Z"},{"alias_kind":"arxiv_version","alias_value":"1703.06373v1","created_at":"2026-05-18T00:48:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.06373","created_at":"2026-05-18T00:48:23Z"},{"alias_kind":"pith_short_12","alias_value":"CBAO2GMJ777N","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CBAO2GMJ777NRYM6","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CBAO2GMJ","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:47fb9cb732b8639ab9bac8be92932b18c1dd1d100860facf5e7bd838a263df73","target":"graph","created_at":"2026-05-18T00:48:23Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Erik Demaine, Hella Hoffman, Jayson Lynch, Mirela Damian, Muriel Dulieu, Robin Flatland, Suneeta Ramaswami, Thomas C. Hull","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-03-19T00:48:41Z","title":"Minimal forcing sets for 1D origami"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.06373","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0b12d9ad330fe2f93a8096c90453c9c9ba05b8c0b045f3f06259d7a6ca3647ee","target":"record","created_at":"2026-05-18T00:48:23Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"64ddbd5b61c230eb9352d79268d5fa3b737c8ce107586670a2075fdaec233cfe","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-03-19T00:48:41Z","title_canon_sha256":"7f2bdf01f0ff29bcf2c9c185329e8bd7e3975db1957cdeafb1a229fc92a9e5f1"},"schema_version":"1.0","source":{"id":"1703.06373","kind":"arxiv","version":1}},"canonical_sha256":"1040ed1989fffed8e19e26742cc23a2369b52dd8a19941707abb7848f53221c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1040ed1989fffed8e19e26742cc23a2369b52dd8a19941707abb7848f53221c3","first_computed_at":"2026-05-18T00:48:23.118928Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:23.118928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"I4TBTZAgAOoY5YJ+FDXAvEaZ+QTnUSmsf2SybrWX405B7nkM8x2wsi8elDXTTggjFh1/EblIHzXUL5wOog7KBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:23.119566Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.06373","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b12d9ad330fe2f93a8096c90453c9c9ba05b8c0b045f3f06259d7a6ca3647ee","sha256:47fb9cb732b8639ab9bac8be92932b18c1dd1d100860facf5e7bd838a263df73"],"state_sha256":"0f8c7416e5a2e9c6b7c07a1885d31dcc2b26bd080fc2bf982ee639bf3e72ced0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bJAGfW5jtF1DflSbRJCz5YQSSb3+XHfbCh1pnVrgiVjSpCnP0jwax9SUVWQua7A3T6w8JhBEV1iqlGGYXelrBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T11:36:15.529620Z","bundle_sha256":"2e66055f49990aa5238b6af74d7dba87df6c05c38d5784af3a7cc88ea1c6c50e"}}