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: "load balanced sparse mttkrp on gpus"
  Abstract: Sparse matricized tensor times Khatri-Rao product (MTTKRP) is one of the most computationally expensive kernels in sparse tensor computations. This work focuses on optimizing the MTTKRP operation on GPUs, addressing both performance and storage requirements. We begin by identifying the performance bottlenecks in directly extending the state-of-the-art CSF (compressed sparse fiber) format from CPUs to GPUs. A significant challenge with GPUs compared to multicore CPUs is that of utilizing the much greater degree of parallelism in a load-balanced fashion for irregular computations like sparse MTTKRP. To address this issue, we develop a new storage-efficient representation for tensors that enables high-performance, load-balanced execution of MTTKRP on GPUs. A GPU implementation of sparse MTTKRP using the new sparse tensor representation is shown to outperform all currently known parallel sparse CPU and GPU MTTKRP implementations.

Connected through hyperedge HE-1 (induced by source paper "a unified iteration space transformation framework for sparse and dense tensor algebra"):
  with members:
    - "format abstraction for sparse tensor algebracompilers"
    - "tensor comprehensions framework agnostic high performance machine learning abstractions"
    - "scaling betweenness centrality using communication efficient sparse matrix multiplication"
    - "tensorflow a system for large scale machine learning"
    - "csr5 an efficient storage format for cross platform sparse matrix vector multiplication"
    - "caffe convolutional architecture for fast feature embedding"

Connected through hyperedge HE-2 (induced by source paper "pasta a parallel sparse tensor algorithm benchmark suite"):
  with members:
    - "tensor train decomposition on tensorflow t3f"
    - "a practical randomized cp tensor decomposition"
    - "software for sparse tensor decomposition on emerging computing architectures"
    - "spartan scalable parafac2 for large sparse data"
    - "tensor regression meets gaussian processes"
    - "tensor computation a new framework for high dimensional problems in eda"
    - "a unified optimization approach for sparse tensor operations on gpus"
    - "learning from multiway data simple and efficient tensor regression"

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)