{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VGFLLEPR4CWFKQMQ42HUVCBMMZ","short_pith_number":"pith:VGFLLEPR","schema_version":"1.0","canonical_sha256":"a98ab591f1e0ac554190e68f4a882c6662ae23f8f98987038facc2e6142816c9","source":{"kind":"arxiv","id":"1810.06625","version":2},"attestation_state":"computed","paper":{"title":"Parameterized Dynamic Cluster Editing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Andr\\'e Nichterlein, Hendrik Molter, Junjie Luo, Rolf Niedermeier","submitted_at":"2018-10-15T19:21:41Z","abstract_excerpt":"We introduce a dynamic version of the NP-hard graph problem Cluster Editing. The essential point here is to take into account dynamically evolving input graphs: Having a cluster graph (that is, a disjoint union of cliques) that represents a solution for the first input graph, can we cost-efficiently transform it into a \"similar\" cluster graph that is a solution for the second (\"subsequent\") input graph? This model is motivated by several application scenarios, including incremental clustering, the search for compromise clusterings, or also local search in graph-based data clustering. We thorou"},"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":"1810.06625","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-10-15T19:21:41Z","cross_cats_sorted":[],"title_canon_sha256":"354c2d19fe2944989ce25d768959c270844413025efe7d0feb1a1ce0efefe7db","abstract_canon_sha256":"2600b11fbf404302c2c660f0de57be1172a67af40547c16ab69d335b4b067f7b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:37.144591Z","signature_b64":"dTfEoGKs9/uvoMQcZzmJZOWuNd1sNHtN4+eeH5GQ4SLSW0fZnzyWQ+Us+rYG3OYVaBhADlg28S1q6GNf1f4MDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a98ab591f1e0ac554190e68f4a882c6662ae23f8f98987038facc2e6142816c9","last_reissued_at":"2026-05-17T23:58:37.144115Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:37.144115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized Dynamic Cluster Editing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Andr\\'e Nichterlein, Hendrik Molter, Junjie Luo, Rolf Niedermeier","submitted_at":"2018-10-15T19:21:41Z","abstract_excerpt":"We introduce a dynamic version of the NP-hard graph problem Cluster Editing. The essential point here is to take into account dynamically evolving input graphs: Having a cluster graph (that is, a disjoint union of cliques) that represents a solution for the first input graph, can we cost-efficiently transform it into a \"similar\" cluster graph that is a solution for the second (\"subsequent\") input graph? This model is motivated by several application scenarios, including incremental clustering, the search for compromise clusterings, or also local search in graph-based data clustering. We thorou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.06625","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":"1810.06625","created_at":"2026-05-17T23:58:37.144188+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.06625v2","created_at":"2026-05-17T23:58:37.144188+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.06625","created_at":"2026-05-17T23:58:37.144188+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/VGFLLEPR4CWFKQMQ42HUVCBMMZ","json":"https://pith.science/pith/VGFLLEPR4CWFKQMQ42HUVCBMMZ.json","graph_json":"https://pith.science/api/pith-number/VGFLLEPR4CWFKQMQ42HUVCBMMZ/graph.json","events_json":"https://pith.science/api/pith-number/VGFLLEPR4CWFKQMQ42HUVCBMMZ/events.json","paper":"https://pith.science/paper/VGFLLEPR"},"agent_actions":{"view_html":"https://pith.science/pith/VGFLLEPR4CWFKQMQ42HUVCBMMZ","download_json":"https://pith.science/pith/VGFLLEPR4CWFKQMQ42HUVCBMMZ.json","view_paper":"https://pith.science/paper/VGFLLEPR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.06625&json=true","fetch_graph":"https://pith.science/api/pith-number/VGFLLEPR4CWFKQMQ42HUVCBMMZ/graph.json","fetch_events":"https://pith.science/api/pith-number/VGFLLEPR4CWFKQMQ42HUVCBMMZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VGFLLEPR4CWFKQMQ42HUVCBMMZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VGFLLEPR4CWFKQMQ42HUVCBMMZ/action/storage_attestation","attest_author":"https://pith.science/pith/VGFLLEPR4CWFKQMQ42HUVCBMMZ/action/author_attestation","sign_citation":"https://pith.science/pith/VGFLLEPR4CWFKQMQ42HUVCBMMZ/action/citation_signature","submit_replication":"https://pith.science/pith/VGFLLEPR4CWFKQMQ42HUVCBMMZ/action/replication_record"}},"created_at":"2026-05-17T23:58:37.144188+00:00","updated_at":"2026-05-17T23:58:37.144188+00:00"}