{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:YHMMIP6N32KNIFY7AJ5IQCBHN5","short_pith_number":"pith:YHMMIP6N","schema_version":"1.0","canonical_sha256":"c1d8c43fcdde94d4171f027a8808276f420035e6623c27b3a6ba559081ea631f","source":{"kind":"arxiv","id":"1409.0650","version":1},"attestation_state":"computed","paper":{"title":"Equitable coloring of corona products of cubic graphs is harder than ordinary coloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Hanna Furma\\'nczyk, Marek Kubale","submitted_at":"2014-09-02T10:06:49Z","abstract_excerpt":"A graph is equitably $k$-colorable if its vertices can be partitioned into $k$ independent sets in such a way that the number of vertices in any two sets differ by at most one. The smallest $k$ for which such a coloring exists is known as the \\emph{equitable chromatic number} of $G$ and it is denoted by $\\chi_{=}(G)$. In this paper the problem of determinig $\\chi_=$ for coronas of cubic graphs is studied. Although the problem of ordinary coloring of coronas of cubic graphs is solvable in polynomial time, the problem of equitable coloring becomes NP-hard for these graphs. We provide polynomiall"},"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":"1409.0650","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-09-02T10:06:49Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0fecbcd95663369dca52549dab4884032f6af6f31736312f2392bfe4bb477c37","abstract_canon_sha256":"6462dd89ce56a34f3f26e40e8c1938adfdbb4fed90a2c8a6cb65264e8d5c3e5f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:46.407663Z","signature_b64":"cxUpcR4Igpz1upm9TL9eRKdM2bNynBab+qdXsBBqzXgvomtKNUNj1OxQGXFkQeWVc47v84UhF4NpBSE+8JJoCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1d8c43fcdde94d4171f027a8808276f420035e6623c27b3a6ba559081ea631f","last_reissued_at":"2026-05-18T02:43:46.407231Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:46.407231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Equitable coloring of corona products of cubic graphs is harder than ordinary coloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Hanna Furma\\'nczyk, Marek Kubale","submitted_at":"2014-09-02T10:06:49Z","abstract_excerpt":"A graph is equitably $k$-colorable if its vertices can be partitioned into $k$ independent sets in such a way that the number of vertices in any two sets differ by at most one. The smallest $k$ for which such a coloring exists is known as the \\emph{equitable chromatic number} of $G$ and it is denoted by $\\chi_{=}(G)$. In this paper the problem of determinig $\\chi_=$ for coronas of cubic graphs is studied. Although the problem of ordinary coloring of coronas of cubic graphs is solvable in polynomial time, the problem of equitable coloring becomes NP-hard for these graphs. We provide polynomiall"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.0650","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":"1409.0650","created_at":"2026-05-18T02:43:46.407290+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.0650v1","created_at":"2026-05-18T02:43:46.407290+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.0650","created_at":"2026-05-18T02:43:46.407290+00:00"},{"alias_kind":"pith_short_12","alias_value":"YHMMIP6N32KN","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"YHMMIP6N32KNIFY7","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"YHMMIP6N","created_at":"2026-05-18T12:28:57.508820+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/YHMMIP6N32KNIFY7AJ5IQCBHN5","json":"https://pith.science/pith/YHMMIP6N32KNIFY7AJ5IQCBHN5.json","graph_json":"https://pith.science/api/pith-number/YHMMIP6N32KNIFY7AJ5IQCBHN5/graph.json","events_json":"https://pith.science/api/pith-number/YHMMIP6N32KNIFY7AJ5IQCBHN5/events.json","paper":"https://pith.science/paper/YHMMIP6N"},"agent_actions":{"view_html":"https://pith.science/pith/YHMMIP6N32KNIFY7AJ5IQCBHN5","download_json":"https://pith.science/pith/YHMMIP6N32KNIFY7AJ5IQCBHN5.json","view_paper":"https://pith.science/paper/YHMMIP6N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.0650&json=true","fetch_graph":"https://pith.science/api/pith-number/YHMMIP6N32KNIFY7AJ5IQCBHN5/graph.json","fetch_events":"https://pith.science/api/pith-number/YHMMIP6N32KNIFY7AJ5IQCBHN5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YHMMIP6N32KNIFY7AJ5IQCBHN5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YHMMIP6N32KNIFY7AJ5IQCBHN5/action/storage_attestation","attest_author":"https://pith.science/pith/YHMMIP6N32KNIFY7AJ5IQCBHN5/action/author_attestation","sign_citation":"https://pith.science/pith/YHMMIP6N32KNIFY7AJ5IQCBHN5/action/citation_signature","submit_replication":"https://pith.science/pith/YHMMIP6N32KNIFY7AJ5IQCBHN5/action/replication_record"}},"created_at":"2026-05-18T02:43:46.407290+00:00","updated_at":"2026-05-18T02:43:46.407290+00:00"}