human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "sparse deep neural network graph challenge"):
  Abstract: The MIT/IEEE/Amazon GraphChallenge.org encourages community approaches to developing new solutions for analyzing graphs and sparse data. Sparse AI analytics present unique scalability difficulties. The proposed Sparse Deep Neural Network (DNN) Challenge draws upon prior challenges from machine learning, high performance computing, and visual analytics to create a challenge that is reflective of emerging sparse AI systems. The Sparse DNN Challenge is based on a mathematically well-defined DNN inference computation and can be implemented in any programming environment. Sparse DNN inference is amenable to both vertex-centric implementations and array-based implementations (e.g., using the GraphBLAS.org standard). The computations are simple enough that performance predictions can be made based on simple computing hardware models. The input data sets are derived from the MNIST handwritten letters. The surrounding I/O and verification provide the context for each sparse DNN inference that allows rigorous definition of both the input and the output. Furthermore, since the proposed sparse DNN challenge is scalable in both problem size and hardware, it can be used to measure and quantitatively compare a wide range of present day and future systems. Reference implementations have been implemented and their serial and parallel performance have been measured. Specifications, data, and software are publicly available at GraphChallenge.org.

Includes members:
  Member "radix net structured sparse matrices for deep neural networks":
    also connected through other hyperedges:
      (none)
  Member "sparse deep neural network exact solutions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "radix net structured sparse matrices for deep neural networks")
  Member "in datacenter performance analysis of a tensor processing unit":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "train large then compress rethinking model size for efficient training and inference of transformers")
  Member "streaming graph challenge stochastic block partition":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "75 000 000 000 streaming inserts second using hierarchical hypersparse graphblas matrices")
  Member "squeezenet alexnet level accuracy with 50x fewer parameters and 0 5mb model size":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "lossless compression of deep neural networks")
  Member "static graph challenge subgraph isomorphism":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a systematic survey of general sparse matrix matrix multiplication")
  Member "speeding up convolutional neural networks by exploiting the sparsity of rectifier units":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "spatially adaptive inference with stochastic feature sampling and interpolation")
  Member "enabling massive deep neural networks with the graphblas":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "ai data wrangling with associative arrays")

Question: Please tell me which class the source paper 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.CV(Computer Vision and Pattern Recognition)