{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:QG7H5HYJALN7LAJK5TTC2UG7ZY","short_pith_number":"pith:QG7H5HYJ","canonical_record":{"source":{"id":"1308.6739","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-30T13:32:21Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"ca32eeec8454671402bd94f74a749c09696bb5bb1a43706421acaf9f319e5189","abstract_canon_sha256":"54e0fc5229871ac4f68f2830d1cd7d47066f231357b74612f1aab893adcb5f28"},"schema_version":"1.0"},"canonical_sha256":"81be7e9f0902dbf5812aece62d50dfce13931f4d4d1738f84604e7b32c53aa1e","source":{"kind":"arxiv","id":"1308.6739","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.6739","created_at":"2026-05-18T02:44:08Z"},{"alias_kind":"arxiv_version","alias_value":"1308.6739v3","created_at":"2026-05-18T02:44:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.6739","created_at":"2026-05-18T02:44:08Z"},{"alias_kind":"pith_short_12","alias_value":"QG7H5HYJALN7","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QG7H5HYJALN7LAJK","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QG7H5HYJ","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:QG7H5HYJALN7LAJK5TTC2UG7ZY","target":"record","payload":{"canonical_record":{"source":{"id":"1308.6739","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-30T13:32:21Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"ca32eeec8454671402bd94f74a749c09696bb5bb1a43706421acaf9f319e5189","abstract_canon_sha256":"54e0fc5229871ac4f68f2830d1cd7d47066f231357b74612f1aab893adcb5f28"},"schema_version":"1.0"},"canonical_sha256":"81be7e9f0902dbf5812aece62d50dfce13931f4d4d1738f84604e7b32c53aa1e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:08.489064Z","signature_b64":"ei3EARFpjKj6glE1VaQS2myFOpRo1wT/rYfZEbV0lb5nsYmM9K0DZGMtFwYoSMTDYcyx9kxcPTP7K0zHPZCMAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81be7e9f0902dbf5812aece62d50dfce13931f4d4d1738f84604e7b32c53aa1e","last_reissued_at":"2026-05-18T02:44:08.488563Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:08.488563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.6739","source_version":3,"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-18T02:44:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7IFs312y4/Ocu9tOvPhIYHhVweLx8I299aABM3+DW8MDGOOrZwetwc80BYCp39moM+JiLDemadhhAuh6n6T9Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:52:06.528304Z"},"content_sha256":"3b1ea57cf10aff935fdbfe7101468bf65834da45d6c6cb3cccf19cfb88bd9974","schema_version":"1.0","event_id":"sha256:3b1ea57cf10aff935fdbfe7101468bf65834da45d6c6cb3cccf19cfb88bd9974"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:QG7H5HYJALN7LAJK5TTC2UG7ZY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Beyond Ohba's Conjecture: A bound on the choice number of $k$-chromatic graphs with $n$ vertices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Douglas B. West, Hehui Wu, Jonathan A. Noel, Xuding Zhu","submitted_at":"2013-08-30T13:32:21Z","abstract_excerpt":"Let $\\text{ch}(G)$ denote the choice number of a graph $G$ (also called \"list chromatic number\" or \"choosability\" of $G$). Noel, Reed, and Wu proved the conjecture of Ohba that $\\text{ch}(G)=\\chi(G)$ when $|V(G)|\\le 2\\chi(G)+1$. We extend this to a general upper bound: $\\text{ch}(G)\\le \\max\\{\\chi(G),\\lceil({|V(G)|+\\chi(G)-1})/{3}\\rceil\\}$. Our result is sharp for $|V(G)|\\le 3\\chi(G)$ using Ohba's examples, and it improves the best-known upper bound for $\\text{ch}(K_{4,\\dots,4})$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.6739","kind":"arxiv","version":3},"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-18T02:44:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QxaxqauGar1Rlx4SCI+PPhnNEz10WrFzNp9575m7ahAXpIZXC7vZRGt2EJNkvMSubzNaHKEKnL1JOOr3/oIgAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:52:06.529192Z"},"content_sha256":"bc04f0414c24f8e31372582fd8bf7a6b5a1e27cb41d255cae8981c839126d8af","schema_version":"1.0","event_id":"sha256:bc04f0414c24f8e31372582fd8bf7a6b5a1e27cb41d255cae8981c839126d8af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QG7H5HYJALN7LAJK5TTC2UG7ZY/bundle.json","state_url":"https://pith.science/pith/QG7H5HYJALN7LAJK5TTC2UG7ZY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QG7H5HYJALN7LAJK5TTC2UG7ZY/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-05T20:52:06Z","links":{"resolver":"https://pith.science/pith/QG7H5HYJALN7LAJK5TTC2UG7ZY","bundle":"https://pith.science/pith/QG7H5HYJALN7LAJK5TTC2UG7ZY/bundle.json","state":"https://pith.science/pith/QG7H5HYJALN7LAJK5TTC2UG7ZY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QG7H5HYJALN7LAJK5TTC2UG7ZY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:QG7H5HYJALN7LAJK5TTC2UG7ZY","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":"54e0fc5229871ac4f68f2830d1cd7d47066f231357b74612f1aab893adcb5f28","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-30T13:32:21Z","title_canon_sha256":"ca32eeec8454671402bd94f74a749c09696bb5bb1a43706421acaf9f319e5189"},"schema_version":"1.0","source":{"id":"1308.6739","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.6739","created_at":"2026-05-18T02:44:08Z"},{"alias_kind":"arxiv_version","alias_value":"1308.6739v3","created_at":"2026-05-18T02:44:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.6739","created_at":"2026-05-18T02:44:08Z"},{"alias_kind":"pith_short_12","alias_value":"QG7H5HYJALN7","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QG7H5HYJALN7LAJK","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QG7H5HYJ","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:bc04f0414c24f8e31372582fd8bf7a6b5a1e27cb41d255cae8981c839126d8af","target":"graph","created_at":"2026-05-18T02:44: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":"Let $\\text{ch}(G)$ denote the choice number of a graph $G$ (also called \"list chromatic number\" or \"choosability\" of $G$). Noel, Reed, and Wu proved the conjecture of Ohba that $\\text{ch}(G)=\\chi(G)$ when $|V(G)|\\le 2\\chi(G)+1$. We extend this to a general upper bound: $\\text{ch}(G)\\le \\max\\{\\chi(G),\\lceil({|V(G)|+\\chi(G)-1})/{3}\\rceil\\}$. Our result is sharp for $|V(G)|\\le 3\\chi(G)$ using Ohba's examples, and it improves the best-known upper bound for $\\text{ch}(K_{4,\\dots,4})$.","authors_text":"Douglas B. West, Hehui Wu, Jonathan A. Noel, Xuding Zhu","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-30T13:32:21Z","title":"Beyond Ohba's Conjecture: A bound on the choice number of $k$-chromatic graphs with $n$ vertices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.6739","kind":"arxiv","version":3},"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:3b1ea57cf10aff935fdbfe7101468bf65834da45d6c6cb3cccf19cfb88bd9974","target":"record","created_at":"2026-05-18T02:44: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":"54e0fc5229871ac4f68f2830d1cd7d47066f231357b74612f1aab893adcb5f28","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-30T13:32:21Z","title_canon_sha256":"ca32eeec8454671402bd94f74a749c09696bb5bb1a43706421acaf9f319e5189"},"schema_version":"1.0","source":{"id":"1308.6739","kind":"arxiv","version":3}},"canonical_sha256":"81be7e9f0902dbf5812aece62d50dfce13931f4d4d1738f84604e7b32c53aa1e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"81be7e9f0902dbf5812aece62d50dfce13931f4d4d1738f84604e7b32c53aa1e","first_computed_at":"2026-05-18T02:44:08.488563Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:08.488563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ei3EARFpjKj6glE1VaQS2myFOpRo1wT/rYfZEbV0lb5nsYmM9K0DZGMtFwYoSMTDYcyx9kxcPTP7K0zHPZCMAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:08.489064Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.6739","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b1ea57cf10aff935fdbfe7101468bf65834da45d6c6cb3cccf19cfb88bd9974","sha256:bc04f0414c24f8e31372582fd8bf7a6b5a1e27cb41d255cae8981c839126d8af"],"state_sha256":"89b504a450cdfac38c69b978f1506b0bc969731253137f612677907e10711814"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+KDp6+gyqiG/qbQ3SP40+j9Z8Y9CmOZIWIzxPN9dtmugm5+PxBr6GwcN67Pg87uM6pG/d4pFg67+uflgWRlPDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T20:52:06.533820Z","bundle_sha256":"86af90355a129dcc0cc787c1b35a054a3afc7db56c8fe16dab9bcc6772aacb15"}}