{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:T5XA6VT5I6DSMKCFFHEAQWTW7G","short_pith_number":"pith:T5XA6VT5","schema_version":"1.0","canonical_sha256":"9f6e0f567d478726284529c8085a76f9861f56d61fec972869b5a5ab7a728ff9","source":{"kind":"arxiv","id":"1408.6771","version":2},"attestation_state":"computed","paper":{"title":"Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Anna Lubiw, David Eppstein, Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Zachary Abel","submitted_at":"2014-08-28T16:25:49Z","abstract_excerpt":"When can a plane graph with prescribed edge lengths and prescribed angles (from among $\\{0,180^\\circ, 360^\\circ$\\}) be folded flat to lie in an infinitesimally thin line, without crossings? This problem generalizes the classic theory of single-vertex flat origami with prescribed mountain-valley assignment, which corresponds to the case of a cycle graph. We characterize such flat-foldable plane graphs by two obviously necessary but also sufficient conditions, proving a conjecture made in 2001: the angles at each vertex should sum to $360^\\circ$, and every face of the graph must itself be flat f"},"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":"1408.6771","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-08-28T16:25:49Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"7089b7d581e0fc489ba03bd716cf933457c572a07695dd67fd5e8266ebad85ed","abstract_canon_sha256":"d2a0d387dddf3d565b7135a93abc3f9497685de6a1ed1add13927643367ebfe2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:49.559275Z","signature_b64":"o4iD7t1SnxzTdl4lXVkDFzMTvvl7oVfnMM/ZQk47Fox2dXxwz+EY3wW9LGOLh4qGGA/7ArFxSK1VPD62U2wtBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f6e0f567d478726284529c8085a76f9861f56d61fec972869b5a5ab7a728ff9","last_reissued_at":"2026-05-18T00:20:49.558661Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:49.558661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Anna Lubiw, David Eppstein, Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Zachary Abel","submitted_at":"2014-08-28T16:25:49Z","abstract_excerpt":"When can a plane graph with prescribed edge lengths and prescribed angles (from among $\\{0,180^\\circ, 360^\\circ$\\}) be folded flat to lie in an infinitesimally thin line, without crossings? This problem generalizes the classic theory of single-vertex flat origami with prescribed mountain-valley assignment, which corresponds to the case of a cycle graph. We characterize such flat-foldable plane graphs by two obviously necessary but also sufficient conditions, proving a conjecture made in 2001: the angles at each vertex should sum to $360^\\circ$, and every face of the graph must itself be flat f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.6771","kind":"arxiv","version":2},"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":"1408.6771","created_at":"2026-05-18T00:20:49.558755+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.6771v2","created_at":"2026-05-18T00:20:49.558755+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.6771","created_at":"2026-05-18T00:20:49.558755+00:00"},{"alias_kind":"pith_short_12","alias_value":"T5XA6VT5I6DS","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"T5XA6VT5I6DSMKCF","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"T5XA6VT5","created_at":"2026-05-18T12:28:49.207871+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/T5XA6VT5I6DSMKCFFHEAQWTW7G","json":"https://pith.science/pith/T5XA6VT5I6DSMKCFFHEAQWTW7G.json","graph_json":"https://pith.science/api/pith-number/T5XA6VT5I6DSMKCFFHEAQWTW7G/graph.json","events_json":"https://pith.science/api/pith-number/T5XA6VT5I6DSMKCFFHEAQWTW7G/events.json","paper":"https://pith.science/paper/T5XA6VT5"},"agent_actions":{"view_html":"https://pith.science/pith/T5XA6VT5I6DSMKCFFHEAQWTW7G","download_json":"https://pith.science/pith/T5XA6VT5I6DSMKCFFHEAQWTW7G.json","view_paper":"https://pith.science/paper/T5XA6VT5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.6771&json=true","fetch_graph":"https://pith.science/api/pith-number/T5XA6VT5I6DSMKCFFHEAQWTW7G/graph.json","fetch_events":"https://pith.science/api/pith-number/T5XA6VT5I6DSMKCFFHEAQWTW7G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T5XA6VT5I6DSMKCFFHEAQWTW7G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T5XA6VT5I6DSMKCFFHEAQWTW7G/action/storage_attestation","attest_author":"https://pith.science/pith/T5XA6VT5I6DSMKCFFHEAQWTW7G/action/author_attestation","sign_citation":"https://pith.science/pith/T5XA6VT5I6DSMKCFFHEAQWTW7G/action/citation_signature","submit_replication":"https://pith.science/pith/T5XA6VT5I6DSMKCFFHEAQWTW7G/action/replication_record"}},"created_at":"2026-05-18T00:20:49.558755+00:00","updated_at":"2026-05-18T00:20:49.558755+00:00"}