{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:OB4MBBGTEGQED7QGZNFBMHCO45","short_pith_number":"pith:OB4MBBGT","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"},"canonical_sha256":"7078c084d321a041fe06cb4a161c4ee751ea92a362981e6d325242a6bac69416","source":{"kind":"arxiv","id":"1312.1753","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.1753","created_at":"2026-05-18T01:24:33Z"},{"alias_kind":"arxiv_version","alias_value":"1312.1753v2","created_at":"2026-05-18T01:24:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1753","created_at":"2026-05-18T01:24:33Z"},{"alias_kind":"pith_short_12","alias_value":"OB4MBBGTEGQE","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OB4MBBGTEGQED7QG","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OB4MBBGT","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:OB4MBBGTEGQED7QGZNFBMHCO45","target":"record","payload":{"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"},"canonical_sha256":"7078c084d321a041fe06cb4a161c4ee751ea92a362981e6d325242a6bac69416","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"},"source_kind":"arxiv","source_id":"1312.1753","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:24:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eN02v3u617Y1l4cKy9bexfyhni+UvopAMWVTBKm55TNfJ+rmHGq21Yjrbhh3vXyT7RXrOV86Xds4XJtwRz3SBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T12:21:16.709476Z"},"content_sha256":"f03ba9c84a3ee1464fd60390b829928d27d59bba248d7669f71b94d184e24734","schema_version":"1.0","event_id":"sha256:f03ba9c84a3ee1464fd60390b829928d27d59bba248d7669f71b94d184e24734"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:OB4MBBGTEGQED7QGZNFBMHCO45","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:24:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SgMpL7SHbv515c0CfSDVwQFgar4Ve3/cxGSsBsmkqPZdm5qJtSlUivR6/Tue6JERs0nazILEaBrSKpI6tkLoBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T12:21:16.710013Z"},"content_sha256":"7af5a8b21013cd435fa6f735ceeb59d2f9c67e3020fe9c60c7b0df4983db100c","schema_version":"1.0","event_id":"sha256:7af5a8b21013cd435fa6f735ceeb59d2f9c67e3020fe9c60c7b0df4983db100c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OB4MBBGTEGQED7QGZNFBMHCO45/bundle.json","state_url":"https://pith.science/pith/OB4MBBGTEGQED7QGZNFBMHCO45/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OB4MBBGTEGQED7QGZNFBMHCO45/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-08T12:21:16Z","links":{"resolver":"https://pith.science/pith/OB4MBBGTEGQED7QGZNFBMHCO45","bundle":"https://pith.science/pith/OB4MBBGTEGQED7QGZNFBMHCO45/bundle.json","state":"https://pith.science/pith/OB4MBBGTEGQED7QGZNFBMHCO45/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OB4MBBGTEGQED7QGZNFBMHCO45/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:OB4MBBGTEGQED7QGZNFBMHCO45","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":"1e6c8c5d1602b659c37fe5c5111e2fab7843499fcbbcded7734b79c6ce7fd3dd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-06T02:24:40Z","title_canon_sha256":"223a622490e4ccde73948a1e6d03a4993852b3521a9955df9100738265605efb"},"schema_version":"1.0","source":{"id":"1312.1753","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.1753","created_at":"2026-05-18T01:24:33Z"},{"alias_kind":"arxiv_version","alias_value":"1312.1753v2","created_at":"2026-05-18T01:24:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1753","created_at":"2026-05-18T01:24:33Z"},{"alias_kind":"pith_short_12","alias_value":"OB4MBBGTEGQE","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OB4MBBGTEGQED7QG","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OB4MBBGT","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:7af5a8b21013cd435fa6f735ceeb59d2f9c67e3020fe9c60c7b0df4983db100c","target":"graph","created_at":"2026-05-18T01:24:33Z","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":"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} & ","authors_text":"David R. Wood, Eran Nevo, Guillermo Pineda-Villavicencio","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-06T02:24:40Z","title":"On the maximum order of graphs embedded in surfaces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1753","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:f03ba9c84a3ee1464fd60390b829928d27d59bba248d7669f71b94d184e24734","target":"record","created_at":"2026-05-18T01:24:33Z","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":"1e6c8c5d1602b659c37fe5c5111e2fab7843499fcbbcded7734b79c6ce7fd3dd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-06T02:24:40Z","title_canon_sha256":"223a622490e4ccde73948a1e6d03a4993852b3521a9955df9100738265605efb"},"schema_version":"1.0","source":{"id":"1312.1753","kind":"arxiv","version":2}},"canonical_sha256":"7078c084d321a041fe06cb4a161c4ee751ea92a362981e6d325242a6bac69416","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7078c084d321a041fe06cb4a161c4ee751ea92a362981e6d325242a6bac69416","first_computed_at":"2026-05-18T01:24:33.429067Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:33.429067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qRBvz3EYhlY328a/DeGi7HSk4dsC7qmNmUvfuefl2v01V5Vi+VcqBnrlzHoim/c/gsKGCfJi6qCXYTt5MXZPBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:33.429633Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.1753","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f03ba9c84a3ee1464fd60390b829928d27d59bba248d7669f71b94d184e24734","sha256:7af5a8b21013cd435fa6f735ceeb59d2f9c67e3020fe9c60c7b0df4983db100c"],"state_sha256":"09667ef3cee73303b39078e453eddb8d2fa1cbbb37271f991cfd7e0fbb604a25"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NwXbTW76/SX5tQLAy+JwIrd6Aih+OsewefefBjBYhIdlGKYqsWSSh2nOVJH8A7Dcw/70k7cSpTWFjTYWkgQYAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T12:21:16.712638Z","bundle_sha256":"0feb5f3c323f8948996bbf1c2f530e227406c94ebab55e4b932cd8ab051112e8"}}