{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ISB7EYBDNIDVRH4EKHZEYPLNQO","short_pith_number":"pith:ISB7EYBD","schema_version":"1.0","canonical_sha256":"4483f260236a07589f8451f24c3d6d83a758572921fb1401750d98510a9702d5","source":{"kind":"arxiv","id":"1612.07085","version":2},"attestation_state":"computed","paper":{"title":"A generalization of a theorem of Hoffman","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jack H. Koolen, Jae Young Yang, Qianqian Yang","submitted_at":"2016-12-21T13:04:05Z","abstract_excerpt":"In 1977, Hoffman gave a characterization of graphs with smallest eigenvalue at least $-2$. In this paper we generalize this result to graphs with smaller smallest eigenvalue. For the proof, we use a combinatorial object named Hoffman graph, introduced by Woo and Neumaier in 1995. Our result says that for every $\\lambda \\leq -2$, if a graph with smallest eigenvalue at least $\\lambda$ satisfies some local conditions, then it is highly structured. We apply our result to graphs which are cospectral with the Hamming graph $H(3,q)$, the Johnson graph $J(v, 3)$ and the $2$-clique extension of grids, "},"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":"1612.07085","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-21T13:04:05Z","cross_cats_sorted":[],"title_canon_sha256":"93f494471f0d563d72a5da5fc19dae98f88b3db44d1a4733b811619586abcbf7","abstract_canon_sha256":"c8978583f72598890c4ccbaef340803e3ef6682954baeb40449adbc0c4883faa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:19.086230Z","signature_b64":"iGkbm7Aa2mw64a50/ySt5PlVb3/9j0qMBmezdYJMtboWR5WBD8RhgB9jjDcku4BYGzNoRW3xmSt2ukrXhp3yAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4483f260236a07589f8451f24c3d6d83a758572921fb1401750d98510a9702d5","last_reissued_at":"2026-05-18T00:11:19.085512Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:19.085512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A generalization of a theorem of Hoffman","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jack H. Koolen, Jae Young Yang, Qianqian Yang","submitted_at":"2016-12-21T13:04:05Z","abstract_excerpt":"In 1977, Hoffman gave a characterization of graphs with smallest eigenvalue at least $-2$. In this paper we generalize this result to graphs with smaller smallest eigenvalue. For the proof, we use a combinatorial object named Hoffman graph, introduced by Woo and Neumaier in 1995. Our result says that for every $\\lambda \\leq -2$, if a graph with smallest eigenvalue at least $\\lambda$ satisfies some local conditions, then it is highly structured. We apply our result to graphs which are cospectral with the Hamming graph $H(3,q)$, the Johnson graph $J(v, 3)$ and the $2$-clique extension of grids, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.07085","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":"1612.07085","created_at":"2026-05-18T00:11:19.085634+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.07085v2","created_at":"2026-05-18T00:11:19.085634+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.07085","created_at":"2026-05-18T00:11:19.085634+00:00"},{"alias_kind":"pith_short_12","alias_value":"ISB7EYBDNIDV","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"ISB7EYBDNIDVRH4E","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"ISB7EYBD","created_at":"2026-05-18T12:30:22.444734+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/ISB7EYBDNIDVRH4EKHZEYPLNQO","json":"https://pith.science/pith/ISB7EYBDNIDVRH4EKHZEYPLNQO.json","graph_json":"https://pith.science/api/pith-number/ISB7EYBDNIDVRH4EKHZEYPLNQO/graph.json","events_json":"https://pith.science/api/pith-number/ISB7EYBDNIDVRH4EKHZEYPLNQO/events.json","paper":"https://pith.science/paper/ISB7EYBD"},"agent_actions":{"view_html":"https://pith.science/pith/ISB7EYBDNIDVRH4EKHZEYPLNQO","download_json":"https://pith.science/pith/ISB7EYBDNIDVRH4EKHZEYPLNQO.json","view_paper":"https://pith.science/paper/ISB7EYBD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.07085&json=true","fetch_graph":"https://pith.science/api/pith-number/ISB7EYBDNIDVRH4EKHZEYPLNQO/graph.json","fetch_events":"https://pith.science/api/pith-number/ISB7EYBDNIDVRH4EKHZEYPLNQO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ISB7EYBDNIDVRH4EKHZEYPLNQO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ISB7EYBDNIDVRH4EKHZEYPLNQO/action/storage_attestation","attest_author":"https://pith.science/pith/ISB7EYBDNIDVRH4EKHZEYPLNQO/action/author_attestation","sign_citation":"https://pith.science/pith/ISB7EYBDNIDVRH4EKHZEYPLNQO/action/citation_signature","submit_replication":"https://pith.science/pith/ISB7EYBDNIDVRH4EKHZEYPLNQO/action/replication_record"}},"created_at":"2026-05-18T00:11:19.085634+00:00","updated_at":"2026-05-18T00:11:19.085634+00:00"}