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 "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.

Includes members:
  Member "linear time compression of bounded genus graphs into information theoretically optimal number of bits":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "survey and taxonomy of lossless graph compression and space efficient graph representations")
  Member "improved compact visibility representation of planar graph via schnyder s realizer":
    also connected through other hyperedges:
      (none)
  Member "compact floor planning via orderly spanning trees":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the flip diameter of rectangulations and convex subdivisions")
  Member "compact encodings of planar graphs via canonical orderings and multiple parentheses":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "survey and taxonomy of lossless graph compression and space efficient graph representations")
  Member "linear time succinct encodings of planar graphs via canonical orderings":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "survey and taxonomy of lossless graph compression and space efficient graph representations")
  Member "a fast general methodology for information theoretically optimal encodings of graphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "dynamic discovery of type classes and relations in semantic web data")

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)