human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "distributed pattern formation in a ring"):
  with members:
    - "schelling games on graphs"
    - "hedonic diversity games"
    - "schelling segregation with strategic agents"
    - "exponential segregation in a two dimensional schelling model with tolerant individuals"
    - "simple and efficient local codes for distributed stable network construction"
    - "an analysis of one dimensional schelling segregation"
    - "optimal deterministic ring exploration with oblivious asynchronous robots"

Connected through hyperedge HE-2 (induced by source paper "positional encoding by robots with non rigid movements"):
  with members:
    - "meeting in a polygon by anonymous oblivious robots"
    - "asynchronous arbitrary pattern formation the effects of a rigorous approach"
    - "getting close without touching near gathering for autonomous mobile robots"
    - "perspective simple agents learn to find their way an introduction on mapping polygons"
    - "a distributed algorithm for gathering many fat mobile robots in the plane"
    - "how to meet asynchronously almost everywhere"
    - "asynchronous deterministic rendezvous in bounded terrains"

Connected through hyperedge HE-3 (induced by source paper "arbitrary pattern formation by asynchronous opaque robots with lights"):
  with members:
    - "asynchronous arbitrary pattern formation the effects of a rigorous approach"
    - "mutual visibility by luminous robots without collisions"
    - "algebraic methods in the congested clique"
    - "a distributed algorithm for gathering many fat mobile robots in the plane"
    - "leader election problem versus pattern formation problem"

Connected through hyperedge HE-4 (induced by source paper "arbitrary pattern formation by opaque fat robots with lights"):
  with members:
    - "arbitrary pattern formation by asynchronous opaque robots with lights"
    - "asynchronous arbitrary pattern formation the effects of a rigorous approach"
    - "a distributed algorithm for gathering many fat mobile robots in the plane"
    - "leader election problem versus pattern formation problem"

Connected through hyperedge HE-5 (induced by source paper "infinite grid exploration by disoriented robots"):
  with members:
    - "mutual visibility by luminous robots without collisions"
    - "optimal grid exploration by asynchronous oblivious robots"
    - "circle formation of weak robots and lyndon words"

Question: Please tell me which class the center node 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)