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: "format abstraction for sparse tensor algebracompilers"
  Abstract: This paper shows how to build a sparse tensor algebra compiler that is agnostic to tensor formats (data layouts). We develop an interface that describes formats in terms of their capabilities and properties, and show how to build a modular code generator where new formats can be added as plugins. We then describe six implementations of the interface that compose to form the dense, CSR/CSF, COO, DIA, ELL, and HASH tensor formats and countless variants thereof. With these implementations at hand, our code generator can generate code to compute any tensor algebra expression on any combination of the aforementioned formats. #R##N##R##N#To demonstrate our technique, we have implemented it in the taco tensor algebra compiler. Our modular code generator design makes it simple to add support for new tensor formats, and the performance of the generated code is competitive with hand-optimized implementations. Furthermore, by extending taco to support a wider range of formats specialized for different application and data characteristics, we can improve end-user application performance. For example, if input data is provided in the COO format, our technique allows computing a single matrix-vector multiplication directly with the data in COO, which is up to 3.6× faster than by first converting the data to CSR.

Connected through hyperedge HE-1 (induced by source paper "a parallel sparse tensor benchmark suite on cpus and gpus"):
  with members:
    - "pasta a parallel sparse tensor algorithm benchmark suite"
    - "spartan scalable parafac2 for large sparse data"
    - "a unified optimization approach for sparse tensor operations on gpus"
    - "simtensor a synthetic tensor data generator"
    - "high performance tensor contraction without transposition"
    - "tensorizing neural networks"
    - "the gap benchmark suite"
    - "speeding up convolutional neural networks using fine tuned cp decomposition"

Connected through hyperedge HE-2 (induced by source paper "a unified iteration space transformation framework for sparse and dense tensor algebra"):
  with members:
    - "load balanced sparse mttkrp on gpus"
    - "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-3 (induced by source paper "automatic generation of efficient sparse tensor format conversion routines"):
  with members:
    - "a unified optimization approach for sparse tensor operations on gpus"
    - "faster cnns with direct sparse convolutions and guided pruning"
    - "csr5 an efficient storage format for cross platform sparse matrix vector multiplication"
    - "tensor decompositions for learning latent variable models"

Connected through hyperedge HE-4 (induced by source paper "enabling distributed memory tensor completion in python using new sparse tensor kernels"):
  with members:
    - "pasta a parallel sparse tensor algorithm benchmark suite"
    - "tensor comprehensions framework agnostic high performance machine learning abstractions"
    - "shared memory parallelization of mttkrp for dense tensors"
    - "communication lower bounds for matricized tensor times khatri rao product"
    - "hptt a high performance tensor transposition c library"
    - "scaling betweenness centrality using communication efficient sparse matrix multiplication"
    - "tensorflow a system for large scale machine learning"
    - "sparse tensor algebra as a parallel programming model"

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.MS(Mathematical Software)