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: "fast two robot disk evacuation with wireless communication"
  Abstract: In the fast evacuation problem, we study the path planning problem for two robots who want to minimize the worst-case evacuation time on the unit disk. The robots are initially placed at the center of the disk. In order to evacuate, they need to reach an unknown point, the exit, on the boundary of the disk. Once one of the robots finds the exit, it will instantaneously notify the other agent, who will make a beeline to it. #R##N#The problem has been studied for robots with the same speed~\cite{s1}. We study a more general case where one robot has speed $1$ and the other has speed $s \geq 1$. We provide optimal evacuation strategies in the case that $s \geq c_{2.75} \approx 2.75$ by showing matching upper and lower bounds on the worst-case evacuation time. For $1\leq s < c_{2.75}$, we show (non-matching) upper and lower bounds on the evacuation time with a ratio less than $1.22$. Moreover, we demonstrate that a generalization of the two-robot search strategy from~\cite{s1} is outperformed by our proposed strategies for any $s \geq c_{1.71} \approx 1.71$.

Connected through hyperedge HE-1 (induced by source paper "probabilistically faulty searching on a half line"):
  with members:
    - "energy consumption of group search on a line"
    - "average case worst case tradeoffs for evacuating 2 robots from the disk in the face to face model"
    - "linear search with terrain dependent speeds"
    - "search and fetch with 2 robots on a disk wireless and face to face communication models"
    - "further connections between contract scheduling and ray searching problems"
    - "collaborative search on the plane without communication"
    - "online searching with turn cost"

Connected through hyperedge HE-2 (induced by source paper "energy consumption of group search on a line"):
  with members:
    - "average case worst case tradeoffs for evacuating 2 robots from the disk in the face to face model"
    - "god save the queen"
    - "priority evacuation from a disk using mobile robots"
    - "linear search with terrain dependent speeds"
    - "search on a line by byzantine robots"
    - "search and fetch with 2 robots on a disk wireless and face to face communication models"
    - "evacuating robots from a disk using face to face communication"
    - "online searching with turn cost"

Connected through hyperedge HE-3 (induced by source paper "evacuating two robots from a disk a second cut"):
  with members:
    - "god save the queen"
    - "priority evacuation from a disk using mobile robots"
    - "the ants problem"
    - "a quasi polynomial time partition oracle for graphs with an excluded minor"

Connected through hyperedge HE-4 (induced by source paper "priority evacuation from a disk using mobile robots"):
  with members:
    - "god save the queen"
    - "search and fetch with 2 robots on a disk wireless and face to face communication models"
    - "revisiting the problem of searching on a line"
    - "fast rendezvous on a cycle by agents with different speeds"
    - "online searching with turn cost"

Connected through hyperedge HE-5 (induced by source paper "god save the queen"):
  with members:
    - "priority evacuation from a disk using mobile robots"

Connected through hyperedge HE-6 (induced by source paper "search and fetch with 2 robots on a disk wireless and face to face communication models"):
  with members:
    - "evacuating robots from a disk using face to face communication"
    - "evacuation of rectilinear polygons"
    - "online searching with turn cost"
    - "optimal constructions of hybrid algorithms"

Connected through hyperedge HE-7 (induced by source paper "evacuating robots from a disk using face to face communication"):
  with members:
    - "search and fetch with 2 robots on a disk wireless and face to face communication models"
    - "trade offs between selection complexity and performance when searching the plane without communication"

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.DC(Distributed, Parallel, and Cluster Computing)