{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:BGWTOL7FQ74BNK3G6DVYPZ3T36","short_pith_number":"pith:BGWTOL7F","schema_version":"1.0","canonical_sha256":"09ad372fe587f816ab66f0eb87e773dfa473405f3b23d25ccedae40874342945","source":{"kind":"arxiv","id":"0707.1069","version":2},"attestation_state":"computed","paper":{"title":"Coloring and The Lonely Graph","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Landon Rabern","submitted_at":"2007-07-07T04:38:14Z","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"},"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":"0707.1069","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2007-07-07T04:38:14Z","cross_cats_sorted":[],"title_canon_sha256":"d1ef5f51995c0555ef4b1deb782bc158b8b7ad04d3e6f8fce629bd3ff58aedbb","abstract_canon_sha256":"18cf68cd47fb28de072f69d244a074c5a48f9b804ef444329dec7197e10bfb2c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:15.747552Z","signature_b64":"4wfLg9X3C55yjJQOwTWFt6i52kQpH+9nmb++lxv9Hn2LCzQ2XAvZ/H8uDJ+qNdDsbWq41KwToP9smLrWEm7iCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09ad372fe587f816ab66f0eb87e773dfa473405f3b23d25ccedae40874342945","last_reissued_at":"2026-05-18T04:09:15.746855Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:15.746855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coloring and The Lonely Graph","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Landon Rabern","submitted_at":"2007-07-07T04:38:14Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0707.1069","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":"0707.1069","created_at":"2026-05-18T04:09:15.746960+00:00"},{"alias_kind":"arxiv_version","alias_value":"0707.1069v2","created_at":"2026-05-18T04:09:15.746960+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0707.1069","created_at":"2026-05-18T04:09:15.746960+00:00"},{"alias_kind":"pith_short_12","alias_value":"BGWTOL7FQ74B","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"BGWTOL7FQ74BNK3G","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"BGWTOL7F","created_at":"2026-05-18T12:25:55.427421+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/BGWTOL7FQ74BNK3G6DVYPZ3T36","json":"https://pith.science/pith/BGWTOL7FQ74BNK3G6DVYPZ3T36.json","graph_json":"https://pith.science/api/pith-number/BGWTOL7FQ74BNK3G6DVYPZ3T36/graph.json","events_json":"https://pith.science/api/pith-number/BGWTOL7FQ74BNK3G6DVYPZ3T36/events.json","paper":"https://pith.science/paper/BGWTOL7F"},"agent_actions":{"view_html":"https://pith.science/pith/BGWTOL7FQ74BNK3G6DVYPZ3T36","download_json":"https://pith.science/pith/BGWTOL7FQ74BNK3G6DVYPZ3T36.json","view_paper":"https://pith.science/paper/BGWTOL7F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0707.1069&json=true","fetch_graph":"https://pith.science/api/pith-number/BGWTOL7FQ74BNK3G6DVYPZ3T36/graph.json","fetch_events":"https://pith.science/api/pith-number/BGWTOL7FQ74BNK3G6DVYPZ3T36/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BGWTOL7FQ74BNK3G6DVYPZ3T36/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BGWTOL7FQ74BNK3G6DVYPZ3T36/action/storage_attestation","attest_author":"https://pith.science/pith/BGWTOL7FQ74BNK3G6DVYPZ3T36/action/author_attestation","sign_citation":"https://pith.science/pith/BGWTOL7FQ74BNK3G6DVYPZ3T36/action/citation_signature","submit_replication":"https://pith.science/pith/BGWTOL7FQ74BNK3G6DVYPZ3T36/action/replication_record"}},"created_at":"2026-05-18T04:09:15.746960+00:00","updated_at":"2026-05-18T04:09:15.746960+00:00"}