{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:7BICHOH2TNPRYDVQNMMRYTQN4O","short_pith_number":"pith:7BICHOH2","canonical_record":{"source":{"id":"1407.1482","kind":"arxiv","version":8},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-07-06T11:20:46Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"f869329b9ce16d99b720941e3d6db4f0e5649098e7c8262c3aa1df124a0d9fab","abstract_canon_sha256":"c78611a23aa525530ca04c92a3e6acada21d76c693c58da4de96f529008eb22b"},"schema_version":"1.0"},"canonical_sha256":"f85023b8fa9b5f1c0eb06b191c4e0de3aa0e874ee56b80a6c811a8929c0173e2","source":{"kind":"arxiv","id":"1407.1482","version":8},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.1482","created_at":"2026-05-18T01:20:50Z"},{"alias_kind":"arxiv_version","alias_value":"1407.1482v8","created_at":"2026-05-18T01:20:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.1482","created_at":"2026-05-18T01:20:50Z"},{"alias_kind":"pith_short_12","alias_value":"7BICHOH2TNPR","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"7BICHOH2TNPRYDVQ","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"7BICHOH2","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:7BICHOH2TNPRYDVQNMMRYTQN4O","target":"record","payload":{"canonical_record":{"source":{"id":"1407.1482","kind":"arxiv","version":8},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-07-06T11:20:46Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"f869329b9ce16d99b720941e3d6db4f0e5649098e7c8262c3aa1df124a0d9fab","abstract_canon_sha256":"c78611a23aa525530ca04c92a3e6acada21d76c693c58da4de96f529008eb22b"},"schema_version":"1.0"},"canonical_sha256":"f85023b8fa9b5f1c0eb06b191c4e0de3aa0e874ee56b80a6c811a8929c0173e2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:50.708211Z","signature_b64":"iacWWjaPFpjPEjyyU2RJ1CgU3RgrmWRhYGbnJ9OnTIyvA9mRiHt/TVweAqR4skF+yUS2hOGhgjEi1pY3X8KADw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f85023b8fa9b5f1c0eb06b191c4e0de3aa0e874ee56b80a6c811a8929c0173e2","last_reissued_at":"2026-05-18T01:20:50.707816Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:50.707816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.1482","source_version":8,"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-18T01:20:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XHmEbPxoDusd08IHhfMyWSi95PL/gv/gB1cW40pNIy0Z7nGOlQ84gAfkJJaO7lLbxYLcByubgV2D2LyzZREqDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T08:01:54.017925Z"},"content_sha256":"5e3b0c02e91a3f9e498bad8907ac222389662f6ce41d1972cc965f566d47e1de","schema_version":"1.0","event_id":"sha256:5e3b0c02e91a3f9e498bad8907ac222389662f6ce41d1972cc965f566d47e1de"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:7BICHOH2TNPRYDVQNMMRYTQN4O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Survey on the Computational Complexity of Colouring Graphs with Forbidden Subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CC","authors_text":"Dani\\\"el Paulusma, Jian Song, Matthew Johnson, Petr A. Golovach","submitted_at":"2014-07-06T11:20:46Z","abstract_excerpt":"For a positive integer $k$, a $k$-colouring of a graph $G=(V,E)$ is a mapping $c: V\\rightarrow\\{1,2,...,k\\}$ such that $c(u)\\neq c(v)$ whenever $uv\\in E$. The Colouring problem is to decide, for a given $G$ and $k$, whether a $k$-colouring of $G$ exists. If $k$ is fixed (that is, it is not part of the input), we have the decision problem $k$-Colouring instead. We survey known results on the computational complexity of Colouring and $k$-Colouring for graph classes that are characterized by one or two forbidden induced subgraphs. We also consider a number of variants: for example, where the prob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.1482","kind":"arxiv","version":8},"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-18T01:20:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HCnIyLBqehxjaBl+vKI+FhzdDbdpLPYiSsOXDayGnuFEL2Kzq73SiHQ/L8azSPPRJkQPxbbgGvpYH2icgJXFAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T08:01:54.018585Z"},"content_sha256":"49aab337853608fcb3f32afc731086eabbdf1853c55f6e7ff7287972310a77e1","schema_version":"1.0","event_id":"sha256:49aab337853608fcb3f32afc731086eabbdf1853c55f6e7ff7287972310a77e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7BICHOH2TNPRYDVQNMMRYTQN4O/bundle.json","state_url":"https://pith.science/pith/7BICHOH2TNPRYDVQNMMRYTQN4O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7BICHOH2TNPRYDVQNMMRYTQN4O/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-05-25T08:01:54Z","links":{"resolver":"https://pith.science/pith/7BICHOH2TNPRYDVQNMMRYTQN4O","bundle":"https://pith.science/pith/7BICHOH2TNPRYDVQNMMRYTQN4O/bundle.json","state":"https://pith.science/pith/7BICHOH2TNPRYDVQNMMRYTQN4O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7BICHOH2TNPRYDVQNMMRYTQN4O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:7BICHOH2TNPRYDVQNMMRYTQN4O","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":"c78611a23aa525530ca04c92a3e6acada21d76c693c58da4de96f529008eb22b","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-07-06T11:20:46Z","title_canon_sha256":"f869329b9ce16d99b720941e3d6db4f0e5649098e7c8262c3aa1df124a0d9fab"},"schema_version":"1.0","source":{"id":"1407.1482","kind":"arxiv","version":8}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.1482","created_at":"2026-05-18T01:20:50Z"},{"alias_kind":"arxiv_version","alias_value":"1407.1482v8","created_at":"2026-05-18T01:20:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.1482","created_at":"2026-05-18T01:20:50Z"},{"alias_kind":"pith_short_12","alias_value":"7BICHOH2TNPR","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"7BICHOH2TNPRYDVQ","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"7BICHOH2","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:49aab337853608fcb3f32afc731086eabbdf1853c55f6e7ff7287972310a77e1","target":"graph","created_at":"2026-05-18T01:20:50Z","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":"For a positive integer $k$, a $k$-colouring of a graph $G=(V,E)$ is a mapping $c: V\\rightarrow\\{1,2,...,k\\}$ such that $c(u)\\neq c(v)$ whenever $uv\\in E$. The Colouring problem is to decide, for a given $G$ and $k$, whether a $k$-colouring of $G$ exists. If $k$ is fixed (that is, it is not part of the input), we have the decision problem $k$-Colouring instead. We survey known results on the computational complexity of Colouring and $k$-Colouring for graph classes that are characterized by one or two forbidden induced subgraphs. We also consider a number of variants: for example, where the prob","authors_text":"Dani\\\"el Paulusma, Jian Song, Matthew Johnson, Petr A. Golovach","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-07-06T11:20:46Z","title":"A Survey on the Computational Complexity of Colouring Graphs with Forbidden Subgraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.1482","kind":"arxiv","version":8},"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:5e3b0c02e91a3f9e498bad8907ac222389662f6ce41d1972cc965f566d47e1de","target":"record","created_at":"2026-05-18T01:20:50Z","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":"c78611a23aa525530ca04c92a3e6acada21d76c693c58da4de96f529008eb22b","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-07-06T11:20:46Z","title_canon_sha256":"f869329b9ce16d99b720941e3d6db4f0e5649098e7c8262c3aa1df124a0d9fab"},"schema_version":"1.0","source":{"id":"1407.1482","kind":"arxiv","version":8}},"canonical_sha256":"f85023b8fa9b5f1c0eb06b191c4e0de3aa0e874ee56b80a6c811a8929c0173e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f85023b8fa9b5f1c0eb06b191c4e0de3aa0e874ee56b80a6c811a8929c0173e2","first_computed_at":"2026-05-18T01:20:50.707816Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:50.707816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iacWWjaPFpjPEjyyU2RJ1CgU3RgrmWRhYGbnJ9OnTIyvA9mRiHt/TVweAqR4skF+yUS2hOGhgjEi1pY3X8KADw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:50.708211Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.1482","source_kind":"arxiv","source_version":8}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e3b0c02e91a3f9e498bad8907ac222389662f6ce41d1972cc965f566d47e1de","sha256:49aab337853608fcb3f32afc731086eabbdf1853c55f6e7ff7287972310a77e1"],"state_sha256":"0f4f640b758171e9c8c1123cbc0c4d1b462e46db31262426971ba0951f8c1ccb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tf2n7Xf8KNtOj7uml2iLBZVGjHPLJvXf+y6Enrk91jRnilCAa3INCNSTTXLSwWM6mbmTNrEgG9MSiCi/1/ReBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T08:01:54.021874Z","bundle_sha256":"bc41605fdb992569d2d296352f673458ca4a50fd8c142d390d327e1e3dbf8ba2"}}