{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:7JYDGHTJZ4ZEFVGKA7G362YQ6U","short_pith_number":"pith:7JYDGHTJ","schema_version":"1.0","canonical_sha256":"fa70331e69cf3242d4ca07cdbf6b10f506025b1fbef8d60a1aecd74451087dbb","source":{"kind":"arxiv","id":"1512.07849","version":2},"attestation_state":"computed","paper":{"title":"Colouring Diamond-free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Dani\\\"el Paulusma, Fran\\c{c}ois Dross, Konrad K. Dabrowski","submitted_at":"2015-12-24T16:23:35Z","abstract_excerpt":"The Colouring problem is that of deciding, given a graph $G$ and an integer $k$, whether $G$ admits a (proper) $k$-colouring. For all graphs $H$ up to five vertices, we classify the computational complexity of Colouring for $(\\mbox{diamond},H)$-free graphs. Our proof is based on combining known results together with proving that the clique-width is bounded for $(\\mbox{diamond}, P_1+2P_2)$-free graphs. Our technique for handling this case is to reduce the graph under consideration to a $k$-partite graph that has a very specific decomposition. As a by-product of this general technique we are als"},"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":"1512.07849","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-12-24T16:23:35Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"064682d86c7f88b0d9bf79728b389fc3f6106b2ff0c6a391fe9a23be9e43c532","abstract_canon_sha256":"024f166216a9f1605cee2ec8892a08a3ab6d7dfd3faa378fd6beec2b5ad2e7d4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:21.030415Z","signature_b64":"xNQwijeSgtTQyL4cohchviUylP1jkbdyVnfjDnrMrG+xT8+n9u2/lm+voIIrsi/KFuNqgNxi3+JGQuza1ADoBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa70331e69cf3242d4ca07cdbf6b10f506025b1fbef8d60a1aecd74451087dbb","last_reissued_at":"2026-05-18T01:06:21.029749Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:21.029749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Colouring Diamond-free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Dani\\\"el Paulusma, Fran\\c{c}ois Dross, Konrad K. Dabrowski","submitted_at":"2015-12-24T16:23:35Z","abstract_excerpt":"The Colouring problem is that of deciding, given a graph $G$ and an integer $k$, whether $G$ admits a (proper) $k$-colouring. For all graphs $H$ up to five vertices, we classify the computational complexity of Colouring for $(\\mbox{diamond},H)$-free graphs. Our proof is based on combining known results together with proving that the clique-width is bounded for $(\\mbox{diamond}, P_1+2P_2)$-free graphs. Our technique for handling this case is to reduce the graph under consideration to a $k$-partite graph that has a very specific decomposition. As a by-product of this general technique we are als"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.07849","kind":"arxiv","version":2},"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":"1512.07849","created_at":"2026-05-18T01:06:21.029846+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.07849v2","created_at":"2026-05-18T01:06:21.029846+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.07849","created_at":"2026-05-18T01:06:21.029846+00:00"},{"alias_kind":"pith_short_12","alias_value":"7JYDGHTJZ4ZE","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"7JYDGHTJZ4ZEFVGK","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"7JYDGHTJ","created_at":"2026-05-18T12:29:10.953037+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/7JYDGHTJZ4ZEFVGKA7G362YQ6U","json":"https://pith.science/pith/7JYDGHTJZ4ZEFVGKA7G362YQ6U.json","graph_json":"https://pith.science/api/pith-number/7JYDGHTJZ4ZEFVGKA7G362YQ6U/graph.json","events_json":"https://pith.science/api/pith-number/7JYDGHTJZ4ZEFVGKA7G362YQ6U/events.json","paper":"https://pith.science/paper/7JYDGHTJ"},"agent_actions":{"view_html":"https://pith.science/pith/7JYDGHTJZ4ZEFVGKA7G362YQ6U","download_json":"https://pith.science/pith/7JYDGHTJZ4ZEFVGKA7G362YQ6U.json","view_paper":"https://pith.science/paper/7JYDGHTJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.07849&json=true","fetch_graph":"https://pith.science/api/pith-number/7JYDGHTJZ4ZEFVGKA7G362YQ6U/graph.json","fetch_events":"https://pith.science/api/pith-number/7JYDGHTJZ4ZEFVGKA7G362YQ6U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7JYDGHTJZ4ZEFVGKA7G362YQ6U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7JYDGHTJZ4ZEFVGKA7G362YQ6U/action/storage_attestation","attest_author":"https://pith.science/pith/7JYDGHTJZ4ZEFVGKA7G362YQ6U/action/author_attestation","sign_citation":"https://pith.science/pith/7JYDGHTJZ4ZEFVGKA7G362YQ6U/action/citation_signature","submit_replication":"https://pith.science/pith/7JYDGHTJZ4ZEFVGKA7G362YQ6U/action/replication_record"}},"created_at":"2026-05-18T01:06:21.029846+00:00","updated_at":"2026-05-18T01:06:21.029846+00:00"}