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 "drawing arrangement graphs in small grids or how to play planarity"):
  Abstract: We describe a linear-time algorithm that finds a planar drawing of every graph of a simple line or pseudoline arrangement within a grid of area O(n^{7/6}). No known input causes our algorithm to use area \Omega(n^{1+\epsilon}) for any \epsilon>0; finding such an input would represent significant progress on the famous k-set problem from discrete geometry. Drawing line arrangement graphs is the main task in the Planarity puzzle.

Includes members:
  Member "superpatterns and universal point sets":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the utility of untangling")
  Member "universal point sets for planar three tree":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "superpatterns and universal point sets")
  Member "untangling polygons and graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "drawing planar graphs with many collinear vertices")
  Member "untangling a planar graph":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "geometry and generation of a new graph planarity game")
  Member "a polynomial bound for untangling geometric planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "geometry and generation of a new graph planarity game")
  Member "on the obfuscation complexity of planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "geometry and generation of a new graph planarity game")
  Member "algorithms for drawing media":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "convex arc drawings of pseudolines")

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)