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 "optimally gathering two robots"):
  Abstract: We present an algorithm that ensures in finite time the gathering of two robots in the non-rigid ASYNC model. To circumvent established impossibility results, we assume robots are equipped with 2-colors lights and are able to measure distances between one another. Aside from its light, a robot has no memory of its past actions, and its protocol is deterministic. Since, in the same model, gathering is impossible when lights have a single color, our solution is optimal with respect to the number of used colors.

Includes members:
  Member "parameterized verification of algorithms for oblivious robots on a ring":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "using model checking to formally verify rendezvous algorithms for robots with lights in euclidean space")
  Member "optimal asynchronous rendezvous for mobile robots with lights":
    also connected through other hyperedges:
      (none)
  Member "certified universal gathering in r 2 for oblivious mobile robots":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "parameterized verification of algorithms for oblivious robots on a ring")
  Member "on the synthesis of mobile robots algorithms the case of ring gathering":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "using model checking to formally verify rendezvous algorithms for robots with lights in euclidean space")
  Member "fault and byzantine tolerant self stabilizing mobile robots gathering feasibility study":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "distributed pattern formation with faulty robots")
  Member "certified impossibility results for byzantine tolerant mobile robots":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "using model checking to formally verify rendezvous algorithms for robots with lights in euclidean space")
  Member "rendezvous of two robots with visible bits":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "gathering on rings for myopic asynchronous robots with lights")
  Member "optimal grid exploration by asynchronous oblivious robots":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "using model checking to formally verify rendezvous algorithms for robots with lights in euclidean space")

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)