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 "compressed dynamic range majority data structures"):
  Abstract: In the range $\alpha$-majority query problem, we preprocess a given sequence $S[1..n]$ for a fixed threshold $\alpha \in (0, 1]$, such that given a query range $[i..j]$, the symbols that occur more than $\alpha (j-i+1)$ times in $S[i..j]$ can be reported efficiently. We design the first compressed solution to this problem in dynamic settings. Our data structure represents $S$ using $nH_k+ o(n\lg \sigma)$ bits for any $k = o(\log_{\sigma} n)$, where $\sigma$ is the alphabet size and $H_k$ is the $k$-th order empirical entropy of $S$. It answers range $\alpha$-majority queries in $O(\frac{\lg n}{\alpha \lg\lg n})$ time, and supports insertions and deletions in $O(\frac{\lg n}{\alpha})$ amortized time. The best previous solution (Elmasry et al., 2016) has the same query and update times, but uses $O(n)$ words.

Includes members:
  Member "range majorities and minorities in arrays":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "compressed dynamic range majority and minority data structures")
  Member "compressed data structures for dynamic sequences":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "local decode and update for big data compression")
  Member "dynamic range majority data structures":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "compressed dynamic range majority and minority data structures")
  Member "searching for frequent colors in rectangles":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "compressed dynamic range majority and minority data structures")

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)