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 "tight cell probe bounds for succinct boolean matrix vector multiplication"):
  Abstract: The conjectured hardness of Boolean matrix-vector multiplication has been used with great success to prove conditional lower bounds for numerous important data structure problems, see Henzinger et al. [STOC'15]. In recent work, Larsen and Williams [SODA'17] attacked the problem from the upper bound side and gave a surprising cell probe data structure (that is, we only charge for memory accesses, while computation is free). Their cell probe data structure answers queries in $\tilde{O}(n^{7/4})$ time and is succinct in the sense that it stores the input matrix in read-only memory, plus an additional $\tilde{O}(n^{7/4})$ bits on the side. In this paper, we essentially settle the cell probe complexity of succinct Boolean matrix-vector multiplication. We present a new cell probe data structure with query time $\tilde{O}(n^{3/2})$ storing just $\tilde{O}(n^{3/2})$ bits on the side. We then complement our data structure with a lower bound showing that any data structure storing $r$ bits on the side, with $n < r < n^2$ must have query time $t$ satisfying $t r = \tilde{\Omega}(n^3)$. For $r \leq n$, any data structure must have $t = \tilde{\Omega}(n^2)$. Since lower bounds in the cell probe model also apply to classic word-RAM data structures, the lower bounds naturally carry over. We also prove similar lower bounds for matrix-vector multiplication over $\mathbb{F}_2$.

Includes members:
  Member "crossing the logarithmic barrier for dynamic boolean data structure lower bounds":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "coarse grained complexity for dynamic algorithms")
  Member "amortized dynamic cell probe lower bounds from four party communication":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "tight static lower bounds for non adaptive data structures")
  Member "faster online matrix vector multiplication":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "coarse grained complexity for dynamic algorithms")
  Member "unifying and strengthening hardness for dynamic problems via the online matrix vector multiplication conjecture":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "new algorithms and hardness for incremental single source shortest paths in directed graphs")
  Member "new unconditional hardness results for dynamic and online problems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "dynamic matrix inverse improved algorithms and matching conditional lower bounds")
  Member "adapt or die polynomial lower bounds for non adaptive dynamic data structures":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "equivalence of systematic linear data structures and matrix rigidity")
  Member "the cell probe complexity of dynamic range counting":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "tight static lower bounds for non adaptive data structures")
  Member "logarithmic lower bounds in the cell probe model":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "coarse grained complexity for dynamic algorithms")

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)