{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GYIC736SNF56XQFVPZSMVODPVA","short_pith_number":"pith:GYIC736S","schema_version":"1.0","canonical_sha256":"36102fefd2697bebc0b57e64cab86fa82c2f2053894691aa57da2088dd3baca2","source":{"kind":"arxiv","id":"1807.08273","version":1},"attestation_state":"computed","paper":{"title":"Chromatic-choosability of hypergraphs with high chromatic number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jianguo Qian, Wei Wang","submitted_at":"2018-07-22T11:27:38Z","abstract_excerpt":"It was conjectured by Ohba and confirmed recently by Noel et al. that, for any graph $G$, if $|V(G)|\\le 2\\chi(G)+1$ then $\\chi_l(G)=\\chi(G)$. This indicates that the graphs with high chromatic number are chromatic-choosable. We show that this is also the case for uniform hypergraphs and further propose a generalized version of Ohba's conjecture: for any $r$-uniform hypergraph $H$ with $r\\geq 2$, if $|V(H)|\\le r\\chi(H)+r-1$ then $\\chi_l(H)=\\chi(H)$. We show that the condition of the proposed conjecture is sharp by giving two classes of $r$-uniform hypergraphs $H$ with $|V(H)|= r\\chi(H)+r$ and $"},"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":"1807.08273","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-22T11:27:38Z","cross_cats_sorted":[],"title_canon_sha256":"9cf0e343b990c63e5294d14bac2e3998d7872238b54a677f6023f20d48b70466","abstract_canon_sha256":"6325a383fea74cf07de6449fa526b27f9156314b01ed4a3fa9ec582f634ad006"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:08.631445Z","signature_b64":"6ksKzigQYpeVEbP9etZPwGa3+SYfsCDMXTZL4+0CPBsUERnksUnJI4/AVBO44bFbKnrwcBANT6oGgbE9p7COBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36102fefd2697bebc0b57e64cab86fa82c2f2053894691aa57da2088dd3baca2","last_reissued_at":"2026-05-18T00:10:08.630817Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:08.630817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Chromatic-choosability of hypergraphs with high chromatic number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jianguo Qian, Wei Wang","submitted_at":"2018-07-22T11:27:38Z","abstract_excerpt":"It was conjectured by Ohba and confirmed recently by Noel et al. that, for any graph $G$, if $|V(G)|\\le 2\\chi(G)+1$ then $\\chi_l(G)=\\chi(G)$. This indicates that the graphs with high chromatic number are chromatic-choosable. We show that this is also the case for uniform hypergraphs and further propose a generalized version of Ohba's conjecture: for any $r$-uniform hypergraph $H$ with $r\\geq 2$, if $|V(H)|\\le r\\chi(H)+r-1$ then $\\chi_l(H)=\\chi(H)$. We show that the condition of the proposed conjecture is sharp by giving two classes of $r$-uniform hypergraphs $H$ with $|V(H)|= r\\chi(H)+r$ and $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.08273","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":"1807.08273","created_at":"2026-05-18T00:10:08.630905+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.08273v1","created_at":"2026-05-18T00:10:08.630905+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.08273","created_at":"2026-05-18T00:10:08.630905+00:00"},{"alias_kind":"pith_short_12","alias_value":"GYIC736SNF56","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"GYIC736SNF56XQFV","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"GYIC736S","created_at":"2026-05-18T12:32:25.280505+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/GYIC736SNF56XQFVPZSMVODPVA","json":"https://pith.science/pith/GYIC736SNF56XQFVPZSMVODPVA.json","graph_json":"https://pith.science/api/pith-number/GYIC736SNF56XQFVPZSMVODPVA/graph.json","events_json":"https://pith.science/api/pith-number/GYIC736SNF56XQFVPZSMVODPVA/events.json","paper":"https://pith.science/paper/GYIC736S"},"agent_actions":{"view_html":"https://pith.science/pith/GYIC736SNF56XQFVPZSMVODPVA","download_json":"https://pith.science/pith/GYIC736SNF56XQFVPZSMVODPVA.json","view_paper":"https://pith.science/paper/GYIC736S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.08273&json=true","fetch_graph":"https://pith.science/api/pith-number/GYIC736SNF56XQFVPZSMVODPVA/graph.json","fetch_events":"https://pith.science/api/pith-number/GYIC736SNF56XQFVPZSMVODPVA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GYIC736SNF56XQFVPZSMVODPVA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GYIC736SNF56XQFVPZSMVODPVA/action/storage_attestation","attest_author":"https://pith.science/pith/GYIC736SNF56XQFVPZSMVODPVA/action/author_attestation","sign_citation":"https://pith.science/pith/GYIC736SNF56XQFVPZSMVODPVA/action/citation_signature","submit_replication":"https://pith.science/pith/GYIC736SNF56XQFVPZSMVODPVA/action/replication_record"}},"created_at":"2026-05-18T00:10:08.630905+00:00","updated_at":"2026-05-18T00:10:08.630905+00:00"}