{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:7IIKCHZFQW5PVC7HIWXU5K5D6Y","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":"cab92f0490a7c0e7c149de170a02eecabfee9e07cf842c3eece01ec7deb9aca8","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-03-24T14:14:35Z","title_canon_sha256":"21b5cddaeac3d58510effb0bc75847d0e8f9c2fd839f71d64ef4663078f26e38"},"schema_version":"1.0","source":{"id":"1403.5961","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.5961","created_at":"2026-05-18T02:30:08Z"},{"alias_kind":"arxiv_version","alias_value":"1403.5961v6","created_at":"2026-05-18T02:30:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.5961","created_at":"2026-05-18T02:30:08Z"},{"alias_kind":"pith_short_12","alias_value":"7IIKCHZFQW5P","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"7IIKCHZFQW5PVC7H","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"7IIKCHZF","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:6ba7a81ad8d861a72f53b852b24b1ec11983879fc626608e172755f8c1e74936","target":"graph","created_at":"2026-05-18T02:30:08Z","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":"A graph $G = (V, E)$ is \\emph{partitionable} if there exists a partition $\\{A, B\\}$ of $V$ such that $A$ induces a disjoint union of cliques and $B$ induces a triangle-free graph. In this paper we investigate the computational complexity of deciding whether a graph is partitionable. The problem is known to be $\\NP$-complete on arbitrary graphs. Here it is proved that if a graph $G$ is bull-free, planar, perfect, $K_4$-free or does not contain certain holes then deciding whether $G$ is partitionable is $\\NP$-complete. This answers an open question posed by Thomass{\\'e}, Trotignon and Vu\\v{s}kov","authors_text":"Carl Feghali, Faisal N. Abu-Khzam, Haiko M\\\"uller","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-03-24T14:14:35Z","title":"Partitioning a Graph into Disjoint Cliques and a Triangle-free Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.5961","kind":"arxiv","version":6},"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:e0f70453ad30112e2720d072549fe4a5738026d6f5707b77dfc0398c46de107b","target":"record","created_at":"2026-05-18T02:30:08Z","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":"cab92f0490a7c0e7c149de170a02eecabfee9e07cf842c3eece01ec7deb9aca8","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-03-24T14:14:35Z","title_canon_sha256":"21b5cddaeac3d58510effb0bc75847d0e8f9c2fd839f71d64ef4663078f26e38"},"schema_version":"1.0","source":{"id":"1403.5961","kind":"arxiv","version":6}},"canonical_sha256":"fa10a11f2585bafa8be745af4eaba3f6325b0f4ee0c36c06ce088ecdd0eb937c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fa10a11f2585bafa8be745af4eaba3f6325b0f4ee0c36c06ce088ecdd0eb937c","first_computed_at":"2026-05-18T02:30:08.374037Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:08.374037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2J1MIb0oxlG9TA1aQlU0gfa5NYT3RIb+H5ROFn/b1c4G4ncLOesutxuj8FNwM5W3L4mmmiQwiOoBYOn2QilFBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:08.374715Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.5961","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e0f70453ad30112e2720d072549fe4a5738026d6f5707b77dfc0398c46de107b","sha256:6ba7a81ad8d861a72f53b852b24b1ec11983879fc626608e172755f8c1e74936"],"state_sha256":"27a653b25502b6b9e7548e2d36df3c617f6a32ed06c72a943f1ad9e93f2b05fd"}