{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4PNMRKLXVGXFGEXDHVEFCXIKGL","short_pith_number":"pith:4PNMRKLX","schema_version":"1.0","canonical_sha256":"e3dac8a977a9ae5312e33d48515d0a32fe5d5bb017b7d6b21b2072d6feda941a","source":{"kind":"arxiv","id":"1607.06757","version":3},"attestation_state":"computed","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, "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1607.06757","created_at":"2026-05-18T00:42:51.664629+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.06757v3","created_at":"2026-05-18T00:42:51.664629+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06757","created_at":"2026-05-18T00:42:51.664629+00:00"},{"alias_kind":"pith_short_12","alias_value":"4PNMRKLXVGXF","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4PNMRKLXVGXFGEXD","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4PNMRKLX","created_at":"2026-05-18T12:29:58.707656+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/4PNMRKLXVGXFGEXDHVEFCXIKGL","json":"https://pith.science/pith/4PNMRKLXVGXFGEXDHVEFCXIKGL.json","graph_json":"https://pith.science/api/pith-number/4PNMRKLXVGXFGEXDHVEFCXIKGL/graph.json","events_json":"https://pith.science/api/pith-number/4PNMRKLXVGXFGEXDHVEFCXIKGL/events.json","paper":"https://pith.science/paper/4PNMRKLX"},"agent_actions":{"view_html":"https://pith.science/pith/4PNMRKLXVGXFGEXDHVEFCXIKGL","download_json":"https://pith.science/pith/4PNMRKLXVGXFGEXDHVEFCXIKGL.json","view_paper":"https://pith.science/paper/4PNMRKLX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.06757&json=true","fetch_graph":"https://pith.science/api/pith-number/4PNMRKLXVGXFGEXDHVEFCXIKGL/graph.json","fetch_events":"https://pith.science/api/pith-number/4PNMRKLXVGXFGEXDHVEFCXIKGL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4PNMRKLXVGXFGEXDHVEFCXIKGL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4PNMRKLXVGXFGEXDHVEFCXIKGL/action/storage_attestation","attest_author":"https://pith.science/pith/4PNMRKLXVGXFGEXDHVEFCXIKGL/action/author_attestation","sign_citation":"https://pith.science/pith/4PNMRKLXVGXFGEXDHVEFCXIKGL/action/citation_signature","submit_replication":"https://pith.science/pith/4PNMRKLXVGXFGEXDHVEFCXIKGL/action/replication_record"}},"created_at":"2026-05-18T00:42:51.664629+00:00","updated_at":"2026-05-18T00:42:51.664629+00:00"}