{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LM2VUU5EZFEVXJKM6Q6PNP4MS3","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":"dab2d129cf9c824d5978d627b7268d919e1492ed81fc7a3f6ba5f2dd4835ebe4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-10T00:34:54Z","title_canon_sha256":"9de3efb31b9e5a328019e5b7232580ea8a25592898f85aaf9918273c94d7e3c9"},"schema_version":"1.0","source":{"id":"1704.02675","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.02675","created_at":"2026-05-17T23:48:57Z"},{"alias_kind":"arxiv_version","alias_value":"1704.02675v2","created_at":"2026-05-17T23:48:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02675","created_at":"2026-05-17T23:48:57Z"},{"alias_kind":"pith_short_12","alias_value":"LM2VUU5EZFEV","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LM2VUU5EZFEVXJKM","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LM2VUU5E","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:052e02d8ece6c2d678ae88b43c522eff3429f5ff05fdf6f1c01440ddf5f53549","target":"graph","created_at":"2026-05-17T23:48:57Z","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 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.","authors_text":"Hiroshi Nozaki","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-10T00:34:54Z","title":"Largest regular multigraphs with three distinct eigenvalues"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02675","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:00f0e999cd2b66b08440ef267a1ffbef2971ef1637a4ab5132bbd3c3abafbc3e","target":"record","created_at":"2026-05-17T23:48:57Z","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":"dab2d129cf9c824d5978d627b7268d919e1492ed81fc7a3f6ba5f2dd4835ebe4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-10T00:34:54Z","title_canon_sha256":"9de3efb31b9e5a328019e5b7232580ea8a25592898f85aaf9918273c94d7e3c9"},"schema_version":"1.0","source":{"id":"1704.02675","kind":"arxiv","version":2}},"canonical_sha256":"5b355a53a4c9495ba54cf43cf6bf8c96d6e38d777e2ebdb8e8c1b7688f1830e0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b355a53a4c9495ba54cf43cf6bf8c96d6e38d777e2ebdb8e8c1b7688f1830e0","first_computed_at":"2026-05-17T23:48:57.495561Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:57.495561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UqPigH9kq0FCzl2C2sldPjnkAVcbDMbcC8NU3esiSmi2aFAh31F/DjQa1RvDWQDmumYUjM1VjxTLUMLiRGYSBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:57.496083Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.02675","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:00f0e999cd2b66b08440ef267a1ffbef2971ef1637a4ab5132bbd3c3abafbc3e","sha256:052e02d8ece6c2d678ae88b43c522eff3429f5ff05fdf6f1c01440ddf5f53549"],"state_sha256":"dd9c1e8a0395fd7dc2823871f449f4231abae61de7cc350e0e4c8571f541e536"}