{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:BGWTOL7FQ74BNK3G6DVYPZ3T36","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":"18cf68cd47fb28de072f69d244a074c5a48f9b804ef444329dec7197e10bfb2c","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"2007-07-07T04:38:14Z","title_canon_sha256":"d1ef5f51995c0555ef4b1deb782bc158b8b7ad04d3e6f8fce629bd3ff58aedbb"},"schema_version":"1.0","source":{"id":"0707.1069","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0707.1069","created_at":"2026-05-18T04:09:15Z"},{"alias_kind":"arxiv_version","alias_value":"0707.1069v2","created_at":"2026-05-18T04:09:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0707.1069","created_at":"2026-05-18T04:09:15Z"},{"alias_kind":"pith_short_12","alias_value":"BGWTOL7FQ74B","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"BGWTOL7FQ74BNK3G","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"BGWTOL7F","created_at":"2026-05-18T12:25:55Z"}],"graph_snapshots":[{"event_id":"sha256:ad0041b8db1dbd80980b8632f31194f62d99da1b48055b9cbf1d9c3705af077b","target":"graph","created_at":"2026-05-18T04:09:15Z","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":"We improve upper bounds on the chromatic number proven independently in \\cite{reedNote} and \\cite{ingo}. Our main lemma gives a sufficient condition for two paths in graph to be completely joined. Using this, we prove that if a graph has an optimal coloring with more than $\\frac{\\omega}{2}$ singleton color classes, then it satisfies $\\chi \\leq \\frac{\\omega + \\Delta + 1}{2}$. It follows that a graph satisfying $n - \\Delta < \\alpha + \\frac{\\omega - 1}{2}$ must also satisfy $\\chi \\leq \\frac{\\omega + \\Delta + 1}{2}$, improving the bounds in \\cite{reedNote} and \\cite{ingo}. We then give a simple ar","authors_text":"Landon Rabern","cross_cats":[],"headline":"","license":"","primary_cat":"math.CO","submitted_at":"2007-07-07T04:38:14Z","title":"Coloring and The Lonely Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0707.1069","kind":"arxiv","version":2},"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:e4b0b4fd193774345063caa8f929900e1b6b01f0cacc1b1d87a248274a387c58","target":"record","created_at":"2026-05-18T04:09:15Z","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":"18cf68cd47fb28de072f69d244a074c5a48f9b804ef444329dec7197e10bfb2c","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"2007-07-07T04:38:14Z","title_canon_sha256":"d1ef5f51995c0555ef4b1deb782bc158b8b7ad04d3e6f8fce629bd3ff58aedbb"},"schema_version":"1.0","source":{"id":"0707.1069","kind":"arxiv","version":2}},"canonical_sha256":"09ad372fe587f816ab66f0eb87e773dfa473405f3b23d25ccedae40874342945","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"09ad372fe587f816ab66f0eb87e773dfa473405f3b23d25ccedae40874342945","first_computed_at":"2026-05-18T04:09:15.746855Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:09:15.746855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4wfLg9X3C55yjJQOwTWFt6i52kQpH+9nmb++lxv9Hn2LCzQ2XAvZ/H8uDJ+qNdDsbWq41KwToP9smLrWEm7iCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:09:15.747552Z","signed_message":"canonical_sha256_bytes"},"source_id":"0707.1069","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e4b0b4fd193774345063caa8f929900e1b6b01f0cacc1b1d87a248274a387c58","sha256:ad0041b8db1dbd80980b8632f31194f62d99da1b48055b9cbf1d9c3705af077b"],"state_sha256":"43bca0dd02a59f9810c39a44a6dd8370e680081b3ddee3925e6baa698eb792b7"}