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 "optimal asynchronous rendezvous for mobile robots with lights"):
  Abstract: We study a Rendezvous problem for 2 autonomous mobile robots in asynchronous settings with persistent memory called light. It is well known that Rendezvous is impossible when robots have no lights in basic common models, even if the system is semi-synchronous. On the other hand, Rendezvous is possible if robots have lights with a constant number of colors in several types lights. In asynchronous settings, Rendezvous can be solved by robots with 4 colors of lights in non-rigid movement, if robots can use not only own light but also other robot's light (full-light), where non-rigid movement means robots may be stopped before reaching the computed destination but can move a minimum distance \delta > 0 and rigid movement means robots can reach the computed destination. In semi-synchronous settings, Rendezvous can be solved with 2 colors of full-lights in non-rigid movement. #R##N#In this paper, we show that in asynchronous settings, Rendezvous can be solved with 2 colors of full-lights in rigid movement and in non-rigid movement if robots know the value of the minimum distance \delta. We also show that Rendezvous can be solved with 2 colors of full-lights in general non-rigid movement if we consider some reasonable restricted class of asynchronous settings.

Includes members:
  Member "gathering problems for autonomous mobile robots with lights":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimal rendezvous mathcal l algorithms for asynchronous mobile robots with external lights")
  Member "rendezvous of two robots with visible bits":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "gathering on rings for myopic asynchronous robots with lights")
  Member "the gathering problem for two oblivious robots with unreliable compasses":
    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")

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)