{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:OB4MBBGTEGQED7QGZNFBMHCO45","short_pith_number":"pith:OB4MBBGT","schema_version":"1.0","canonical_sha256":"7078c084d321a041fe06cb4a161c4ee751ea92a362981e6d325242a6bac69416","source":{"kind":"arxiv","id":"1312.1753","version":2},"attestation_state":"computed","paper":{"title":"On the maximum order of graphs embedded in surfaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David R. Wood, Eran Nevo, Guillermo Pineda-Villavicencio","submitted_at":"2013-12-06T02:24:40Z","abstract_excerpt":"The maximum number of vertices in a graph of maximum degree $\\Delta\\ge 3$ and fixed diameter $k\\ge 2$ is upper bounded by $(1+o(1))(\\Delta-1)^{k}$. If we restrict our graphs to certain classes, better upper bounds are known. For instance, for the class of trees there is an upper bound of $(2+o(1))(\\Delta-1)^{\\lfloor k/2\\rfloor}$ for a fixed $k$. The main result of this paper is that graphs embedded in surfaces of bounded Euler genus $g$ behave like trees, in the sense that, for large $\\Delta$, such graphs have orders bounded from above by \\[begin{cases} c(g+1)(\\Delta-1)^{\\lfloor k/2\\rfloor} & "},"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":"1312.1753","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-06T02:24:40Z","cross_cats_sorted":[],"title_canon_sha256":"223a622490e4ccde73948a1e6d03a4993852b3521a9955df9100738265605efb","abstract_canon_sha256":"1e6c8c5d1602b659c37fe5c5111e2fab7843499fcbbcded7734b79c6ce7fd3dd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:33.429633Z","signature_b64":"qRBvz3EYhlY328a/DeGi7HSk4dsC7qmNmUvfuefl2v01V5Vi+VcqBnrlzHoim/c/gsKGCfJi6qCXYTt5MXZPBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7078c084d321a041fe06cb4a161c4ee751ea92a362981e6d325242a6bac69416","last_reissued_at":"2026-05-18T01:24:33.429067Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:33.429067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the maximum order of graphs embedded in surfaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David R. Wood, Eran Nevo, Guillermo Pineda-Villavicencio","submitted_at":"2013-12-06T02:24:40Z","abstract_excerpt":"The maximum number of vertices in a graph of maximum degree $\\Delta\\ge 3$ and fixed diameter $k\\ge 2$ is upper bounded by $(1+o(1))(\\Delta-1)^{k}$. If we restrict our graphs to certain classes, better upper bounds are known. For instance, for the class of trees there is an upper bound of $(2+o(1))(\\Delta-1)^{\\lfloor k/2\\rfloor}$ for a fixed $k$. The main result of this paper is that graphs embedded in surfaces of bounded Euler genus $g$ behave like trees, in the sense that, for large $\\Delta$, such graphs have orders bounded from above by \\[begin{cases} c(g+1)(\\Delta-1)^{\\lfloor k/2\\rfloor} & "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1753","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":"1312.1753","created_at":"2026-05-18T01:24:33.429161+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.1753v2","created_at":"2026-05-18T01:24:33.429161+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1753","created_at":"2026-05-18T01:24:33.429161+00:00"},{"alias_kind":"pith_short_12","alias_value":"OB4MBBGTEGQE","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OB4MBBGTEGQED7QG","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OB4MBBGT","created_at":"2026-05-18T12:27:54.935989+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/OB4MBBGTEGQED7QGZNFBMHCO45","json":"https://pith.science/pith/OB4MBBGTEGQED7QGZNFBMHCO45.json","graph_json":"https://pith.science/api/pith-number/OB4MBBGTEGQED7QGZNFBMHCO45/graph.json","events_json":"https://pith.science/api/pith-number/OB4MBBGTEGQED7QGZNFBMHCO45/events.json","paper":"https://pith.science/paper/OB4MBBGT"},"agent_actions":{"view_html":"https://pith.science/pith/OB4MBBGTEGQED7QGZNFBMHCO45","download_json":"https://pith.science/pith/OB4MBBGTEGQED7QGZNFBMHCO45.json","view_paper":"https://pith.science/paper/OB4MBBGT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.1753&json=true","fetch_graph":"https://pith.science/api/pith-number/OB4MBBGTEGQED7QGZNFBMHCO45/graph.json","fetch_events":"https://pith.science/api/pith-number/OB4MBBGTEGQED7QGZNFBMHCO45/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OB4MBBGTEGQED7QGZNFBMHCO45/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OB4MBBGTEGQED7QGZNFBMHCO45/action/storage_attestation","attest_author":"https://pith.science/pith/OB4MBBGTEGQED7QGZNFBMHCO45/action/author_attestation","sign_citation":"https://pith.science/pith/OB4MBBGTEGQED7QGZNFBMHCO45/action/citation_signature","submit_replication":"https://pith.science/pith/OB4MBBGTEGQED7QGZNFBMHCO45/action/replication_record"}},"created_at":"2026-05-18T01:24:33.429161+00:00","updated_at":"2026-05-18T01:24:33.429161+00:00"}