{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:TXNAZ3UGSRJPNDZH6BX5QBFXON","short_pith_number":"pith:TXNAZ3UG","schema_version":"1.0","canonical_sha256":"9dda0cee869452f68f27f06fd804b773701325ed77d93030cfb0f073890a8508","source":{"kind":"arxiv","id":"1111.5458","version":2},"attestation_state":"computed","paper":{"title":"Towards on-line Ohba's conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jakub Kozik, Piotr Micek, Xuding Zhu","submitted_at":"2011-11-23T11:13:19Z","abstract_excerpt":"The on-line choice number of a graph is a variation of the choice number defined through a two person game. It is at least as large as the choice number for all graphs and is strictly larger for some graphs. In particular, there are graphs $G$ with $|V(G)| = 2 \\chi(G)+1$ whose on-line choice numbers are larger than their chromatic numbers, in contrast to a recently confirmed conjecture of Ohba that every graph $G$ with $|V(G)| \\le 2 \\chi(G)+1$ has its choice number equal its chromatic number. Nevertheless, an on-line version of Ohba conjecture was proposed in [P. Huang, T. Wong and X. Zhu, App"},"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":"1111.5458","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-23T11:13:19Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"610a898038c2aa00a64b015168584d46330a8e1032c5c8e1227de2d4148dc079","abstract_canon_sha256":"601ad3bb14c00c951355704e07bc3a7e21fba04f1c13cc331caa557ba1d7feb4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:39:05.335284Z","signature_b64":"cjkd/NmODYgOCzeyErzIT8wFsMcnCGR95KYFnHhA3LPK7uNunXXgjFYkRPmOnE8SJKNLjice7CrHsk0TbiamAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9dda0cee869452f68f27f06fd804b773701325ed77d93030cfb0f073890a8508","last_reissued_at":"2026-05-18T03:39:05.334594Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:39:05.334594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards on-line Ohba's conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jakub Kozik, Piotr Micek, Xuding Zhu","submitted_at":"2011-11-23T11:13:19Z","abstract_excerpt":"The on-line choice number of a graph is a variation of the choice number defined through a two person game. It is at least as large as the choice number for all graphs and is strictly larger for some graphs. In particular, there are graphs $G$ with $|V(G)| = 2 \\chi(G)+1$ whose on-line choice numbers are larger than their chromatic numbers, in contrast to a recently confirmed conjecture of Ohba that every graph $G$ with $|V(G)| \\le 2 \\chi(G)+1$ has its choice number equal its chromatic number. Nevertheless, an on-line version of Ohba conjecture was proposed in [P. Huang, T. Wong and X. Zhu, App"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.5458","kind":"arxiv","version":2},"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":"1111.5458","created_at":"2026-05-18T03:39:05.334683+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.5458v2","created_at":"2026-05-18T03:39:05.334683+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.5458","created_at":"2026-05-18T03:39:05.334683+00:00"},{"alias_kind":"pith_short_12","alias_value":"TXNAZ3UGSRJP","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"TXNAZ3UGSRJPNDZH","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"TXNAZ3UG","created_at":"2026-05-18T12:26:42.757692+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/TXNAZ3UGSRJPNDZH6BX5QBFXON","json":"https://pith.science/pith/TXNAZ3UGSRJPNDZH6BX5QBFXON.json","graph_json":"https://pith.science/api/pith-number/TXNAZ3UGSRJPNDZH6BX5QBFXON/graph.json","events_json":"https://pith.science/api/pith-number/TXNAZ3UGSRJPNDZH6BX5QBFXON/events.json","paper":"https://pith.science/paper/TXNAZ3UG"},"agent_actions":{"view_html":"https://pith.science/pith/TXNAZ3UGSRJPNDZH6BX5QBFXON","download_json":"https://pith.science/pith/TXNAZ3UGSRJPNDZH6BX5QBFXON.json","view_paper":"https://pith.science/paper/TXNAZ3UG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.5458&json=true","fetch_graph":"https://pith.science/api/pith-number/TXNAZ3UGSRJPNDZH6BX5QBFXON/graph.json","fetch_events":"https://pith.science/api/pith-number/TXNAZ3UGSRJPNDZH6BX5QBFXON/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TXNAZ3UGSRJPNDZH6BX5QBFXON/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TXNAZ3UGSRJPNDZH6BX5QBFXON/action/storage_attestation","attest_author":"https://pith.science/pith/TXNAZ3UGSRJPNDZH6BX5QBFXON/action/author_attestation","sign_citation":"https://pith.science/pith/TXNAZ3UGSRJPNDZH6BX5QBFXON/action/citation_signature","submit_replication":"https://pith.science/pith/TXNAZ3UGSRJPNDZH6BX5QBFXON/action/replication_record"}},"created_at":"2026-05-18T03:39:05.334683+00:00","updated_at":"2026-05-18T03:39:05.334683+00:00"}