human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "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}$.

Includes members:
  Member "god save the queen":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "energy consumption of group search on a line")
  Member "fast two robot disk evacuation with wireless communication":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "probabilistically faulty searching on a half line")
  Member "search and fetch with 2 robots on a disk wireless and face to face communication models":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "probabilistically faulty searching on a half line")
  Member "revisiting the problem of searching on a line":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "lower bounds for searching robots some faulty")
  Member "fast rendezvous on a cycle by agents with different speeds":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "symmetric rendezvous with advice how to rendezvous in a disk")
  Member "online searching with turn cost":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "probabilistically faulty searching on a half line")

Question: Please tell me which class the source paper 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)