{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:WOMKSVL55OAMDQ2BIXK6JUMURP","short_pith_number":"pith:WOMKSVL5","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"},"canonical_sha256":"b398a9557deb80c1c34145d5e4d1948bde9cca46e5a9547738789cb0480b0167","source":{"kind":"arxiv","id":"1109.2162","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.2162","created_at":"2026-05-18T00:14:11Z"},{"alias_kind":"arxiv_version","alias_value":"1109.2162v1","created_at":"2026-05-18T00:14:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2162","created_at":"2026-05-18T00:14:11Z"},{"alias_kind":"pith_short_12","alias_value":"WOMKSVL55OAM","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WOMKSVL55OAMDQ2B","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WOMKSVL5","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:WOMKSVL55OAMDQ2BIXK6JUMURP","target":"record","payload":{"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"},"canonical_sha256":"b398a9557deb80c1c34145d5e4d1948bde9cca46e5a9547738789cb0480b0167","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"},"source_kind":"arxiv","source_id":"1109.2162","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:14:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NN+joVR6fPAZP0NwbGWf7LKli54cNs0iJ873DNl82RBjCyu+0i9tcqcGlFL2RjEcwA20V1i+fvsbtJsWCA9EDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:48:34.786855Z"},"content_sha256":"168bed3d3b4f545fb68dda6dc0d3b3c241911f512fc9e9e42a37cd69bf1b9189","schema_version":"1.0","event_id":"sha256:168bed3d3b4f545fb68dda6dc0d3b3c241911f512fc9e9e42a37cd69bf1b9189"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:WOMKSVL55OAMDQ2BIXK6JUMURP","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:14:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pAu83JBcerZdcwDAZMz2cPq+Ba42PpXDKjjuw1ZAwRJ8jT8LCbRydYbPSh4a+2ElZ6ND6MnLdGTtZMVCiqBHCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:48:34.787208Z"},"content_sha256":"33ba23ae8020276b7c08024e487b0e4c5bc86d620ab4dc1fe4738f8ebcdb8d3d","schema_version":"1.0","event_id":"sha256:33ba23ae8020276b7c08024e487b0e4c5bc86d620ab4dc1fe4738f8ebcdb8d3d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WOMKSVL55OAMDQ2BIXK6JUMURP/bundle.json","state_url":"https://pith.science/pith/WOMKSVL55OAMDQ2BIXK6JUMURP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WOMKSVL55OAMDQ2BIXK6JUMURP/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-04T06:48:34Z","links":{"resolver":"https://pith.science/pith/WOMKSVL55OAMDQ2BIXK6JUMURP","bundle":"https://pith.science/pith/WOMKSVL55OAMDQ2BIXK6JUMURP/bundle.json","state":"https://pith.science/pith/WOMKSVL55OAMDQ2BIXK6JUMURP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WOMKSVL55OAMDQ2BIXK6JUMURP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:WOMKSVL55OAMDQ2BIXK6JUMURP","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":"7c5e1f0b612900392596166222ac947c7c84d1c671c4cec49876e9e557b3842b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-09-09T21:13:39Z","title_canon_sha256":"fc3a01eec862c9c3623a74a8d732acb01b1d5e882ceacae7f2931150adb54c96"},"schema_version":"1.0","source":{"id":"1109.2162","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.2162","created_at":"2026-05-18T00:14:11Z"},{"alias_kind":"arxiv_version","alias_value":"1109.2162v1","created_at":"2026-05-18T00:14:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2162","created_at":"2026-05-18T00:14:11Z"},{"alias_kind":"pith_short_12","alias_value":"WOMKSVL55OAM","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WOMKSVL55OAMDQ2B","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WOMKSVL5","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:33ba23ae8020276b7c08024e487b0e4c5bc86d620ab4dc1fe4738f8ebcdb8d3d","target":"graph","created_at":"2026-05-18T00:14:11Z","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 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 ","authors_text":"Andrew R. A. McGrae, Michele Zito","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-09-09T21:13:39Z","title":"The Complexity of the Empire Colouring Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2162","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:168bed3d3b4f545fb68dda6dc0d3b3c241911f512fc9e9e42a37cd69bf1b9189","target":"record","created_at":"2026-05-18T00:14:11Z","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":"7c5e1f0b612900392596166222ac947c7c84d1c671c4cec49876e9e557b3842b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-09-09T21:13:39Z","title_canon_sha256":"fc3a01eec862c9c3623a74a8d732acb01b1d5e882ceacae7f2931150adb54c96"},"schema_version":"1.0","source":{"id":"1109.2162","kind":"arxiv","version":1}},"canonical_sha256":"b398a9557deb80c1c34145d5e4d1948bde9cca46e5a9547738789cb0480b0167","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b398a9557deb80c1c34145d5e4d1948bde9cca46e5a9547738789cb0480b0167","first_computed_at":"2026-05-18T00:14:11.654633Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:11.654633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8QLpW+PDfuqswCPXsEuZ0927mcokq06IKZzxhKQObJPE2Vou817neGEisnjvhxqChU6phfbF69VtTqwKz4i+Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:11.655187Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.2162","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:168bed3d3b4f545fb68dda6dc0d3b3c241911f512fc9e9e42a37cd69bf1b9189","sha256:33ba23ae8020276b7c08024e487b0e4c5bc86d620ab4dc1fe4738f8ebcdb8d3d"],"state_sha256":"77229b5510653fb72a11cffdae549d6f87dcd905c1cf3fac135d86d4d650138f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wGeYDtr+wgU3l6MoLGHM2WD3RJBy77MHGQiWxfoTkXj15hG5CATT+WAIuDuS7bJd83UXl5WWlExJGGHIwpPkBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T06:48:34.789467Z","bundle_sha256":"57a65e21c50f1b256421d6e7335e4f3dc748a1eff4ee292e6f054b93fc29c171"}}