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 "arbitrary pattern formation by asynchronous opaque robots with lights"):
  Abstract: The Arbitrary Pattern Formation problem asks for a distributed algorithm that moves a set of autonomous mobile robots to form any arbitrary pattern given as input. The robots are assumed to be autonomous, anonymous and identical. They operate in Look-Compute-Move cycles under a fully asynchronous scheduler. The robots do not have access to any global coordinate system. The existing literature that investigates this problem, considers robots with unobstructed visibility. This work considers the problem in the more realistic obstructed visibility model, where the view of a robot can be obstructed by the presence of other robots. The robots are assumed to be punctiform and equipped with visible lights that can assume a constant number of predefined colors. We have studied the problem in two settings based on the level of consistency among the local coordinate systems of the robots: two axis agreement (they agree on the direction and orientation of both coordinate axes) and one axis agreement (they agree on the direction and orientation of only one coordinate axis). In both settings, we have provided a full characterization of initial configurations from where any arbitrary pattern can be formed.

Includes members:
  Member "arbitrary pattern formation on infinite grid by asynchronous oblivious robots":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "distributed pattern formation in a ring")
  Member "asynchronous arbitrary pattern formation the effects of a rigorous approach":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "positional encoding by robots with non rigid movements")
  Member "mutual visibility by luminous robots without collisions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "infinite grid exploration by disoriented robots")
  Member "algebraic methods in the congested clique":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "exponentially faster shortest paths in the congested clique")
  Member "a distributed algorithm for gathering many fat mobile robots in the plane":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "positional encoding by robots with non rigid movements")
  Member "leader election problem versus pattern formation problem":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "coding theory for noiseless channels realized by anonymous oblivious mobile robots")

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)