{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:LWET3UG7YBDB7S366SFAJQZUYX","short_pith_number":"pith:LWET3UG7","schema_version":"1.0","canonical_sha256":"5d893dd0dfc0461fcb7ef48a04c334c5c922d7feede2b27b5fa54912eca9fd23","source":{"kind":"arxiv","id":"0705.1835","version":2},"attestation_state":"computed","paper":{"title":"Decomposition and Enumeration of Triangulated Surfaces","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gennaro Amendola","submitted_at":"2007-05-13T15:28:39Z","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."},"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":"0705.1835","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2007-05-13T15:28:39Z","cross_cats_sorted":[],"title_canon_sha256":"b5c60741d68f43ca49fdc0c17d63568058ab588e82b5fae9c619cb225d118f1c","abstract_canon_sha256":"f062957f14ad4d268645a985dd96f38494d4badd0abcc55620fca2ce90b8b630"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:23.594212Z","signature_b64":"lQRhwk5Zt1yHEN+lvI4ABTxyKMC1kS1RlRnaJ3U74iytm7FCZYgHUulARrDyzHVfjeTvswZH04Rnc3lnWCw5Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d893dd0dfc0461fcb7ef48a04c334c5c922d7feede2b27b5fa54912eca9fd23","last_reissued_at":"2026-05-17T23:55:23.593832Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:23.593832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decomposition and Enumeration of Triangulated Surfaces","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gennaro Amendola","submitted_at":"2007-05-13T15:28:39Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0705.1835","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":"0705.1835","created_at":"2026-05-17T23:55:23.593893+00:00"},{"alias_kind":"arxiv_version","alias_value":"0705.1835v2","created_at":"2026-05-17T23:55:23.593893+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0705.1835","created_at":"2026-05-17T23:55:23.593893+00:00"},{"alias_kind":"pith_short_12","alias_value":"LWET3UG7YBDB","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"LWET3UG7YBDB7S36","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"LWET3UG7","created_at":"2026-05-18T12:25:55.427421+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/LWET3UG7YBDB7S366SFAJQZUYX","json":"https://pith.science/pith/LWET3UG7YBDB7S366SFAJQZUYX.json","graph_json":"https://pith.science/api/pith-number/LWET3UG7YBDB7S366SFAJQZUYX/graph.json","events_json":"https://pith.science/api/pith-number/LWET3UG7YBDB7S366SFAJQZUYX/events.json","paper":"https://pith.science/paper/LWET3UG7"},"agent_actions":{"view_html":"https://pith.science/pith/LWET3UG7YBDB7S366SFAJQZUYX","download_json":"https://pith.science/pith/LWET3UG7YBDB7S366SFAJQZUYX.json","view_paper":"https://pith.science/paper/LWET3UG7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0705.1835&json=true","fetch_graph":"https://pith.science/api/pith-number/LWET3UG7YBDB7S366SFAJQZUYX/graph.json","fetch_events":"https://pith.science/api/pith-number/LWET3UG7YBDB7S366SFAJQZUYX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LWET3UG7YBDB7S366SFAJQZUYX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LWET3UG7YBDB7S366SFAJQZUYX/action/storage_attestation","attest_author":"https://pith.science/pith/LWET3UG7YBDB7S366SFAJQZUYX/action/author_attestation","sign_citation":"https://pith.science/pith/LWET3UG7YBDB7S366SFAJQZUYX/action/citation_signature","submit_replication":"https://pith.science/pith/LWET3UG7YBDB7S366SFAJQZUYX/action/replication_record"}},"created_at":"2026-05-17T23:55:23.593893+00:00","updated_at":"2026-05-17T23:55:23.593893+00:00"}