{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DD6DBY7LJ6YFNJX2GCZIUAJDFX","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":"301b743b85ccd8965e0fe143f18bb2ac974130d7d2b419a7b53939fa0db891ff","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-15T21:27:19Z","title_canon_sha256":"349433a5c492314d83bd0c2aa28a84bbff9ea9f39b21bda4ca28933fd285063a"},"schema_version":"1.0","source":{"id":"1810.06704","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.06704","created_at":"2026-05-18T00:03:11Z"},{"alias_kind":"arxiv_version","alias_value":"1810.06704v1","created_at":"2026-05-18T00:03:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.06704","created_at":"2026-05-18T00:03:11Z"},{"alias_kind":"pith_short_12","alias_value":"DD6DBY7LJ6YF","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DD6DBY7LJ6YFNJX2","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DD6DBY7L","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:8c824a660f5972b1f2005303092b2b30c6e4c474222988d0244f538c7e44d515","target":"graph","created_at":"2026-05-18T00:03:11Z","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":"Let $G$ be a graph with chromatic number $\\chi$, maximum degree $\\Delta$ and clique number $\\omega$. Reed's conjecture states that $\\chi \\leq \\lceil (1-\\varepsilon)(\\Delta + 1) + \\varepsilon\\omega \\rceil$ for all $\\varepsilon \\leq 1/2$. It was shown by King and Reed that, provided $\\Delta$ is large enough, the conjecture holds for $\\varepsilon \\leq 1/130,000$. In this article, we show that the same statement holds for $\\varepsilon \\leq 1/26$, thus making a significant step towards Reed's conjecture. We derive this result from a general technique to bound the chromatic number of a graph where n","authors_text":"Luke Postle, Marthe Bonamy, Thomas Perrett","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-15T21:27:19Z","title":"Colouring Graphs with Sparse Neighbourhoods: Bounds and Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.06704","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:62932339490db59df642c6267fc271b10dcfb16ea2076e2955daeb51cb2887ca","target":"record","created_at":"2026-05-18T00:03:11Z","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":"301b743b85ccd8965e0fe143f18bb2ac974130d7d2b419a7b53939fa0db891ff","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-15T21:27:19Z","title_canon_sha256":"349433a5c492314d83bd0c2aa28a84bbff9ea9f39b21bda4ca28933fd285063a"},"schema_version":"1.0","source":{"id":"1810.06704","kind":"arxiv","version":1}},"canonical_sha256":"18fc30e3eb4fb056a6fa30b28a01232dc723260731f2161a11c17b9348dfcd2a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"18fc30e3eb4fb056a6fa30b28a01232dc723260731f2161a11c17b9348dfcd2a","first_computed_at":"2026-05-18T00:03:11.863653Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:11.863653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XUW1VWi1zP+7rcEN0fsWtOLh//aLsR9TG6GFCukFZl2Z4jzOZyBcF/k2/6rbWxdoaD1Pdo0fjpTqiJ52Pze+Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:11.864260Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.06704","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:62932339490db59df642c6267fc271b10dcfb16ea2076e2955daeb51cb2887ca","sha256:8c824a660f5972b1f2005303092b2b30c6e4c474222988d0244f538c7e44d515"],"state_sha256":"3b800bf2b81007e89d3238ef95aa31d9afdf7d859abe0393084eca3ed141327e"}