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 "a polynomial bound for untangling geometric planar graphs"):
  Abstract: To untangle a geometric graph means to move some of the vertices so that the resulting geometric graph has no crossings. Pach and Tardos (Discrete Comput. Geom. 28(4): 585–592, 2002) asked if every n-vertex geometric planar graph can be untangled while keeping at least n e vertices fixed. We answer this question in the affirmative with e=1/4. The previous best known bound was $\Omega(\sqrt{\log n/\log\log n})$. We also consider untangling geometric trees. It is known that every n-vertex geometric tree can be untangled while keeping at least $\Omega(\sqrt{n})$vertices fixed, while the best upper bound was $\mathcal{O}((n\log n)^{2/3})$. We answer a question of Spillner and Wolff (http://arxiv.org/abs/0709.0170) by closing this gap for untangling trees. In particular, we show that for infinitely many values of n, there is an n-vertex geometric tree that cannot be untangled while keeping more than $3(\sqrt{n}-1)$vertices fixed.

Includes members:
  Member "untangling polygons and graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "drawing planar graphs with many collinear vertices")
  Member "on collinear sets in straight line drawings":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "cubic planar graphs that cannot be drawn on few lines")
  Member "on the obfuscation complexity of planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "geometry and generation of a new graph planarity game")
  Member "moving vertices to make drawings plane":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "geometry and generation of a new graph planarity game")

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)