{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:FV5SKZRXBIP5UFBFG2W6FWFZK4","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":"59bd8d2804dbad3d441c95fdadd84781ade433f76813b5da57de65492c41ef78","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-12-19T17:43:36Z","title_canon_sha256":"2dd93d61305857c4b78ac1425567ebcd79ba8ed4745ed4eedb2db2abeadace0b"},"schema_version":"1.0","source":{"id":"1112.4419","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.4419","created_at":"2026-05-18T02:21:27Z"},{"alias_kind":"arxiv_version","alias_value":"1112.4419v4","created_at":"2026-05-18T02:21:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.4419","created_at":"2026-05-18T02:21:27Z"},{"alias_kind":"pith_short_12","alias_value":"FV5SKZRXBIP5","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FV5SKZRXBIP5UFBF","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FV5SKZRX","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:db6c9a39a09b471c760bd9b2417e0d19de45c502733f11a41c10c4c1d5ae2551","target":"graph","created_at":"2026-05-18T02:21:27Z","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 Correlation Clustering, also known as Cluster Editing, we are given an undirected n-vertex graph G and a positive integer k. The task is to decide if G can be transformed into a cluster graph, i.e., a disjoint union of cliques, by changing at most k adjacencies, i.e. by adding/deleting at most k edges. We give a subexponential algorithm that, in time 2^O(sqrt(pk)) + n^O(1) decides whether G can be transformed into a cluster graph with p cliques by changing at most k adjacencies. We complement our algorithmic findings by the following tight lower bounds on the asymptotic behaviour of our","authors_text":"Fedor V. Fomin, Marcin Pilipczuk, Micha{\\l} Pilipczuk, Stefan Kratsch, Yngve Villanger","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-12-19T17:43:36Z","title":"Subexponential fixed-parameter tractability of cluster editing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.4419","kind":"arxiv","version":4},"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:5112404556112fc441629253aeda5b2ede73f4a26f8a48545d8a2637b2399565","target":"record","created_at":"2026-05-18T02:21:27Z","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":"59bd8d2804dbad3d441c95fdadd84781ade433f76813b5da57de65492c41ef78","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-12-19T17:43:36Z","title_canon_sha256":"2dd93d61305857c4b78ac1425567ebcd79ba8ed4745ed4eedb2db2abeadace0b"},"schema_version":"1.0","source":{"id":"1112.4419","kind":"arxiv","version":4}},"canonical_sha256":"2d7b2566370a1fda142536ade2d8b9570c133c0352d838a7e8e4c6a026f08c00","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d7b2566370a1fda142536ade2d8b9570c133c0352d838a7e8e4c6a026f08c00","first_computed_at":"2026-05-18T02:21:27.104916Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:27.104916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2x37AFerAIg5/+gN5K37Ty9RG/YPPJfbEat1iBzNLtMDPNpTcxMIqsPndAHfz3EiQOu9PyA2k6iy7K/gU3RnBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:27.105590Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.4419","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5112404556112fc441629253aeda5b2ede73f4a26f8a48545d8a2637b2399565","sha256:db6c9a39a09b471c760bd9b2417e0d19de45c502733f11a41c10c4c1d5ae2551"],"state_sha256":"421148d7fcf567b27f44f9aa093fda35c505bccb38548072be102810fc2596ff"}