{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:QE5MHFCF4HGSPYQ433UJONWGC3","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":"3fe7ebb0346814611c49ff4bdd50428157de157c9a6eb30ecf7aa17eb1fe7f67","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-14T16:33:49Z","title_canon_sha256":"2a92ee9d475e095095009174efa0cdf11f42b644b2dba0ac4e191d3b98c85b91"},"schema_version":"1.0","source":{"id":"1408.5412","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.5412","created_at":"2026-05-18T02:44:25Z"},{"alias_kind":"arxiv_version","alias_value":"1408.5412v1","created_at":"2026-05-18T02:44:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5412","created_at":"2026-05-18T02:44:25Z"},{"alias_kind":"pith_short_12","alias_value":"QE5MHFCF4HGS","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"QE5MHFCF4HGSPYQ4","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"QE5MHFCF","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:6afe1a8955356e75c2f2dbf608bb998091109da42c764e8424473ff5ce9e0bab","target":"graph","created_at":"2026-05-18T02:44:25Z","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":"We prove several results about the complexity of the role colouring problem. A role colouring of a graph $G$ is an assignment of colours to the vertices of $G$ such that two vertices of the same colour have identical sets of colours in their neighbourhoods. We show that the problem of finding a role colouring with $1< k <n$ colours is NP-hard for planar graphs. We show that restricting the problem to trees yields a polynomially solvable case, as long as $k$ is either constant or has a constant difference with $n$, the number of vertices in the tree. Finally, we prove that cographs are always $","authors_text":"Christopher Purcell, M. Puck Rombach","cross_cats":["cs.CC","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-14T16:33:49Z","title":"On the Complexity of Role Colouring Planar Graphs, Trees and Cographs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5412","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:8cba0c61aa08a03a5bd694a7d801c04f42efcec6573cfb379be127f4d41fbd5d","target":"record","created_at":"2026-05-18T02:44:25Z","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":"3fe7ebb0346814611c49ff4bdd50428157de157c9a6eb30ecf7aa17eb1fe7f67","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-14T16:33:49Z","title_canon_sha256":"2a92ee9d475e095095009174efa0cdf11f42b644b2dba0ac4e191d3b98c85b91"},"schema_version":"1.0","source":{"id":"1408.5412","kind":"arxiv","version":1}},"canonical_sha256":"813ac39445e1cd27e21cdee89736c616c2f46d4f3a106a16470bc233ca11a00c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"813ac39445e1cd27e21cdee89736c616c2f46d4f3a106a16470bc233ca11a00c","first_computed_at":"2026-05-18T02:44:25.232304Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:25.232304Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kjo2FjcK9kJANED7ZtePGjLHPWBKv4KGOz6UOrQUN0QnRq4I67qh82Buur1CqNUycIaBMPtL5Qf9R6wTFpeDCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:25.232715Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.5412","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8cba0c61aa08a03a5bd694a7d801c04f42efcec6573cfb379be127f4d41fbd5d","sha256:6afe1a8955356e75c2f2dbf608bb998091109da42c764e8424473ff5ce9e0bab"],"state_sha256":"2b728bcbb3843ca6abc754d84619eddb80ce14e1911097a66a552eae8530ea53"}