{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:24KVTR2K2JZRWDUKAMW5356YPD","short_pith_number":"pith:24KVTR2K","schema_version":"1.0","canonical_sha256":"d71559c74ad2731b0e8a032dddf7d878f59a0301018108419583f0ace823b2ea","source":{"kind":"arxiv","id":"1808.03561","version":1},"attestation_state":"computed","paper":{"title":"Finding a Small Number of Colourful Components","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Paulusma, Guillaume Fertin, Konrad K. Dabrowski, Laurent Bulteau, Matthew Johnson, Stephane Vialette","submitted_at":"2018-08-10T14:26:29Z","abstract_excerpt":"A partition $(V_1,\\ldots,V_k)$ of the vertex set of a graph $G$ with a (not necessarily proper) colouring $c$ is colourful if no two vertices in any $V_i$ have the same colour and every set $V_i$ induces a connected graph. The COLOURFUL PARTITION problem is to decide whether a coloured graph $(G,c)$ has a colourful partition of size at most $k$. This problem is closely related to the COLOURFUL COMPONENTS problem, which is to decide whether a graph can be modified into a graph whose connected components form a colourful partition by deleting at most $p$ edges. Nevertheless we show that COLOURFU"},"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":"1808.03561","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-10T14:26:29Z","cross_cats_sorted":[],"title_canon_sha256":"7c6fc599e00434fc54f3a075617ef6922137da8cd6bdb39a55dd83d802ab9266","abstract_canon_sha256":"51afdd02c0702339b78a7135b66e75b4ac615e58d946ef9a1c79415432412bfa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:24.671192Z","signature_b64":"6Yp+9QrkmVyqAy0kan4EpxR52BkU48+euTAHNSmtMkWRA+2AfxqzAm4bwWlYm5zGTscib2oBYEUdtKKjXmtwAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d71559c74ad2731b0e8a032dddf7d878f59a0301018108419583f0ace823b2ea","last_reissued_at":"2026-05-18T00:08:24.670779Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:24.670779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding a Small Number of Colourful Components","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Paulusma, Guillaume Fertin, Konrad K. Dabrowski, Laurent Bulteau, Matthew Johnson, Stephane Vialette","submitted_at":"2018-08-10T14:26:29Z","abstract_excerpt":"A partition $(V_1,\\ldots,V_k)$ of the vertex set of a graph $G$ with a (not necessarily proper) colouring $c$ is colourful if no two vertices in any $V_i$ have the same colour and every set $V_i$ induces a connected graph. The COLOURFUL PARTITION problem is to decide whether a coloured graph $(G,c)$ has a colourful partition of size at most $k$. This problem is closely related to the COLOURFUL COMPONENTS problem, which is to decide whether a graph can be modified into a graph whose connected components form a colourful partition by deleting at most $p$ edges. Nevertheless we show that COLOURFU"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.03561","kind":"arxiv","version":1},"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":"1808.03561","created_at":"2026-05-18T00:08:24.670840+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.03561v1","created_at":"2026-05-18T00:08:24.670840+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03561","created_at":"2026-05-18T00:08:24.670840+00:00"},{"alias_kind":"pith_short_12","alias_value":"24KVTR2K2JZR","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"24KVTR2K2JZRWDUK","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"24KVTR2K","created_at":"2026-05-18T12:31:59.375834+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/24KVTR2K2JZRWDUKAMW5356YPD","json":"https://pith.science/pith/24KVTR2K2JZRWDUKAMW5356YPD.json","graph_json":"https://pith.science/api/pith-number/24KVTR2K2JZRWDUKAMW5356YPD/graph.json","events_json":"https://pith.science/api/pith-number/24KVTR2K2JZRWDUKAMW5356YPD/events.json","paper":"https://pith.science/paper/24KVTR2K"},"agent_actions":{"view_html":"https://pith.science/pith/24KVTR2K2JZRWDUKAMW5356YPD","download_json":"https://pith.science/pith/24KVTR2K2JZRWDUKAMW5356YPD.json","view_paper":"https://pith.science/paper/24KVTR2K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.03561&json=true","fetch_graph":"https://pith.science/api/pith-number/24KVTR2K2JZRWDUKAMW5356YPD/graph.json","fetch_events":"https://pith.science/api/pith-number/24KVTR2K2JZRWDUKAMW5356YPD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/24KVTR2K2JZRWDUKAMW5356YPD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/24KVTR2K2JZRWDUKAMW5356YPD/action/storage_attestation","attest_author":"https://pith.science/pith/24KVTR2K2JZRWDUKAMW5356YPD/action/author_attestation","sign_citation":"https://pith.science/pith/24KVTR2K2JZRWDUKAMW5356YPD/action/citation_signature","submit_replication":"https://pith.science/pith/24KVTR2K2JZRWDUKAMW5356YPD/action/replication_record"}},"created_at":"2026-05-18T00:08:24.670840+00:00","updated_at":"2026-05-18T00:08:24.670840+00:00"}