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 experimental study of a 1 planarity testing and embedding algorithm"):
  Abstract: The definition of $1$-planar graphs naturally extends graph planarity, namely a graph is $1$-planar if it can be drawn in the plane with at most one crossing per edge. Unfortunately, while testing graph planarity is solvable in linear time, deciding whether a graph is $1$-planar is NP-complete, even for restricted classes of graphs. Although several polynomial-time algorithms have been described for recognizing specific subfamilies of $1$-planar graphs, no implementations of general algorithms are available to date. We investigate the feasibility of a $1$-planarity testing and embedding algorithm based on a backtracking strategy. While the experiments show that our approach can be successfully applied to graphs with up to 30 vertices, they also suggest the need of more sophisticated techniques to attack larger graphs. Our contribution provides initial indications that may stimulate further research on the design of practical approaches for the $1$-planarity testing problem.

Includes members:
  Member "planar graphs have bounded queue number":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "adjacency labelling for planar graphs and beyond")
  Member "a survey on graph drawing beyond planarity":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fan crossing free graphs")
  Member "parameterized complexity of 1 planarity":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "sketched representations and orthogonal planarity of bounded treewidth graphs")
  Member "recognizing optimal 1 planar graphs in linear time":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fan crossing free graphs")
  Member "embedding preserving rectangle visibility representations of nonplanar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a survey on graph drawing beyond planarity")
  Member "an annotated bibliography on 1 planarity":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "fan crossing free graphs")
  Member "crossing patterns in nonplanar road networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the edge crossings of the greedy spanner")
  Member "re embedding a 1 plane graph into a straight line drawing in linear time":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "a survey on graph drawing beyond planarity")

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)