{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:6C7ZHFTPO2TPDSSOEDOEUCJJEA","short_pith_number":"pith:6C7ZHFTP","schema_version":"1.0","canonical_sha256":"f0bf93966f76a6f1ca4e20dc4a0929201672dbc62727e48ffa55d03f90dc333a","source":{"kind":"arxiv","id":"1512.04200","version":1},"attestation_state":"computed","paper":{"title":"Parameterized Algorithms on Perfect Graphs for deletion to $(r,\\ell)$-graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fahad Panolan, Saket Saurabh, Sudeshna Kolay, Venkatesh Raman","submitted_at":"2015-12-14T07:05:04Z","abstract_excerpt":"For fixed integers $r,\\ell \\geq 0$, a graph $G$ is called an {\\em $(r,\\ell)$-graph} if the vertex set $V(G)$ can be partitioned into $r$ independent sets and $\\ell$ cliques. The class of $(r, \\ell)$ graphs generalizes $r$-colourable graphs (when $\\ell =0)$ and hence not surprisingly, determining whether a given graph is an $(r, \\ell)$-graph is \\NP-hard even when $r \\geq 3$ or $\\ell \\geq 3$ in general graphs.\n  When $r$ and $\\ell$ are part of the input, then the recognition problem is NP-hard even if the input graph is a perfect graph (where the {\\sc Chromatic Number} problem is solvable in pol"},"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":"1512.04200","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-14T07:05:04Z","cross_cats_sorted":[],"title_canon_sha256":"b49942cfb8ae8ed2e760153e154ceb70b26f052c8855798f4f06ccbf4bf16e40","abstract_canon_sha256":"8020649e286a3caa0d49bc202d9290f63d53b73342ba88cd399d2478eaf3252c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:22.862653Z","signature_b64":"pmay8hn4nt6aXINhtWhLgL6BHLQ2ODOvDbGqXKNpYDxY8gItV6yhVFb3+dBXXuyMCq4LjRk1F+qsfcHx0NiQBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0bf93966f76a6f1ca4e20dc4a0929201672dbc62727e48ffa55d03f90dc333a","last_reissued_at":"2026-05-18T01:24:22.862051Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:22.862051Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized Algorithms on Perfect Graphs for deletion to $(r,\\ell)$-graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fahad Panolan, Saket Saurabh, Sudeshna Kolay, Venkatesh Raman","submitted_at":"2015-12-14T07:05:04Z","abstract_excerpt":"For fixed integers $r,\\ell \\geq 0$, a graph $G$ is called an {\\em $(r,\\ell)$-graph} if the vertex set $V(G)$ can be partitioned into $r$ independent sets and $\\ell$ cliques. The class of $(r, \\ell)$ graphs generalizes $r$-colourable graphs (when $\\ell =0)$ and hence not surprisingly, determining whether a given graph is an $(r, \\ell)$-graph is \\NP-hard even when $r \\geq 3$ or $\\ell \\geq 3$ in general graphs.\n  When $r$ and $\\ell$ are part of the input, then the recognition problem is NP-hard even if the input graph is a perfect graph (where the {\\sc Chromatic Number} problem is solvable in pol"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.04200","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":"1512.04200","created_at":"2026-05-18T01:24:22.862154+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.04200v1","created_at":"2026-05-18T01:24:22.862154+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.04200","created_at":"2026-05-18T01:24:22.862154+00:00"},{"alias_kind":"pith_short_12","alias_value":"6C7ZHFTPO2TP","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"6C7ZHFTPO2TPDSSO","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"6C7ZHFTP","created_at":"2026-05-18T12:29:07.941421+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/6C7ZHFTPO2TPDSSOEDOEUCJJEA","json":"https://pith.science/pith/6C7ZHFTPO2TPDSSOEDOEUCJJEA.json","graph_json":"https://pith.science/api/pith-number/6C7ZHFTPO2TPDSSOEDOEUCJJEA/graph.json","events_json":"https://pith.science/api/pith-number/6C7ZHFTPO2TPDSSOEDOEUCJJEA/events.json","paper":"https://pith.science/paper/6C7ZHFTP"},"agent_actions":{"view_html":"https://pith.science/pith/6C7ZHFTPO2TPDSSOEDOEUCJJEA","download_json":"https://pith.science/pith/6C7ZHFTPO2TPDSSOEDOEUCJJEA.json","view_paper":"https://pith.science/paper/6C7ZHFTP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.04200&json=true","fetch_graph":"https://pith.science/api/pith-number/6C7ZHFTPO2TPDSSOEDOEUCJJEA/graph.json","fetch_events":"https://pith.science/api/pith-number/6C7ZHFTPO2TPDSSOEDOEUCJJEA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6C7ZHFTPO2TPDSSOEDOEUCJJEA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6C7ZHFTPO2TPDSSOEDOEUCJJEA/action/storage_attestation","attest_author":"https://pith.science/pith/6C7ZHFTPO2TPDSSOEDOEUCJJEA/action/author_attestation","sign_citation":"https://pith.science/pith/6C7ZHFTPO2TPDSSOEDOEUCJJEA/action/citation_signature","submit_replication":"https://pith.science/pith/6C7ZHFTPO2TPDSSOEDOEUCJJEA/action/replication_record"}},"created_at":"2026-05-18T01:24:22.862154+00:00","updated_at":"2026-05-18T01:24:22.862154+00:00"}