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 "c planarity of embedded cyclic c graphs"):
  Abstract: We show that c-planarity is solvable in quadratic time for flat clustered graphs with three clusters if the combinatorial embedding of the underlying graph is fixed. In simpler graph-theoretical terms our result can be viewed as follows. Given a graph $G$ with the vertex set partitioned into three parts embedded on a 2-sphere, our algorithm decides if we can augment $G$ by adding edges without creating an edge-crossing so that in the resulting spherical graph the vertices of each part induce a connected sub-graph. We proceed by a reduction to the problem of testing the existence of a perfect matching in planar bipartite graphs. We formulate our result in a slightly more general setting of cyclic clustered graphs, i.e., the simple graph obtained by contracting each cluster, where we disregard loops and multi-edges, is a cycle.

Includes members:
  Member "clustered planarity with pipes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "c planarity testing of embedded clustered graphs with bounded dual carving width")
  Member "recognizing weakly simple polygons":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "minimum cuts in surface graphs")
  Member "testing cyclic level and simultaneous level planarity":
    also connected through other hyperedges:
      (none)
  Member "a new perspective on clustered planarity as a combinatorial embedding problem":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "c planarity testing of embedded clustered graphs with bounded dual carving width")
  Member "detecting weakly simple polygons":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "minimum cuts in surface graphs")
  Member "beyond level planarity":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "extending upward planar graph drawings")
  Member "powers of tensors and fast matrix multiplication":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "new algorithms and hardness for incremental single source shortest paths in directed graphs")
  Member "advances on testing c planarity of embedded flat clustered graphs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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)