{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:KYLJNUCDAR5AO7I5PK5KK24FXJ","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":"c798448f79fec5953e93a5e1bb9bbac805d7e832f45c64f3aa5080c1bc2a8a87","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-03-20T19:47:15Z","title_canon_sha256":"1f8c67ac35419ffc88a347f1037cf36fd0e8fd7ff2df3d0a475706ce5d514f52"},"schema_version":"1.0","source":{"id":"1403.5248","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.5248","created_at":"2026-05-18T02:54:32Z"},{"alias_kind":"arxiv_version","alias_value":"1403.5248v3","created_at":"2026-05-18T02:54:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.5248","created_at":"2026-05-18T02:54:32Z"},{"alias_kind":"pith_short_12","alias_value":"KYLJNUCDAR5A","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KYLJNUCDAR5AO7I5","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KYLJNUCD","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:aa17205a5b6f61d242116e0874500adf68b254687b08ca0b5db299bbaf8c6bbd","target":"graph","created_at":"2026-05-18T02:54:32Z","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":"This paper investigates the computational complexity of deciding whether the vertices of a graph can be partitioned into a disjoint union of cliques and a triangle-free subgraph. This problem is known to be $\\NP$-complete on arbitrary graphs. We show that this problem remains $\\NP$-complete even when restricted to planar graphs and perfect graphs.","authors_text":"Carl Feghali, Faisal N. Abu-Khzam, Haiko M\\\"uller","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-03-20T19:47:15Z","title":"NP-hardness results for partitioning graphs into disjoint cliques and a triangle-free subgraph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.5248","kind":"arxiv","version":3},"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:e3a9199ea5bcb2ae500be367d52e743df8ed0a116f5db7cfa7e137d5d82d06d5","target":"record","created_at":"2026-05-18T02:54:32Z","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":"c798448f79fec5953e93a5e1bb9bbac805d7e832f45c64f3aa5080c1bc2a8a87","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-03-20T19:47:15Z","title_canon_sha256":"1f8c67ac35419ffc88a347f1037cf36fd0e8fd7ff2df3d0a475706ce5d514f52"},"schema_version":"1.0","source":{"id":"1403.5248","kind":"arxiv","version":3}},"canonical_sha256":"561696d043047a077d1d7abaa56b85ba4aa59c7a5bf4f7a11121c501edddc98d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"561696d043047a077d1d7abaa56b85ba4aa59c7a5bf4f7a11121c501edddc98d","first_computed_at":"2026-05-18T02:54:32.023059Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:32.023059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"em2afA+LbelEy52UikahBBuD3I2FRht0xrgBUV5XenQIY9YbWijTuHMmIqYI4RPJl99z3JqhKtdthNrJWoeMBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:32.023542Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.5248","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e3a9199ea5bcb2ae500be367d52e743df8ed0a116f5db7cfa7e137d5d82d06d5","sha256:aa17205a5b6f61d242116e0874500adf68b254687b08ca0b5db299bbaf8c6bbd"],"state_sha256":"182b0959f3112238959910770d79ccc0564fda21d5bbc5454ca0ee27d9a750b7"}