{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:G6NEUS3BV2QO5BZHCWWRPAOHWU","short_pith_number":"pith:G6NEUS3B","schema_version":"1.0","canonical_sha256":"379a4a4b61aea0ee872715ad1781c7b53c7a0d1be6548327b79ff0edea2c57ba","source":{"kind":"arxiv","id":"1806.03319","version":1},"attestation_state":"computed","paper":{"title":"From unicellular fatgraphs to trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christian M. Reidys, Thomas J. X. Li","submitted_at":"2018-06-08T18:47:34Z","abstract_excerpt":"In this paper we study the minimum number of reversals needed to transform a unicellular fatgraph into a tree. We consider reversals acting on boundary components, having the natural interpretation as gluing, slicing or half-flipping of vertices. Our main result is an expression for the minimum number of reversals needed to transform a unicellular fatgraph to a plane tree. The expression involves the Euler genus of the fatgraph and an additional parameter, which counts the number of certain orientable blocks in the decomposition of the fatgraph. In the process we derive a constructive proof of"},"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":"1806.03319","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-08T18:47:34Z","cross_cats_sorted":[],"title_canon_sha256":"cc5e55a112ca500bc448232610a416201cecfb2c37dd937d2f44c7eeb03342d7","abstract_canon_sha256":"a404eef586e71a7a0d0ed2b1dbe0a19c2e1b142b0b832885605bf18added82e3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:43.785716Z","signature_b64":"1pgV5HHdaG59YAL56pP1e9aG2pT/CzCrVx5WzWWBIbpU3aKtjvjfZ1JS3y2P+0IYPUCDXLZmnmCLUxxC6c0iCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"379a4a4b61aea0ee872715ad1781c7b53c7a0d1be6548327b79ff0edea2c57ba","last_reissued_at":"2026-05-18T00:13:43.784788Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:43.784788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"From unicellular fatgraphs to trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christian M. Reidys, Thomas J. X. Li","submitted_at":"2018-06-08T18:47:34Z","abstract_excerpt":"In this paper we study the minimum number of reversals needed to transform a unicellular fatgraph into a tree. We consider reversals acting on boundary components, having the natural interpretation as gluing, slicing or half-flipping of vertices. Our main result is an expression for the minimum number of reversals needed to transform a unicellular fatgraph to a plane tree. The expression involves the Euler genus of the fatgraph and an additional parameter, which counts the number of certain orientable blocks in the decomposition of the fatgraph. In the process we derive a constructive proof of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.03319","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":"1806.03319","created_at":"2026-05-18T00:13:43.784938+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.03319v1","created_at":"2026-05-18T00:13:43.784938+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.03319","created_at":"2026-05-18T00:13:43.784938+00:00"},{"alias_kind":"pith_short_12","alias_value":"G6NEUS3BV2QO","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"G6NEUS3BV2QO5BZH","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"G6NEUS3B","created_at":"2026-05-18T12:32:25.280505+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/G6NEUS3BV2QO5BZHCWWRPAOHWU","json":"https://pith.science/pith/G6NEUS3BV2QO5BZHCWWRPAOHWU.json","graph_json":"https://pith.science/api/pith-number/G6NEUS3BV2QO5BZHCWWRPAOHWU/graph.json","events_json":"https://pith.science/api/pith-number/G6NEUS3BV2QO5BZHCWWRPAOHWU/events.json","paper":"https://pith.science/paper/G6NEUS3B"},"agent_actions":{"view_html":"https://pith.science/pith/G6NEUS3BV2QO5BZHCWWRPAOHWU","download_json":"https://pith.science/pith/G6NEUS3BV2QO5BZHCWWRPAOHWU.json","view_paper":"https://pith.science/paper/G6NEUS3B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.03319&json=true","fetch_graph":"https://pith.science/api/pith-number/G6NEUS3BV2QO5BZHCWWRPAOHWU/graph.json","fetch_events":"https://pith.science/api/pith-number/G6NEUS3BV2QO5BZHCWWRPAOHWU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G6NEUS3BV2QO5BZHCWWRPAOHWU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G6NEUS3BV2QO5BZHCWWRPAOHWU/action/storage_attestation","attest_author":"https://pith.science/pith/G6NEUS3BV2QO5BZHCWWRPAOHWU/action/author_attestation","sign_citation":"https://pith.science/pith/G6NEUS3BV2QO5BZHCWWRPAOHWU/action/citation_signature","submit_replication":"https://pith.science/pith/G6NEUS3BV2QO5BZHCWWRPAOHWU/action/replication_record"}},"created_at":"2026-05-18T00:13:43.784938+00:00","updated_at":"2026-05-18T00:13:43.784938+00:00"}