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 "cell probe lower bounds for dynamic problems via a new communication model"):
  Abstract: In this paper, we develop a new communication model to prove a data structure lower bound for the dynamic interval union problem. The problem is to maintain a multiset of intervals $\mathcal{I}$ over $[0, n]$ with integer coordinates, supporting the following operations: #R##N#- insert(a, b): add an interval $[a, b]$ to $\mathcal{I}$, provided that $a$ and $b$ are integers in $[0, n]$; #R##N#- delete(a, b): delete a (previously inserted) interval $[a, b]$ from $\mathcal{I}$; #R##N#- query(): return the total length of the union of all intervals in $\mathcal{I}$. #R##N#It is related to the two-dimensional case of Klee's measure problem. We prove that there is a distribution over sequences of operations with $O(n)$ insertions and deletions, and $O(n^{0.01})$ queries, for which any data structure with any constant error probability requires $\Omega(n\log n)$ time in expectation. Interestingly, we use the sparse set disjointness protocol of H\aa{}stad and Wigderson [ToC'07] to speed up a reduction from a new kind of nondeterministic communication games, for which we prove lower bounds. #R##N#For applications, we prove lower bounds for several dynamic graph problems by reducing them from dynamic interval union.

Includes members:
  Member "new unconditional hardness results for dynamic and online problems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "dynamic matrix inverse improved algorithms and matching conditional lower bounds")
  Member "cell probe bounds for online edit distance and other pattern matching problems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "amortized dynamic cell probe lower bounds from four party communication")
  Member "faster all pairs shortest paths via circuit complexity":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "deterministic algorithms for decremental approximate shortest paths faster and simpler")
  Member "tight cell probe bounds for online hamming distance computation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "new unconditional hardness results for dynamic and online problems")
  Member "the cell probe complexity of dynamic range counting":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "tight static lower bounds for non adaptive data structures")
  Member "lower bounds on near neighbor search via metric expansion":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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-7 (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)