{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:R2TKRKAUVPEKBTQ636PUG72EYL","short_pith_number":"pith:R2TKRKAU","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"},"canonical_sha256":"8ea6a8a814abc8a0ce1edf9f437f44c2ff2e120702cc5eecbe5aabde602041fe","source":{"kind":"arxiv","id":"1302.1648","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.1648","created_at":"2026-05-18T02:52:42Z"},{"alias_kind":"arxiv_version","alias_value":"1302.1648v1","created_at":"2026-05-18T02:52:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.1648","created_at":"2026-05-18T02:52:42Z"},{"alias_kind":"pith_short_12","alias_value":"R2TKRKAUVPEK","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"R2TKRKAUVPEKBTQ6","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"R2TKRKAU","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:R2TKRKAUVPEKBTQ636PUG72EYL","target":"record","payload":{"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"},"canonical_sha256":"8ea6a8a814abc8a0ce1edf9f437f44c2ff2e120702cc5eecbe5aabde602041fe","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"},"source_kind":"arxiv","source_id":"1302.1648","source_version":1,"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-18T02:52:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gZRg711olb+YYH71cOrrP6AyWITa8OcunODwKjIQdm0TggZ+hV877rSB3U4XO95v6sCXQJl6PMYi+G65zUCwCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T00:33:29.661860Z"},"content_sha256":"a18eaedd0c823647cd55abb6350e7d08c18f18358c1e4144aa94d242d88dbc71","schema_version":"1.0","event_id":"sha256:a18eaedd0c823647cd55abb6350e7d08c18f18358c1e4144aa94d242d88dbc71"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:R2TKRKAUVPEKBTQ636PUG72EYL","target":"graph","payload":{"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"},"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-18T02:52:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2rMf8ziPJ7V6HoNf3M1zLE+PQm1DARu8OtULqm0aitYxQniYcrmPNKbt/tNDIMNRYIEab0luJoXqhoVcNHqSBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T00:33:29.662479Z"},"content_sha256":"60d53845685c5f25501faf29e8ab2c3e746a7e843b6f09d9576a67ee060c9cb6","schema_version":"1.0","event_id":"sha256:60d53845685c5f25501faf29e8ab2c3e746a7e843b6f09d9576a67ee060c9cb6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R2TKRKAUVPEKBTQ636PUG72EYL/bundle.json","state_url":"https://pith.science/pith/R2TKRKAUVPEKBTQ636PUG72EYL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R2TKRKAUVPEKBTQ636PUG72EYL/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-05-30T00:33:29Z","links":{"resolver":"https://pith.science/pith/R2TKRKAUVPEKBTQ636PUG72EYL","bundle":"https://pith.science/pith/R2TKRKAUVPEKBTQ636PUG72EYL/bundle.json","state":"https://pith.science/pith/R2TKRKAUVPEKBTQ636PUG72EYL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R2TKRKAUVPEKBTQ636PUG72EYL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:R2TKRKAUVPEKBTQ636PUG72EYL","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":"27261a4310cbbc6f35aefc360e0d9b676bf8d04b793ea14fb3f93b04cd7183b1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-07T06:16:01Z","title_canon_sha256":"b5bf55e94f9d282663681582b902fe05298d1a1773dd4355aa7de743a059aa41"},"schema_version":"1.0","source":{"id":"1302.1648","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.1648","created_at":"2026-05-18T02:52:42Z"},{"alias_kind":"arxiv_version","alias_value":"1302.1648v1","created_at":"2026-05-18T02:52:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.1648","created_at":"2026-05-18T02:52:42Z"},{"alias_kind":"pith_short_12","alias_value":"R2TKRKAUVPEK","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"R2TKRKAUVPEKBTQ6","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"R2TKRKAU","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:60d53845685c5f25501faf29e8ab2c3e746a7e843b6f09d9576a67ee060c9cb6","target":"graph","created_at":"2026-05-18T02:52:42Z","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 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","authors_text":"Guillermo Pineda-Villavicencio, Ramiro Feria-Puron","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-07T06:16:01Z","title":"Constructions of Large Graphs on Surfaces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.1648","kind":"arxiv","version":1},"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:a18eaedd0c823647cd55abb6350e7d08c18f18358c1e4144aa94d242d88dbc71","target":"record","created_at":"2026-05-18T02:52:42Z","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":"27261a4310cbbc6f35aefc360e0d9b676bf8d04b793ea14fb3f93b04cd7183b1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-07T06:16:01Z","title_canon_sha256":"b5bf55e94f9d282663681582b902fe05298d1a1773dd4355aa7de743a059aa41"},"schema_version":"1.0","source":{"id":"1302.1648","kind":"arxiv","version":1}},"canonical_sha256":"8ea6a8a814abc8a0ce1edf9f437f44c2ff2e120702cc5eecbe5aabde602041fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ea6a8a814abc8a0ce1edf9f437f44c2ff2e120702cc5eecbe5aabde602041fe","first_computed_at":"2026-05-18T02:52:42.173376Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:42.173376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aYeyoRDJJ0nSBxd4dv4X9knBHvw9UZnxcbpcOI5W0QsPM3FzBCuUCVl2r0syLMpjUPXlEpImCMFZItnK0pHGDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:42.173917Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.1648","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a18eaedd0c823647cd55abb6350e7d08c18f18358c1e4144aa94d242d88dbc71","sha256:60d53845685c5f25501faf29e8ab2c3e746a7e843b6f09d9576a67ee060c9cb6"],"state_sha256":"a44b9b05a2d4af5b4f93d0ce9b72e736d58fa6532baf17969258b707dd9d0781"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HZHW6Y8nnTlXfTZc9lwGcOlqZzO7tv3Vd2DLpDgpq1Mwm/33LAhZvpFh+71lzn17+GsIb4/PCp1OcKkieCSRAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T00:33:29.664928Z","bundle_sha256":"a188a6b603ec24bec1cca3c4b97a6c7c86b3172b17c169cb7d1e6907b488d85d"}}