{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:36SODYM4BCFZY43CFDDCRNLE2S","short_pith_number":"pith:36SODYM4","schema_version":"1.0","canonical_sha256":"dfa4e1e19c088b9c736228c628b564d490936b10c4b66ccf237afaa641588552","source":{"kind":"arxiv","id":"1608.00373","version":2},"attestation_state":"computed","paper":{"title":"The spectral excess theorem for graphs with few eigenvalues whose distance-$2$ or distance-$1$-or-$2$ graph is strongly regular","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"C. Dalf\\'o, J. Koolen, M.A. Fiol","submitted_at":"2016-08-01T10:07:58Z","abstract_excerpt":"We study regular graphs whose distance-$2$ graph or distance-$1$-or-$2$ graph is strongly regular. We provide a characterization of such graphs $\\Gamma$ (among regular graphs with few distinct eigenvalues) in terms of the spectrum and the mean number of vertices at maximal distance $d$ from every vertex, where $d+1$ is the number of different eigenvalues of $\\Gamma$. This can be seen as a another version of the so-called spectral excess theorem, which characterizes in a similar way those regular graphs that are distance-regular."},"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":"1608.00373","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-01T10:07:58Z","cross_cats_sorted":[],"title_canon_sha256":"cd9935af0f26a704ed94d468c0a9be1a9b21cccaf73455f7462a5c1d491fd981","abstract_canon_sha256":"7193d9d8ee2cae740a4e1cbee7e1685f39532c1d0271a96f4d111edc90241a9e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:34.488148Z","signature_b64":"7Ldss2SUCkQ7Unm1clIcnj76ycYKW1313wuVV/EprSKY4jC9t/hWze+aedalYIEnt801lyEkT6hNGru//+C9DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dfa4e1e19c088b9c736228c628b564d490936b10c4b66ccf237afaa641588552","last_reissued_at":"2026-05-17T23:52:34.487800Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:34.487800Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The spectral excess theorem for graphs with few eigenvalues whose distance-$2$ or distance-$1$-or-$2$ graph is strongly regular","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"C. Dalf\\'o, J. Koolen, M.A. Fiol","submitted_at":"2016-08-01T10:07:58Z","abstract_excerpt":"We study regular graphs whose distance-$2$ graph or distance-$1$-or-$2$ graph is strongly regular. We provide a characterization of such graphs $\\Gamma$ (among regular graphs with few distinct eigenvalues) in terms of the spectrum and the mean number of vertices at maximal distance $d$ from every vertex, where $d+1$ is the number of different eigenvalues of $\\Gamma$. This can be seen as a another version of the so-called spectral excess theorem, which characterizes in a similar way those regular graphs that are distance-regular."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.00373","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":"1608.00373","created_at":"2026-05-17T23:52:34.487855+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.00373v2","created_at":"2026-05-17T23:52:34.487855+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.00373","created_at":"2026-05-17T23:52:34.487855+00:00"},{"alias_kind":"pith_short_12","alias_value":"36SODYM4BCFZ","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"36SODYM4BCFZY43C","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"36SODYM4","created_at":"2026-05-18T12:29:55.572404+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/36SODYM4BCFZY43CFDDCRNLE2S","json":"https://pith.science/pith/36SODYM4BCFZY43CFDDCRNLE2S.json","graph_json":"https://pith.science/api/pith-number/36SODYM4BCFZY43CFDDCRNLE2S/graph.json","events_json":"https://pith.science/api/pith-number/36SODYM4BCFZY43CFDDCRNLE2S/events.json","paper":"https://pith.science/paper/36SODYM4"},"agent_actions":{"view_html":"https://pith.science/pith/36SODYM4BCFZY43CFDDCRNLE2S","download_json":"https://pith.science/pith/36SODYM4BCFZY43CFDDCRNLE2S.json","view_paper":"https://pith.science/paper/36SODYM4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.00373&json=true","fetch_graph":"https://pith.science/api/pith-number/36SODYM4BCFZY43CFDDCRNLE2S/graph.json","fetch_events":"https://pith.science/api/pith-number/36SODYM4BCFZY43CFDDCRNLE2S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/36SODYM4BCFZY43CFDDCRNLE2S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/36SODYM4BCFZY43CFDDCRNLE2S/action/storage_attestation","attest_author":"https://pith.science/pith/36SODYM4BCFZY43CFDDCRNLE2S/action/author_attestation","sign_citation":"https://pith.science/pith/36SODYM4BCFZY43CFDDCRNLE2S/action/citation_signature","submit_replication":"https://pith.science/pith/36SODYM4BCFZY43CFDDCRNLE2S/action/replication_record"}},"created_at":"2026-05-17T23:52:34.487855+00:00","updated_at":"2026-05-17T23:52:34.487855+00:00"}