{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:KA4WMUE2A473ES7DXC5KB7W3IU","short_pith_number":"pith:KA4WMUE2","schema_version":"1.0","canonical_sha256":"503966509a073fb24be3b8baa0fedb453262d0263aeffee79af4b5708350ba28","source":{"kind":"arxiv","id":"1210.0188","version":1},"attestation_state":"computed","paper":{"title":"Equitable coloring of Kronecker products of complete multipartite graphs and complete graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Wei Wang, Zhidan Yan","submitted_at":"2012-09-30T11:19:35Z","abstract_excerpt":"A proper vertex coloring of a graph is equitable if the sizes of color classes differ by at most 1. The equitable chromatic number of a graph $G$, denoted by $\\chi_=(G)$, is the minimum $k$ such that $G$ is equitably $k$-colorable. The equitable chromatic threshold of a graph $G$, denoted by $\\chi_=^*(G)$, is the minimum $t$ such that $G$ is equitably $k$-colorable for $k \\ge t$. In this paper, we give the exact values of $\\chi_=(K_{m_1,..., m_r} \\times K_n)$ and $\\chi_=^*(K_{m_1,..., m_r} \\times K_n)$ for $\\sum_{i = 1}^r m_i \\leq n$."},"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":"1210.0188","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-30T11:19:35Z","cross_cats_sorted":[],"title_canon_sha256":"ee6035f1d837e8f42519e6c16a482d2a55461c201a01ec4919372f74a9166ee7","abstract_canon_sha256":"9c721e727eddfbf4e6818f843781a232d075356516c094ddfe85cba5bcd034e2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:23.049189Z","signature_b64":"ShAW0hwdCDsLcTJ2StFeCC6A93PXN80+GDNGO9CxFFmv2sMOxeYG1K5dxIuaqg4kfQ15uoCPRu34dhigHkiTCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"503966509a073fb24be3b8baa0fedb453262d0263aeffee79af4b5708350ba28","last_reissued_at":"2026-05-18T03:44:23.048474Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:23.048474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Equitable coloring of Kronecker products of complete multipartite graphs and complete graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Wei Wang, Zhidan Yan","submitted_at":"2012-09-30T11:19:35Z","abstract_excerpt":"A proper vertex coloring of a graph is equitable if the sizes of color classes differ by at most 1. The equitable chromatic number of a graph $G$, denoted by $\\chi_=(G)$, is the minimum $k$ such that $G$ is equitably $k$-colorable. The equitable chromatic threshold of a graph $G$, denoted by $\\chi_=^*(G)$, is the minimum $t$ such that $G$ is equitably $k$-colorable for $k \\ge t$. In this paper, we give the exact values of $\\chi_=(K_{m_1,..., m_r} \\times K_n)$ and $\\chi_=^*(K_{m_1,..., m_r} \\times K_n)$ for $\\sum_{i = 1}^r m_i \\leq n$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.0188","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1210.0188","created_at":"2026-05-18T03:44:23.048590+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.0188v1","created_at":"2026-05-18T03:44:23.048590+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0188","created_at":"2026-05-18T03:44:23.048590+00:00"},{"alias_kind":"pith_short_12","alias_value":"KA4WMUE2A473","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"KA4WMUE2A473ES7D","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"KA4WMUE2","created_at":"2026-05-18T12:27:11.947152+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/KA4WMUE2A473ES7DXC5KB7W3IU","json":"https://pith.science/pith/KA4WMUE2A473ES7DXC5KB7W3IU.json","graph_json":"https://pith.science/api/pith-number/KA4WMUE2A473ES7DXC5KB7W3IU/graph.json","events_json":"https://pith.science/api/pith-number/KA4WMUE2A473ES7DXC5KB7W3IU/events.json","paper":"https://pith.science/paper/KA4WMUE2"},"agent_actions":{"view_html":"https://pith.science/pith/KA4WMUE2A473ES7DXC5KB7W3IU","download_json":"https://pith.science/pith/KA4WMUE2A473ES7DXC5KB7W3IU.json","view_paper":"https://pith.science/paper/KA4WMUE2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.0188&json=true","fetch_graph":"https://pith.science/api/pith-number/KA4WMUE2A473ES7DXC5KB7W3IU/graph.json","fetch_events":"https://pith.science/api/pith-number/KA4WMUE2A473ES7DXC5KB7W3IU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KA4WMUE2A473ES7DXC5KB7W3IU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KA4WMUE2A473ES7DXC5KB7W3IU/action/storage_attestation","attest_author":"https://pith.science/pith/KA4WMUE2A473ES7DXC5KB7W3IU/action/author_attestation","sign_citation":"https://pith.science/pith/KA4WMUE2A473ES7DXC5KB7W3IU/action/citation_signature","submit_replication":"https://pith.science/pith/KA4WMUE2A473ES7DXC5KB7W3IU/action/replication_record"}},"created_at":"2026-05-18T03:44:23.048590+00:00","updated_at":"2026-05-18T03:44:23.048590+00:00"}