{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:L7PMMQOZ6RAECAWQQOFKAJGTSQ","short_pith_number":"pith:L7PMMQOZ","schema_version":"1.0","canonical_sha256":"5fdec641d9f4404102d0838aa024d39431c48580fad297c140a8c12b69cb1bcc","source":{"kind":"arxiv","id":"1904.09470","version":1},"attestation_state":"computed","paper":{"title":"Cluster Deletion on Interval Graphs and Split Related Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Athanasios L. Konstantinidis, Charis Papadopoulos","submitted_at":"2019-04-20T17:24:41Z","abstract_excerpt":"In the {\\sc Cluster Deletion} problem the goal is to remove the minimum number of edges of a given graph, such that every connected component of the resulting graph constitutes a clique. It is known that the decision version of {\\sc Cluster Deletion} is NP-complete on ($P_5$-free) chordal graphs, whereas {\\sc Cluster Deletion} is solved in polynomial time on split graphs. However, the existence of a polynomial-time algorithm of {\\sc Cluster Deletion} on interval graphs, a proper subclass of chordal graphs, remained a well-known open problem. Our main contribution is that we settle this problem"},"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":"1904.09470","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-20T17:24:41Z","cross_cats_sorted":[],"title_canon_sha256":"c7a819c993c9050478801a4f908a2a523be3f0009c9bba1796b5254b70a0044e","abstract_canon_sha256":"413cf2eb27447f6eb2c321339d98d5a092abe7b123a49e6b6657d39169fb6857"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:04.114073Z","signature_b64":"jGHmAEXHl02e6rwXwH8ZgiJl5lJHJrj6+O7PPuHI7mFEWfilDEIempj3V/AX75ayhx4ke8QcmUKOIirLJFJ7Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5fdec641d9f4404102d0838aa024d39431c48580fad297c140a8c12b69cb1bcc","last_reissued_at":"2026-05-17T23:48:04.113556Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:04.113556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cluster Deletion on Interval Graphs and Split Related Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Athanasios L. Konstantinidis, Charis Papadopoulos","submitted_at":"2019-04-20T17:24:41Z","abstract_excerpt":"In the {\\sc Cluster Deletion} problem the goal is to remove the minimum number of edges of a given graph, such that every connected component of the resulting graph constitutes a clique. It is known that the decision version of {\\sc Cluster Deletion} is NP-complete on ($P_5$-free) chordal graphs, whereas {\\sc Cluster Deletion} is solved in polynomial time on split graphs. However, the existence of a polynomial-time algorithm of {\\sc Cluster Deletion} on interval graphs, a proper subclass of chordal graphs, remained a well-known open problem. Our main contribution is that we settle this problem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.09470","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":"1904.09470","created_at":"2026-05-17T23:48:04.113645+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.09470v1","created_at":"2026-05-17T23:48:04.113645+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.09470","created_at":"2026-05-17T23:48:04.113645+00:00"},{"alias_kind":"pith_short_12","alias_value":"L7PMMQOZ6RAE","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"L7PMMQOZ6RAECAWQ","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"L7PMMQOZ","created_at":"2026-05-18T12:33:21.387695+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/L7PMMQOZ6RAECAWQQOFKAJGTSQ","json":"https://pith.science/pith/L7PMMQOZ6RAECAWQQOFKAJGTSQ.json","graph_json":"https://pith.science/api/pith-number/L7PMMQOZ6RAECAWQQOFKAJGTSQ/graph.json","events_json":"https://pith.science/api/pith-number/L7PMMQOZ6RAECAWQQOFKAJGTSQ/events.json","paper":"https://pith.science/paper/L7PMMQOZ"},"agent_actions":{"view_html":"https://pith.science/pith/L7PMMQOZ6RAECAWQQOFKAJGTSQ","download_json":"https://pith.science/pith/L7PMMQOZ6RAECAWQQOFKAJGTSQ.json","view_paper":"https://pith.science/paper/L7PMMQOZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.09470&json=true","fetch_graph":"https://pith.science/api/pith-number/L7PMMQOZ6RAECAWQQOFKAJGTSQ/graph.json","fetch_events":"https://pith.science/api/pith-number/L7PMMQOZ6RAECAWQQOFKAJGTSQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L7PMMQOZ6RAECAWQQOFKAJGTSQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L7PMMQOZ6RAECAWQQOFKAJGTSQ/action/storage_attestation","attest_author":"https://pith.science/pith/L7PMMQOZ6RAECAWQQOFKAJGTSQ/action/author_attestation","sign_citation":"https://pith.science/pith/L7PMMQOZ6RAECAWQQOFKAJGTSQ/action/citation_signature","submit_replication":"https://pith.science/pith/L7PMMQOZ6RAECAWQQOFKAJGTSQ/action/replication_record"}},"created_at":"2026-05-17T23:48:04.113645+00:00","updated_at":"2026-05-17T23:48:04.113645+00:00"}