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: "orderly spanning trees with applications"
  Abstract: We introduce and study orderly spanning trees of plane graphs. This algorithmic tool generalizes canonical orderings, which exist only for triconnected plane graphs. Although not every plane graph admits an orderly spanning tree, we provide an algorithm to compute an orderly pair for any connected planar graph G, consisting of an embedded planar graph H isomorphic to G, and an orderly spanning tree of H. We also present several applications of orderly spanning trees: (1) a new constructive proof for Schnyder's realizer theorem, (2) the first algorithm for computing an area-optimal 2-visibility drawing of a planar graph, and (3) the most compact known encoding of a planar graph with O(1)-time query support. All algorithms in this paper run in linear time.

Connected through hyperedge HE-1 (induced by source paper "drawing planar graphs with few segments on a polynomial grid"):
  with members:
    - "drawing planar graphs with few geometric primitives"
    - "drawing graphs on few circles and few spheres"
    - "experimental analysis of the accessibility of drawings with few segments"
    - "optimal monotone drawings of trees"
    - "the complexity of drawing graphs on few lines and few planes"
    - "strongly monotone drawings of planar graphs"
    - "drawing graphs on few lines and few planes"
    - "on monotone drawings of trees"

Connected through hyperedge HE-2 (induced by source paper "monotone drawings of k inner planar graphs"):
  with members:
    - "simple compact monotone tree drawings"
    - "optimal monotone drawings of trees"
    - "on monotone drawings of trees"

Connected through hyperedge HE-3 (induced by source paper "fast and compact planar embeddings"):
  with members:
    - "dynamic data structures for document collections and graphs"
    - "layered label propagation a multiresolution coordinate free ordering for compressing social networks"
    - "fully functional static and dynamic succinct trees"
    - "succinct indexable dictionaries with applications to encoding k ary trees prefix sums and multisets"
    - "practical entropy compressed rank select dictionary"
    - "dynamic generators of topologically embedded graphs"
    - "compact encodings of planar graphs via canonical orderings and multiple parentheses"
    - "linear time succinct encodings of planar graphs via canonical orderings"

Connected through hyperedge HE-4 (induced by source paper "simple and efficient fully functional succinct trees"):
  with members:
    - "succinct representations of permutations and functions"
    - "fully functional static and dynamic succinct trees"
    - "practical entropy compressed rank select dictionary"

Connected through hyperedge HE-5 (induced by source paper "small area orthogonal drawings of 3 connected graphs"):
  with members:
    - "the mondshein sequence"
    - "mondshein sequences a k a 2 1 orders"

Connected through hyperedge HE-6 (induced by source paper "linear time compression of bounded genus graphs into information theoretically optimal number of bits"):
  with members:
    - "faster approximate distance queries and compact routing in sparse graphs"
    - "compact encodings of planar graphs via canonical orderings and multiple parentheses"
    - "linear time succinct encodings of planar graphs via canonical orderings"
    - "a fast general methodology for information theoretically optimal encodings of graphs"

Connected through hyperedge HE-7 (induced by source paper "succinct representation of labeled trees"):
  with members:
    - "new lower and upper bounds for representing sequences"
    - "succinct representations of permutations and functions"
    - "fully functional static and dynamic succinct trees"
    - "succinct indexable dictionaries with applications to encoding k ary trees prefix sums and multisets"

Connected through hyperedge HE-8 (induced by source paper "fully functional static and dynamic succinct trees"):
  with members:
    - "optimal dynamic sequence representations"
    - "lrm trees compressed indices adaptive sorting and compressed permutations"
    - "succinct representations of dynamic strings"
    - "optimal succinctness for range minimum queries"
    - "succinct indexable dictionaries with applications to encoding k ary trees prefix sums and multisets"
    - "logarithmic lower bounds in the cell probe model"

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)