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: "toward the hanani tutte theorem for clustered graphs"
  Abstract: The weak variant of Hanani-Tutte theorem says that a graph is planar, if it can be drawn in the plane so that every pair of edges cross an even number of times. Moreover, we can turn such a drawing into an embedding without changing the order in which edges leave the vertices. We prove a generalization of the weak Hanani-Tutte theorem that also easily implies the monotone variant of the weak Hanani-Tutte theorem by Pach and T\'oth. Thus, our result can be thought of as a common generalization of these two neat results. In other words, we prove the weak Hanani-Tutte theorem for strip clustered graphs, whose clusters are linearly ordered vertical strips in the plane and edges join only vertices in the same cluster or in neighboring clusters with respect to this order. In order to prove our main result we first obtain a forbidden substructure characterization of embedded strip clustered planar graphs. #R##N#The Hanani-Tutte theorem says that a graph is planar, if it can be drawn in the plane so that every pair of edges not sharing a vertex cross an even number of times. We prove the variant of Hanani-Tutte theorem for strip clustered graphs if the underlying abstract graph is three connected or a tree. In the case of trees our result implies that c-planarity for flat clustered graphs with three clusters is solvable in a polynomial time if the underlying abstract graph is a tree. The proof of the latter result combines our forbidden substructure characterization of embedded strip clustered planar graphs with Tucker's characterization of 0-1 matrices with consecutive ones property.

Connected through hyperedge HE-1 (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"
    - "clustered planarity testing revisited"
    - "simultaneous pq ordering with applications to constrained embedding problems"

Connected through hyperedge HE-2 (induced by source paper "clustered planarity with pipes"):
  with members:
    - "subexponential time and fpt algorithms for embedded flat clustered planarity"
    - "recognizing weak embeddings of graphs"
    - "hanani tutte for approximating maps of graphs"
    - "c planarity of embedded cyclic c graphs"
    - "embedding graphs into embedded graphs"
    - "a new perspective on clustered planarity as a combinatorial embedding problem"
    - "detecting weakly simple polygons"
    - "advancements on sefe and partitioned book embedding problems"

Connected through hyperedge HE-3 (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-4 (induced by source paper "bounded embeddings of graphs in the plane"):
  with members:
    - "windrose planarity embedding graphs with direction constrained edges"
    - "c planarity of embedded cyclic c graphs"
    - "detecting weakly simple polygons"
    - "simultaneous pq ordering with applications to constrained embedding problems"

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

Connected through hyperedge HE-6 (induced by source paper "clustered planarity testing revisited"):
  with members:
    - "powers of tensors and fast matrix multiplication"
    - "efficient c planarity testing algebraically"

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)