{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:VGFLLEPR4CWFKQMQ42HUVCBMMZ","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":"2600b11fbf404302c2c660f0de57be1172a67af40547c16ab69d335b4b067f7b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-10-15T19:21:41Z","title_canon_sha256":"354c2d19fe2944989ce25d768959c270844413025efe7d0feb1a1ce0efefe7db"},"schema_version":"1.0","source":{"id":"1810.06625","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.06625","created_at":"2026-05-17T23:58:37Z"},{"alias_kind":"arxiv_version","alias_value":"1810.06625v2","created_at":"2026-05-17T23:58:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.06625","created_at":"2026-05-17T23:58:37Z"},{"alias_kind":"pith_short_12","alias_value":"VGFLLEPR4CWF","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VGFLLEPR4CWFKQMQ","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VGFLLEPR","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:0ff58d4c87447a6c0a9518ce1c210e9296fee6a8ec5a6fdfc752dca8a50602bf","target":"graph","created_at":"2026-05-17T23:58:37Z","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":"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","authors_text":"Andr\\'e Nichterlein, Hendrik Molter, Junjie Luo, Rolf Niedermeier","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-10-15T19:21:41Z","title":"Parameterized Dynamic Cluster Editing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.06625","kind":"arxiv","version":2},"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:30f1c2dc6a8589f987a1f7584323abff8cfae6de32e254adb5e253e936a70df4","target":"record","created_at":"2026-05-17T23:58:37Z","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":"2600b11fbf404302c2c660f0de57be1172a67af40547c16ab69d335b4b067f7b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-10-15T19:21:41Z","title_canon_sha256":"354c2d19fe2944989ce25d768959c270844413025efe7d0feb1a1ce0efefe7db"},"schema_version":"1.0","source":{"id":"1810.06625","kind":"arxiv","version":2}},"canonical_sha256":"a98ab591f1e0ac554190e68f4a882c6662ae23f8f98987038facc2e6142816c9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a98ab591f1e0ac554190e68f4a882c6662ae23f8f98987038facc2e6142816c9","first_computed_at":"2026-05-17T23:58:37.144115Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:37.144115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dTfEoGKs9/uvoMQcZzmJZOWuNd1sNHtN4+eeH5GQ4SLSW0fZnzyWQ+Us+rYG3OYVaBhADlg28S1q6GNf1f4MDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:37.144591Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.06625","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:30f1c2dc6a8589f987a1f7584323abff8cfae6de32e254adb5e253e936a70df4","sha256:0ff58d4c87447a6c0a9518ce1c210e9296fee6a8ec5a6fdfc752dca8a50602bf"],"state_sha256":"a7a2affcfac362f275827d055c12edcbdc502b6a8a718ba953102beff04b7528"}