{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:PUBERREDUO7FLVPQRDCRDP7XVM","short_pith_number":"pith:PUBERRED","schema_version":"1.0","canonical_sha256":"7d0248c483a3be55d5f088c511bff7ab0218fa7ac40769f97fbac73fcb99a17f","source":{"kind":"arxiv","id":"1504.05515","version":2},"attestation_state":"computed","paper":{"title":"Parameterized complexity dichotomy for $(r,\\ell)$-Vertex Deletion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Ignasi Sau, Julien Baste, Luerbio Faria, Sulamita Klein","submitted_at":"2015-04-21T17:23:06Z","abstract_excerpt":"For two integers $r, \\ell \\geq 0$, a graph $G = (V, E)$ is an $(r,\\ell)$-graph if $V$ can be partitioned into $r$ independent sets and $\\ell$ cliques. In the parameterized $(r,\\ell)$-Vertex Deletion problem, given a graph $G$ and an integer $k$, one has to decide whether at most $k$ vertices can be removed from $G$ to obtain an $(r,\\ell)$-graph. This problem is NP-hard if $r+\\ell \\geq 1$ and encompasses several relevant problems such as Vertex Cover and Odd Cycle Transversal. The parameterized complexity of $(r,\\ell)$-Vertex Deletion was known for all values of $(r,\\ell)$ except for $(2,1)$, $"},"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":"1504.05515","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-21T17:23:06Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"2b28894d33132883a041c4235b7cb5ac4b44ea4ec65014e7bdddfb1a9fcaded2","abstract_canon_sha256":"372a533134c9cf86fe5c5343ca6dfa88fcf7ee0d28cc482e0bd8806f45e0f2b1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:49.999561Z","signature_b64":"D36aEr8wG5NZ82ueRtAXPB2BLhQGWgeDXTiaVjS5u0fO538d5w1jZH6AnNEqwvNqe0ssk4QzPBTcbNmdlvkvCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d0248c483a3be55d5f088c511bff7ab0218fa7ac40769f97fbac73fcb99a17f","last_reissued_at":"2026-05-18T01:02:49.999045Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:49.999045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized complexity dichotomy for $(r,\\ell)$-Vertex Deletion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Ignasi Sau, Julien Baste, Luerbio Faria, Sulamita Klein","submitted_at":"2015-04-21T17:23:06Z","abstract_excerpt":"For two integers $r, \\ell \\geq 0$, a graph $G = (V, E)$ is an $(r,\\ell)$-graph if $V$ can be partitioned into $r$ independent sets and $\\ell$ cliques. In the parameterized $(r,\\ell)$-Vertex Deletion problem, given a graph $G$ and an integer $k$, one has to decide whether at most $k$ vertices can be removed from $G$ to obtain an $(r,\\ell)$-graph. This problem is NP-hard if $r+\\ell \\geq 1$ and encompasses several relevant problems such as Vertex Cover and Odd Cycle Transversal. The parameterized complexity of $(r,\\ell)$-Vertex Deletion was known for all values of $(r,\\ell)$ except for $(2,1)$, $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05515","kind":"arxiv","version":2},"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":"1504.05515","created_at":"2026-05-18T01:02:49.999135+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.05515v2","created_at":"2026-05-18T01:02:49.999135+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05515","created_at":"2026-05-18T01:02:49.999135+00:00"},{"alias_kind":"pith_short_12","alias_value":"PUBERREDUO7F","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"PUBERREDUO7FLVPQ","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"PUBERRED","created_at":"2026-05-18T12:29:37.295048+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/PUBERREDUO7FLVPQRDCRDP7XVM","json":"https://pith.science/pith/PUBERREDUO7FLVPQRDCRDP7XVM.json","graph_json":"https://pith.science/api/pith-number/PUBERREDUO7FLVPQRDCRDP7XVM/graph.json","events_json":"https://pith.science/api/pith-number/PUBERREDUO7FLVPQRDCRDP7XVM/events.json","paper":"https://pith.science/paper/PUBERRED"},"agent_actions":{"view_html":"https://pith.science/pith/PUBERREDUO7FLVPQRDCRDP7XVM","download_json":"https://pith.science/pith/PUBERREDUO7FLVPQRDCRDP7XVM.json","view_paper":"https://pith.science/paper/PUBERRED","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.05515&json=true","fetch_graph":"https://pith.science/api/pith-number/PUBERREDUO7FLVPQRDCRDP7XVM/graph.json","fetch_events":"https://pith.science/api/pith-number/PUBERREDUO7FLVPQRDCRDP7XVM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PUBERREDUO7FLVPQRDCRDP7XVM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PUBERREDUO7FLVPQRDCRDP7XVM/action/storage_attestation","attest_author":"https://pith.science/pith/PUBERREDUO7FLVPQRDCRDP7XVM/action/author_attestation","sign_citation":"https://pith.science/pith/PUBERREDUO7FLVPQRDCRDP7XVM/action/citation_signature","submit_replication":"https://pith.science/pith/PUBERREDUO7FLVPQRDCRDP7XVM/action/replication_record"}},"created_at":"2026-05-18T01:02:49.999135+00:00","updated_at":"2026-05-18T01:02:49.999135+00:00"}