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 "on the relationship between k planar and k quasi planar graphs"):
  Abstract: A graph is $k$-planar $(k \geq 1)$ if it can be drawn in the plane such that no edge is crossed more than $k$ times. A graph is $k$-quasi planar $(k \geq 2)$ if it can be drawn in the plane with no $k$ pairwise crossing edges. The families of $k$-planar and $k$-quasi planar graphs have been widely studied in the literature, and several bounds have been proven on their edge density. Nonetheless, only trivial results are known about the relationship between these two graph families. In this paper we prove that, for $k \geq 3$, every $k$-planar graph is $(k+1)$-quasi planar.

Includes members:
  Member "on optimal 2 and 3 planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "book embeddings of nonplanar graphs with small faces in few pages")
  Member "two planar graphs are quasiplanar":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "simple k planar graphs are simple k 1 quasiplanar")
  Member "on the density of non simple 3 planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "simple k planar graphs are simple k 1 quasiplanar")
  Member "recognizing and drawing ic planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fan crossing free graphs")
  Member "on the recognition of fan planar and maximal outer fan planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "fan crossing free graphs")
  Member "the density of fan planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "fan crossing free graphs")
  Member "on the number of edges of fan crossing free graphs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "efficient generation of different topological representations of graphs beyond planarity")
  Member "relaxing the constraints of clustered planarity":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "c planarity testing of embedded clustered graphs with bounded dual carving width")

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)