{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:3FV2SXYRAURZ53JBEK2QSFUBV7","short_pith_number":"pith:3FV2SXYR","schema_version":"1.0","canonical_sha256":"d96ba95f1105239eed2122b5091681afcf9238c17ebfacd1a4073ab65f7d71e2","source":{"kind":"arxiv","id":"1906.01307","version":1},"attestation_state":"computed","paper":{"title":"On a version of the spectral excess theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"M. A. Fiol, Safet Penji\\'c","submitted_at":"2019-06-04T10:00:12Z","abstract_excerpt":"Given a regular (connected) graph $\\Gamma=(X,E)$ with adjacency matrix $A$, $d+1$ distinct eigenvalues, and diameter $D$, we give a characterization of when its distance matrix $A_D$ is a polynomial in $A$, in terms of the adjacency spectrum of $\\Gamma$ and the arithmetic (or harmonic) mean of the numbers of vertices at distance $\\le D-1$ of every vertex. The same results is proved for any graph by using its Laplacian matrix $L$ and corresponding spectrum. When $D=d$ we reobtain the spectral excess theorem characterizing distance-regular graphs."},"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":"1906.01307","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-04T10:00:12Z","cross_cats_sorted":[],"title_canon_sha256":"56a4935a66ae34518b034f24f8b103d4d398de819615da9fffb34f8e0a470ad6","abstract_canon_sha256":"c1895cb4635731730143cdebc0d84afa95bd9a566e37eb4bb8fbe4f8873c29c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:17.062056Z","signature_b64":"hP1s1OGxYg8OkNzYCR3XnBCX8XLLPsYe5YII5FJNu4tRzmZjKG4sijHhFHIMRDalWGxd1mKtgT06kxtSLlvADw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d96ba95f1105239eed2122b5091681afcf9238c17ebfacd1a4073ab65f7d71e2","last_reissued_at":"2026-05-17T23:44:17.061547Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:17.061547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On a version of the spectral excess theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"M. A. Fiol, Safet Penji\\'c","submitted_at":"2019-06-04T10:00:12Z","abstract_excerpt":"Given a regular (connected) graph $\\Gamma=(X,E)$ with adjacency matrix $A$, $d+1$ distinct eigenvalues, and diameter $D$, we give a characterization of when its distance matrix $A_D$ is a polynomial in $A$, in terms of the adjacency spectrum of $\\Gamma$ and the arithmetic (or harmonic) mean of the numbers of vertices at distance $\\le D-1$ of every vertex. The same results is proved for any graph by using its Laplacian matrix $L$ and corresponding spectrum. When $D=d$ we reobtain the spectral excess theorem characterizing distance-regular graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.01307","kind":"arxiv","version":1},"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":"1906.01307","created_at":"2026-05-17T23:44:17.061629+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.01307v1","created_at":"2026-05-17T23:44:17.061629+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.01307","created_at":"2026-05-17T23:44:17.061629+00:00"},{"alias_kind":"pith_short_12","alias_value":"3FV2SXYRAURZ","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"3FV2SXYRAURZ53JB","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"3FV2SXYR","created_at":"2026-05-18T12:33:07.085635+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/3FV2SXYRAURZ53JBEK2QSFUBV7","json":"https://pith.science/pith/3FV2SXYRAURZ53JBEK2QSFUBV7.json","graph_json":"https://pith.science/api/pith-number/3FV2SXYRAURZ53JBEK2QSFUBV7/graph.json","events_json":"https://pith.science/api/pith-number/3FV2SXYRAURZ53JBEK2QSFUBV7/events.json","paper":"https://pith.science/paper/3FV2SXYR"},"agent_actions":{"view_html":"https://pith.science/pith/3FV2SXYRAURZ53JBEK2QSFUBV7","download_json":"https://pith.science/pith/3FV2SXYRAURZ53JBEK2QSFUBV7.json","view_paper":"https://pith.science/paper/3FV2SXYR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.01307&json=true","fetch_graph":"https://pith.science/api/pith-number/3FV2SXYRAURZ53JBEK2QSFUBV7/graph.json","fetch_events":"https://pith.science/api/pith-number/3FV2SXYRAURZ53JBEK2QSFUBV7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3FV2SXYRAURZ53JBEK2QSFUBV7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3FV2SXYRAURZ53JBEK2QSFUBV7/action/storage_attestation","attest_author":"https://pith.science/pith/3FV2SXYRAURZ53JBEK2QSFUBV7/action/author_attestation","sign_citation":"https://pith.science/pith/3FV2SXYRAURZ53JBEK2QSFUBV7/action/citation_signature","submit_replication":"https://pith.science/pith/3FV2SXYRAURZ53JBEK2QSFUBV7/action/replication_record"}},"created_at":"2026-05-17T23:44:17.061629+00:00","updated_at":"2026-05-17T23:44:17.061629+00:00"}