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: "probing convex polygons with a wedge"
  Abstract: Abstract   Minimizing the number of probes is one of the main challenges in reconstructing geometric objects with probing devices. In this paper, we investigate the problem of using an ω-wedge probing tool to determine the exact shape and orientation of a convex polygon. An ω-wedge consists of two rays emanating from a point called the apex of the wedge and the two rays forming an angle ω. To probe with an ω-wedge, we set the direction that the apex of the probe has to follow, the line      L    →     , and the initial orientation of the two rays. A valid ω-probe of a convex polygon    O    contains    O    within the ω-wedge and its outcome consists of the coordinates of the apex, the orientation of both rays and the coordinates of the closest (to the apex) points of contact between    O    and each of the rays.  We present algorithms minimizing the number of probes and prove their optimality. In particular, we show how to reconstruct a convex n-gon (with all internal angles of size larger than ω) using    2  n  −  2    ω-probes; if    ω  =  π  /  2   , the reconstruction uses    2  n  −  3    ω-probes. We show that both results are optimal. Let      N    B      be the number of vertices of    O    whose internal angle is at most ω, (we show that    0  ≤    N    B    ≤  3   ). We determine the shape and orientation of a general convex n-gon with      N    B    =  1    (respectively      N    B    =  2   ,      N    B    =  3   ) using    2  n  −  1    (respectively    2  n  +  3   ,    2  n  +  5   ) ω-probes. We prove optimality for the first case. Assuming the algorithm knows the value of      N    B      in advance, the reconstruction of    O    with      N    B    =  2    or      N    B    =  3    can be achieved with    2  n  +  2    probes,- which is optimal.

Connected through hyperedge HE-1 (induced by source paper "reconstructing a convex polygon from its omega cloud"):
  with members:
    - "highway hull revisited"

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)