{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:QE5MHFCF4HGSPYQ433UJONWGC3","short_pith_number":"pith:QE5MHFCF","schema_version":"1.0","canonical_sha256":"813ac39445e1cd27e21cdee89736c616c2f46d4f3a106a16470bc233ca11a00c","source":{"kind":"arxiv","id":"1408.5412","version":1},"attestation_state":"computed","paper":{"title":"On the Complexity of Role Colouring Planar Graphs, Trees and Cographs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Christopher Purcell, M. Puck Rombach","submitted_at":"2014-08-14T16:33:49Z","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 $"},"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":"1408.5412","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-14T16:33:49Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"2a92ee9d475e095095009174efa0cdf11f42b644b2dba0ac4e191d3b98c85b91","abstract_canon_sha256":"3fe7ebb0346814611c49ff4bdd50428157de157c9a6eb30ecf7aa17eb1fe7f67"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:25.232715Z","signature_b64":"kjo2FjcK9kJANED7ZtePGjLHPWBKv4KGOz6UOrQUN0QnRq4I67qh82Buur1CqNUycIaBMPtL5Qf9R6wTFpeDCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"813ac39445e1cd27e21cdee89736c616c2f46d4f3a106a16470bc233ca11a00c","last_reissued_at":"2026-05-18T02:44:25.232304Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:25.232304Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Complexity of Role Colouring Planar Graphs, Trees and Cographs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Christopher Purcell, M. Puck Rombach","submitted_at":"2014-08-14T16:33:49Z","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 $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5412","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":"1408.5412","created_at":"2026-05-18T02:44:25.232377+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.5412v1","created_at":"2026-05-18T02:44:25.232377+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5412","created_at":"2026-05-18T02:44:25.232377+00:00"},{"alias_kind":"pith_short_12","alias_value":"QE5MHFCF4HGS","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"QE5MHFCF4HGSPYQ4","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"QE5MHFCF","created_at":"2026-05-18T12:28:43.426989+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/QE5MHFCF4HGSPYQ433UJONWGC3","json":"https://pith.science/pith/QE5MHFCF4HGSPYQ433UJONWGC3.json","graph_json":"https://pith.science/api/pith-number/QE5MHFCF4HGSPYQ433UJONWGC3/graph.json","events_json":"https://pith.science/api/pith-number/QE5MHFCF4HGSPYQ433UJONWGC3/events.json","paper":"https://pith.science/paper/QE5MHFCF"},"agent_actions":{"view_html":"https://pith.science/pith/QE5MHFCF4HGSPYQ433UJONWGC3","download_json":"https://pith.science/pith/QE5MHFCF4HGSPYQ433UJONWGC3.json","view_paper":"https://pith.science/paper/QE5MHFCF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.5412&json=true","fetch_graph":"https://pith.science/api/pith-number/QE5MHFCF4HGSPYQ433UJONWGC3/graph.json","fetch_events":"https://pith.science/api/pith-number/QE5MHFCF4HGSPYQ433UJONWGC3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QE5MHFCF4HGSPYQ433UJONWGC3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QE5MHFCF4HGSPYQ433UJONWGC3/action/storage_attestation","attest_author":"https://pith.science/pith/QE5MHFCF4HGSPYQ433UJONWGC3/action/author_attestation","sign_citation":"https://pith.science/pith/QE5MHFCF4HGSPYQ433UJONWGC3/action/citation_signature","submit_replication":"https://pith.science/pith/QE5MHFCF4HGSPYQ433UJONWGC3/action/replication_record"}},"created_at":"2026-05-18T02:44:25.232377+00:00","updated_at":"2026-05-18T02:44:25.232377+00:00"}