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: "enabling highly scalable remote memory access programming with mpi 3 one sided"
  Abstract: Modern interconnects offer remote direct memory access (RDMA) features. Yet, most applications rely on explicit message passing for communications albeit their unwanted overheads. The MPI-3.0 standard defines a programming interface for exploiting RDMA networks directly, however, it's scalability and practicability has to be demonstrated in practice. In this work, we develop scalable bufferless protocols that implement the MPI-3.0 specification. Our protocols support scaling to millions of cores with negligible memory consumption while providing highest performance and minimal overheads. To arm programmers, we provide a spectrum of performance models for all critical functions and demonstrate the usability of our library and models with several application studies with up to half a million processes. We show that our design is comparable to, or better than UPC and Fortran Coarrays in terms of latency, bandwidth, and message rate. We also demonstrate application performance improvements with comparable programming complexity.

Connected through hyperedge HE-1 (induced by source paper "practice of streaming and dynamic graphs concepts models systems and parallelism"):
  with members:
    - "storing and querying large scale spatio temporal graphs with high throughput edge insertions"
    - "parallel batch dynamic graph connectivity"
    - "demystifying graph databases analysis and taxonomy of data organization system designs and graph queries"
    - "graph processing on fpgas taxonomy survey challenges"
    - "slim fly a cost effective low diameter network topology"
    - "red blue pebbling revisited near optimal parallel matrix matrix multiplication"
    - "dynamic algorithms for the massively parallel computation model"
    - "fatpaths routing in supercomputers data centers and clouds with low diameter networks when shortest paths fall short"

Connected through hyperedge HE-2 (induced by source paper "slim graph practical lossy graph compression for approximate graph processing storage and analytics"):
  with members:
    - "demystifying graph databases analysis and taxonomy of data organization system designs and graph queries"
    - "graph processing on fpgas taxonomy survey challenges"
    - "fatpaths routing in supercomputers data centers and clouds with low diameter networks when shortest paths fall short"
    - "a modular benchmarking infrastructure for high performance and reproducible deep learning"
    - "active access a mechanism for high performance distributed data centric computations"
    - "communication efficient jaccard similarity for high performance distributed genome comparisons"
    - "local computation algorithms for spanners"
    - "survey and taxonomy of lossless graph compression and space efficient graph representations"

Connected through hyperedge HE-3 (induced by source paper "demystifying graph databases analysis and taxonomy of data organization system designs and graph queries"):
  with members:
    - "graph processing on fpgas taxonomy survey challenges"
    - "slim fly a cost effective low diameter network topology"
    - "fatpaths routing in supercomputers data centers and clouds with low diameter networks when shortest paths fall short"
    - "active access a mechanism for high performance distributed data centric computations"
    - "network accelerated non contiguous memory transfers"
    - "slim graph practical lossy graph compression for approximate graph processing storage and analytics"
    - "survey and taxonomy of lossless graph compression and space efficient graph representations"
    - "high level programming abstractions for distributed graph processing"

Connected through hyperedge HE-4 (induced by source paper "slim fly a cost effective low diameter network topology"):
  with members:
    - "demystifying graph databases analysis and taxonomy of data organization system designs and graph queries"
    - "graph processing on fpgas taxonomy survey challenges"
    - "red blue pebbling revisited near optimal parallel matrix matrix multiplication"
    - "a modular benchmarking infrastructure for high performance and reproducible deep learning"
    - "network accelerated non contiguous memory transfers"
    - "communication efficient jaccard similarity for high performance distributed genome comparisons"
    - "slim graph practical lossy graph compression for approximate graph processing storage and analytics"
    - "survey and taxonomy of lossless graph compression and space efficient graph representations"

Connected through hyperedge HE-5 (induced by source paper "graph processing on fpgas taxonomy survey challenges"):
  with members:
    - "slim fly a cost effective low diameter network topology"
    - "a modular benchmarking infrastructure for high performance and reproducible deep learning"
    - "survey and taxonomy of lossless graph compression and space efficient graph representations"
    - "demystifying parallel and distributed deep learning an in depth concurrency analysis"
    - "high level programming abstractions for distributed graph processing"
    - "an efficient dispatcher for large scale graphprocessing on opencl based fpgas"
    - "an efficient graph accelerator with parallel data conflict management"
    - "mathematical foundations of the graphblas"

Connected through hyperedge HE-6 (induced by source paper "fatpaths routing in supercomputers data centers and clouds with low diameter networks when shortest paths fall short"):
  with members:
    - "slim fly a cost effective low diameter network topology"
    - "expander datacenters from theory to practice"
    - "homa a receiver driven low latency transport protocol using network priorities"
    - "revisiting network support for rdma"
    - "a survey and evaluation of data center network topologies"
    - "measuring and understanding throughput of network topologies"
    - "jellyfish networking data centers randomly"

Connected through hyperedge HE-7 (induced by source paper "active access a mechanism for high performance distributed data centric computations"):
  with members:
    - "demystifying graph databases analysis and taxonomy of data organization system designs and graph queries"
    - "graph processing on fpgas taxonomy survey challenges"
    - "a modular benchmarking infrastructure for high performance and reproducible deep learning"
    - "network accelerated non contiguous memory transfers"
    - "transformations of high level synthesis codes for high performance computing"
    - "spin high performance streaming processing in the network"
    - "scaling betweenness centrality using communication efficient sparse matrix multiplication"

Connected through hyperedge HE-8 (induced by source paper "red blue pebbling revisited near optimal parallel matrix matrix multiplication"):
  with members:
    - "demystifying parallel and distributed deep learning an in depth concurrency analysis"
    - "increasing the efficiency of sparse matrix matrix multiplication with a 2 5d algorithm and one sided mpi"
    - "pushing the bounds for matrix matrix multiplication"
    - "scaling betweenness centrality using communication efficient sparse matrix multiplication"
    - "mathematical foundations of the graphblas"
    - "i o efficient algorithms for matrix computations"

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)