{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:2PEZTYHMF2Q35UKLDI5TLCPH6V","short_pith_number":"pith:2PEZTYHM","schema_version":"1.0","canonical_sha256":"d3c999e0ec2ea1bed14b1a3b3589e7f57135067bbf22ed88113a41bb83787ef1","source":{"kind":"arxiv","id":"1305.2700","version":2},"attestation_state":"computed","paper":{"title":"On-Line Choice Number of Complete Multipartite Graphs: an Algorithmic Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fei-Huang Chang, Hong-Bin Chen, Jun-Yi Guo, Yu-Pei Huang","submitted_at":"2013-05-13T08:16:16Z","abstract_excerpt":"This paper studies the on-line choice number on complete multipartite graphs with independence number $m$. We give a unified strategy for every prescribed $m$. Our main result leads to several interesting consequences comparable to known results. (1) If $ k_1-\\sum_{p=2}^m(\\frac{p^2}{2}-\\frac{3p}{2}+1)k_p\\geq 0$, where $k_p$ denotes the number of parts of cardinality $p$, then $G$ is on-line chromatic-choosable. (2) If $ |V(G)|\\leq\\frac{m^2-m+2}{m^2-3m+4}\\chi(G)$, then $G$ is on-line chromatic-choosable. (3) The on-line choice number of regular complete multipartite graphs $K_{m\\star k}$ is at "},"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":"1305.2700","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-13T08:16:16Z","cross_cats_sorted":[],"title_canon_sha256":"3959b696bf94af37f7e986652d15703c83eddf3df678cba769a7427dd41e90f5","abstract_canon_sha256":"45892fb798f3b98f249595e691f0ce9d66fe12ec8a63779e60c1a25c93e2a89b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:04.125512Z","signature_b64":"GcNmSY9Vi5Pyt/EI2w+1KDSKG2DMt2gscQElxZGxl4nfLwcuw2UT2iRUHYBGGhjHrU6IiMzqeuwwB3yp7U+RCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3c999e0ec2ea1bed14b1a3b3589e7f57135067bbf22ed88113a41bb83787ef1","last_reissued_at":"2026-05-18T02:31:04.125024Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:04.125024Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On-Line Choice Number of Complete Multipartite Graphs: an Algorithmic Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fei-Huang Chang, Hong-Bin Chen, Jun-Yi Guo, Yu-Pei Huang","submitted_at":"2013-05-13T08:16:16Z","abstract_excerpt":"This paper studies the on-line choice number on complete multipartite graphs with independence number $m$. We give a unified strategy for every prescribed $m$. Our main result leads to several interesting consequences comparable to known results. (1) If $ k_1-\\sum_{p=2}^m(\\frac{p^2}{2}-\\frac{3p}{2}+1)k_p\\geq 0$, where $k_p$ denotes the number of parts of cardinality $p$, then $G$ is on-line chromatic-choosable. (2) If $ |V(G)|\\leq\\frac{m^2-m+2}{m^2-3m+4}\\chi(G)$, then $G$ is on-line chromatic-choosable. (3) The on-line choice number of regular complete multipartite graphs $K_{m\\star k}$ is at "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.2700","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":"1305.2700","created_at":"2026-05-18T02:31:04.125086+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.2700v2","created_at":"2026-05-18T02:31:04.125086+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.2700","created_at":"2026-05-18T02:31:04.125086+00:00"},{"alias_kind":"pith_short_12","alias_value":"2PEZTYHMF2Q3","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"2PEZTYHMF2Q35UKL","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"2PEZTYHM","created_at":"2026-05-18T12:27:32.513160+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/2PEZTYHMF2Q35UKLDI5TLCPH6V","json":"https://pith.science/pith/2PEZTYHMF2Q35UKLDI5TLCPH6V.json","graph_json":"https://pith.science/api/pith-number/2PEZTYHMF2Q35UKLDI5TLCPH6V/graph.json","events_json":"https://pith.science/api/pith-number/2PEZTYHMF2Q35UKLDI5TLCPH6V/events.json","paper":"https://pith.science/paper/2PEZTYHM"},"agent_actions":{"view_html":"https://pith.science/pith/2PEZTYHMF2Q35UKLDI5TLCPH6V","download_json":"https://pith.science/pith/2PEZTYHMF2Q35UKLDI5TLCPH6V.json","view_paper":"https://pith.science/paper/2PEZTYHM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.2700&json=true","fetch_graph":"https://pith.science/api/pith-number/2PEZTYHMF2Q35UKLDI5TLCPH6V/graph.json","fetch_events":"https://pith.science/api/pith-number/2PEZTYHMF2Q35UKLDI5TLCPH6V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2PEZTYHMF2Q35UKLDI5TLCPH6V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2PEZTYHMF2Q35UKLDI5TLCPH6V/action/storage_attestation","attest_author":"https://pith.science/pith/2PEZTYHMF2Q35UKLDI5TLCPH6V/action/author_attestation","sign_citation":"https://pith.science/pith/2PEZTYHMF2Q35UKLDI5TLCPH6V/action/citation_signature","submit_replication":"https://pith.science/pith/2PEZTYHMF2Q35UKLDI5TLCPH6V/action/replication_record"}},"created_at":"2026-05-18T02:31:04.125086+00:00","updated_at":"2026-05-18T02:31:04.125086+00:00"}