{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:7AHW27KJTAXPQKRMKJ3RMYRANL","short_pith_number":"pith:7AHW27KJ","schema_version":"1.0","canonical_sha256":"f80f6d7d49982ef82a2c52771662206ac951ed450fafbe72d05861ab4b89d647","source":{"kind":"arxiv","id":"1309.0225","version":1},"attestation_state":"computed","paper":{"title":"Choosability of Graphs with Bounded Order: Ohba's Conjecture and Beyond","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jonathan A. Noel","submitted_at":"2013-09-01T14:15:03Z","abstract_excerpt":"The \\emph{choice number} of a graph $G$, denoted $\\ch(G)$, is the minimum integer $k$ such that for any assignment of lists of size $k$ to the vertices of $G$, there is a proper colouring of $G$ such that every vertex is mapped to a colour in its list. For general graphs, the choice number is not bounded above by a function of the chromatic number.\n  In this thesis, we prove a conjecture of Ohba which asserts that $\\ch(G)=\\chi(G)$ whenever $|V(G)|\\leq 2\\chi(G)+1$. We also prove a strengthening of Ohba's Conjecture which is best possible for graphs on at most $3\\chi(G)$ vertices, and pose sever"},"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":"1309.0225","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-01T14:15:03Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"d12f4e329f8054bf729216a2a1c4b0710c4a8faed33b318254fba461c07f861a","abstract_canon_sha256":"ff6fac9500cf0b9ed36ac39bc90dc8624ade0214771fa1dadbffa2db104c01d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:14:28.528847Z","signature_b64":"Eddcao3MlGECNEV4POj4MKVGnj1Xievrn4TzA07ipH5AY8Es9wOkLoBzZdyLEGKNoMzw0i3XYpDxUZr17hb/AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f80f6d7d49982ef82a2c52771662206ac951ed450fafbe72d05861ab4b89d647","last_reissued_at":"2026-05-18T03:14:28.528374Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:14:28.528374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Choosability of Graphs with Bounded Order: Ohba's Conjecture and Beyond","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jonathan A. Noel","submitted_at":"2013-09-01T14:15:03Z","abstract_excerpt":"The \\emph{choice number} of a graph $G$, denoted $\\ch(G)$, is the minimum integer $k$ such that for any assignment of lists of size $k$ to the vertices of $G$, there is a proper colouring of $G$ such that every vertex is mapped to a colour in its list. For general graphs, the choice number is not bounded above by a function of the chromatic number.\n  In this thesis, we prove a conjecture of Ohba which asserts that $\\ch(G)=\\chi(G)$ whenever $|V(G)|\\leq 2\\chi(G)+1$. We also prove a strengthening of Ohba's Conjecture which is best possible for graphs on at most $3\\chi(G)$ vertices, and pose sever"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.0225","kind":"arxiv","version":1},"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":"1309.0225","created_at":"2026-05-18T03:14:28.528445+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.0225v1","created_at":"2026-05-18T03:14:28.528445+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.0225","created_at":"2026-05-18T03:14:28.528445+00:00"},{"alias_kind":"pith_short_12","alias_value":"7AHW27KJTAXP","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"7AHW27KJTAXPQKRM","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"7AHW27KJ","created_at":"2026-05-18T12:27:36.564083+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/7AHW27KJTAXPQKRMKJ3RMYRANL","json":"https://pith.science/pith/7AHW27KJTAXPQKRMKJ3RMYRANL.json","graph_json":"https://pith.science/api/pith-number/7AHW27KJTAXPQKRMKJ3RMYRANL/graph.json","events_json":"https://pith.science/api/pith-number/7AHW27KJTAXPQKRMKJ3RMYRANL/events.json","paper":"https://pith.science/paper/7AHW27KJ"},"agent_actions":{"view_html":"https://pith.science/pith/7AHW27KJTAXPQKRMKJ3RMYRANL","download_json":"https://pith.science/pith/7AHW27KJTAXPQKRMKJ3RMYRANL.json","view_paper":"https://pith.science/paper/7AHW27KJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.0225&json=true","fetch_graph":"https://pith.science/api/pith-number/7AHW27KJTAXPQKRMKJ3RMYRANL/graph.json","fetch_events":"https://pith.science/api/pith-number/7AHW27KJTAXPQKRMKJ3RMYRANL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7AHW27KJTAXPQKRMKJ3RMYRANL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7AHW27KJTAXPQKRMKJ3RMYRANL/action/storage_attestation","attest_author":"https://pith.science/pith/7AHW27KJTAXPQKRMKJ3RMYRANL/action/author_attestation","sign_citation":"https://pith.science/pith/7AHW27KJTAXPQKRMKJ3RMYRANL/action/citation_signature","submit_replication":"https://pith.science/pith/7AHW27KJTAXPQKRMKJ3RMYRANL/action/replication_record"}},"created_at":"2026-05-18T03:14:28.528445+00:00","updated_at":"2026-05-18T03:14:28.528445+00:00"}