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 "mutual visibility by luminous robots without collisions"):
  Abstract: Consider a finite set of identical computational entities that can move freely in the Euclidean plane operating in Look-Compute-Move cycles. Let p(t) denote the location of entity p at time t; entity p can see entity q at time t if at that time no other entity lies in the line segment p(t)q(t). We consider the basic problem called Mutual Visibility: starting from arbitrary distinct locations, within finite time the entities must reach, without collisions, a configuration where they all see each other. This problem must be solved by each entity autonomously executing the same algorithm. We study this problem in the "luminous robots" model; in this generalization of the standard model of oblivious robots, each entity, called "robot", has an externally visible persistent light which can assume colors from a fixed set. The case where the number of colors is c=1 corresponds to the classical model without lights. #R##N#In this paper we investigate under what conditions luminous robots can solve Mutual Visibility without collisions and at what cost (i.e., with how many colors). We establish a spectrum of results, depending on the power of the adversary, on the number c of colors, and on the a-priori knowledge the robots have about the system. Among such results, we prove that Mutual Visibility can always be solved without collisions in SSynch with c=2 colors and in ASynch with c=3 colors. If an adversary can interrupt and stop a robot moving to its computed destination, Mutual Visibility is still always solvable without collisions in SSynch with c=3 colors, and, if the robots agree on the direction of one axis, also in ASynch. All the results are obtained constructively by means of novel protocols. #R##N#As a byproduct of our solutions, we provide the first obstructed-visibility solutions to two classical problems for oblivious robots: Collision-less Convergence to a point and Circle Formation.

Includes members:
  Member "distributed computing by mobile robots solving the uniform circle formation problem":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fault induced dynamics of oblivious robots on a line")
  Member "rendezvous of two robots with constant memory":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "deterministic meeting of sniffing agents in the plane")
  Member "rendezvous of two robots with visible bits":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "gathering on rings for myopic asynchronous robots with lights")
  Member "a distributed algorithm for gathering many fat mobile robots in the plane":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "positional encoding by robots with non rigid movements")
  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")
  Member "robocast asynchronous communication in robot networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "asynchronous pattern formation without chirality")
  Member "circle formation of weak mobile robots":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fault induced dynamics of oblivious robots 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)