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 "the complexity of drawing a graph in a polygonal region"):
  Abstract: We prove that the following problem is complete for the existential theory of the reals: Given a planar graph and a polygonal region, with some vertices of the graph assigned to points on the boundary of the region, place the remaining vertices to create a planar straight-line drawing of the graph inside the region. This strengthens an NP-hardness result by Patrignani on extending partial planar graph drawings. Our result is one of the first showing that a problem of drawing planar graphs with straight-line edges is hard for the existential theory of the reals. The complexity of the problem is open in the case of a simply connected region. #R##N#We also show that, even for integer input coordinates, it is possible that drawing a graph in a polygonal region requires some vertices to be placed at irrational coordinates. By contrast, the coordinates are known to be bounded in the special case of a convex region, or for drawing a path in any polygonal region.

Includes members:
  Member "the art gallery problem is exists mathbb r complete":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimal curve straightening is exists mathbb r complete")
  Member "forall exists mathbb r completeness and area universality":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the area universality of triangulations")
  Member "on the complexity of minimum link path problems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "global curve simplification")
  Member "irrational guards are sometimes needed":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the parameterized complexity of guarding almost convex polygons")
  Member "the galois complexity of graph drawing why numerical solutions are ubiquitous for force directed spectral and circle packing drawings":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "computing circle packing representations of planar graphs")
  Member "drawing partially embedded and simultaneously planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "beta stars or on extending a drawing of a connected subgraph")
  Member "intersection graphs of segments and exists mathbb r":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "computing exact solutions of consensus halving and the borsuk ulam theorem")
  Member "drawing graphs in the plane with a prescribed outer face and polynomial area":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "how to morph a tree on a small grid")

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.CC(Computational Complexity)