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 "dynamic matrix inverse improved algorithms and matching conditional lower bounds"):
  Abstract: The dynamic matrix inverse problem is to maintain the inverse of a matrix undergoing element and column updates. It is the main subroutine behind the best algorithms for many dynamic problems whose complexity is not yet well-understood, such as maintaining the largest eigenvalue, rank and determinant of a matrix and maintaining reachability, distances, maximum matching size, and $k$-paths/cycles in a graph. Understanding the complexity of dynamic matrix inverse is a key to understand these problems. #R##N#In this paper, we present (i) improved algorithms for dynamic matrix inverse and their extensions to some incremental/look-ahead variants, and (ii) variants of the Online Matrix-Vector conjecture [Henzinger et al. STOC'15] that, if true, imply that these algorithms are tight. Our algorithms automatically lead to faster dynamic algorithms for the aforementioned problems, some of which are also tight under our conjectures, e.g. reachability and maximum matching size (closing the gaps for these two problems was in fact asked by Abboud and V. Williams [FOCS'14]). Prior best bounds for most of these problems date back to more than a decade ago [Sankowski FOCS'04, COCOON'05, SODA'07; Kavitha FSTTCS'08; Mucha and Sankowski Algorithmica'10; Bosek et al. FOCS'14]. #R##N#Our improvements stem mostly from the ability to use fast matrix multiplication ``one more time'', to maintain a certain transformation matrix which could be maintained only combinatorially previously (i.e. without fast matrix multiplication). Oddly, unlike other dynamic problems where this approach, once successful, could be repeated several times (``bootstrapping''), our conjectures imply that this is not the case for dynamic matrix inverse and some related problems. However, when a small additional ``look-ahead'' information is provided we can perform such repetition to drive the bounds down further.

Includes members:
  Member "dynamic approximate shortest paths and beyond subquadratic and worst case update time":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "deterministic algorithms for decremental approximate shortest paths faster and simpler")
  Member "a deterministic linear program solver in current matrix multiplication time":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "solving tall dense linear programs in nearly linear time")
  Member "sensitive distance and reachability oracles for large batch updates":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "approximate distance oracles subject to multiple vertex failures")
  Member "solving linear programs in the current matrix multiplication time":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "solving tall dense linear programs in nearly linear time")
  Member "online bipartite matching with amortized o log 2 n replacements":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "new algorithms and hardness for incremental single source shortest paths in directed graphs")
  Member "tight cell probe bounds for succinct boolean matrix vector multiplication":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "coarse grained complexity for dynamic algorithms")
  Member "improved rectangular matrix multiplication using powers of the coppersmith winograd tensor":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "new algorithms and hardness for incremental single source shortest paths in directed graphs")
  Member "dynamic minimum spanning forest with subpolynomial worst case update time":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "dynamic graph algorithms with batch updates in the massively parallel computation model")

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)