{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:PB574MTQHZBKPMXQSBWNBV47VQ","short_pith_number":"pith:PB574MTQ","schema_version":"1.0","canonical_sha256":"787bfe32703e42a7b2f0906cd0d79fac0571438c98fc7b82a5a2397899d129b0","source":{"kind":"arxiv","id":"1304.4354","version":1},"attestation_state":"computed","paper":{"title":"The spectral excess theorem for distance-biregular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"M.A. Fiol","submitted_at":"2013-04-16T08:11:20Z","abstract_excerpt":"The spectral excess theorem for distance-regular graphs states that a regular (connected) graph is distance-regular if and only if its spectral-excess equals its average excess. A bipartite graph is distance-biregular when it is distance-regular around each vertex and the intersection array only depends on the stable set such a vertex belongs to. In this note we derive a new version of the spectral excess theorem for bipartite distance-biregular 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":"1304.4354","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-16T08:11:20Z","cross_cats_sorted":[],"title_canon_sha256":"ca7e7ba8ba330dc062b84e1d7e2680482e63286cd32ae8414690194d4f79da1a","abstract_canon_sha256":"5658d3fd19b14e11822d7a6d9a0c0cc57b0e59970840de78c7b2d539ed0c6d31"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:53.343706Z","signature_b64":"tZwVBUooaEveNB8yc+ebXg1LUk7kANhUSZqAMg6XhjUnYGj4eBTn9EKELfFGWKwQ8K1NVhTS0gV15KUUVoerAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"787bfe32703e42a7b2f0906cd0d79fac0571438c98fc7b82a5a2397899d129b0","last_reissued_at":"2026-05-18T03:27:53.343266Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:53.343266Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The spectral excess theorem for distance-biregular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"M.A. Fiol","submitted_at":"2013-04-16T08:11:20Z","abstract_excerpt":"The spectral excess theorem for distance-regular graphs states that a regular (connected) graph is distance-regular if and only if its spectral-excess equals its average excess. A bipartite graph is distance-biregular when it is distance-regular around each vertex and the intersection array only depends on the stable set such a vertex belongs to. In this note we derive a new version of the spectral excess theorem for bipartite distance-biregular graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.4354","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":"1304.4354","created_at":"2026-05-18T03:27:53.343335+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.4354v1","created_at":"2026-05-18T03:27:53.343335+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.4354","created_at":"2026-05-18T03:27:53.343335+00:00"},{"alias_kind":"pith_short_12","alias_value":"PB574MTQHZBK","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PB574MTQHZBKPMXQ","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PB574MTQ","created_at":"2026-05-18T12:27:54.935989+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/PB574MTQHZBKPMXQSBWNBV47VQ","json":"https://pith.science/pith/PB574MTQHZBKPMXQSBWNBV47VQ.json","graph_json":"https://pith.science/api/pith-number/PB574MTQHZBKPMXQSBWNBV47VQ/graph.json","events_json":"https://pith.science/api/pith-number/PB574MTQHZBKPMXQSBWNBV47VQ/events.json","paper":"https://pith.science/paper/PB574MTQ"},"agent_actions":{"view_html":"https://pith.science/pith/PB574MTQHZBKPMXQSBWNBV47VQ","download_json":"https://pith.science/pith/PB574MTQHZBKPMXQSBWNBV47VQ.json","view_paper":"https://pith.science/paper/PB574MTQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.4354&json=true","fetch_graph":"https://pith.science/api/pith-number/PB574MTQHZBKPMXQSBWNBV47VQ/graph.json","fetch_events":"https://pith.science/api/pith-number/PB574MTQHZBKPMXQSBWNBV47VQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PB574MTQHZBKPMXQSBWNBV47VQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PB574MTQHZBKPMXQSBWNBV47VQ/action/storage_attestation","attest_author":"https://pith.science/pith/PB574MTQHZBKPMXQSBWNBV47VQ/action/author_attestation","sign_citation":"https://pith.science/pith/PB574MTQHZBKPMXQSBWNBV47VQ/action/citation_signature","submit_replication":"https://pith.science/pith/PB574MTQHZBKPMXQSBWNBV47VQ/action/replication_record"}},"created_at":"2026-05-18T03:27:53.343335+00:00","updated_at":"2026-05-18T03:27:53.343335+00:00"}