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 "solving tall dense linear programs in nearly linear time"):
  Abstract: In this paper we provide an $\tilde{O}(nd+d^{3})$ time randomized algorithm for solving linear programs with $d$ variables and $n$ constraints with high probability. To obtain this result we provide a robust, primal-dual $\tilde{O}(\sqrt{d})$-iteration interior point method inspired by the methods of Lee and Sidford (2014, 2019) and show how to efficiently implement this method using new data-structures based on heavy-hitters, the Johnson-Lindenstrauss lemma, and inverse maintenance. Interestingly, we obtain this running time without using fast matrix multiplication and consequently, barring a major advance in linear system solving, our running time is near optimal for solving dense linear programs among algorithms that do not use fast matrix multiplication.

Includes members:
  Member "solving empirical risk minimization in the current matrix multiplication time":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "barriers for rectangular matrix multiplication")
  Member "dynamic matrix inverse improved algorithms and matching conditional lower bounds":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "faster fully dynamic transitive closure in practice")
  Member "dynamic streaming spectral sparsification in nearly linear time and space":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "two player hidden pointer chasing and multi pass lower bounds in turnstile streams")
  Member "fully dynamic spectral vertex sparsifiers and applications":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "practice of streaming and dynamic graphs concepts models systems and parallelism")
  Member "a deterministic linear program solver in current matrix multiplication time":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimal sketching for kronecker product regression and low rank approximation")
  Member "solving linear programs in the current matrix multiplication time":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "faster divergence maximization for faster maximum flow")
  Member "relative error tensor low rank approximation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "sketching transformed matrices with applications to natural language processing")
  Member "improved rectangular matrix multiplication using powers of the coppersmith winograd tensor":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "new algorithms and hardness for incremental single source shortest paths in directed graphs")

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.DS(Data Structures and Algorithms)