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: "simultaneous embedding of a planar graph and its dual on the grid"
  Abstract: Traditional representations of graphs and their duals suggest the requirement that the dual vertices be placed inside their corresponding primal faces, and the edges of the dual graph cross only their corresponding primal edges. We consider the problem of simultaneously embedding a planar graph and its dual into a small integer grid such that the edges are drawn as straight-line segments and the only crossings are between primal-dual pairs of edges. We provide a linear-time algorithm that simultaneously embeds a 3-connected planar graph and its dual on a (2n-2) by (2n-2) integer grid, where n is the total number of vertices in the graph and its dual. Furthermore our embedding algorithm satisfies the two natural requirements mentioned above.

Connected through hyperedge HE-1 (induced by source paper "an annotated bibliography on 1 planarity"):
  with members:
    - "parameterized complexity of 1 planarity"
    - "recognizing optimal 1 planar graphs in linear time"
    - "nic planar graphs"
    - "new results on edge partitions of 1 plane graphs"
    - "recognizing and drawing ic planar graphs"
    - "re embedding a 1 plane graph into a straight line drawing in linear time"
    - "recognizing ic planar and nic planar graphs"
    - "ortho polygon visibility representations of embedded graphs"

Connected through hyperedge HE-2 (induced by source paper "simultaneous drawing of planar graphs with right angle crossings and few bends"):
  with members:
    - "simultaneous embedding edge orderings relative positions cutvertices"
    - "two page book embeddings of 4 planar graphs"
    - "simultaneous embedding of planar graphs"
    - "testing simultaneous planarity when the common graph is 2 connected"
    - "on a tree and a path with no geometric simultaneous embedding"

Connected through hyperedge HE-3 (induced by source paper "simultaneous straight line drawing of a planar graph and its rectangular dual"):
  with members:
    - "simultaneous embedding of planar graphs"
    - "optimal polygonal representation of planar graphs"

Connected through hyperedge HE-4 (induced by source paper "drawing partially embedded and simultaneously planar graphs"):
  with members:
    - "simultaneous embeddings with few bends and crossings"
    - "adding one edge to planar graphs makes crossing number and 1 planarity hard"
    - "a kuratowski type theorem for planarity of partially embedded graphs"
    - "testing simultaneous planarity when the common graph is 2 connected"

Connected through hyperedge HE-5 (induced by source paper "1 visibility representations of 1 planar graphs"):
  with members:
    - "bar 1 visibility graphs and their relation to other nearly planar graphs"
    - "bar 1 visibility drawings of 1 planar graphs"

Connected through hyperedge HE-6 (induced by source paper "simultaneous embedding of planar graphs"):
  with members:
    - "extending partial representations of interval graphs"
    - "disconnectivity and relative positions in simultaneous embeddings"
    - "a kuratowski type theorem for planarity of partially embedded graphs"
    - "simultaneous pq ordering with applications to constrained embedding problems"
    - "testing simultaneous planarity when the common graph is 2 connected"
    - "simultaneous interval graphs"
    - "on a tree and a path with no geometric simultaneous embedding"
    - "the geometric thickness of low degree graphs"

Connected through hyperedge HE-7 (induced by source paper "embedding the dual complex of hyper rectangular partitions"):
  with members:
    - "regular labelings and geometric structures"
    - "compact floor planning via orderly spanning trees"

Connected through hyperedge HE-8 (induced by source paper "delta confluent drawings"):
  with members:
    - "confluent layered drawings"
    - "the geometric thickness of low degree graphs"
    - "on simultaneous graph embedding"
    - "confluent drawings visualizing non planar diagrams in a planar way"

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)