{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:LWET3UG7YBDB7S366SFAJQZUYX","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":"f062957f14ad4d268645a985dd96f38494d4badd0abcc55620fca2ce90b8b630","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"2007-05-13T15:28:39Z","title_canon_sha256":"b5c60741d68f43ca49fdc0c17d63568058ab588e82b5fae9c619cb225d118f1c"},"schema_version":"1.0","source":{"id":"0705.1835","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0705.1835","created_at":"2026-05-17T23:55:23Z"},{"alias_kind":"arxiv_version","alias_value":"0705.1835v2","created_at":"2026-05-17T23:55:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0705.1835","created_at":"2026-05-17T23:55:23Z"},{"alias_kind":"pith_short_12","alias_value":"LWET3UG7YBDB","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"LWET3UG7YBDB7S36","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"LWET3UG7","created_at":"2026-05-18T12:25:55Z"}],"graph_snapshots":[{"event_id":"sha256:08b56fb3a25394a4a50a89b017a0214d834bc41de2678d298c5748caad294750","target":"graph","created_at":"2026-05-17T23:55: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":"We describe some theoretical results on triangulations of surfaces and we develop a theory on roots, decompositions and genus-surfaces. We apply this theory to describe an algorithm to list all triangulations of closed surfaces with at most a fixed number of vertices. We specialize the theory for the case where the number of vertices is at most 11 and we get theoretical restrictions on genus-surfaces allowing us to get the list of triangulations of closed surfaces with at most 11 vertices.","authors_text":"Gennaro Amendola","cross_cats":[],"headline":"","license":"","primary_cat":"math.CO","submitted_at":"2007-05-13T15:28:39Z","title":"Decomposition and Enumeration of Triangulated Surfaces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0705.1835","kind":"arxiv","version":2},"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:257cd230c5ea78f6b918daa9a20a1e5700c1e7953d8aa302580ad94c7afe52d6","target":"record","created_at":"2026-05-17T23:55: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":"f062957f14ad4d268645a985dd96f38494d4badd0abcc55620fca2ce90b8b630","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"2007-05-13T15:28:39Z","title_canon_sha256":"b5c60741d68f43ca49fdc0c17d63568058ab588e82b5fae9c619cb225d118f1c"},"schema_version":"1.0","source":{"id":"0705.1835","kind":"arxiv","version":2}},"canonical_sha256":"5d893dd0dfc0461fcb7ef48a04c334c5c922d7feede2b27b5fa54912eca9fd23","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5d893dd0dfc0461fcb7ef48a04c334c5c922d7feede2b27b5fa54912eca9fd23","first_computed_at":"2026-05-17T23:55:23.593832Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:23.593832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lQRhwk5Zt1yHEN+lvI4ABTxyKMC1kS1RlRnaJ3U74iytm7FCZYgHUulARrDyzHVfjeTvswZH04Rnc3lnWCw5Dg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:23.594212Z","signed_message":"canonical_sha256_bytes"},"source_id":"0705.1835","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:257cd230c5ea78f6b918daa9a20a1e5700c1e7953d8aa302580ad94c7afe52d6","sha256:08b56fb3a25394a4a50a89b017a0214d834bc41de2678d298c5748caad294750"],"state_sha256":"ec6152f91c53be0d8be8c1da112cb803dd65ad4e9229936f4b7ca7bef2956e16"}