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: "pattern formation for asynchronous robots without agreement in chirality"
  Abstract: AbstractThis paper presents a deterministic algorithm for forming a given asymmetricpattern in nite time by a set of autonomous, homogeneous, oblivious mobilerobots under the CORDA model. The robots are represented as points on the2D plane. There is no explicit communication between the robots. The robotscoordinate among themselves by observing the positions of the other robots onthe plane. Initially all the robots are assumed to be stationary. The robotshave local coordinate systems de ned by Sense of Direction (SoD), orientationor chirality and scale. Initially the robots are in asymmetric con guration. Weshow that these robots can form any given asymmetric pattern in nite time.Keywords: Asynchronous, oblivious, mobile robots, pattern formation,chirality.1. IntroductionExecuting a collaborative task by a set of small, autonomous, mobile robots(also known as robot swarm [18]) has been a popular topic for the researchfor last few decades. The robots are assumed to be anonymous, homogeneous,oblivious and asynchronous. The robots together perform a complex job, e.g.,moving a big body [16], cleaning a big surface [13] etc. The individual unit orrobot in a system of swarm robots is less expensive than a big robot. Increasingor decreasing the number of robots in this system involves very simple hardwareor software modi cations and thus provides good scalability. Moreover, havingsimilar capability, if some robots fail, others can manage to execute the work.This feature makes the system to be more resilient to malfunction. In hostileenvironments, these robots are easily deployable to perform various complextasks cooperatively.

Connected through hyperedge HE-1 (induced by source paper "asynchronous pattern formation the effects of a rigorous approach"):
  with members:
    - "square formation by asynchronous oblivious robots"
    - "probabilistic asynchronous arbitrary pattern formation"
    - "plane formation by synchronous mobile robots in the three dimensional euclidean space"
    - "on the synthesis of mobile robots algorithms the case of ring gathering"
    - "distributed computing by mobile robots uniform circle formation"
    - "distributed computing by mobile robots solving the uniform circle formation problem"
    - "leader election problem versus pattern formation problem"

Connected through hyperedge HE-2 (induced by source paper "asynchronous arbitrary pattern formation the effects of a rigorous approach"):
  with members:
    - "square formation by asynchronous oblivious robots"
    - "probabilistic asynchronous arbitrary pattern formation"
    - "plane formation by synchronous mobile robots in the three dimensional euclidean space"
    - "on the synthesis of mobile robots algorithms the case of ring gathering"
    - "distributed computing by mobile robots uniform circle formation"
    - "leader election problem versus pattern formation problem"

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)