{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:HZSMCLOHBTOFEOTWTCYE7G766I","short_pith_number":"pith:HZSMCLOH","schema_version":"1.0","canonical_sha256":"3e64c12dc70cdc523a7698b04f9bfef217fdfd40e2d21ef6d9901dfe56c6baa0","source":{"kind":"arxiv","id":"1102.1021","version":2},"attestation_state":"computed","paper":{"title":"An improvement on Brooks' Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Landon Rabern","submitted_at":"2011-02-04T21:43:04Z","abstract_excerpt":"We prove that $\\chi(G) \\leq \\max {\\omega(G), \\Delta_2(G), (5/6)(\\Delta(G) + 1)}$ for every graph $G$ with $\\Delta(G) \\geq 3$. Here $\\Delta_2$ is the parameter introduced by Stacho that gives the largest degree that a vertex $v$ can have subject to the condition that $v$ is adjacent to a vertex whose degree is at least as large as its own. This upper bound generalizes both Brooks' Theorem and the Ore-degree version of Brooks' Theorem."},"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":"1102.1021","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-04T21:43:04Z","cross_cats_sorted":[],"title_canon_sha256":"299babf29beac087f020f0bc1dc55962bd494c75a7c726408840cce84f471a9a","abstract_canon_sha256":"c2c51f37d875f442f62b4e3e2ba05691c706e47fa5b99bdff0f4dbe60f2dc09d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:16:02.052914Z","signature_b64":"lr8rbDcXeskje1eBfk0VeFH9PIYfRqYnKP3gqjnLxtV+dUUX1tnoGEerKq3RWwvnqJPqqywtHN7ZnLKomyh8Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e64c12dc70cdc523a7698b04f9bfef217fdfd40e2d21ef6d9901dfe56c6baa0","last_reissued_at":"2026-05-18T04:16:02.052261Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:16:02.052261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An improvement on Brooks' Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Landon Rabern","submitted_at":"2011-02-04T21:43:04Z","abstract_excerpt":"We prove that $\\chi(G) \\leq \\max {\\omega(G), \\Delta_2(G), (5/6)(\\Delta(G) + 1)}$ for every graph $G$ with $\\Delta(G) \\geq 3$. Here $\\Delta_2$ is the parameter introduced by Stacho that gives the largest degree that a vertex $v$ can have subject to the condition that $v$ is adjacent to a vertex whose degree is at least as large as its own. This upper bound generalizes both Brooks' Theorem and the Ore-degree version of Brooks' Theorem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.1021","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":"1102.1021","created_at":"2026-05-18T04:16:02.052373+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.1021v2","created_at":"2026-05-18T04:16:02.052373+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.1021","created_at":"2026-05-18T04:16:02.052373+00:00"},{"alias_kind":"pith_short_12","alias_value":"HZSMCLOHBTOF","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"HZSMCLOHBTOFEOTW","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"HZSMCLOH","created_at":"2026-05-18T12:26:30.835961+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/HZSMCLOHBTOFEOTWTCYE7G766I","json":"https://pith.science/pith/HZSMCLOHBTOFEOTWTCYE7G766I.json","graph_json":"https://pith.science/api/pith-number/HZSMCLOHBTOFEOTWTCYE7G766I/graph.json","events_json":"https://pith.science/api/pith-number/HZSMCLOHBTOFEOTWTCYE7G766I/events.json","paper":"https://pith.science/paper/HZSMCLOH"},"agent_actions":{"view_html":"https://pith.science/pith/HZSMCLOHBTOFEOTWTCYE7G766I","download_json":"https://pith.science/pith/HZSMCLOHBTOFEOTWTCYE7G766I.json","view_paper":"https://pith.science/paper/HZSMCLOH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.1021&json=true","fetch_graph":"https://pith.science/api/pith-number/HZSMCLOHBTOFEOTWTCYE7G766I/graph.json","fetch_events":"https://pith.science/api/pith-number/HZSMCLOHBTOFEOTWTCYE7G766I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HZSMCLOHBTOFEOTWTCYE7G766I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HZSMCLOHBTOFEOTWTCYE7G766I/action/storage_attestation","attest_author":"https://pith.science/pith/HZSMCLOHBTOFEOTWTCYE7G766I/action/author_attestation","sign_citation":"https://pith.science/pith/HZSMCLOHBTOFEOTWTCYE7G766I/action/citation_signature","submit_replication":"https://pith.science/pith/HZSMCLOHBTOFEOTWTCYE7G766I/action/replication_record"}},"created_at":"2026-05-18T04:16:02.052373+00:00","updated_at":"2026-05-18T04:16:02.052373+00:00"}