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 "planar drawings of fixed mobile bigraphs"):
  Abstract: A fixed-mobile bigraph G is a bipartite graph such that the vertices of one partition set are given with fixed positions in the plane and the mobile vertices of the other part, together with the edges, must be added to the drawing. We assume that G is planar and study the problem of finding, for a given k >= 0, a planar poly-line drawing of G with at most k bends per edge. In the most general case, we show NP-hardness. For k=0 and under additional constraints on the positions of the fixed or mobile vertices, we either prove that the problem is polynomial-time solvable or prove that it belongs to NP. Finally, we present a polynomial-time testing algorithm for a certain type of "layered" 1-bend drawings.

Includes members:
  Member "multi sided boundary labeling":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "external labeling techniques a taxonomy and survey")
  Member "on the readability of boundary labeling":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "exploring the limits of complexity a survey of empirical studies on graph visualisation")
  Member "many to one boundary labeling with backbones":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "external labeling techniques a taxonomy and survey")
  Member "drawing graphs in the plane with a prescribed outer face and polynomial area":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "how to morph a tree on a small grid")
  Member "untangling a planar graph":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "geometry and generation of a new graph planarity game")
  Member "planar drawings of higher genus graphs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "drawing planar graphs with a prescribed inner face")

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)