{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:H46QIGD6L6OIOX6LW2PKRTPB2B","short_pith_number":"pith:H46QIGD6","schema_version":"1.0","canonical_sha256":"3f3d04187e5f9c875fcbb69ea8cde1d0564082caa96dd4926de8f16dd38436e8","source":{"kind":"arxiv","id":"1207.3578","version":1},"attestation_state":"computed","paper":{"title":"Equitable chromatic threshold of complete multipartite 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-07-16T05:17:04Z","abstract_excerpt":"A proper vertex coloring of a graph is equitable if the sizes of color classes differ by at most one. 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$. We develop a formula and a linear-time algorithm which compute the equitable chromatic threshold of an arbitrary complete multipartite graph."},"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":"1207.3578","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-16T05:17:04Z","cross_cats_sorted":[],"title_canon_sha256":"6451986e7c05122f9a3d081c8a9239ba4d940a69f52b4307ac3060ffe81e78af","abstract_canon_sha256":"f5bd21dd7c8cf397fb530a654fadcc98870ca479e53c5caa43f79587afec4612"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:00.715193Z","signature_b64":"OYYK7S6WtTpnSFlTBi7697w1f5EvnVUFWKF/EMCGWAVNghSqEold3bCnephBa9FQKfAzaLc5kuYQQNbo+Np+AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f3d04187e5f9c875fcbb69ea8cde1d0564082caa96dd4926de8f16dd38436e8","last_reissued_at":"2026-05-18T03:51:00.714469Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:00.714469Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Equitable chromatic threshold of complete multipartite 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-07-16T05:17:04Z","abstract_excerpt":"A proper vertex coloring of a graph is equitable if the sizes of color classes differ by at most one. 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$. We develop a formula and a linear-time algorithm which compute the equitable chromatic threshold of an arbitrary complete multipartite graph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.3578","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":"1207.3578","created_at":"2026-05-18T03:51:00.714573+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.3578v1","created_at":"2026-05-18T03:51:00.714573+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.3578","created_at":"2026-05-18T03:51:00.714573+00:00"},{"alias_kind":"pith_short_12","alias_value":"H46QIGD6L6OI","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"H46QIGD6L6OIOX6L","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"H46QIGD6","created_at":"2026-05-18T12:27:06.952714+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/H46QIGD6L6OIOX6LW2PKRTPB2B","json":"https://pith.science/pith/H46QIGD6L6OIOX6LW2PKRTPB2B.json","graph_json":"https://pith.science/api/pith-number/H46QIGD6L6OIOX6LW2PKRTPB2B/graph.json","events_json":"https://pith.science/api/pith-number/H46QIGD6L6OIOX6LW2PKRTPB2B/events.json","paper":"https://pith.science/paper/H46QIGD6"},"agent_actions":{"view_html":"https://pith.science/pith/H46QIGD6L6OIOX6LW2PKRTPB2B","download_json":"https://pith.science/pith/H46QIGD6L6OIOX6LW2PKRTPB2B.json","view_paper":"https://pith.science/paper/H46QIGD6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.3578&json=true","fetch_graph":"https://pith.science/api/pith-number/H46QIGD6L6OIOX6LW2PKRTPB2B/graph.json","fetch_events":"https://pith.science/api/pith-number/H46QIGD6L6OIOX6LW2PKRTPB2B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H46QIGD6L6OIOX6LW2PKRTPB2B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H46QIGD6L6OIOX6LW2PKRTPB2B/action/storage_attestation","attest_author":"https://pith.science/pith/H46QIGD6L6OIOX6LW2PKRTPB2B/action/author_attestation","sign_citation":"https://pith.science/pith/H46QIGD6L6OIOX6LW2PKRTPB2B/action/citation_signature","submit_replication":"https://pith.science/pith/H46QIGD6L6OIOX6LW2PKRTPB2B/action/replication_record"}},"created_at":"2026-05-18T03:51:00.714573+00:00","updated_at":"2026-05-18T03:51:00.714573+00:00"}