{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6HZ4HAPLRJG3RXODY3I7WUYNLB","short_pith_number":"pith:6HZ4HAPL","schema_version":"1.0","canonical_sha256":"f1f3c381eb8a4db8ddc3c6d1fb530d5859ff13518030732b553f153e5baf62ac","source":{"kind":"arxiv","id":"1708.02425","version":2},"attestation_state":"computed","paper":{"title":"Large Cayley graphs of small diameter","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Grahame Erskine, James Tuite","submitted_at":"2017-08-08T09:35:53Z","abstract_excerpt":"The degree-diameter problem seeks to find the largest possible number of vertices in a graph having given diameter and given maximum degree. Very often the problem is studied for restricted families of graph such as vertex-transitive or Cayley graphs, with the goal being to find a family of graphs with good asymptotic properties. In this paper we restrict attention to Cayley graphs, and study the asymptotics by fixing a small diameter and constructing families of graphs of large order for all values of the maximum degree. Much of the literature in this direction is focused on the diameter two "},"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":"1708.02425","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-08T09:35:53Z","cross_cats_sorted":[],"title_canon_sha256":"0e77dda39b7f306b5d90b494a5a2c17767277773d92afe0e75473f4ac860116f","abstract_canon_sha256":"f5d83a846d5f24db92302e3ec420f0fa0328aa13af215a67afd5ceb489760271"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:41.434154Z","signature_b64":"gVnrXX2/CSJ+yWqijlwOWdIALAoaItbjLldd7j+s/TKRlN+QNPcR9py+Yyo3N1GxpzHPLiMeB5gdia3uY7z6BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1f3c381eb8a4db8ddc3c6d1fb530d5859ff13518030732b553f153e5baf62ac","last_reissued_at":"2026-05-18T00:18:41.433620Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:41.433620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Large Cayley graphs of small diameter","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Grahame Erskine, James Tuite","submitted_at":"2017-08-08T09:35:53Z","abstract_excerpt":"The degree-diameter problem seeks to find the largest possible number of vertices in a graph having given diameter and given maximum degree. Very often the problem is studied for restricted families of graph such as vertex-transitive or Cayley graphs, with the goal being to find a family of graphs with good asymptotic properties. In this paper we restrict attention to Cayley graphs, and study the asymptotics by fixing a small diameter and constructing families of graphs of large order for all values of the maximum degree. Much of the literature in this direction is focused on the diameter two "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.02425","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":"1708.02425","created_at":"2026-05-18T00:18:41.433696+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.02425v2","created_at":"2026-05-18T00:18:41.433696+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02425","created_at":"2026-05-18T00:18:41.433696+00:00"},{"alias_kind":"pith_short_12","alias_value":"6HZ4HAPLRJG3","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6HZ4HAPLRJG3RXOD","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6HZ4HAPL","created_at":"2026-05-18T12:31:03.183658+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/6HZ4HAPLRJG3RXODY3I7WUYNLB","json":"https://pith.science/pith/6HZ4HAPLRJG3RXODY3I7WUYNLB.json","graph_json":"https://pith.science/api/pith-number/6HZ4HAPLRJG3RXODY3I7WUYNLB/graph.json","events_json":"https://pith.science/api/pith-number/6HZ4HAPLRJG3RXODY3I7WUYNLB/events.json","paper":"https://pith.science/paper/6HZ4HAPL"},"agent_actions":{"view_html":"https://pith.science/pith/6HZ4HAPLRJG3RXODY3I7WUYNLB","download_json":"https://pith.science/pith/6HZ4HAPLRJG3RXODY3I7WUYNLB.json","view_paper":"https://pith.science/paper/6HZ4HAPL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.02425&json=true","fetch_graph":"https://pith.science/api/pith-number/6HZ4HAPLRJG3RXODY3I7WUYNLB/graph.json","fetch_events":"https://pith.science/api/pith-number/6HZ4HAPLRJG3RXODY3I7WUYNLB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6HZ4HAPLRJG3RXODY3I7WUYNLB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6HZ4HAPLRJG3RXODY3I7WUYNLB/action/storage_attestation","attest_author":"https://pith.science/pith/6HZ4HAPLRJG3RXODY3I7WUYNLB/action/author_attestation","sign_citation":"https://pith.science/pith/6HZ4HAPLRJG3RXODY3I7WUYNLB/action/citation_signature","submit_replication":"https://pith.science/pith/6HZ4HAPLRJG3RXODY3I7WUYNLB/action/replication_record"}},"created_at":"2026-05-18T00:18:41.433696+00:00","updated_at":"2026-05-18T00:18:41.433696+00:00"}