{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:4ZX66BRCTCHKK4MYYRCMZV27WC","short_pith_number":"pith:4ZX66BRC","schema_version":"1.0","canonical_sha256":"e66fef0622988ea57198c444ccd75fb098003ea84ffe6c8083f1c7b2eda46ffe","source":{"kind":"arxiv","id":"1211.1410","version":1},"attestation_state":"computed","paper":{"title":"A short proof that $\\chi$ can be bounded $\\epsilon$ away from $\\Delta+1$ towards $\\omega$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Andrew D. King, Bruce A. Reed","submitted_at":"2012-11-06T22:02:27Z","abstract_excerpt":"In 1998 the second author proved that there is an $\\epsilon>0$ such that every graph satisfies $\\chi \\leq \\lceil (1-\\epsilon)(\\Delta+1)+\\epsilon\\omega\\rceil$. The first author recently proved that any graph satisfying $\\omega > \\frac 23(\\Delta+1)$ contains a stable set intersecting every maximum clique. In this note we exploit the latter result to give a much shorter, simpler proof of the former. We include, as a certificate of simplicity, an appendix that proves all intermediate results with the exception of Hall's Theorem, Brooks' Theorem, the Lov\\'asz Local Lemma, and Talagrand's Inequality"},"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":"1211.1410","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-11-06T22:02:27Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d9a462b866b3636fb2ef2c60e5d4773a021c99678897839a4ba8bb090d77ae5e","abstract_canon_sha256":"ffb58a618f2e25e017dc2be2bdeaa7ca0b479c9638c82b5a93a7bf1b5c9a623c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:20.996776Z","signature_b64":"jmfenqKSY7CsJ6A/X5Rbay2PbomSubiI0dPvq1ZK0/lyp/IzIw9f8nHh+RRB4VVlKHV7Z/BtfwD1jbxx8fhSCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e66fef0622988ea57198c444ccd75fb098003ea84ffe6c8083f1c7b2eda46ffe","last_reissued_at":"2026-05-18T03:41:20.996376Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:20.996376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A short proof that $\\chi$ can be bounded $\\epsilon$ away from $\\Delta+1$ towards $\\omega$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Andrew D. King, Bruce A. Reed","submitted_at":"2012-11-06T22:02:27Z","abstract_excerpt":"In 1998 the second author proved that there is an $\\epsilon>0$ such that every graph satisfies $\\chi \\leq \\lceil (1-\\epsilon)(\\Delta+1)+\\epsilon\\omega\\rceil$. The first author recently proved that any graph satisfying $\\omega > \\frac 23(\\Delta+1)$ contains a stable set intersecting every maximum clique. In this note we exploit the latter result to give a much shorter, simpler proof of the former. We include, as a certificate of simplicity, an appendix that proves all intermediate results with the exception of Hall's Theorem, Brooks' Theorem, the Lov\\'asz Local Lemma, and Talagrand's Inequality"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.1410","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":"1211.1410","created_at":"2026-05-18T03:41:20.996434+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.1410v1","created_at":"2026-05-18T03:41:20.996434+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.1410","created_at":"2026-05-18T03:41:20.996434+00:00"},{"alias_kind":"pith_short_12","alias_value":"4ZX66BRCTCHK","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"4ZX66BRCTCHKK4MY","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"4ZX66BRC","created_at":"2026-05-18T12:26:53.410803+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/4ZX66BRCTCHKK4MYYRCMZV27WC","json":"https://pith.science/pith/4ZX66BRCTCHKK4MYYRCMZV27WC.json","graph_json":"https://pith.science/api/pith-number/4ZX66BRCTCHKK4MYYRCMZV27WC/graph.json","events_json":"https://pith.science/api/pith-number/4ZX66BRCTCHKK4MYYRCMZV27WC/events.json","paper":"https://pith.science/paper/4ZX66BRC"},"agent_actions":{"view_html":"https://pith.science/pith/4ZX66BRCTCHKK4MYYRCMZV27WC","download_json":"https://pith.science/pith/4ZX66BRCTCHKK4MYYRCMZV27WC.json","view_paper":"https://pith.science/paper/4ZX66BRC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.1410&json=true","fetch_graph":"https://pith.science/api/pith-number/4ZX66BRCTCHKK4MYYRCMZV27WC/graph.json","fetch_events":"https://pith.science/api/pith-number/4ZX66BRCTCHKK4MYYRCMZV27WC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4ZX66BRCTCHKK4MYYRCMZV27WC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4ZX66BRCTCHKK4MYYRCMZV27WC/action/storage_attestation","attest_author":"https://pith.science/pith/4ZX66BRCTCHKK4MYYRCMZV27WC/action/author_attestation","sign_citation":"https://pith.science/pith/4ZX66BRCTCHKK4MYYRCMZV27WC/action/citation_signature","submit_replication":"https://pith.science/pith/4ZX66BRCTCHKK4MYYRCMZV27WC/action/replication_record"}},"created_at":"2026-05-18T03:41:20.996434+00:00","updated_at":"2026-05-18T03:41:20.996434+00:00"}