human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "delta state replicated data types"
  Abstract: Abstract   Conflict-free Replicated Data Types (CRDTs) are distributed data types that make eventual consistency of a distributed object possible and non ad-hoc. Specifically, state-based CRDTs ensure convergence through disseminating the entire state, that may be large, and merging it to other replicas. We introduce Delta State Conflict-Free Replicated Data Types (   δ   -CRDT) that can achieve the best of both operation-based and state-based CRDTs: small messages with an incremental nature, as in operation-based CRDTs, disseminated over unreliable communication channels, as in traditional state-based CRDTs. This is achieved by defining    δ   -mutators to return a delta-state, typically with a much smaller size than the full state, that to be joined with both local and remote states. We introduce the    δ   -CRDT framework, and we explain it through establishing a correspondence to current state-based CRDTs. In addition, we present an anti-entropy algorithm for eventual convergence, and another one that ensures causal consistency. Finally, we introduce several    δ   -CRDT specifications of both well-known replicated datatypes and novel datatypes, including a generic map composition.

Connected through hyperedge HE-1 (induced by source paper "achlys towards a framework for distributed storage and generic computing applications for wireless iot edge networks with lasp on grisp"):
  with members:
    - "practical evaluation of the lasp programming model at large scale an experience report"
    - "big ger sets decomposed delta crdt sets in riak"

Connected through hyperedge HE-2 (induced by source paper "got git but for objects"):
  with members:
    - "on consistency of operational transformation approach"

Connected through hyperedge HE-3 (induced by source paper "conflict free replicated data types crdts"):
  with members:
    - "verifying strong eventual consistency in distributed systems"
    - "a conflict free replicated json datatype"
    - "eventually consistent register revisited"
    - "scalable eventually consistent counters over unreliable networks"

Connected through hyperedge HE-4 (induced by source paper "conflict free replicated data types an overview"):
  with members:
    - "eventually consistent register revisited"
    - "the homeostasis protocol avoiding transaction coordination through program analysis"
    - "scalable eventually consistent counters over unreliable networks"
    - "designing a commutative replicated data type"

Connected through hyperedge HE-5 (induced by source paper "efficient synchronization of state based crdts"):
  with members:
    - "pure operation based replicated data types"
    - "efficient state based crdts by delta mutation"

Connected through hyperedge HE-6 (induced by source paper "pure operation based replicated data types"):
  with members:
    - "efficient state based crdts by delta mutation"
    - "crdts consistency without concurrency control"

Question: Please tell me which class the center node belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.DC(Distributed, Parallel, and Cluster Computing)