{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:WOMKSVL55OAMDQ2BIXK6JUMURP","short_pith_number":"pith:WOMKSVL5","schema_version":"1.0","canonical_sha256":"b398a9557deb80c1c34145d5e4d1948bde9cca46e5a9547738789cb0480b0167","source":{"kind":"arxiv","id":"1109.2162","version":1},"attestation_state":"computed","paper":{"title":"The Complexity of the Empire Colouring Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Andrew R. A. McGrae, Michele Zito","submitted_at":"2011-09-09T21:13:39Z","abstract_excerpt":"We investigate the computational complexity of the empire colouring problem (as defined by Percy Heawood in 1890) for maps containing empires formed by exactly $r > 1$ countries each. We prove that the problem can be solved in polynomial time using $s$ colours on maps whose underlying adjacency graph has no induced subgraph of average degree larger than $s/r$. However, if $s \\geq 3$, the problem is NP-hard even if the graph is a forest of paths of arbitrary lengths (for any $r \\geq 2$, provided $s < 2r - \\sqrt(2r + 1/4+ 3/2)$. Furthermore we obtain a complete characterization of the problem's "},"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":"1109.2162","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-09-09T21:13:39Z","cross_cats_sorted":[],"title_canon_sha256":"fc3a01eec862c9c3623a74a8d732acb01b1d5e882ceacae7f2931150adb54c96","abstract_canon_sha256":"7c5e1f0b612900392596166222ac947c7c84d1c671c4cec49876e9e557b3842b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:11.655187Z","signature_b64":"8QLpW+PDfuqswCPXsEuZ0927mcokq06IKZzxhKQObJPE2Vou817neGEisnjvhxqChU6phfbF69VtTqwKz4i+Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b398a9557deb80c1c34145d5e4d1948bde9cca46e5a9547738789cb0480b0167","last_reissued_at":"2026-05-18T00:14:11.654633Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:11.654633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Complexity of the Empire Colouring Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Andrew R. A. McGrae, Michele Zito","submitted_at":"2011-09-09T21:13:39Z","abstract_excerpt":"We investigate the computational complexity of the empire colouring problem (as defined by Percy Heawood in 1890) for maps containing empires formed by exactly $r > 1$ countries each. We prove that the problem can be solved in polynomial time using $s$ colours on maps whose underlying adjacency graph has no induced subgraph of average degree larger than $s/r$. However, if $s \\geq 3$, the problem is NP-hard even if the graph is a forest of paths of arbitrary lengths (for any $r \\geq 2$, provided $s < 2r - \\sqrt(2r + 1/4+ 3/2)$. Furthermore we obtain a complete characterization of the problem's "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2162","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":"1109.2162","created_at":"2026-05-18T00:14:11.654727+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.2162v1","created_at":"2026-05-18T00:14:11.654727+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2162","created_at":"2026-05-18T00:14:11.654727+00:00"},{"alias_kind":"pith_short_12","alias_value":"WOMKSVL55OAM","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"WOMKSVL55OAMDQ2B","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"WOMKSVL5","created_at":"2026-05-18T12:26:44.992195+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/WOMKSVL55OAMDQ2BIXK6JUMURP","json":"https://pith.science/pith/WOMKSVL55OAMDQ2BIXK6JUMURP.json","graph_json":"https://pith.science/api/pith-number/WOMKSVL55OAMDQ2BIXK6JUMURP/graph.json","events_json":"https://pith.science/api/pith-number/WOMKSVL55OAMDQ2BIXK6JUMURP/events.json","paper":"https://pith.science/paper/WOMKSVL5"},"agent_actions":{"view_html":"https://pith.science/pith/WOMKSVL55OAMDQ2BIXK6JUMURP","download_json":"https://pith.science/pith/WOMKSVL55OAMDQ2BIXK6JUMURP.json","view_paper":"https://pith.science/paper/WOMKSVL5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.2162&json=true","fetch_graph":"https://pith.science/api/pith-number/WOMKSVL55OAMDQ2BIXK6JUMURP/graph.json","fetch_events":"https://pith.science/api/pith-number/WOMKSVL55OAMDQ2BIXK6JUMURP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WOMKSVL55OAMDQ2BIXK6JUMURP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WOMKSVL55OAMDQ2BIXK6JUMURP/action/storage_attestation","attest_author":"https://pith.science/pith/WOMKSVL55OAMDQ2BIXK6JUMURP/action/author_attestation","sign_citation":"https://pith.science/pith/WOMKSVL55OAMDQ2BIXK6JUMURP/action/citation_signature","submit_replication":"https://pith.science/pith/WOMKSVL55OAMDQ2BIXK6JUMURP/action/replication_record"}},"created_at":"2026-05-18T00:14:11.654727+00:00","updated_at":"2026-05-18T00:14:11.654727+00:00"}