{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:L7PMMQOZ6RAECAWQQOFKAJGTSQ","short_pith_number":"pith:L7PMMQOZ","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"},"canonical_sha256":"5fdec641d9f4404102d0838aa024d39431c48580fad297c140a8c12b69cb1bcc","source":{"kind":"arxiv","id":"1904.09470","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.09470","created_at":"2026-05-17T23:48:04Z"},{"alias_kind":"arxiv_version","alias_value":"1904.09470v1","created_at":"2026-05-17T23:48:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.09470","created_at":"2026-05-17T23:48:04Z"},{"alias_kind":"pith_short_12","alias_value":"L7PMMQOZ6RAE","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"L7PMMQOZ6RAECAWQ","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"L7PMMQOZ","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:L7PMMQOZ6RAECAWQQOFKAJGTSQ","target":"record","payload":{"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"},"canonical_sha256":"5fdec641d9f4404102d0838aa024d39431c48580fad297c140a8c12b69cb1bcc","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"},"source_kind":"arxiv","source_id":"1904.09470","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:48:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s7BE6L5mTtjB8vLAoeJWTl86JfNlz3UJebw1zPAK7LvPpTRbg3UwL351NH4SgpwBw0og040UVVsqrzwHE5EQDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:23:05.240724Z"},"content_sha256":"c4a1ad97846dd560b0f54feb0511119fbb056eb43e8bb01a03654b23ebe5dccb","schema_version":"1.0","event_id":"sha256:c4a1ad97846dd560b0f54feb0511119fbb056eb43e8bb01a03654b23ebe5dccb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:L7PMMQOZ6RAECAWQQOFKAJGTSQ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:48:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f7sSXFV71gtlFgfLFnTY8HtyrsXXrjr2MDWPqnUpLlAxpKakwsDNeF8A56op0cys3kj/80+7khI7TAqnlLQoCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:23:05.241381Z"},"content_sha256":"63cfab9c475b184cd503195b034c197b1b86c6439ea0923730f264b6789a40ed","schema_version":"1.0","event_id":"sha256:63cfab9c475b184cd503195b034c197b1b86c6439ea0923730f264b6789a40ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L7PMMQOZ6RAECAWQQOFKAJGTSQ/bundle.json","state_url":"https://pith.science/pith/L7PMMQOZ6RAECAWQQOFKAJGTSQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L7PMMQOZ6RAECAWQQOFKAJGTSQ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T20:23:05Z","links":{"resolver":"https://pith.science/pith/L7PMMQOZ6RAECAWQQOFKAJGTSQ","bundle":"https://pith.science/pith/L7PMMQOZ6RAECAWQQOFKAJGTSQ/bundle.json","state":"https://pith.science/pith/L7PMMQOZ6RAECAWQQOFKAJGTSQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L7PMMQOZ6RAECAWQQOFKAJGTSQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:L7PMMQOZ6RAECAWQQOFKAJGTSQ","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":"413cf2eb27447f6eb2c321339d98d5a092abe7b123a49e6b6657d39169fb6857","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-20T17:24:41Z","title_canon_sha256":"c7a819c993c9050478801a4f908a2a523be3f0009c9bba1796b5254b70a0044e"},"schema_version":"1.0","source":{"id":"1904.09470","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.09470","created_at":"2026-05-17T23:48:04Z"},{"alias_kind":"arxiv_version","alias_value":"1904.09470v1","created_at":"2026-05-17T23:48:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.09470","created_at":"2026-05-17T23:48:04Z"},{"alias_kind":"pith_short_12","alias_value":"L7PMMQOZ6RAE","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"L7PMMQOZ6RAECAWQ","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"L7PMMQOZ","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:63cfab9c475b184cd503195b034c197b1b86c6439ea0923730f264b6789a40ed","target":"graph","created_at":"2026-05-17T23:48:04Z","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":"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","authors_text":"Athanasios L. Konstantinidis, Charis Papadopoulos","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-20T17:24:41Z","title":"Cluster Deletion on Interval Graphs and Split Related Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.09470","kind":"arxiv","version":1},"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:c4a1ad97846dd560b0f54feb0511119fbb056eb43e8bb01a03654b23ebe5dccb","target":"record","created_at":"2026-05-17T23:48:04Z","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":"413cf2eb27447f6eb2c321339d98d5a092abe7b123a49e6b6657d39169fb6857","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-20T17:24:41Z","title_canon_sha256":"c7a819c993c9050478801a4f908a2a523be3f0009c9bba1796b5254b70a0044e"},"schema_version":"1.0","source":{"id":"1904.09470","kind":"arxiv","version":1}},"canonical_sha256":"5fdec641d9f4404102d0838aa024d39431c48580fad297c140a8c12b69cb1bcc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5fdec641d9f4404102d0838aa024d39431c48580fad297c140a8c12b69cb1bcc","first_computed_at":"2026-05-17T23:48:04.113556Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:04.113556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jGHmAEXHl02e6rwXwH8ZgiJl5lJHJrj6+O7PPuHI7mFEWfilDEIempj3V/AX75ayhx4ke8QcmUKOIirLJFJ7Dw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:04.114073Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.09470","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c4a1ad97846dd560b0f54feb0511119fbb056eb43e8bb01a03654b23ebe5dccb","sha256:63cfab9c475b184cd503195b034c197b1b86c6439ea0923730f264b6789a40ed"],"state_sha256":"cb735ada0ba6bd157f68405ddd4f94a339947a1bf0da3d5b074e6f4f948332b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7pV9dQ9U5K0OnuX3ZnbdLGWfkdWzBPTvwmnWJpchp1y3gbsKJsWvHXeXm5YWUSGgBxRBIM9KqvP923oMsOnlAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T20:23:05.245298Z","bundle_sha256":"3558cd46a4b48b1654011169a9c13b66de01693a25a2116e63ee1141b4feb93c"}}