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: "asynchronous deterministic rendezvous in bounded terrains"
  Abstract: Two mobile agents (robots) have to meet in an a priori unknown bounded terrain modeled as a polygon, possibly with polygonal obstacles. Robots are modeled as points, and each of them is equipped with a compass. Compasses of robots may be incoherent. Robots construct their routes, but the actual walk of each robot is decided by the adversary that may, e.g., speed up or slow down the robot. We consider several scenarios, depending on three factors: (1) obstacles in the terrain are present, or not, (2) compasses of both robots agree, or not, (3) robots have or do not have a map of the terrain with their positions marked. The cost of a rendezvous algorithm is the worst-case sum of lengths of the robots' trajectories until their meeting. For each scenario we design a deterministic rendezvous algorithm and analyze its cost. We also prove lower bounds on the cost of any deterministic rendezvous algorithm in each case. For all scenarios these bounds are tight.

Connected through hyperedge HE-1 (induced by source paper "positional encoding by robots with non rigid movements"):
  with members:
    - "arbitrary pattern formation on infinite grid by asynchronous oblivious robots"
    - "meeting in a polygon by anonymous oblivious robots"
    - "asynchronous arbitrary pattern formation the effects of a rigorous approach"
    - "getting close without touching near gathering for autonomous mobile robots"
    - "perspective simple agents learn to find their way an introduction on mapping polygons"
    - "a distributed algorithm for gathering many fat mobile robots in the plane"
    - "how to meet asynchronously almost everywhere"

Connected through hyperedge HE-2 (induced by source paper "multi robot symmetric rendezvous search on the line with an unknown initial distance"):
  with members:
    - "how to meet asynchronously at polynomial cost"
    - "how to meet asynchronously almost everywhere"

Connected through hyperedge HE-3 (induced by source paper "self stabilizing meeting in a polygon by anonymous oblivious robots"):
  with members:
    - "meeting in a polygon by anonymous oblivious robots"
    - "asynchronous approach in the plane a deterministic polynomial algorithm"
    - "mutual visibility by luminous robots without collisions"
    - "getting close without touching near gathering for autonomous mobile robots"
    - "distributed computing by mobile robots uniform circle formation"
    - "perspective simple agents learn to find their way an introduction on mapping polygons"
    - "how to meet asynchronously at polynomial cost"
    - "how to meet asynchronously almost everywhere"

Connected through hyperedge HE-4 (induced by source paper "meeting in a polygon by anonymous oblivious robots"):
  with members:
    - "asynchronous approach in the plane a deterministic polynomial algorithm"
    - "mutual visibility by luminous robots without collisions"
    - "getting close without touching near gathering for autonomous mobile robots"
    - "distributed computing by mobile robots uniform circle formation"
    - "how to meet asynchronously at polynomial cost"
    - "how to meet asynchronously almost everywhere"

Connected through hyperedge HE-5 (induced by source paper "revisiting the problem of searching on a line"):
  with members:
    - "anonymous meeting in networks"

Connected through hyperedge HE-6 (induced by source paper "fast rendezvous on a cycle by agents with different speeds"):
  with members:
    - "toward more localized local algorithms removing assumptions concerning global knowledge"
    - "an optimal self stabilizing firing squad"

Connected through hyperedge HE-7 (induced by source paper "rendezvous of agents with different speeds"):
  with members:
    - "toward more localized local algorithms removing assumptions concerning global knowledge"
    - "an optimal self stabilizing firing squad"

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)