{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:LM2VUU5EZFEVXJKM6Q6PNP4MS3","short_pith_number":"pith:LM2VUU5E","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"},"canonical_sha256":"5b355a53a4c9495ba54cf43cf6bf8c96d6e38d777e2ebdb8e8c1b7688f1830e0","source":{"kind":"arxiv","id":"1704.02675","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:LM2VUU5EZFEVXJKM6Q6PNP4MS3","target":"record","payload":{"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"},"canonical_sha256":"5b355a53a4c9495ba54cf43cf6bf8c96d6e38d777e2ebdb8e8c1b7688f1830e0","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"},"source_kind":"arxiv","source_id":"1704.02675","source_version":2,"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-17T23:48:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zjkgFn/SZrzvnAXX4bTY/JSBsmUiYLecjI/sebe/NgYPlMgDplL+RcF3mIDfWp0b9eDpMgzbpZoYYU75L6CPDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:38:52.969999Z"},"content_sha256":"00f0e999cd2b66b08440ef267a1ffbef2971ef1637a4ab5132bbd3c3abafbc3e","schema_version":"1.0","event_id":"sha256:00f0e999cd2b66b08440ef267a1ffbef2971ef1637a4ab5132bbd3c3abafbc3e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:LM2VUU5EZFEVXJKM6Q6PNP4MS3","target":"graph","payload":{"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"},"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-17T23:48:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KmP6wr7Gl9W2nY9ohjMJxF/xjlXMOpGY6lTWRS34FTQbSZVrhgO1v5rtv+Pb3h0V9MwNzr2tWow9vFRhn883AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:38:52.970660Z"},"content_sha256":"052e02d8ece6c2d678ae88b43c522eff3429f5ff05fdf6f1c01440ddf5f53549","schema_version":"1.0","event_id":"sha256:052e02d8ece6c2d678ae88b43c522eff3429f5ff05fdf6f1c01440ddf5f53549"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LM2VUU5EZFEVXJKM6Q6PNP4MS3/bundle.json","state_url":"https://pith.science/pith/LM2VUU5EZFEVXJKM6Q6PNP4MS3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LM2VUU5EZFEVXJKM6Q6PNP4MS3/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-27T21:38:52Z","links":{"resolver":"https://pith.science/pith/LM2VUU5EZFEVXJKM6Q6PNP4MS3","bundle":"https://pith.science/pith/LM2VUU5EZFEVXJKM6Q6PNP4MS3/bundle.json","state":"https://pith.science/pith/LM2VUU5EZFEVXJKM6Q6PNP4MS3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LM2VUU5EZFEVXJKM6Q6PNP4MS3/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wlv8BrAICIVTCaz1vSnsu9G3VMSImF80NIMnrdZAf6A3P5wrQRGM9vKsBwxTgUCipF4rmiAnNFzAspkuslZBAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T21:38:52.973725Z","bundle_sha256":"58335c75cb93312cff73c2f6dd0ceef8ca7258b455722682f02ce13d0dab5d4c"}}