{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:R2TKRKAUVPEKBTQ636PUG72EYL","short_pith_number":"pith:R2TKRKAU","schema_version":"1.0","canonical_sha256":"8ea6a8a814abc8a0ce1edf9f437f44c2ff2e120702cc5eecbe5aabde602041fe","source":{"kind":"arxiv","id":"1302.1648","version":1},"attestation_state":"computed","paper":{"title":"Constructions of Large Graphs on Surfaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guillermo Pineda-Villavicencio, Ramiro Feria-Puron","submitted_at":"2013-02-07T06:16:01Z","abstract_excerpt":"We consider the degree/diameter problem for graphs embedded in a surface, namely, given a surface $\\Sigma$ and integers $\\Delta$ and $k$, determine the maximum order $N(\\Delta,k,\\Sigma)$ of a graph embeddable in $\\Sigma$ with maximum degree $\\Delta$ and diameter $k$. We introduce a number of constructions which produce many new largest known planar and toroidal graphs. We record all these graphs in the available tables of largest known graphs.\nGiven a surface $\\Sigma$ of Euler genus $g$ and an odd diameter $k$, the current best asymptotic lower bound for $N(\\Delta,k,\\Sigma)$ is given by \\[\\sqr"},"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":"1302.1648","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-07T06:16:01Z","cross_cats_sorted":[],"title_canon_sha256":"b5bf55e94f9d282663681582b902fe05298d1a1773dd4355aa7de743a059aa41","abstract_canon_sha256":"27261a4310cbbc6f35aefc360e0d9b676bf8d04b793ea14fb3f93b04cd7183b1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:42.173917Z","signature_b64":"aYeyoRDJJ0nSBxd4dv4X9knBHvw9UZnxcbpcOI5W0QsPM3FzBCuUCVl2r0syLMpjUPXlEpImCMFZItnK0pHGDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ea6a8a814abc8a0ce1edf9f437f44c2ff2e120702cc5eecbe5aabde602041fe","last_reissued_at":"2026-05-18T02:52:42.173376Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:42.173376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constructions of Large Graphs on Surfaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guillermo Pineda-Villavicencio, Ramiro Feria-Puron","submitted_at":"2013-02-07T06:16:01Z","abstract_excerpt":"We consider the degree/diameter problem for graphs embedded in a surface, namely, given a surface $\\Sigma$ and integers $\\Delta$ and $k$, determine the maximum order $N(\\Delta,k,\\Sigma)$ of a graph embeddable in $\\Sigma$ with maximum degree $\\Delta$ and diameter $k$. We introduce a number of constructions which produce many new largest known planar and toroidal graphs. We record all these graphs in the available tables of largest known graphs.\nGiven a surface $\\Sigma$ of Euler genus $g$ and an odd diameter $k$, the current best asymptotic lower bound for $N(\\Delta,k,\\Sigma)$ is given by \\[\\sqr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.1648","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":"1302.1648","created_at":"2026-05-18T02:52:42.173453+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.1648v1","created_at":"2026-05-18T02:52:42.173453+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.1648","created_at":"2026-05-18T02:52:42.173453+00:00"},{"alias_kind":"pith_short_12","alias_value":"R2TKRKAUVPEK","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"R2TKRKAUVPEKBTQ6","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"R2TKRKAU","created_at":"2026-05-18T12:27:57.521954+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/R2TKRKAUVPEKBTQ636PUG72EYL","json":"https://pith.science/pith/R2TKRKAUVPEKBTQ636PUG72EYL.json","graph_json":"https://pith.science/api/pith-number/R2TKRKAUVPEKBTQ636PUG72EYL/graph.json","events_json":"https://pith.science/api/pith-number/R2TKRKAUVPEKBTQ636PUG72EYL/events.json","paper":"https://pith.science/paper/R2TKRKAU"},"agent_actions":{"view_html":"https://pith.science/pith/R2TKRKAUVPEKBTQ636PUG72EYL","download_json":"https://pith.science/pith/R2TKRKAUVPEKBTQ636PUG72EYL.json","view_paper":"https://pith.science/paper/R2TKRKAU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.1648&json=true","fetch_graph":"https://pith.science/api/pith-number/R2TKRKAUVPEKBTQ636PUG72EYL/graph.json","fetch_events":"https://pith.science/api/pith-number/R2TKRKAUVPEKBTQ636PUG72EYL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R2TKRKAUVPEKBTQ636PUG72EYL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R2TKRKAUVPEKBTQ636PUG72EYL/action/storage_attestation","attest_author":"https://pith.science/pith/R2TKRKAUVPEKBTQ636PUG72EYL/action/author_attestation","sign_citation":"https://pith.science/pith/R2TKRKAUVPEKBTQ636PUG72EYL/action/citation_signature","submit_replication":"https://pith.science/pith/R2TKRKAUVPEKBTQ636PUG72EYL/action/replication_record"}},"created_at":"2026-05-18T02:52:42.173453+00:00","updated_at":"2026-05-18T02:52:42.173453+00:00"}