{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:YHMMIP6N32KNIFY7AJ5IQCBHN5","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6462dd89ce56a34f3f26e40e8c1938adfdbb4fed90a2c8a6cb65264e8d5c3e5f","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-09-02T10:06:49Z","title_canon_sha256":"0fecbcd95663369dca52549dab4884032f6af6f31736312f2392bfe4bb477c37"},"schema_version":"1.0","source":{"id":"1409.0650","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.0650","created_at":"2026-05-18T02:43:46Z"},{"alias_kind":"arxiv_version","alias_value":"1409.0650v1","created_at":"2026-05-18T02:43:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.0650","created_at":"2026-05-18T02:43:46Z"},{"alias_kind":"pith_short_12","alias_value":"YHMMIP6N32KN","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YHMMIP6N32KNIFY7","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YHMMIP6N","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:e3fda6078992960ce444b1046817d90122705248b906faa892cac01bb60619b4","target":"graph","created_at":"2026-05-18T02:43:46Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Hanna Furma\\'nczyk, Marek Kubale","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-09-02T10:06:49Z","title":"Equitable coloring of corona products of cubic graphs is harder than ordinary coloring"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.0650","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c64b7c9a5ee4f75a011c6c8dc09d2b3cd3745668db57029a4bf73548b1960af5","target":"record","created_at":"2026-05-18T02:43:46Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6462dd89ce56a34f3f26e40e8c1938adfdbb4fed90a2c8a6cb65264e8d5c3e5f","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-09-02T10:06:49Z","title_canon_sha256":"0fecbcd95663369dca52549dab4884032f6af6f31736312f2392bfe4bb477c37"},"schema_version":"1.0","source":{"id":"1409.0650","kind":"arxiv","version":1}},"canonical_sha256":"c1d8c43fcdde94d4171f027a8808276f420035e6623c27b3a6ba559081ea631f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c1d8c43fcdde94d4171f027a8808276f420035e6623c27b3a6ba559081ea631f","first_computed_at":"2026-05-18T02:43:46.407231Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:43:46.407231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cxUpcR4Igpz1upm9TL9eRKdM2bNynBab+qdXsBBqzXgvomtKNUNj1OxQGXFkQeWVc47v84UhF4NpBSE+8JJoCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:43:46.407663Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.0650","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c64b7c9a5ee4f75a011c6c8dc09d2b3cd3745668db57029a4bf73548b1960af5","sha256:e3fda6078992960ce444b1046817d90122705248b906faa892cac01bb60619b4"],"state_sha256":"e88233a63efe07ac724a08e8dd3791c30ec84d476596fc93e10c7c6bb4f890a5"}