{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:7AHW27KJTAXPQKRMKJ3RMYRANL","short_pith_number":"pith:7AHW27KJ","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"},"canonical_sha256":"f80f6d7d49982ef82a2c52771662206ac951ed450fafbe72d05861ab4b89d647","source":{"kind":"arxiv","id":"1309.0225","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.0225","created_at":"2026-05-18T03:14:28Z"},{"alias_kind":"arxiv_version","alias_value":"1309.0225v1","created_at":"2026-05-18T03:14:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.0225","created_at":"2026-05-18T03:14:28Z"},{"alias_kind":"pith_short_12","alias_value":"7AHW27KJTAXP","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7AHW27KJTAXPQKRM","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7AHW27KJ","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:7AHW27KJTAXPQKRMKJ3RMYRANL","target":"record","payload":{"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"},"canonical_sha256":"f80f6d7d49982ef82a2c52771662206ac951ed450fafbe72d05861ab4b89d647","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"},"source_kind":"arxiv","source_id":"1309.0225","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-18T03:14:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"heymNzTnj2U+2pk4CKmMn6Zi69gd1sI6xbu7zPmvcPsip87A7q84rUYw6lYbfK+sL6r5fYMgYvRx94M6g/6CAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:33:33.093687Z"},"content_sha256":"967ef6d05c550089553566e1dd7c888dfefaebb416a383270083bb49847a8ab6","schema_version":"1.0","event_id":"sha256:967ef6d05c550089553566e1dd7c888dfefaebb416a383270083bb49847a8ab6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:7AHW27KJTAXPQKRMKJ3RMYRANL","target":"graph","payload":{"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"},"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-18T03:14:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B2Aetg7Ca5MHniUpJmivt7kSnz6XcrEkHAjrRm9wq9WbIkG7tIZ6FyOLxLaKy8OpntRpO6uj+rCe3NpqR/BiAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:33:33.094038Z"},"content_sha256":"58bda1b2295f8553970804f292b16cf16d15a3f10756ac24e748084015b7924e","schema_version":"1.0","event_id":"sha256:58bda1b2295f8553970804f292b16cf16d15a3f10756ac24e748084015b7924e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7AHW27KJTAXPQKRMKJ3RMYRANL/bundle.json","state_url":"https://pith.science/pith/7AHW27KJTAXPQKRMKJ3RMYRANL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7AHW27KJTAXPQKRMKJ3RMYRANL/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-02T06:33:33Z","links":{"resolver":"https://pith.science/pith/7AHW27KJTAXPQKRMKJ3RMYRANL","bundle":"https://pith.science/pith/7AHW27KJTAXPQKRMKJ3RMYRANL/bundle.json","state":"https://pith.science/pith/7AHW27KJTAXPQKRMKJ3RMYRANL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7AHW27KJTAXPQKRMKJ3RMYRANL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:7AHW27KJTAXPQKRMKJ3RMYRANL","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":"ff6fac9500cf0b9ed36ac39bc90dc8624ade0214771fa1dadbffa2db104c01d5","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-01T14:15:03Z","title_canon_sha256":"d12f4e329f8054bf729216a2a1c4b0710c4a8faed33b318254fba461c07f861a"},"schema_version":"1.0","source":{"id":"1309.0225","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.0225","created_at":"2026-05-18T03:14:28Z"},{"alias_kind":"arxiv_version","alias_value":"1309.0225v1","created_at":"2026-05-18T03:14:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.0225","created_at":"2026-05-18T03:14:28Z"},{"alias_kind":"pith_short_12","alias_value":"7AHW27KJTAXP","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7AHW27KJTAXPQKRM","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7AHW27KJ","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:58bda1b2295f8553970804f292b16cf16d15a3f10756ac24e748084015b7924e","target":"graph","created_at":"2026-05-18T03:14:28Z","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":"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","authors_text":"Jonathan A. Noel","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-01T14:15:03Z","title":"Choosability of Graphs with Bounded Order: Ohba's Conjecture and Beyond"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.0225","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:967ef6d05c550089553566e1dd7c888dfefaebb416a383270083bb49847a8ab6","target":"record","created_at":"2026-05-18T03:14:28Z","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":"ff6fac9500cf0b9ed36ac39bc90dc8624ade0214771fa1dadbffa2db104c01d5","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-01T14:15:03Z","title_canon_sha256":"d12f4e329f8054bf729216a2a1c4b0710c4a8faed33b318254fba461c07f861a"},"schema_version":"1.0","source":{"id":"1309.0225","kind":"arxiv","version":1}},"canonical_sha256":"f80f6d7d49982ef82a2c52771662206ac951ed450fafbe72d05861ab4b89d647","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f80f6d7d49982ef82a2c52771662206ac951ed450fafbe72d05861ab4b89d647","first_computed_at":"2026-05-18T03:14:28.528374Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:14:28.528374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Eddcao3MlGECNEV4POj4MKVGnj1Xievrn4TzA07ipH5AY8Es9wOkLoBzZdyLEGKNoMzw0i3XYpDxUZr17hb/AA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:14:28.528847Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.0225","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:967ef6d05c550089553566e1dd7c888dfefaebb416a383270083bb49847a8ab6","sha256:58bda1b2295f8553970804f292b16cf16d15a3f10756ac24e748084015b7924e"],"state_sha256":"952309bd1c174fa461d67ec9c4bdd6bfbb4745825ffb004981ee296488682af8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hJaQOVAddKj9w1E4yWi7DOQ8mwVHvCkdrd2bq8QBNpAtYU5ZHJr4IWDT0N+mMWYwWyiEl2cnKJLU4G6gaENfAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T06:33:33.096209Z","bundle_sha256":"5f331e683e756c1230fec5eddafdfa4a7420df65a073c9d4fd223dd0337485d9"}}