{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:TVMIUG5DBVDLLC45NVQX2FRZMQ","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":"c518c4a3367d8fe8009a8c277de047a57557431109fd435ac95cebb78d9f349b","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-04-10T13:12:32Z","title_canon_sha256":"2c7e36ffb0aad4514efdb9ea57f4de96d1c49f870e9c819536c57fb0f2fce58c"},"schema_version":"1.0","source":{"id":"2004.05022","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.05022","created_at":"2026-07-05T00:57:53Z"},{"alias_kind":"arxiv_version","alias_value":"2004.05022v2","created_at":"2026-07-05T00:57:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.05022","created_at":"2026-07-05T00:57:53Z"},{"alias_kind":"pith_short_12","alias_value":"TVMIUG5DBVDL","created_at":"2026-07-05T00:57:53Z"},{"alias_kind":"pith_short_16","alias_value":"TVMIUG5DBVDLLC45","created_at":"2026-07-05T00:57:53Z"},{"alias_kind":"pith_short_8","alias_value":"TVMIUG5D","created_at":"2026-07-05T00:57:53Z"}],"graph_snapshots":[{"event_id":"sha256:4dc3cc5dcd4314c1f56c9b1d1bd30ed3bdd25318aaca9f8f65b4294e8bdef973","target":"graph","created_at":"2026-07-05T00:57:53Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2004.05022/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove that the class of $(K_t,sP_1+P_5)$-free graphs has bounded mim-width for every $s\\geq 0$ and $t\\geq 1$, and that there is a polynomial-time algorithm that, given a graph in the class, computes a branch decomposition of constant mim-width. A large number of \\NP-complete graph problems become polynomial-time solvable on graph classes with bounded mim-width and for which a branch decomposition is quickly computable. The $k$-Colouring problem is an example of such a problem. For this problem, we may assume that the input graph is $K_{k+1}$-free. Then, as a consequence of our result, we ob","authors_text":"Daniel Paulusma, Jake Horsfield, Nick Brettell","cross_cats":["cs.CC","cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-04-10T13:12:32Z","title":"Colouring $(sP_1+P_5)$-Free Graphs: a Mim-Width Perspective"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.05022","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:991b4ed3e7e724e88ec9212f0e64e5542862b44d91aa321342da800a3fe5b023","target":"record","created_at":"2026-07-05T00:57:53Z","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":"c518c4a3367d8fe8009a8c277de047a57557431109fd435ac95cebb78d9f349b","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-04-10T13:12:32Z","title_canon_sha256":"2c7e36ffb0aad4514efdb9ea57f4de96d1c49f870e9c819536c57fb0f2fce58c"},"schema_version":"1.0","source":{"id":"2004.05022","kind":"arxiv","version":2}},"canonical_sha256":"9d588a1ba30d46b58b9d6d617d163964122fa266a1e331f92839192faa8df577","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9d588a1ba30d46b58b9d6d617d163964122fa266a1e331f92839192faa8df577","first_computed_at":"2026-07-05T00:57:53.204711Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:57:53.204711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/t07GUI1MIDnYQuuKiVyWkG+1WX47Iz7Frm5EIlfSG9Qjju1TfeOcSLtAXLpMh40gEivkZDAemjI3ZI9PFFaDw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:57:53.205169Z","signed_message":"canonical_sha256_bytes"},"source_id":"2004.05022","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:991b4ed3e7e724e88ec9212f0e64e5542862b44d91aa321342da800a3fe5b023","sha256:4dc3cc5dcd4314c1f56c9b1d1bd30ed3bdd25318aaca9f8f65b4294e8bdef973"],"state_sha256":"d7852622e79bff2e073273bbb382517490ed63bbc67e5d3b9b01b428621eccb9"}