{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:7JYDGHTJZ4ZEFVGKA7G362YQ6U","short_pith_number":"pith:7JYDGHTJ","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"},"canonical_sha256":"fa70331e69cf3242d4ca07cdbf6b10f506025b1fbef8d60a1aecd74451087dbb","source":{"kind":"arxiv","id":"1512.07849","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.07849","created_at":"2026-05-18T01:06:21Z"},{"alias_kind":"arxiv_version","alias_value":"1512.07849v2","created_at":"2026-05-18T01:06:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.07849","created_at":"2026-05-18T01:06:21Z"},{"alias_kind":"pith_short_12","alias_value":"7JYDGHTJZ4ZE","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7JYDGHTJZ4ZEFVGK","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7JYDGHTJ","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:7JYDGHTJZ4ZEFVGKA7G362YQ6U","target":"record","payload":{"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"},"canonical_sha256":"fa70331e69cf3242d4ca07cdbf6b10f506025b1fbef8d60a1aecd74451087dbb","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"},"source_kind":"arxiv","source_id":"1512.07849","source_version":2,"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:06:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AfPzBrtjgvLeS4lPcf6wttxfGXqU6NQpA+8l3ljwLwzY7jugivUKDFp6bv/hyeLfPbhgYX2DrPEJAQlWA9ogDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T08:42:57.053040Z"},"content_sha256":"5bdb35b5b7124fca95b61c6e4b2202b006b38f7c5f56cbf8575fa6d17e928fa4","schema_version":"1.0","event_id":"sha256:5bdb35b5b7124fca95b61c6e4b2202b006b38f7c5f56cbf8575fa6d17e928fa4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:7JYDGHTJZ4ZEFVGKA7G362YQ6U","target":"graph","payload":{"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"},"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:06:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rx8heDWHm88OYODsi0uIcPFYVDV2QduKZMElnKET/S9PiRAZDXdl0d7a68JYgEPw1BDf4+eKRjeicQOAJnRtBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T08:42:57.053401Z"},"content_sha256":"7758a9a666fa4257f5ad41a65dd339f20f2c9400361779eac2a1febc79a50103","schema_version":"1.0","event_id":"sha256:7758a9a666fa4257f5ad41a65dd339f20f2c9400361779eac2a1febc79a50103"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7JYDGHTJZ4ZEFVGKA7G362YQ6U/bundle.json","state_url":"https://pith.science/pith/7JYDGHTJZ4ZEFVGKA7G362YQ6U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7JYDGHTJZ4ZEFVGKA7G362YQ6U/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-20T08:42:57Z","links":{"resolver":"https://pith.science/pith/7JYDGHTJZ4ZEFVGKA7G362YQ6U","bundle":"https://pith.science/pith/7JYDGHTJZ4ZEFVGKA7G362YQ6U/bundle.json","state":"https://pith.science/pith/7JYDGHTJZ4ZEFVGKA7G362YQ6U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7JYDGHTJZ4ZEFVGKA7G362YQ6U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7JYDGHTJZ4ZEFVGKA7G362YQ6U","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":"024f166216a9f1605cee2ec8892a08a3ab6d7dfd3faa378fd6beec2b5ad2e7d4","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-12-24T16:23:35Z","title_canon_sha256":"064682d86c7f88b0d9bf79728b389fc3f6106b2ff0c6a391fe9a23be9e43c532"},"schema_version":"1.0","source":{"id":"1512.07849","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.07849","created_at":"2026-05-18T01:06:21Z"},{"alias_kind":"arxiv_version","alias_value":"1512.07849v2","created_at":"2026-05-18T01:06:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.07849","created_at":"2026-05-18T01:06:21Z"},{"alias_kind":"pith_short_12","alias_value":"7JYDGHTJZ4ZE","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7JYDGHTJZ4ZEFVGK","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7JYDGHTJ","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:7758a9a666fa4257f5ad41a65dd339f20f2c9400361779eac2a1febc79a50103","target":"graph","created_at":"2026-05-18T01:06:21Z","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":"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","authors_text":"Dani\\\"el Paulusma, Fran\\c{c}ois Dross, Konrad K. Dabrowski","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-12-24T16:23:35Z","title":"Colouring Diamond-free Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.07849","kind":"arxiv","version":2},"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:5bdb35b5b7124fca95b61c6e4b2202b006b38f7c5f56cbf8575fa6d17e928fa4","target":"record","created_at":"2026-05-18T01:06:21Z","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":"024f166216a9f1605cee2ec8892a08a3ab6d7dfd3faa378fd6beec2b5ad2e7d4","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-12-24T16:23:35Z","title_canon_sha256":"064682d86c7f88b0d9bf79728b389fc3f6106b2ff0c6a391fe9a23be9e43c532"},"schema_version":"1.0","source":{"id":"1512.07849","kind":"arxiv","version":2}},"canonical_sha256":"fa70331e69cf3242d4ca07cdbf6b10f506025b1fbef8d60a1aecd74451087dbb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fa70331e69cf3242d4ca07cdbf6b10f506025b1fbef8d60a1aecd74451087dbb","first_computed_at":"2026-05-18T01:06:21.029749Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:06:21.029749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xNQwijeSgtTQyL4cohchviUylP1jkbdyVnfjDnrMrG+xT8+n9u2/lm+voIIrsi/KFuNqgNxi3+JGQuza1ADoBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:06:21.030415Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.07849","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5bdb35b5b7124fca95b61c6e4b2202b006b38f7c5f56cbf8575fa6d17e928fa4","sha256:7758a9a666fa4257f5ad41a65dd339f20f2c9400361779eac2a1febc79a50103"],"state_sha256":"5f963d94386fb485fc90b53502d8a4e1e53166bd848cb7fdf509c77585846276"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xEyyis9feMI3L1djcSTQ9PqhFEk323FbuMe63X7LkZNbU+4+QyJYFuZrdOG4NhVmWuaXXD+rbq/HtZFuzK6HDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T08:42:57.055922Z","bundle_sha256":"8e0c576c82052c06f7ab291de1e151fadf703f23bee6b107c3220a91bb864ae9"}}