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: "asynchronous mpi for the masses"
  Abstract: We present a simple library which equips MPI implementations with truly asynchronous non-blocking point-to-point operations, and which is independent of the underlying communication infrastructure. It utilizes the MPI profiling interface (PMPI) and the MPI_THREAD_MULTIPLE thread compatibility level, and works with current versions of Intel MPI, Open MPI, MPICH2, MVAPICH2, Cray MPI, and IBM MPI. We show performance comparisons on a commodity InfiniBand cluster and two tier-1 systems in Germany, using low-level and application benchmarks. Issues of thread/process placement and the peculiarities of different MPI implementations are discussed in detail. We also identify the MPI libraries that already support asynchronous operations. Finally we show how our ideas can be extended to MPI-IO.

Connected through hyperedge HE-1 (induced by source paper "a high level characterisation and generalisation of communication avoiding programming techniques"):
  with members:
    - "parallel performance of algebraic multigrid domain decomposition amg dd"
    - "stop talking to me a communication avoiding ader dg realisation"
    - "enclave tasking for discontinuous galerkin methods on dynamically adaptive meshes"
    - "two particle in grid realisations on spacetrees"
    - "algebraic geometric matrix free multigrid on dynamically adaptive cartesian meshes"
    - "swift using task based parallelism fully asynchronous communication and graph partition based domain decomposition for strong scaling on more than 100 000 cores"

Connected through hyperedge HE-2 (induced by source paper "enclave tasking for discontinuous galerkin methods on dynamically adaptive meshes"):
  with members:
    - "exahype an engine for parallel dynamically adaptive simulations of wave problems"
    - "stop talking to me a communication avoiding ader dg realisation"
    - "quasi matrix free hybrid multigrid on dynamically adaptive cartesian grids"
    - "fast matrix free evaluation of discontinuous galerkin finite element operators"
    - "likwid a lightweight performance oriented tool suite for x86 multicore environments"
    - "likwid a lightweight performance oriented tool suite for x86 multicore environments"

Connected through hyperedge HE-3 (induced by source paper "ghost building blocks for high performance sparse linear algebra on heterogeneous systems"):
  with members:
    - "pipelined iterative solvers with kernel fusion for graphics processing units"
    - "performance engineering of the kernel polynomal method on large scale cpu gpu systems"
    - "a unified sparse matrix data format for efficient general sparse matrix vector multiplication on modern processors with wide simd units"
    - "density matrix based algorithm for solving eigenvalue problems"
    - "pt scotch a tool for efficient parallel graph ordering"

Connected through hyperedge HE-4 (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"
    - "dart mpi an mpi based implementation of a pgas runtime system"

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)