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 "hierarchical partial planarity"):
  Abstract: In this paper we consider graphs whose edges are associated with a degree of {\em importance}, which may depend on the type of connections they represent or on how recently they appeared in the scene, in a streaming setting. The goal is to construct layouts of these graphs in which the readability of an edge is proportional to its importance, that is, more important edges have fewer crossings. We formalize this problem and study the case in which there exist three different degrees of importance. We give a polynomial-time testing algorithm when the graph induced by the two most important sets of edges is biconnected. We also discuss interesting relationships with other constrained-planarity problems.

Includes members:
  Member "simultaneous orthogonal planarity":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "level planar drawings with few slopes")
  Member "simultaneous drawing of planar graphs with right angle crossings and few bends":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the quasefe problem")
  Member "planarity of streamed graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "graph stories in small area")
  Member "drawing partially embedded and simultaneously planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the complexity of drawing a graph in a polygonal region")
  Member "streamed graph drawing and the file maintenance problem":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "graph stories in small area")
  Member "advancements on sefe and partitioned book embedding problems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "upward book embeddings of st graphs")
  Member "picking planar edges or drawing a graph with a planar subgraph":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "graph stories in small area")
  Member "algorithms and bounds for drawing non planar graphs with crossing free subgraphs":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "planarity of streamed graphs")

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)