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: "dart mpi an mpi based implementation of a pgas runtime system"
  Abstract: A Partitioned Global Address Space (PGAS) approach treats a distributed system as if the memory were shared on a global level. Given such a global view on memory, the user may program applications very much like shared memory systems. This greatly simplifies the tasks of developing parallel applications, because no explicit communication has to be specified in the program for data exchange between different computing nodes. In this paper we present DART, a runtime environment, which implements the PGAS paradigm on large-scale high-performance computing clusters. A specific feature of our implementation is the use of one-sided communication of the Message Passing Interface (MPI) version 3 (i.e. MPI-3) as the underlying communication substrate. We evaluated the performance of the implementation with several low-level kernels in order to determine overheads and limitations in comparison to the underlying MPI-3.

Connected through hyperedge HE-1 (induced by source paper "towards performance portability through locality awareness for applications using one sided communication primitives"):
  with members:
    - "leveraging mpi 3 shared memory extensions for efficient pgas runtime systems"
    - "a bandwidth saving optimization for mpi broadcast collective operation"
    - "enabling highly scalable remote memory access programming with mpi 3 one sided"
    - "design and implementation of mpich2 over infiniband with rdma support"

Connected through hyperedge HE-2 (induced by source paper "asynchronous progress design for a mpi based pgas one sided communication system"):
  with members:
    - "towards performance portability through locality awareness for applications using one sided communication primitives"
    - "leveraging mpi 3 shared memory extensions for efficient pgas runtime systems"
    - "asynchronous mpi for the masses"

Connected through hyperedge HE-3 (induced by source paper "dash a c pgas library for distributed data structures and parallel algorithms"):
  with members:
    - "alpaka an abstraction library for parallel kernel acceleration"
    - "leveraging mpi 3 shared memory extensions for efficient pgas runtime systems"

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)