{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:YWVSQERMZAD2QPV6YZHAY6VUOZ","short_pith_number":"pith:YWVSQERM","schema_version":"1.0","canonical_sha256":"c5ab28122cc807a83ebec64e0c7ab4766330d721146bc7d41c0c6a61c5c53520","source":{"kind":"arxiv","id":"1701.09133","version":2},"attestation_state":"computed","paper":{"title":"The list chromatic number of graphs with small clique number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael Molloy","submitted_at":"2017-01-31T17:09:05Z","abstract_excerpt":"We prove that every triangle-free graph with maximum degree $\\Delta$ has list chromatic number at most $(1+o(1))\\frac{\\Delta}{\\ln \\Delta}$. This matches the best-known bound for graphs of girth at least 5. We also provide a new proof that for any $r\\geq 4$ every $K_r$-free graph has list-chromatic number at most $200r\\frac{\\Delta\\ln\\ln\\Delta}{\\ln\\Delta}$."},"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":"1701.09133","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-31T17:09:05Z","cross_cats_sorted":[],"title_canon_sha256":"b85b1046243cfeba9e0e0c8b83ee4d29067f6a7cae5572a40d3a3118359c45ab","abstract_canon_sha256":"71dc215f4a4b3e784bb1787bf73066e95f8cd55576ca98fe0f9ee20036030d07"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:02.621878Z","signature_b64":"XSwRv2Dw7LiWzLGUgCbwlliqO5sVWYi2B6LYajKy7Vk00HMZ0AT8bnlvSH6fPGFHv+VV8Nom1tX9t+QHpMupAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5ab28122cc807a83ebec64e0c7ab4766330d721146bc7d41c0c6a61c5c53520","last_reissued_at":"2026-05-18T00:12:02.621281Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:02.621281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The list chromatic number of graphs with small clique number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael Molloy","submitted_at":"2017-01-31T17:09:05Z","abstract_excerpt":"We prove that every triangle-free graph with maximum degree $\\Delta$ has list chromatic number at most $(1+o(1))\\frac{\\Delta}{\\ln \\Delta}$. This matches the best-known bound for graphs of girth at least 5. We also provide a new proof that for any $r\\geq 4$ every $K_r$-free graph has list-chromatic number at most $200r\\frac{\\Delta\\ln\\ln\\Delta}{\\ln\\Delta}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.09133","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":"1701.09133","created_at":"2026-05-18T00:12:02.621396+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.09133v2","created_at":"2026-05-18T00:12:02.621396+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.09133","created_at":"2026-05-18T00:12:02.621396+00:00"},{"alias_kind":"pith_short_12","alias_value":"YWVSQERMZAD2","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"YWVSQERMZAD2QPV6","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"YWVSQERM","created_at":"2026-05-18T12:31:56.362134+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2210.05915","citing_title":"Coloring, List Coloring, and Painting Squares of Graphs (and other related problems)","ref_index":151,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YWVSQERMZAD2QPV6YZHAY6VUOZ","json":"https://pith.science/pith/YWVSQERMZAD2QPV6YZHAY6VUOZ.json","graph_json":"https://pith.science/api/pith-number/YWVSQERMZAD2QPV6YZHAY6VUOZ/graph.json","events_json":"https://pith.science/api/pith-number/YWVSQERMZAD2QPV6YZHAY6VUOZ/events.json","paper":"https://pith.science/paper/YWVSQERM"},"agent_actions":{"view_html":"https://pith.science/pith/YWVSQERMZAD2QPV6YZHAY6VUOZ","download_json":"https://pith.science/pith/YWVSQERMZAD2QPV6YZHAY6VUOZ.json","view_paper":"https://pith.science/paper/YWVSQERM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.09133&json=true","fetch_graph":"https://pith.science/api/pith-number/YWVSQERMZAD2QPV6YZHAY6VUOZ/graph.json","fetch_events":"https://pith.science/api/pith-number/YWVSQERMZAD2QPV6YZHAY6VUOZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YWVSQERMZAD2QPV6YZHAY6VUOZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YWVSQERMZAD2QPV6YZHAY6VUOZ/action/storage_attestation","attest_author":"https://pith.science/pith/YWVSQERMZAD2QPV6YZHAY6VUOZ/action/author_attestation","sign_citation":"https://pith.science/pith/YWVSQERMZAD2QPV6YZHAY6VUOZ/action/citation_signature","submit_replication":"https://pith.science/pith/YWVSQERMZAD2QPV6YZHAY6VUOZ/action/replication_record"}},"created_at":"2026-05-18T00:12:02.621396+00:00","updated_at":"2026-05-18T00:12:02.621396+00:00"}