{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:F7TL423SGVCM3AKA5SASCMZHI3","short_pith_number":"pith:F7TL423S","schema_version":"1.0","canonical_sha256":"2fe6be6b723544cd8140ec8121332746e509f2e64cdfbaae9792fdacc6a3d4fa","source":{"kind":"arxiv","id":"2508.16818","version":2},"attestation_state":"computed","paper":{"title":"Toward Vu's conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Abhishek Dhawan, Abhishek Methuku, Michael C. Wigal, Peter Bradshaw","submitted_at":"2025-08-22T22:37:22Z","abstract_excerpt":"In 2002, Vu conjectured that graphs of maximum degree $\\Delta$ and maximum codegree at most $\\zeta \\Delta$ have chromatic number at most $(\\zeta+o(1))\\Delta$. Despite its importance, the conjecture has remained widely open. The only direct progress so far has been obtained in the ``dense regime,'' when $\\zeta$ is close to $1$, by Hurley, de Verclos, and Kang.\n  In this paper we provide the first progress in the sparse regime $\\zeta \\ll 1$, the case of primary interest to Vu. We show that there exists $\\zeta_0 > 0$ such that for all $\\zeta \\in [\\log^{-32}\\Delta,\\zeta_0]$, the following holds: i"},"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":"2508.16818","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-08-22T22:37:22Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"57012ad851004081d12d811bac1c1099f1901eceefca70ed1be332257a7b578a","abstract_canon_sha256":"754c1c1842f1f7f8e1412f6f6ec3992b7b45556b7aeb88ad304c730f83e7b417"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:06:18.497359Z","signature_b64":"VqiPm3jBswaSrr0uX0gcB0Ir02972BcBntZieUADJfANgw/RCkQwVXG8ahtP8zCIdf/3Lb98kPC8la2fBHYoCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2fe6be6b723544cd8140ec8121332746e509f2e64cdfbaae9792fdacc6a3d4fa","last_reissued_at":"2026-07-05T12:06:18.496837Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:06:18.496837Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Toward Vu's conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Abhishek Dhawan, Abhishek Methuku, Michael C. Wigal, Peter Bradshaw","submitted_at":"2025-08-22T22:37:22Z","abstract_excerpt":"In 2002, Vu conjectured that graphs of maximum degree $\\Delta$ and maximum codegree at most $\\zeta \\Delta$ have chromatic number at most $(\\zeta+o(1))\\Delta$. Despite its importance, the conjecture has remained widely open. The only direct progress so far has been obtained in the ``dense regime,'' when $\\zeta$ is close to $1$, by Hurley, de Verclos, and Kang.\n  In this paper we provide the first progress in the sparse regime $\\zeta \\ll 1$, the case of primary interest to Vu. We show that there exists $\\zeta_0 > 0$ such that for all $\\zeta \\in [\\log^{-32}\\Delta,\\zeta_0]$, the following holds: i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.16818","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2508.16818/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2508.16818","created_at":"2026-07-05T12:06:18.496901+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.16818v2","created_at":"2026-07-05T12:06:18.496901+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.16818","created_at":"2026-07-05T12:06:18.496901+00:00"},{"alias_kind":"pith_short_12","alias_value":"F7TL423SGVCM","created_at":"2026-07-05T12:06:18.496901+00:00"},{"alias_kind":"pith_short_16","alias_value":"F7TL423SGVCM3AKA","created_at":"2026-07-05T12:06:18.496901+00:00"},{"alias_kind":"pith_short_8","alias_value":"F7TL423S","created_at":"2026-07-05T12:06:18.496901+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.18048","citing_title":"The independence number of uncrowded hypergraphs: bounds matching the shattering threshold","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F7TL423SGVCM3AKA5SASCMZHI3","json":"https://pith.science/pith/F7TL423SGVCM3AKA5SASCMZHI3.json","graph_json":"https://pith.science/api/pith-number/F7TL423SGVCM3AKA5SASCMZHI3/graph.json","events_json":"https://pith.science/api/pith-number/F7TL423SGVCM3AKA5SASCMZHI3/events.json","paper":"https://pith.science/paper/F7TL423S"},"agent_actions":{"view_html":"https://pith.science/pith/F7TL423SGVCM3AKA5SASCMZHI3","download_json":"https://pith.science/pith/F7TL423SGVCM3AKA5SASCMZHI3.json","view_paper":"https://pith.science/paper/F7TL423S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.16818&json=true","fetch_graph":"https://pith.science/api/pith-number/F7TL423SGVCM3AKA5SASCMZHI3/graph.json","fetch_events":"https://pith.science/api/pith-number/F7TL423SGVCM3AKA5SASCMZHI3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F7TL423SGVCM3AKA5SASCMZHI3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F7TL423SGVCM3AKA5SASCMZHI3/action/storage_attestation","attest_author":"https://pith.science/pith/F7TL423SGVCM3AKA5SASCMZHI3/action/author_attestation","sign_citation":"https://pith.science/pith/F7TL423SGVCM3AKA5SASCMZHI3/action/citation_signature","submit_replication":"https://pith.science/pith/F7TL423SGVCM3AKA5SASCMZHI3/action/replication_record"}},"created_at":"2026-07-05T12:06:18.496901+00:00","updated_at":"2026-07-05T12:06:18.496901+00:00"}