{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:LM2VUU5EZFEVXJKM6Q6PNP4MS3","short_pith_number":"pith:LM2VUU5E","schema_version":"1.0","canonical_sha256":"5b355a53a4c9495ba54cf43cf6bf8c96d6e38d777e2ebdb8e8c1b7688f1830e0","source":{"kind":"arxiv","id":"1704.02675","version":2},"attestation_state":"computed","paper":{"title":"Largest regular multigraphs with three distinct eigenvalues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hiroshi Nozaki","submitted_at":"2017-04-10T00:34:54Z","abstract_excerpt":"We deal with connected $k$-regular multigraphs of order $n$ that has only three distinct eigenvalues. In this paper, we study the largest possible number of vertices of such a graph for given $k$. For $k=2,3,7$, the Moore graphs are largest. For $k\\ne 2,3,7,57$, we show an upper bound $n\\leq k^2-k+1$, with equality if and only if there exists a finite projective plane of order $k-1$ that admits a polarity."},"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":"1704.02675","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-10T00:34:54Z","cross_cats_sorted":[],"title_canon_sha256":"9de3efb31b9e5a328019e5b7232580ea8a25592898f85aaf9918273c94d7e3c9","abstract_canon_sha256":"dab2d129cf9c824d5978d627b7268d919e1492ed81fc7a3f6ba5f2dd4835ebe4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:57.496083Z","signature_b64":"UqPigH9kq0FCzl2C2sldPjnkAVcbDMbcC8NU3esiSmi2aFAh31F/DjQa1RvDWQDmumYUjM1VjxTLUMLiRGYSBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b355a53a4c9495ba54cf43cf6bf8c96d6e38d777e2ebdb8e8c1b7688f1830e0","last_reissued_at":"2026-05-17T23:48:57.495561Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:57.495561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Largest regular multigraphs with three distinct eigenvalues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hiroshi Nozaki","submitted_at":"2017-04-10T00:34:54Z","abstract_excerpt":"We deal with connected $k$-regular multigraphs of order $n$ that has only three distinct eigenvalues. In this paper, we study the largest possible number of vertices of such a graph for given $k$. For $k=2,3,7$, the Moore graphs are largest. For $k\\ne 2,3,7,57$, we show an upper bound $n\\leq k^2-k+1$, with equality if and only if there exists a finite projective plane of order $k-1$ that admits a polarity."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02675","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":"1704.02675","created_at":"2026-05-17T23:48:57.495646+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.02675v2","created_at":"2026-05-17T23:48:57.495646+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02675","created_at":"2026-05-17T23:48:57.495646+00:00"},{"alias_kind":"pith_short_12","alias_value":"LM2VUU5EZFEV","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"LM2VUU5EZFEVXJKM","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"LM2VUU5E","created_at":"2026-05-18T12:31:28.150371+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/LM2VUU5EZFEVXJKM6Q6PNP4MS3","json":"https://pith.science/pith/LM2VUU5EZFEVXJKM6Q6PNP4MS3.json","graph_json":"https://pith.science/api/pith-number/LM2VUU5EZFEVXJKM6Q6PNP4MS3/graph.json","events_json":"https://pith.science/api/pith-number/LM2VUU5EZFEVXJKM6Q6PNP4MS3/events.json","paper":"https://pith.science/paper/LM2VUU5E"},"agent_actions":{"view_html":"https://pith.science/pith/LM2VUU5EZFEVXJKM6Q6PNP4MS3","download_json":"https://pith.science/pith/LM2VUU5EZFEVXJKM6Q6PNP4MS3.json","view_paper":"https://pith.science/paper/LM2VUU5E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.02675&json=true","fetch_graph":"https://pith.science/api/pith-number/LM2VUU5EZFEVXJKM6Q6PNP4MS3/graph.json","fetch_events":"https://pith.science/api/pith-number/LM2VUU5EZFEVXJKM6Q6PNP4MS3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LM2VUU5EZFEVXJKM6Q6PNP4MS3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LM2VUU5EZFEVXJKM6Q6PNP4MS3/action/storage_attestation","attest_author":"https://pith.science/pith/LM2VUU5EZFEVXJKM6Q6PNP4MS3/action/author_attestation","sign_citation":"https://pith.science/pith/LM2VUU5EZFEVXJKM6Q6PNP4MS3/action/citation_signature","submit_replication":"https://pith.science/pith/LM2VUU5EZFEVXJKM6Q6PNP4MS3/action/replication_record"}},"created_at":"2026-05-17T23:48:57.495646+00:00","updated_at":"2026-05-17T23:48:57.495646+00:00"}