{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:LFQGEIXC7RCL3IBD4NGNWBBIYR","short_pith_number":"pith:LFQGEIXC","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"},"canonical_sha256":"59606222e2fc44bda023e34cdb0428c477c273541e2ef8cc52ca14d3f80ddec7","source":{"kind":"arxiv","id":"1412.3855","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.3855","created_at":"2026-05-18T02:31:29Z"},{"alias_kind":"arxiv_version","alias_value":"1412.3855v1","created_at":"2026-05-18T02:31:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3855","created_at":"2026-05-18T02:31:29Z"},{"alias_kind":"pith_short_12","alias_value":"LFQGEIXC7RCL","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LFQGEIXC7RCL3IBD","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LFQGEIXC","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:LFQGEIXC7RCL3IBD4NGNWBBIYR","target":"record","payload":{"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"},"canonical_sha256":"59606222e2fc44bda023e34cdb0428c477c273541e2ef8cc52ca14d3f80ddec7","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"},"source_kind":"arxiv","source_id":"1412.3855","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:31:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vo/WYVf3EHTYK1cWuS2LDx0Pk/SSGNvTDEbeLUXLtjSqfzy7IjENFEKJIurulaFAFFMz6Xg7/22gXsIvm+8CDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:56:19.808144Z"},"content_sha256":"bc85a2e72d357bf8be49295e6f98fc602d12e2d3fa5ebb8513fabeace2979fb1","schema_version":"1.0","event_id":"sha256:bc85a2e72d357bf8be49295e6f98fc602d12e2d3fa5ebb8513fabeace2979fb1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:LFQGEIXC7RCL3IBD4NGNWBBIYR","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:31:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"27mhBizoq65+gO/1Tsj9Om0CZ8p8IzHFWkrfudMj87pHNwAKXpphg9DXcNA6XUy/MBbqipLlZ4Ufxa3iW3wvCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:56:19.808532Z"},"content_sha256":"634a623ba20f6a50f77fcd839c87d4b5f04d105b53a392ee22ac86cad258bd02","schema_version":"1.0","event_id":"sha256:634a623ba20f6a50f77fcd839c87d4b5f04d105b53a392ee22ac86cad258bd02"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LFQGEIXC7RCL3IBD4NGNWBBIYR/bundle.json","state_url":"https://pith.science/pith/LFQGEIXC7RCL3IBD4NGNWBBIYR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LFQGEIXC7RCL3IBD4NGNWBBIYR/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-29T14:56:19Z","links":{"resolver":"https://pith.science/pith/LFQGEIXC7RCL3IBD4NGNWBBIYR","bundle":"https://pith.science/pith/LFQGEIXC7RCL3IBD4NGNWBBIYR/bundle.json","state":"https://pith.science/pith/LFQGEIXC7RCL3IBD4NGNWBBIYR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LFQGEIXC7RCL3IBD4NGNWBBIYR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:LFQGEIXC7RCL3IBD4NGNWBBIYR","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"358a5c7ca7a0c936b1f65748efa617de513395c65d1055febf2bc8ae2f5f9c6f","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-11T23:00:37Z","title_canon_sha256":"00c1077205fdf791c468d0cfdf207189cd1a9b413677f57b2929ef46a13dfa29"},"schema_version":"1.0","source":{"id":"1412.3855","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.3855","created_at":"2026-05-18T02:31:29Z"},{"alias_kind":"arxiv_version","alias_value":"1412.3855v1","created_at":"2026-05-18T02:31:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3855","created_at":"2026-05-18T02:31:29Z"},{"alias_kind":"pith_short_12","alias_value":"LFQGEIXC7RCL","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LFQGEIXC7RCL3IBD","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LFQGEIXC","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:634a623ba20f6a50f77fcd839c87d4b5f04d105b53a392ee22ac86cad258bd02","target":"graph","created_at":"2026-05-18T02:31:29Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Franklin H. J. Kenter","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-11T23:00:37Z","title":"Necessary Spectral Conditions for Coloring Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.3855","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:bc85a2e72d357bf8be49295e6f98fc602d12e2d3fa5ebb8513fabeace2979fb1","target":"record","created_at":"2026-05-18T02:31:29Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"358a5c7ca7a0c936b1f65748efa617de513395c65d1055febf2bc8ae2f5f9c6f","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-11T23:00:37Z","title_canon_sha256":"00c1077205fdf791c468d0cfdf207189cd1a9b413677f57b2929ef46a13dfa29"},"schema_version":"1.0","source":{"id":"1412.3855","kind":"arxiv","version":1}},"canonical_sha256":"59606222e2fc44bda023e34cdb0428c477c273541e2ef8cc52ca14d3f80ddec7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"59606222e2fc44bda023e34cdb0428c477c273541e2ef8cc52ca14d3f80ddec7","first_computed_at":"2026-05-18T02:31:29.486857Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:31:29.486857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vHvz/jLXsHSI8jH61B7LTz/5FdIEZoM46gpZ4w6We+V5s40haFw5Gc8QzK8PZtGWwIkGAksiKsb9bdrGPIiIBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:31:29.487479Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.3855","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc85a2e72d357bf8be49295e6f98fc602d12e2d3fa5ebb8513fabeace2979fb1","sha256:634a623ba20f6a50f77fcd839c87d4b5f04d105b53a392ee22ac86cad258bd02"],"state_sha256":"9c6cca24c70dbb9bdaac2e8f66801b04596b4dc38a9f96f74f0dcf15dce86040"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0f19aBFSkJ++N10qLf2rgS0qzunkI3FQVZgPmJGeFEUl6d6gV6pApIP/shsqjGxErP6fcCNirmNKqx8l3CJRCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T14:56:19.810628Z","bundle_sha256":"35261087271a30ea58fe1ca9bfeb634d1958aba558f0e602c662173b85eda0c8"}}