{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ORISUUEGHVSVKIOTOZH7MSZ5MU","short_pith_number":"pith:ORISUUEG","schema_version":"1.0","canonical_sha256":"74512a50863d655521d3764ff64b3d65063f8aaa528df2608137ed766fd70aa3","source":{"kind":"arxiv","id":"1611.00106","version":1},"attestation_state":"computed","paper":{"title":"Unfolding Genus-2 Orthogonal Polyhedra with Linear Refinement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Erik Demaine, Joseph O'Rourke, Mirela Damian, Robin Flatland","submitted_at":"2016-11-01T02:09:38Z","abstract_excerpt":"We show that every orthogonal polyhedron of genus at most 2 can be unfolded without overlap while using only a linear number of orthogonal cuts (parallel to the polyhedron edges). This is the first result on unfolding general orthogonal polyhedra beyond genus-0. Our unfolding algorithm relies on the existence of at most 2 special leaves in what we call the \"unfolding tree\" (which ties back to the genus), so unfolding polyhedra of genus 3 and beyond requires new techniques."},"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":"1611.00106","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-11-01T02:09:38Z","cross_cats_sorted":[],"title_canon_sha256":"021091e80c50a1d84f6a08982ebfe3791152409893174fa7658d966b51fd432a","abstract_canon_sha256":"acbf65ff735b7b3377b11f5b34527fbe0a0406cd6c907aaeed0e74ffc6a669c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:41.446163Z","signature_b64":"qpRqCSnkVEyAZbuJsU9sQKJWFAqUj8wG2qjB3ngLx63qQ5aWIz95jSXHo2sr70rPlDdmGUJ6zXVRXSzfRhB0Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74512a50863d655521d3764ff64b3d65063f8aaa528df2608137ed766fd70aa3","last_reissued_at":"2026-05-18T01:00:41.445652Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:41.445652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unfolding Genus-2 Orthogonal Polyhedra with Linear Refinement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Erik Demaine, Joseph O'Rourke, Mirela Damian, Robin Flatland","submitted_at":"2016-11-01T02:09:38Z","abstract_excerpt":"We show that every orthogonal polyhedron of genus at most 2 can be unfolded without overlap while using only a linear number of orthogonal cuts (parallel to the polyhedron edges). This is the first result on unfolding general orthogonal polyhedra beyond genus-0. Our unfolding algorithm relies on the existence of at most 2 special leaves in what we call the \"unfolding tree\" (which ties back to the genus), so unfolding polyhedra of genus 3 and beyond requires new techniques."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00106","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":"1611.00106","created_at":"2026-05-18T01:00:41.445724+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.00106v1","created_at":"2026-05-18T01:00:41.445724+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00106","created_at":"2026-05-18T01:00:41.445724+00:00"},{"alias_kind":"pith_short_12","alias_value":"ORISUUEGHVSV","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"ORISUUEGHVSVKIOT","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"ORISUUEG","created_at":"2026-05-18T12:30:36.002864+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/ORISUUEGHVSVKIOTOZH7MSZ5MU","json":"https://pith.science/pith/ORISUUEGHVSVKIOTOZH7MSZ5MU.json","graph_json":"https://pith.science/api/pith-number/ORISUUEGHVSVKIOTOZH7MSZ5MU/graph.json","events_json":"https://pith.science/api/pith-number/ORISUUEGHVSVKIOTOZH7MSZ5MU/events.json","paper":"https://pith.science/paper/ORISUUEG"},"agent_actions":{"view_html":"https://pith.science/pith/ORISUUEGHVSVKIOTOZH7MSZ5MU","download_json":"https://pith.science/pith/ORISUUEGHVSVKIOTOZH7MSZ5MU.json","view_paper":"https://pith.science/paper/ORISUUEG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.00106&json=true","fetch_graph":"https://pith.science/api/pith-number/ORISUUEGHVSVKIOTOZH7MSZ5MU/graph.json","fetch_events":"https://pith.science/api/pith-number/ORISUUEGHVSVKIOTOZH7MSZ5MU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ORISUUEGHVSVKIOTOZH7MSZ5MU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ORISUUEGHVSVKIOTOZH7MSZ5MU/action/storage_attestation","attest_author":"https://pith.science/pith/ORISUUEGHVSVKIOTOZH7MSZ5MU/action/author_attestation","sign_citation":"https://pith.science/pith/ORISUUEGHVSVKIOTOZH7MSZ5MU/action/citation_signature","submit_replication":"https://pith.science/pith/ORISUUEGHVSVKIOTOZH7MSZ5MU/action/replication_record"}},"created_at":"2026-05-18T01:00:41.445724+00:00","updated_at":"2026-05-18T01:00:41.445724+00:00"}