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 "distributed pattern formation with faulty robots"):
  Abstract: Pattern formation is one of the most fundamental problems in distributed computing, which has recently received much attention. In this paper, we initiate the study of distributed pattern formation in situations when some robots can be \textit{faulty}. In particular, we consider the usual and challenging \textit{look-compute-move} model with oblivious, anonymous robots. We first present lower bounds and show that any deterministic algorithm takes at least two parallel rounds to form simple patterns in the presence of faulty robots. We then present distributed algorithms for our problem which match this bound, \textit{for conic sections}: in two parallel rounds, robots form lines, circles, parabola, and ellipses while tolerating $f=2$, $f=3$, $f=4$, and $f=5$ faults, respectively. We show that the resulting pattern includes the $f$ faulty robots in the pattern of $n$ robots, where $n \geq 2f+1$, and that $f < n < 2f+1$ robots cannot form such patterns. We conclude by discussing several relaxations and extensions.

Includes members:
  Member "plane formation by synchronous mobile robots without chirality":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "arbitrary pattern formation on infinite grid by asynchronous oblivious robots")
  Member "fault and byzantine tolerant self stabilizing mobile robots gathering feasibility study":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "resilient consensus through event based communication")

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)