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 "a certified universal gathering algorithm for oblivious mobile robots"):
  Abstract: We present a new algorithm for the problem of universal gathering mobile oblivious robots (that is, starting from any initial configuration that is not bivalent, using any number of robots, the robots reach in a finite number of steps the same position, not known beforehand) without relying on a common chirality. We give very strong guaranties on the correctness of our algorithm by proving formally that it is correct, using the COQ proof assistant. To our knowledge, this is the first certified positive (and constructive) result in the context of oblivious mobile robots. It demonstrates both the effectiveness of the approach to obtain new algorithms that are truly generic, and its managability since the amount of developped code remains human readable.

Includes members:
  Member "on the synthesis of mobile robots algorithms the case of ring gathering":
    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 "impossibility of gathering a certification":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "certified universal gathering in r 2 for oblivious mobile robots")
  Member "certified impossibility results for byzantine tolerant mobile robots":
    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 "optimal grid exploration by asynchronous oblivious robots":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "using model checking to formally verify rendezvous algorithms for robots with lights in euclidean space")
  Member "the gathering problem for two oblivious robots with unreliable compasses":
    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")

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)