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 on infinite grid by asynchronous oblivious robots"):
  Abstract: The Arbitrary Pattern Formation problem asks to design a distributed algorithm that allows a set of autonomous mobile robots to form any specific but arbitrary geometric pattern given as input. The problem has been extensively studied in literature in continuous domains. This paper investigates a discrete version of the problem where the robots are operating on a two dimensional infinite grid. The robots are assumed to be autonomous, identical, anonymous and oblivious. They operate in Look-Compute-Move cycles under a fully asynchronous scheduler. The robots do not agree on any common global coordinate system or chirality. We have shown that a set of robots can form any arbitrary pattern, if their starting configuration is asymmetric.

Includes members:
  Member "arbitrary pattern formation by asynchronous opaque robots with lights":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "arbitrary pattern formation by opaque fat robots with lights")
  Member "plane formation by synchronous mobile robots without chirality":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "distributed pattern formation with faulty robots")
  Member "asynchronous arbitrary pattern formation the effects of a rigorous approach":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "positional encoding by robots with non rigid movements")
  Member "plane formation by synchronous mobile robots in the three dimensional euclidean space":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "coding theory for noiseless channels realized by anonymous oblivious mobile robots")
  Member "distributed computing by mobile robots uniform circle formation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "fault induced dynamics of oblivious robots on a line")
  Member "the gathering problem for two oblivious robots with unreliable compasses":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "using model checking to formally verify rendezvous algorithms for robots with lights in euclidean space")
  Member "leader election problem versus pattern formation problem":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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)