{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GYIC736SNF56XQFVPZSMVODPVA","short_pith_number":"pith:GYIC736S","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"},"canonical_sha256":"36102fefd2697bebc0b57e64cab86fa82c2f2053894691aa57da2088dd3baca2","source":{"kind":"arxiv","id":"1807.08273","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.08273","created_at":"2026-05-18T00:10:08Z"},{"alias_kind":"arxiv_version","alias_value":"1807.08273v1","created_at":"2026-05-18T00:10:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.08273","created_at":"2026-05-18T00:10:08Z"},{"alias_kind":"pith_short_12","alias_value":"GYIC736SNF56","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GYIC736SNF56XQFV","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GYIC736S","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GYIC736SNF56XQFVPZSMVODPVA","target":"record","payload":{"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"},"canonical_sha256":"36102fefd2697bebc0b57e64cab86fa82c2f2053894691aa57da2088dd3baca2","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"},"source_kind":"arxiv","source_id":"1807.08273","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:10:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pyPZl9eWPkVT2uXFoRKdPPKftHzcEgQp0iLWebhCjdP9DcYaf29/SbTSxtLtEjP35UbFygi6DcBXAisHmHrxAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T22:33:46.211699Z"},"content_sha256":"a84b5eb17641dad52e138a69c1cbc82f9f241990a663953cb25e3a7e9d52afb1","schema_version":"1.0","event_id":"sha256:a84b5eb17641dad52e138a69c1cbc82f9f241990a663953cb25e3a7e9d52afb1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GYIC736SNF56XQFVPZSMVODPVA","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:10:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j7o9EhhAj4+ZFSO68RRFaDzyGt4lRjx+V04RI3BceWlOgNaRW0WQ1shBqJvnJPVf2dd8AmNprbaXQ7bfLJzVAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T22:33:46.212046Z"},"content_sha256":"6a3b568c09afc39c89c09ad624c732444871a0211936b6c3e84f65f004d6bf22","schema_version":"1.0","event_id":"sha256:6a3b568c09afc39c89c09ad624c732444871a0211936b6c3e84f65f004d6bf22"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GYIC736SNF56XQFVPZSMVODPVA/bundle.json","state_url":"https://pith.science/pith/GYIC736SNF56XQFVPZSMVODPVA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GYIC736SNF56XQFVPZSMVODPVA/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-08T22:33:46Z","links":{"resolver":"https://pith.science/pith/GYIC736SNF56XQFVPZSMVODPVA","bundle":"https://pith.science/pith/GYIC736SNF56XQFVPZSMVODPVA/bundle.json","state":"https://pith.science/pith/GYIC736SNF56XQFVPZSMVODPVA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GYIC736SNF56XQFVPZSMVODPVA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GYIC736SNF56XQFVPZSMVODPVA","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6325a383fea74cf07de6449fa526b27f9156314b01ed4a3fa9ec582f634ad006","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-22T11:27:38Z","title_canon_sha256":"9cf0e343b990c63e5294d14bac2e3998d7872238b54a677f6023f20d48b70466"},"schema_version":"1.0","source":{"id":"1807.08273","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.08273","created_at":"2026-05-18T00:10:08Z"},{"alias_kind":"arxiv_version","alias_value":"1807.08273v1","created_at":"2026-05-18T00:10:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.08273","created_at":"2026-05-18T00:10:08Z"},{"alias_kind":"pith_short_12","alias_value":"GYIC736SNF56","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GYIC736SNF56XQFV","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GYIC736S","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:6a3b568c09afc39c89c09ad624c732444871a0211936b6c3e84f65f004d6bf22","target":"graph","created_at":"2026-05-18T00:10:08Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 $","authors_text":"Jianguo Qian, Wei Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-22T11:27:38Z","title":"Chromatic-choosability of hypergraphs with high chromatic number"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.08273","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a84b5eb17641dad52e138a69c1cbc82f9f241990a663953cb25e3a7e9d52afb1","target":"record","created_at":"2026-05-18T00:10:08Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6325a383fea74cf07de6449fa526b27f9156314b01ed4a3fa9ec582f634ad006","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-22T11:27:38Z","title_canon_sha256":"9cf0e343b990c63e5294d14bac2e3998d7872238b54a677f6023f20d48b70466"},"schema_version":"1.0","source":{"id":"1807.08273","kind":"arxiv","version":1}},"canonical_sha256":"36102fefd2697bebc0b57e64cab86fa82c2f2053894691aa57da2088dd3baca2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"36102fefd2697bebc0b57e64cab86fa82c2f2053894691aa57da2088dd3baca2","first_computed_at":"2026-05-18T00:10:08.630817Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:08.630817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6ksKzigQYpeVEbP9etZPwGa3+SYfsCDMXTZL4+0CPBsUERnksUnJI4/AVBO44bFbKnrwcBANT6oGgbE9p7COBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:08.631445Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.08273","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a84b5eb17641dad52e138a69c1cbc82f9f241990a663953cb25e3a7e9d52afb1","sha256:6a3b568c09afc39c89c09ad624c732444871a0211936b6c3e84f65f004d6bf22"],"state_sha256":"9f8361be4eb9f35b5f992a6c49b0773de1e21e4c9e501560d068890dd9c9d0b8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u/pTpm3nJ6J7tJeugKdXL8G7rOclR3B/ZfqBKqUvY1M+y1CT+NagVjKYioIPOdp8GUHo3yRHp1n54pZFpS8GAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T22:33:46.214028Z","bundle_sha256":"ed98134a84d5a47cefb058f2d5c6666e46fdaba429cf4469a0dc779de0e15b6d"}}