human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "new amortized cell probe lower bounds for dynamic problems"):
  with members:
    - "amortized dynamic cell probe lower bounds from four party communication"
    - "unifying and strengthening hardness for dynamic problems via the online matrix vector multiplication conjecture"
    - "new unconditional hardness results for dynamic and online problems"
    - "popular conjectures imply strong lower bounds for dynamic problems"
    - "don t rush into a union take time to find your roots"
    - "the cell probe complexity of dynamic range counting"
    - "lower bounds on near neighbor search via metric expansion"
    - "logarithmic lower bounds in the cell probe model"

Connected through hyperedge HE-2 (induced by source paper "lower bounds for oblivious data structures"):
  with members:
    - "bios oram improved privacy preserving data access for parameterized outsourced storage"
    - "crossing the logarithmic barrier for dynamic boolean data structure lower bounds"
    - "amortized dynamic cell probe lower bounds from four party communication"
    - "decreasekeys are expensive for external memory priority queues"
    - "new unconditional hardness results for dynamic and online problems"
    - "the cell probe complexity of dynamic range counting"
    - "privacy preserving group data access via stateless oblivious ram simulation"
    - "lower bounds on near neighbor search via metric expansion"

Connected through hyperedge HE-3 (induced by source paper "cell probe lower bounds from online communication complexity"):
  with members:
    - "amortized dynamic cell probe lower bounds from four party communication"
    - "faster online matrix vector multiplication"
    - "new unconditional hardness results for dynamic and online problems"
    - "logarithmic lower bounds in the cell probe model"

Connected through hyperedge HE-4 (induced by source paper "amortized dynamic cell probe lower bounds from four party communication"):
  with members:
    - "new unconditional hardness results for dynamic and online problems"
    - "cell probe bounds for online edit distance and other pattern matching problems"
    - "on arthur merlin games in communication complexity"
    - "the cell probe complexity of dynamic range counting"
    - "lower bounds on near neighbor search via metric expansion"
    - "logarithmic lower bounds in the cell probe model"

Connected through hyperedge HE-5 (induced by source paper "faster online matrix vector multiplication"):
  with members:
    - "unifying and strengthening hardness for dynamic problems via the online matrix vector multiplication conjecture"
    - "new unconditional hardness results for dynamic and online problems"
    - "the cell probe complexity of dynamic range counting"
    - "logarithmic lower bounds in the cell probe model"

Connected through hyperedge HE-6 (induced by source paper "higher lower bounds from the 3sum conjecture"):
  with members:
    - "improved bounds for 3sum k sum and linear degeneracy"
    - "clustered integer 3sum via additive combinatorics"
    - "threesomes degenerates and love triangles"
    - "dynamic set intersection"
    - "popular conjectures imply strong lower bounds for dynamic problems"
    - "on hardness of jumbled indexing"
    - "faster all pairs shortest paths via circuit complexity"
    - "orienting fully dynamic graphs with worst case time bounds"

Question: Please tell me which class the center node 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)