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 annotated bibliography on 1 planarity"):
  Abstract: Abstract   The notion of 1-planarity is among the most natural and most studied generalizations of graph planarity. A graph is 1-planar if it has an embedding where each edge is crossed by at most another edge. The study of 1-planar graphs dates back to more than fifty years ago and, recently, it has driven increasing attention in the areas of graph theory, graph algorithms, graph drawing, and computational geometry. This annotated bibliography aims to provide a guiding reference to researchers who want to have an overview of the large body of literature about 1-planar graphs. It reviews the current literature covering various research streams about 1-planarity, such as characterization and recognition, combinatorial properties, and geometric representations. As an additional contribution, we offer a list of open problems on 1-planar graphs.

Includes members:
  Member "parameterized complexity of 1 planarity":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "an experimental study of a 1 planarity testing and embedding algorithm")
  Member "recognizing optimal 1 planar graphs in linear time":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fan crossing free graphs")
  Member "nic planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fan crossing free graphs")
  Member "new results on edge partitions of 1 plane graphs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a survey on graph drawing beyond planarity")
  Member "recognizing and drawing ic planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "fan crossing free graphs")
  Member "re embedding a 1 plane graph into a straight line drawing in linear time":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "an experimental study of a 1 planarity testing and embedding algorithm")
  Member "recognizing ic planar and nic planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a survey on graph drawing beyond planarity")
  Member "ortho polygon visibility representations of embedded graphs":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "an experimental study of a 1 planarity testing and embedding algorithm")

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.CG(Computational Geometry)