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: "ordered level planarity geodesic planarity and bi monotonicity"
  Abstract: We introduce and study the problem Ordered Level Planarity which asks for a planar drawing of a graph such that vertices are placed at prescribed positions in the plane and such that every edge is realized as a y-monotone curve. This can be interpreted as a variant of Level Planarity in which the vertices on each level appear in a prescribed total order. We establish a complexity dichotomy with respect to both the maximum degree and the level-width, that is, the maximum number of vertices that share a level. Our study of Ordered Level Planarity is motivated by connections to several other graph drawing problems.

Connected through hyperedge HE-1 (induced by source paper "extending upward planar graph drawings"):
  with members:
    - "upward book embeddings of st graphs"
    - "upward planar morphs"
    - "windrose planarity embedding graphs with direction constrained edges"
    - "planar l drawings of directed graphs"
    - "the partial visibility representation extension problem"
    - "beyond level planarity"
    - "extending partial representations of circle graphs"
    - "extending partial representations of subclasses of chordal graphs"

Connected through hyperedge HE-2 (induced by source paper "computing k modal embeddings of planar digraphs"):
  with members:
    - "windrose planarity embedding graphs with direction constrained edges"
    - "turning cliques into paths to achieve planarity"
    - "nodetrix planarity testing with small clusters"
    - "planar l drawings of directed graphs"
    - "computing nodetrix representations of clustered graphs"
    - "beyond level planarity"

Connected through hyperedge HE-3 (induced by source paper "windrose planarity embedding graphs with direction constrained edges"):
  with members:
    - "bitonic st orderings for upward planar graphs"
    - "advances on testing c planarity of embedded flat clustered graphs"
    - "relaxing the constraints of clustered planarity"
    - "multiple source multiple sink maximum flow in directed planar graphs in near linear time"

Connected through hyperedge HE-4 (induced by source paper "multilevel planarity"):
  with members:
    - "beyond level planarity"
    - "a kuratowski type theorem for planarity of partially embedded graphs"

Connected through hyperedge HE-5 (induced by source paper "level planarity transitivity vs even crossings"):
  with members:
    - "beyond level planarity"

Connected through hyperedge HE-6 (induced by source paper "non crossing paths with geographic constraints"):
  with members:
    - "non crossing connectors in the plane"
    - "the problem of compatible representatives"

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)