{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:6ZG73UKMPDN2SHAMVPVR5L4QL2","short_pith_number":"pith:6ZG73UKM","schema_version":"1.0","canonical_sha256":"f64dfdd14c78dba91c0cabeb1eaf905ea7470134d8d55182e3b92e92ddba5d43","source":{"kind":"arxiv","id":"1008.4250","version":3},"attestation_state":"computed","paper":{"title":"Cluster Editing: Kernelization based on Edge Cuts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jianer Chen, Yixin Cao","submitted_at":"2010-08-25T10:44:39Z","abstract_excerpt":"Kernelization algorithms for the {\\sc cluster editing} problem have been a popular topic in the recent research in parameterized computation. Thus far most kernelization algorithms for this problem are based on the concept of {\\it critical cliques}. In this paper, we present new observations and new techniques for the study of kernelization algorithms for the {\\sc cluster editing} problem. Our techniques are based on the study of the relationship between {\\sc cluster editing} and graph edge-cuts. As an application, we present an ${\\cal O}(n^2)$-time algorithm that constructs a $2k$ kernel for "},"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":"1008.4250","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-08-25T10:44:39Z","cross_cats_sorted":[],"title_canon_sha256":"0408121bead4fc2767ebbd3406a2da1f5e31028aff8841b711ff16aecaa9975e","abstract_canon_sha256":"0d75353fd9f2ac6b8a02cf990427b1964531cb9e76e4662b5deeaca451c3e056"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:05:42.963937Z","signature_b64":"fzhHkiWdzIVYlUAj8/yfxueVQpAeJFoiY2PSDcP9h2AUriUGSrMs5l85NLJsZXO3YOGH2t/s/WQPwxzUIQ5TDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f64dfdd14c78dba91c0cabeb1eaf905ea7470134d8d55182e3b92e92ddba5d43","last_reissued_at":"2026-05-18T02:05:42.963327Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:05:42.963327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cluster Editing: Kernelization based on Edge Cuts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jianer Chen, Yixin Cao","submitted_at":"2010-08-25T10:44:39Z","abstract_excerpt":"Kernelization algorithms for the {\\sc cluster editing} problem have been a popular topic in the recent research in parameterized computation. Thus far most kernelization algorithms for this problem are based on the concept of {\\it critical cliques}. In this paper, we present new observations and new techniques for the study of kernelization algorithms for the {\\sc cluster editing} problem. Our techniques are based on the study of the relationship between {\\sc cluster editing} and graph edge-cuts. As an application, we present an ${\\cal O}(n^2)$-time algorithm that constructs a $2k$ kernel for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.4250","kind":"arxiv","version":3},"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":"1008.4250","created_at":"2026-05-18T02:05:42.963416+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.4250v3","created_at":"2026-05-18T02:05:42.963416+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.4250","created_at":"2026-05-18T02:05:42.963416+00:00"},{"alias_kind":"pith_short_12","alias_value":"6ZG73UKMPDN2","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_16","alias_value":"6ZG73UKMPDN2SHAM","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_8","alias_value":"6ZG73UKM","created_at":"2026-05-18T12:26:04.259169+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/6ZG73UKMPDN2SHAMVPVR5L4QL2","json":"https://pith.science/pith/6ZG73UKMPDN2SHAMVPVR5L4QL2.json","graph_json":"https://pith.science/api/pith-number/6ZG73UKMPDN2SHAMVPVR5L4QL2/graph.json","events_json":"https://pith.science/api/pith-number/6ZG73UKMPDN2SHAMVPVR5L4QL2/events.json","paper":"https://pith.science/paper/6ZG73UKM"},"agent_actions":{"view_html":"https://pith.science/pith/6ZG73UKMPDN2SHAMVPVR5L4QL2","download_json":"https://pith.science/pith/6ZG73UKMPDN2SHAMVPVR5L4QL2.json","view_paper":"https://pith.science/paper/6ZG73UKM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.4250&json=true","fetch_graph":"https://pith.science/api/pith-number/6ZG73UKMPDN2SHAMVPVR5L4QL2/graph.json","fetch_events":"https://pith.science/api/pith-number/6ZG73UKMPDN2SHAMVPVR5L4QL2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6ZG73UKMPDN2SHAMVPVR5L4QL2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6ZG73UKMPDN2SHAMVPVR5L4QL2/action/storage_attestation","attest_author":"https://pith.science/pith/6ZG73UKMPDN2SHAMVPVR5L4QL2/action/author_attestation","sign_citation":"https://pith.science/pith/6ZG73UKMPDN2SHAMVPVR5L4QL2/action/citation_signature","submit_replication":"https://pith.science/pith/6ZG73UKMPDN2SHAMVPVR5L4QL2/action/replication_record"}},"created_at":"2026-05-18T02:05:42.963416+00:00","updated_at":"2026-05-18T02:05:42.963416+00:00"}