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: "efficient state based crdts by delta mutation"
  Abstract: 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 en- tire state, that may be large, and merging it to other replicas; whereas operation-based CRDTs disseminate operations (i.e., small states) assuming an exactly-once reliable dissemination layer. We introduce Delta State Conflict-Free Replicated Datatypes ({\delta}-CRDT) that can achieve the best of both worlds: 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 {\delta}-mutators to return a delta-state, typically with a much smaller size than the full state, that is joined to both: local and remote states. We introduce the {\delta}-CRDT framework, and we explain it through establishing a correspondence to current state-based CRDTs. In addition, we present an anti-entropy algorithm that ensures causal consistency, and we introduce two {\delta}-CRDT specifications of well-known replicated datatypes.

Connected through hyperedge HE-1 (induced by source paper "linearizable state machine replication of state based crdts without logs"):
  with members:
    - "linearizable replicated state machines with lattice agreement"
    - "set constrained delivery broadcast definition abstraction power and computability limits"
    - "consistency in non transactional distributed storage systems"
    - "abstract unordered and ordered trees crdt"

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

Connected through hyperedge HE-3 (induced by source paper "delta state replicated data types"):
  with members:
    - "an optimized conflict free replicated set"
    - "crdts consistency without concurrency control"

Connected through hyperedge HE-4 (induced by source paper "verifying strong eventual consistency in distributed systems"):
  with members:
    - "simultaneous editing of json objects via operational transformation"
    - "a conflict free replicated json datatype"

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

Connected through hyperedge HE-6 (induced by source paper "big ger sets decomposed delta crdt sets in riak"):
  with members:
    - "an optimized conflict free replicated set"

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)