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 "chauffeuring a crashed robot from a disk"):
  Abstract: Evacuation of robots from a disk has attained a lot of attention recently. We visit the problem from the perspective of fault-tolerance. We consider two robots trying to evacuate from a disk via a single hidden exit on the perimeter of the disk. The robots communicate wirelessly. The robots are susceptible to crash faults after which they stop moving and communicating. We design the algorithms for tolerating one fault. The objective is to minimize the worst-case time required to evacuate both the robots from the disk. When the non-faulty robot chauffeurs the crashed robot, it takes $\alpha \geq 1$ amount of time to travel unit distance. With this, we also provide a lower bound for the evacuation time. Further, we evaluate the worst-case of the algorithms for different values of $\alpha$ and the crash time.

Includes members:
  Member "evacuating two robots from a disk a second cut":
    also connected through other hyperedges:
      (none)
  Member "average case worst case tradeoffs for evacuating 2 robots from the disk in the face to face model":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "probabilistically faulty searching on a half line")
  Member "god save the queen":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "energy consumption of group search on a line")
  Member "priority evacuation from a disk using mobile robots":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "energy consumption of group search on a line")
  Member "lower bounds for searching robots some faulty":
    also connected through other hyperedges:
      (none)
  Member "search on a line by byzantine robots":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "energy consumption of group search on a 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.DC(Distributed, Parallel, and Cluster Computing)