{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:4PNMRKLXVGXFGEXDHVEFCXIKGL","short_pith_number":"pith:4PNMRKLX","canonical_record":{"source":{"id":"1607.06757","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-22T17:32:39Z","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"title_canon_sha256":"dc2a6e1cfdd813b15079c18dec9fe137c20a6aa7da1424577b43ef4d631e8f91","abstract_canon_sha256":"aa275787fde1b02547104f4e5bc70156b1f1c44d004b1e11885933e3be40d62c"},"schema_version":"1.0"},"canonical_sha256":"e3dac8a977a9ae5312e33d48515d0a32fe5d5bb017b7d6b21b2072d6feda941a","source":{"kind":"arxiv","id":"1607.06757","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.06757","created_at":"2026-05-18T00:42:51Z"},{"alias_kind":"arxiv_version","alias_value":"1607.06757v3","created_at":"2026-05-18T00:42:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06757","created_at":"2026-05-18T00:42:51Z"},{"alias_kind":"pith_short_12","alias_value":"4PNMRKLXVGXF","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4PNMRKLXVGXFGEXD","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4PNMRKLX","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:4PNMRKLXVGXFGEXDHVEFCXIKGL","target":"record","payload":{"canonical_record":{"source":{"id":"1607.06757","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-22T17:32:39Z","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"title_canon_sha256":"dc2a6e1cfdd813b15079c18dec9fe137c20a6aa7da1424577b43ef4d631e8f91","abstract_canon_sha256":"aa275787fde1b02547104f4e5bc70156b1f1c44d004b1e11885933e3be40d62c"},"schema_version":"1.0"},"canonical_sha256":"e3dac8a977a9ae5312e33d48515d0a32fe5d5bb017b7d6b21b2072d6feda941a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:51.665146Z","signature_b64":"PW9fdRqe5ZXlckbXUmL2qtoJRLsSFv+KMoqo1aMiFsB4JwFwiydRikUhhxhBdu6VIDWYwc9Fkf33R+dc5jPmCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3dac8a977a9ae5312e33d48515d0a32fe5d5bb017b7d6b21b2072d6feda941a","last_reissued_at":"2026-05-18T00:42:51.664513Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:51.664513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.06757","source_version":3,"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:42:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gBUhzUHs5y6BpzjkGEy1oA2PQ27k4d00GsKvDh0ZVn54UGzxplZMIi6n+0zdSNiJzqR+iRdGVRVyqfHiNzCdBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:29:59.942494Z"},"content_sha256":"14529fcfe9cde07aa4209956003d47629dc3d99b60e011cefa2b038d7946a83c","schema_version":"1.0","event_id":"sha256:14529fcfe9cde07aa4209956003d47629dc3d99b60e011cefa2b038d7946a83c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:4PNMRKLXVGXFGEXDHVEFCXIKGL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hereditary Graph Classes: When the Complexities of Colouring and Clique Cover Coincide","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Alexandre Blanch\\'e, Dani\\\"el Paulusma, Konrad K. Dabrowski, Matthew Johnson","submitted_at":"2016-07-22T17:32:39Z","abstract_excerpt":"A graph is $(H_1,H_2)$-free for a pair of graphs $H_1,H_2$ if it contains no induced subgraph isomorphic to $H_1$ or $H_2$. In 2001, Kr\\'al', Kratochv\\'{\\i}l, Tuza, and Woeginger initiated a study into the complexity of Colouring for $(H_1,H_2)$-free graphs. Since then, others have tried to complete their study, but many cases remain open. We focus on those $(H_1,H_2)$-free graphs where $H_2$ is $\\overline{H_1}$, the complement of $H_1$. As these classes are closed under complementation, the computational complexities of Colouring and Clique Cover coincide. By combining new and known results, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.06757","kind":"arxiv","version":3},"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:42:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UCfxwX56UfEoRpimjz5D/E6tDlGz7MQ9h51blNL7aRQw/5oreu+Qe2czTIMtr2wdsyo94OZejvxnNZHByp5XDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:29:59.942848Z"},"content_sha256":"0c68b903bdda7a3b3b32901a2429632732e2419b4c6453f300cc11ec1e5b066d","schema_version":"1.0","event_id":"sha256:0c68b903bdda7a3b3b32901a2429632732e2419b4c6453f300cc11ec1e5b066d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4PNMRKLXVGXFGEXDHVEFCXIKGL/bundle.json","state_url":"https://pith.science/pith/4PNMRKLXVGXFGEXDHVEFCXIKGL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4PNMRKLXVGXFGEXDHVEFCXIKGL/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-03T06:29:59Z","links":{"resolver":"https://pith.science/pith/4PNMRKLXVGXFGEXDHVEFCXIKGL","bundle":"https://pith.science/pith/4PNMRKLXVGXFGEXDHVEFCXIKGL/bundle.json","state":"https://pith.science/pith/4PNMRKLXVGXFGEXDHVEFCXIKGL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4PNMRKLXVGXFGEXDHVEFCXIKGL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4PNMRKLXVGXFGEXDHVEFCXIKGL","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":"aa275787fde1b02547104f4e5bc70156b1f1c44d004b1e11885933e3be40d62c","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-22T17:32:39Z","title_canon_sha256":"dc2a6e1cfdd813b15079c18dec9fe137c20a6aa7da1424577b43ef4d631e8f91"},"schema_version":"1.0","source":{"id":"1607.06757","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.06757","created_at":"2026-05-18T00:42:51Z"},{"alias_kind":"arxiv_version","alias_value":"1607.06757v3","created_at":"2026-05-18T00:42:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06757","created_at":"2026-05-18T00:42:51Z"},{"alias_kind":"pith_short_12","alias_value":"4PNMRKLXVGXF","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4PNMRKLXVGXFGEXD","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4PNMRKLX","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:0c68b903bdda7a3b3b32901a2429632732e2419b4c6453f300cc11ec1e5b066d","target":"graph","created_at":"2026-05-18T00:42:51Z","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":"A graph is $(H_1,H_2)$-free for a pair of graphs $H_1,H_2$ if it contains no induced subgraph isomorphic to $H_1$ or $H_2$. In 2001, Kr\\'al', Kratochv\\'{\\i}l, Tuza, and Woeginger initiated a study into the complexity of Colouring for $(H_1,H_2)$-free graphs. Since then, others have tried to complete their study, but many cases remain open. We focus on those $(H_1,H_2)$-free graphs where $H_2$ is $\\overline{H_1}$, the complement of $H_1$. As these classes are closed under complementation, the computational complexities of Colouring and Clique Cover coincide. By combining new and known results, ","authors_text":"Alexandre Blanch\\'e, Dani\\\"el Paulusma, Konrad K. Dabrowski, Matthew Johnson","cross_cats":["cs.CC","cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-22T17:32:39Z","title":"Hereditary Graph Classes: When the Complexities of Colouring and Clique Cover Coincide"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.06757","kind":"arxiv","version":3},"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:14529fcfe9cde07aa4209956003d47629dc3d99b60e011cefa2b038d7946a83c","target":"record","created_at":"2026-05-18T00:42:51Z","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":"aa275787fde1b02547104f4e5bc70156b1f1c44d004b1e11885933e3be40d62c","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-22T17:32:39Z","title_canon_sha256":"dc2a6e1cfdd813b15079c18dec9fe137c20a6aa7da1424577b43ef4d631e8f91"},"schema_version":"1.0","source":{"id":"1607.06757","kind":"arxiv","version":3}},"canonical_sha256":"e3dac8a977a9ae5312e33d48515d0a32fe5d5bb017b7d6b21b2072d6feda941a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e3dac8a977a9ae5312e33d48515d0a32fe5d5bb017b7d6b21b2072d6feda941a","first_computed_at":"2026-05-18T00:42:51.664513Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:51.664513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PW9fdRqe5ZXlckbXUmL2qtoJRLsSFv+KMoqo1aMiFsB4JwFwiydRikUhhxhBdu6VIDWYwc9Fkf33R+dc5jPmCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:51.665146Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.06757","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:14529fcfe9cde07aa4209956003d47629dc3d99b60e011cefa2b038d7946a83c","sha256:0c68b903bdda7a3b3b32901a2429632732e2419b4c6453f300cc11ec1e5b066d"],"state_sha256":"8cc628ec2eade7138453d2e628610ed244361ace0c560c5b5ced289d676d6739"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JzBKiJ0msrbsWEMo9Ak/IxID840tlYPv2Re00w/c0uZVjERCOX/8d5Nk2yWpo00nNUnwKB8gqVNCO5rabbY5BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T06:29:59.944941Z","bundle_sha256":"25e346518aa1ffd8cebdaf6773d5c8444e81ae32c659f366249de50290c69c45"}}