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 "an optimal ancestry labeling scheme with applications to xml trees and universal posets"):
  Abstract: In this article, we solve the ancestry-labeling scheme problem, which aims at assigning the shortest possible labels (bit strings) to nodes of rooted trees, so ancestry queries between any two nodes can be answered by inspecting their assigned labels only. This problem was introduced more than 20 years ago by Kannan et al. [1988] and is among the most well-studied problems in the field of informative labeling schemes. We construct an ancestry-labeling scheme for n-node trees with label size log 2n + O(log log n) bits, thus matching the log 2n + Ω(log log n) bits lower bound given by Alstrup et al. [2003]. Our scheme is based on a simplified ancestry scheme that operates extremely well on a restricted set of trees. In particular, for the set of n-node trees with a depth of at most d, the simplified ancestry scheme enjoys label size of log 2n + 2log2d + O(1) bits. Since the depth of most XML trees is at most some small constant, such an ancestry scheme may be of practical use. In addition, we also obtain an adjacency-labeling scheme that labels n-node trees of depth d with labels of size log 2n + 3log 2d + O(1) bits. All our schemes assign the labels in linear time, and guarantee that any query can be answered in constant time.   Finally, our ancestry scheme finds applications to the construction of small universal partially ordered sets (posets). Specifically, for any fixed integer k, it enables the construction of a universal poset of size O(nk) for the family of n-element posets with a tree dimension of at most k. Up to lower-order terms, this bound is tight thanks to a lower bound of nk − o(1) by to Alon and Scheinerman [1988].

Includes members:
  Member "optimal induced universal graphs and adjacency labeling for trees":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "shorter labels for routing in trees")
  Member "improved ancestry labeling scheme for trees":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "dynamic and multi functional labeling schemes")
  Member "a simple and optimal ancestry labeling scheme for trees":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "shorter labels for routing in trees")
  Member "adjacency labeling schemes and induced universal graphs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "shorter labels for routing in trees")
  Member "near optimal labeling schemes for nearest common ancestors":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "shorter labels for routing in trees")
  Member "labeling schemes for bounded degree graphs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "adjacency labelling for planar graphs and beyond")

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)