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: "priority evacuation from a disk using mobile robots"
  Abstract: We introduce and study a new search-type problem with ($n+1$)-robots on a disk. The searchers (robots) all start from the center of the disk, have unit speed, and can communicate wirelessly. The goal is for a distinguished robot (the queen) to reach and evacuate from an exit that is hidden on the perimeter of the disk in as little time as possible. The remaining $n$ robots (servants) are there to facilitate the queen's objective and are not required to reach the hidden exit. We provide upper and lower bounds for the time required to evacuate the queen from a unit disk. Namely, we propose an algorithm specifying the trajectories of the robots which guarantees evacuation of the queen in time always better than $2 + 4(\sqrt{2}-1) \frac{\pi}{n}$ for $n \geq 4$ servants. We also demonstrate that for $n \geq 4$ servants the queen cannot be evacuated in time less than $2+\frac{\pi}{n}+\frac{2}{n^2}$.

Connected through hyperedge HE-1 (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"
    - "linear search with terrain dependent speeds"
    - "search on a line by byzantine robots"
    - "fast two robot disk evacuation with wireless communication"
    - "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-2 (induced by source paper "time energy tradeoffs for evacuation by two robots in the wireless model"):
  with members:
    - "average case worst case tradeoffs for evacuating 2 robots from the disk in the face to face model"
    - "god save the queen"
    - "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 "chauffeuring a crashed robot from a disk"):
  with members:
    - "evacuating two robots from a disk a second cut"
    - "average case worst case tradeoffs for evacuating 2 robots from the disk in the face to face model"
    - "god save the queen"
    - "lower bounds for searching robots some faulty"
    - "search on a line by byzantine robots"

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

Connected through hyperedge HE-5 (induced by source paper "average case worst case tradeoffs for evacuating 2 robots from the disk in the face to face model"):
  with members:
    - "god save the queen"
    - "search on a line by byzantine robots"
    - "searching with advice robot fence jumping"
    - "search and fetch with 2 robots on a disk wireless and face to face communication models"
    - "evacuation of rectilinear polygons"

Connected through hyperedge HE-6 (induced by source paper "evacuating equilateral triangles and squares in the face to face model"):
  with members:
    - "god save the queen"
    - "evacuating robots from a disk using face to face communication"
    - "trade offs between selection complexity and performance when searching the plane without communication"
    - "collaborative search on the plane without communication"

Connected through hyperedge HE-7 (induced by source paper "god save the queen"):
  with members:
    - "fast two robot disk evacuation with wireless 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.DM(Discrete Mathematics)