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: "probabilistic asynchronous arbitrary pattern formation"
  Abstract: We propose a new probabilistic pattern formation algorithm for oblivious mobile robots that operates in#R##N#the ASYNC model. Unlike previous work, our algorithm makes no assumptions about the local coordinate#R##N#systems of robots (the robots do not share a common “North” nor a common “Right”), yet it preserves the#R##N#ability from any initial configuration that contains at least 5 robots to form any general pattern (and not just#R##N#patterns that satisfy symmetricity predicates). Our proposal also gets rid of the previous assumption (in the#R##N#same model) that robots do not pause while moving (so, our robots really are fully asynchronous), and the#R##N#amount of randomness is kept low – a single random bit per robot per Look-Compute-Move cycle is used.#R##N#Our protocol consists in the combination of two phases, a probabilistic leader election phase, and a deterministic#R##N#pattern formation one. As the deterministic phase does not use chirality, it may be of independent#R##N#interest in the deterministic context. A noteworthy feature of our algorithm is the ability to form patterns#R##N#with multiplicity points (except the gathering case due to impossibility results), a new feature in the context#R##N#of pattern formation that we believe is an important asset of our approach.

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"
    - "plane formation by synchronous mobile robots in the three dimensional euclidean space"
    - "on the synthesis of mobile robots algorithms the case of ring gathering"
    - "pattern formation for asynchronous robots without agreement in chirality"
    - "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"
    - "plane formation by synchronous mobile robots in the three dimensional euclidean space"
    - "on the synthesis of mobile robots algorithms the case of ring gathering"
    - "pattern formation for asynchronous robots without agreement in chirality"
    - "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)