{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:LFQGEIXC7RCL3IBD4NGNWBBIYR","short_pith_number":"pith:LFQGEIXC","schema_version":"1.0","canonical_sha256":"59606222e2fc44bda023e34cdb0428c477c273541e2ef8cc52ca14d3f80ddec7","source":{"kind":"arxiv","id":"1412.3855","version":1},"attestation_state":"computed","paper":{"title":"Necessary Spectral Conditions for Coloring Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Franklin H. J. Kenter","submitted_at":"2014-12-11T23:00:37Z","abstract_excerpt":"Hoffman proved that for a simple graph $G$, the chromatic number $\\chi(G)$ obeys $\\chi(G) \\le 1 - \\frac{\\lambda_1}{\\lambda_{n}}$ where $\\lambda_1$ and $\\lambda_n$ are the maximal and minimal eigenvalues of the adjacency matrix of $G$ respectively. Lov\\'asz later showed that $\\chi(G) \\le 1 - \\frac{\\lambda_1}{\\lambda_{n}}$ for any (perhaps negatively) weighted adjacency matrix.\n  In this paper, we give a probabilistic proof of Lov\\'asz's theorem, then extend the technique to derive generalizations of Hoffman's theorem when allowed a certain proportion of edge-conflicts. Using this result, we sho"},"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":"1412.3855","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-11T23:00:37Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"00c1077205fdf791c468d0cfdf207189cd1a9b413677f57b2929ef46a13dfa29","abstract_canon_sha256":"358a5c7ca7a0c936b1f65748efa617de513395c65d1055febf2bc8ae2f5f9c6f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:29.487479Z","signature_b64":"vHvz/jLXsHSI8jH61B7LTz/5FdIEZoM46gpZ4w6We+V5s40haFw5Gc8QzK8PZtGWwIkGAksiKsb9bdrGPIiIBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59606222e2fc44bda023e34cdb0428c477c273541e2ef8cc52ca14d3f80ddec7","last_reissued_at":"2026-05-18T02:31:29.486857Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:29.486857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Necessary Spectral Conditions for Coloring Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Franklin H. J. Kenter","submitted_at":"2014-12-11T23:00:37Z","abstract_excerpt":"Hoffman proved that for a simple graph $G$, the chromatic number $\\chi(G)$ obeys $\\chi(G) \\le 1 - \\frac{\\lambda_1}{\\lambda_{n}}$ where $\\lambda_1$ and $\\lambda_n$ are the maximal and minimal eigenvalues of the adjacency matrix of $G$ respectively. Lov\\'asz later showed that $\\chi(G) \\le 1 - \\frac{\\lambda_1}{\\lambda_{n}}$ for any (perhaps negatively) weighted adjacency matrix.\n  In this paper, we give a probabilistic proof of Lov\\'asz's theorem, then extend the technique to derive generalizations of Hoffman's theorem when allowed a certain proportion of edge-conflicts. Using this result, we sho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.3855","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":"1412.3855","created_at":"2026-05-18T02:31:29.486943+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.3855v1","created_at":"2026-05-18T02:31:29.486943+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3855","created_at":"2026-05-18T02:31:29.486943+00:00"},{"alias_kind":"pith_short_12","alias_value":"LFQGEIXC7RCL","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"LFQGEIXC7RCL3IBD","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"LFQGEIXC","created_at":"2026-05-18T12:28:38.356838+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/LFQGEIXC7RCL3IBD4NGNWBBIYR","json":"https://pith.science/pith/LFQGEIXC7RCL3IBD4NGNWBBIYR.json","graph_json":"https://pith.science/api/pith-number/LFQGEIXC7RCL3IBD4NGNWBBIYR/graph.json","events_json":"https://pith.science/api/pith-number/LFQGEIXC7RCL3IBD4NGNWBBIYR/events.json","paper":"https://pith.science/paper/LFQGEIXC"},"agent_actions":{"view_html":"https://pith.science/pith/LFQGEIXC7RCL3IBD4NGNWBBIYR","download_json":"https://pith.science/pith/LFQGEIXC7RCL3IBD4NGNWBBIYR.json","view_paper":"https://pith.science/paper/LFQGEIXC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.3855&json=true","fetch_graph":"https://pith.science/api/pith-number/LFQGEIXC7RCL3IBD4NGNWBBIYR/graph.json","fetch_events":"https://pith.science/api/pith-number/LFQGEIXC7RCL3IBD4NGNWBBIYR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LFQGEIXC7RCL3IBD4NGNWBBIYR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LFQGEIXC7RCL3IBD4NGNWBBIYR/action/storage_attestation","attest_author":"https://pith.science/pith/LFQGEIXC7RCL3IBD4NGNWBBIYR/action/author_attestation","sign_citation":"https://pith.science/pith/LFQGEIXC7RCL3IBD4NGNWBBIYR/action/citation_signature","submit_replication":"https://pith.science/pith/LFQGEIXC7RCL3IBD4NGNWBBIYR/action/replication_record"}},"created_at":"2026-05-18T02:31:29.486943+00:00","updated_at":"2026-05-18T02:31:29.486943+00:00"}