{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:PD2EW2WK53CE4PS5ZAKLQQHVUR","short_pith_number":"pith:PD2EW2WK","schema_version":"1.0","canonical_sha256":"78f44b6acaeec44e3e5dc814b840f5a44bfc40c7c1f1ac214668dd238bf1e57c","source":{"kind":"arxiv","id":"1311.1251","version":2},"attestation_state":"computed","paper":{"title":"Painting Squares in $\\Delta^2-1$ Shades","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel W. Cranston, Landon Rabern","submitted_at":"2013-11-05T23:52:46Z","abstract_excerpt":"Cranston and Kim conjecture that if $G$ is a connected graph with maximum degree $\\Delta$ and $G$ is not a Moore Graph, then $\\chi_l(G^2) \\le \\Delta^2-1$; here $\\chi_l$ is the list chromatic number. We prove their conjecture; in fact, this upper bound holds even for online list chromatic number."},"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":"1311.1251","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-05T23:52:46Z","cross_cats_sorted":[],"title_canon_sha256":"a6bbd2b811ffc9d8a3f8394e881f11de734def93f9ec84189089b45a0ce14426","abstract_canon_sha256":"8d20a5964df311eb170776801707d30ecc75c3be56b265c550bd52030ccc4d2a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:39.164412Z","signature_b64":"a0GSIfjbwsaUiU57XP3rdyM/eeiMmfEQl435Q4bbz/FeQcO1tuRGjbM/hUnzWiBaANLbhWVDl9UUyJIHqPVaCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78f44b6acaeec44e3e5dc814b840f5a44bfc40c7c1f1ac214668dd238bf1e57c","last_reissued_at":"2026-05-18T00:44:39.163854Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:39.163854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Painting Squares in $\\Delta^2-1$ Shades","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel W. Cranston, Landon Rabern","submitted_at":"2013-11-05T23:52:46Z","abstract_excerpt":"Cranston and Kim conjecture that if $G$ is a connected graph with maximum degree $\\Delta$ and $G$ is not a Moore Graph, then $\\chi_l(G^2) \\le \\Delta^2-1$; here $\\chi_l$ is the list chromatic number. We prove their conjecture; in fact, this upper bound holds even for online list chromatic number."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.1251","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":"1311.1251","created_at":"2026-05-18T00:44:39.163944+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.1251v2","created_at":"2026-05-18T00:44:39.163944+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.1251","created_at":"2026-05-18T00:44:39.163944+00:00"},{"alias_kind":"pith_short_12","alias_value":"PD2EW2WK53CE","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PD2EW2WK53CE4PS5","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PD2EW2WK","created_at":"2026-05-18T12:27:54.935989+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":63,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PD2EW2WK53CE4PS5ZAKLQQHVUR","json":"https://pith.science/pith/PD2EW2WK53CE4PS5ZAKLQQHVUR.json","graph_json":"https://pith.science/api/pith-number/PD2EW2WK53CE4PS5ZAKLQQHVUR/graph.json","events_json":"https://pith.science/api/pith-number/PD2EW2WK53CE4PS5ZAKLQQHVUR/events.json","paper":"https://pith.science/paper/PD2EW2WK"},"agent_actions":{"view_html":"https://pith.science/pith/PD2EW2WK53CE4PS5ZAKLQQHVUR","download_json":"https://pith.science/pith/PD2EW2WK53CE4PS5ZAKLQQHVUR.json","view_paper":"https://pith.science/paper/PD2EW2WK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.1251&json=true","fetch_graph":"https://pith.science/api/pith-number/PD2EW2WK53CE4PS5ZAKLQQHVUR/graph.json","fetch_events":"https://pith.science/api/pith-number/PD2EW2WK53CE4PS5ZAKLQQHVUR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PD2EW2WK53CE4PS5ZAKLQQHVUR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PD2EW2WK53CE4PS5ZAKLQQHVUR/action/storage_attestation","attest_author":"https://pith.science/pith/PD2EW2WK53CE4PS5ZAKLQQHVUR/action/author_attestation","sign_citation":"https://pith.science/pith/PD2EW2WK53CE4PS5ZAKLQQHVUR/action/citation_signature","submit_replication":"https://pith.science/pith/PD2EW2WK53CE4PS5ZAKLQQHVUR/action/replication_record"}},"created_at":"2026-05-18T00:44:39.163944+00:00","updated_at":"2026-05-18T00:44:39.163944+00:00"}