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 "gpgpu linear complexity t sne optimization"):
  Abstract: The t-distributed Stochastic Neighbor Embedding (tSNE) algorithm has become in recent years one of the most used and insightful techniques for the exploratory data analysis of high-dimensional data. tSNE reveals clusters of high-dimensional data points at different scales while it requires only minimal tuning of its parameters. Despite these advantages, the computational complexity of the algorithm limits its application to relatively small datasets. To address this problem, several evolutions of tSNE have been developed in recent years, mainly focusing on the scalability of the similarity computations between data points. However, these contributions are insufficient to achieve interactive rates when visualizing the evolution of the tSNE embedding for large datasets. In this work, we present a novel approach to the minimization of the tSNE objective function that heavily relies on modern graphics hardware and has linear computational complexity. Our technique does not only beat the state of the art, but can even be executed on the client side in a browser. We propose to approximate the repulsion forces between data points using adaptive-resolution textures that are drawn at every iteration with WebGL. This approximation allows us to reformulate the tSNE minimization problem as a series of tensor operation that are computed with TensorFlow.js, a JavaScript library for scalable tensor computations.

Includes members:
  Member "progressive data science potential and challenges":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "an incremental dimensionality reduction method for visualizing streaming multidimensional data")
  Member "visual analytics in deep learning an interrogative survey for the next frontiers":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "explainer a visual analytics framework for interactive and explainable machine learning")
  Member "t sne cuda gpu accelerated t sne and its applications to modern data":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "t visne interactive assessment and interpretation of t sne projections")
  Member "billion scale similarity search with gpus":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "noise estimation using density estimation for self supervised multimodal learning")
  Member "pixelsne visualizing fast with just enough precision via pixel aligned stochastic neighbor embedding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "embeddingvis a visual analytics approach to comparative network embedding inspection")
  Member "progressive analytics a computation paradigm for exploratory data analysis":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "hillview a trillion cell spreadsheet for big data")
  Member "going deeper with convolutions":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "discrimination aware network pruning for deep model compression")

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.LG(Machine Learning)