human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "clustered planarity testing revisited"
  Abstract: The Hanani--Tutte theorem is a classical result proved for the first time in the 1930s that characterizes planar graphs as graphs that admit a drawing in the plane in which every pair of edges not sharing a vertex cross an even number of times. We generalize this result to clustered graphs with two disjoint clusters, and show that a straightforward extension to flat clustered graphs with three or more disjoint clusters is not possible. For general clustered graphs we show a variant of the Hanani--Tutte theorem in the case when each cluster induces a connected subgraph. Di Battista and Frati proved that clustered planarity of embedded clustered graphs whose every face is incident with at most five vertices can be tested in polynomial time. We give a new and short proof of this result, using the matroid intersection algorithm.

Connected through hyperedge HE-1 (induced by source paper "c planarity testing of embedded clustered graphs with bounded dual carving width"):
  with members:
    - "atomic embeddability clustered planarity and thickenability"
    - "clustered planarity flat clustered planarity"
    - "subexponential time and fpt algorithms for embedded flat clustered planarity"
    - "embedded width a variant of treewidth for plane graphs"
    - "recognizing weak embeddings of graphs"
    - "hanani tutte for approximating maps of graphs"
    - "clustered planarity with pipes"
    - "computing nodetrix representations of clustered graphs"

Connected through hyperedge HE-2 (induced by source paper "atomic embeddability clustered planarity and thickenability"):
  with members:
    - "recognizing weak embeddings of graphs"
    - "hanani tutte for approximating maps of graphs"
    - "clustered planarity with pipes"
    - "recognizing weakly simple polygons"
    - "detecting weakly simple polygons"
    - "simultaneous embedding edge orderings relative positions cutvertices"
    - "simultaneous embedding of planar graphs"
    - "simultaneous pq ordering with applications to constrained embedding problems"

Connected through hyperedge HE-3 (induced by source paper "clustered planarity flat clustered planarity"):
  with members:
    - "subexponential time and fpt algorithms for embedded flat clustered planarity"
    - "nodetrix planarity testing with small clusters"
    - "recognizing weak embeddings of graphs"
    - "hanani tutte for approximating maps of graphs"
    - "c planarity of embedded cyclic c graphs"
    - "clustered planarity with pipes"
    - "computing nodetrix representations of clustered graphs"
    - "embedding graphs into embedded graphs"

Connected through hyperedge HE-4 (induced by source paper "subexponential time and fpt algorithms for embedded flat clustered planarity"):
  with members:
    - "crossing minimization for 1 page and 2 page drawings of graphs with bounded treewidth"
    - "embedded width a variant of treewidth for plane graphs"
    - "recognizing weak embeddings of graphs"
    - "c planarity of embedded cyclic c graphs"
    - "clustered planarity with pipes"
    - "a new perspective on clustered planarity as a combinatorial embedding problem"
    - "advances on testing c planarity of embedded flat clustered graphs"
    - "relaxing the constraints of clustered planarity"

Connected through hyperedge HE-5 (induced by source paper "hanani tutte for approximating maps of graphs"):
  with members:
    - "recognizing weak embeddings of graphs"
    - "bounded embeddings of graphs in the plane"
    - "clustered planarity with pipes"
    - "embedding graphs into embedded graphs"
    - "detecting weakly simple polygons"
    - "powers of tensors and fast matrix multiplication"
    - "toward the hanani tutte theorem for clustered graphs"
    - "simultaneous pq ordering with applications to constrained embedding problems"

Connected through hyperedge HE-6 (induced by source paper "c planarity of embedded cyclic c graphs"):
  with members:
    - "clustered planarity with pipes"
    - "recognizing weakly simple polygons"
    - "testing cyclic level and simultaneous level planarity"
    - "a new perspective on clustered planarity as a combinatorial embedding problem"
    - "detecting weakly simple polygons"
    - "beyond level planarity"
    - "powers of tensors and fast matrix multiplication"
    - "advances on testing c planarity of embedded flat clustered graphs"

Connected through hyperedge HE-7 (induced by source paper "hanani tutte for radial planarity ii"):
  with members:
    - "bounded embeddings of graphs in the plane"
    - "beyond level planarity"
    - "toward the hanani tutte theorem for clustered graphs"
    - "simultaneous pq ordering with applications to constrained embedding problems"

Connected through hyperedge HE-8 (induced by source paper "toward the hanani tutte theorem for clustered graphs"):
  with members:
    - "simultaneous pq ordering with applications to constrained embedding problems"

Question: Please tell me which class the center node 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)