{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:7XFMZP7P4S7CEQ265M4LIT4SCF","short_pith_number":"pith:7XFMZP7P","schema_version":"1.0","canonical_sha256":"fdcaccbfefe4be22435eeb38b44f9211642373d5bf000c69c626e62d4621132e","source":{"kind":"arxiv","id":"1309.7705","version":2},"attestation_state":"computed","paper":{"title":"A note on list-coloring powers of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benjamin Reiniger, Elyse Yeager, Nicholas Kosar, Sarka Petrickova","submitted_at":"2013-09-30T02:10:16Z","abstract_excerpt":"Recently, Kim and Park have found an infinite family of graphs whose squares are not chromatic-choosable. Xuding Zhu asked whether there is some $k$ such that all $k$th power graphs are chromatic-choosable. We answer this question in the negative: we show that there is a positive constant $c$ such that for any $k$ there is a family of graphs $G$ with $\\chi(G^k)$ unbounded and $\\chi_{\\ell}(G^k)\\geq c \\chi(G^k) \\log \\chi(G^k)$. We also provide an upper bound, $\\chi_{\\ell}(G^k)<\\chi(G^k)^3$ for $k>1$."},"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":"1309.7705","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-30T02:10:16Z","cross_cats_sorted":[],"title_canon_sha256":"e7eff18c1fea96fea056a2923ad9905653a57f501b7d8a99dbd5297920926486","abstract_canon_sha256":"b34edd186937c428ad7199aa148cf2d1620292f784e41579233705e3125198f1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:39.606374Z","signature_b64":"HSStahFnyywyvphownQfFie+aJnWeUCr3rX1u15NNYaCW1hPrZgsKwRId/gXQeG+eACbbSSy95hgPQmfcaAhDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fdcaccbfefe4be22435eeb38b44f9211642373d5bf000c69c626e62d4621132e","last_reissued_at":"2026-05-18T02:42:39.605734Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:39.605734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on list-coloring powers of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benjamin Reiniger, Elyse Yeager, Nicholas Kosar, Sarka Petrickova","submitted_at":"2013-09-30T02:10:16Z","abstract_excerpt":"Recently, Kim and Park have found an infinite family of graphs whose squares are not chromatic-choosable. Xuding Zhu asked whether there is some $k$ such that all $k$th power graphs are chromatic-choosable. We answer this question in the negative: we show that there is a positive constant $c$ such that for any $k$ there is a family of graphs $G$ with $\\chi(G^k)$ unbounded and $\\chi_{\\ell}(G^k)\\geq c \\chi(G^k) \\log \\chi(G^k)$. We also provide an upper bound, $\\chi_{\\ell}(G^k)<\\chi(G^k)^3$ for $k>1$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.7705","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":"1309.7705","created_at":"2026-05-18T02:42:39.605836+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.7705v2","created_at":"2026-05-18T02:42:39.605836+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.7705","created_at":"2026-05-18T02:42:39.605836+00:00"},{"alias_kind":"pith_short_12","alias_value":"7XFMZP7P4S7C","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"7XFMZP7P4S7CEQ26","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"7XFMZP7P","created_at":"2026-05-18T12:27:38.830355+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2210.05915","citing_title":"Coloring, List Coloring, and Painting Squares of Graphs (and other related problems)","ref_index":128,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7XFMZP7P4S7CEQ265M4LIT4SCF","json":"https://pith.science/pith/7XFMZP7P4S7CEQ265M4LIT4SCF.json","graph_json":"https://pith.science/api/pith-number/7XFMZP7P4S7CEQ265M4LIT4SCF/graph.json","events_json":"https://pith.science/api/pith-number/7XFMZP7P4S7CEQ265M4LIT4SCF/events.json","paper":"https://pith.science/paper/7XFMZP7P"},"agent_actions":{"view_html":"https://pith.science/pith/7XFMZP7P4S7CEQ265M4LIT4SCF","download_json":"https://pith.science/pith/7XFMZP7P4S7CEQ265M4LIT4SCF.json","view_paper":"https://pith.science/paper/7XFMZP7P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.7705&json=true","fetch_graph":"https://pith.science/api/pith-number/7XFMZP7P4S7CEQ265M4LIT4SCF/graph.json","fetch_events":"https://pith.science/api/pith-number/7XFMZP7P4S7CEQ265M4LIT4SCF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7XFMZP7P4S7CEQ265M4LIT4SCF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7XFMZP7P4S7CEQ265M4LIT4SCF/action/storage_attestation","attest_author":"https://pith.science/pith/7XFMZP7P4S7CEQ265M4LIT4SCF/action/author_attestation","sign_citation":"https://pith.science/pith/7XFMZP7P4S7CEQ265M4LIT4SCF/action/citation_signature","submit_replication":"https://pith.science/pith/7XFMZP7P4S7CEQ265M4LIT4SCF/action/replication_record"}},"created_at":"2026-05-18T02:42:39.605836+00:00","updated_at":"2026-05-18T02:42:39.605836+00:00"}