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 "succinct data structure for nearest colored node in a tree"):
  Abstract: We give a succinct data-structure that stores a tree with color for each node, and allows finding, given a node x and a color alpha, the nearest node to x with color alpha. This results improves the O(n log n)-bits structure of Gawrychowski et al.~[CPM 2016].

Includes members:
  Member "efficient vertex label distance oracles for planar graphs":
    also connected through other hyperedges:
      (none)
  Member "compressed subsequence matching and packed tree coloring":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "balancing straight line programs")
  Member "succinct representation of labeled trees":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "succinct data structure for dynamic trees with faster queries")
  Member "the power of dynamic distance oracles efficient dynamic algorithms for the steiner tree":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "online minimum cost matching on the line with recourse")
  Member "new lower and upper bounds for representing sequences":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "run compressed rank select for large alphabets")
  Member "improved distance oracles and spanners for vertex labeled graphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "conditional lower bounds for space time tradeoffs")
  Member "optimal succinctness for range minimum queries":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "space efficient construction of lyndon arrays in linear time")

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)