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: "square formation by asynchronous oblivious robots"
  Abstract: A fundamental problem in Distributed Computing is the Pattern Formation problem, where some independent mobile entities, called robots, have to rearrange themselves in such a way as to form a given figure from every possible (non-degenerate) initial configuration. #R##N#In the present paper, we consider robots that operate in the Euclidean plane and are dimensionless, anonymous, oblivious, silent, asynchronous, disoriented, non-chiral, and non-rigid. For this very elementary type of robots, the feasibility of the Pattern Formation problem has been settled, either in the positive or in the negative, for every possible pattern, except for one case: the Square Formation problem by a team of four robots. #R##N#Here we solve this last case by giving a Square Formation algorithm and proving its correctness. Our contribution represents the concluding chapter in a long thread of research. Our results imply that in the context of the Pattern Formation problem for mobile robots, features such as synchronicity, chirality, and rigidity are computationally irrelevant.

Connected through hyperedge HE-1 (induced by source paper "asynchronous pattern formation the effects of a rigorous approach"):
  with members:
    - "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"
    - "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:
    - "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"
    - "pattern formation for asynchronous robots without agreement in chirality"
    - "distributed computing by mobile robots uniform circle formation"
    - "leader election problem versus pattern formation problem"

Connected through hyperedge HE-3 (induced by source paper "plane formation by synchronous mobile robots without chirality"):
  with members:
    - "plane formation by synchronous mobile robots in the three dimensional euclidean space"
    - "distributed computing by mobile robots solving the uniform circle formation problem"

Connected through hyperedge HE-4 (induced by source paper "distributed computing by mobile robots uniform circle formation"):
  with members:
    - "distributed computing by mobile robots solving the uniform circle formation problem"
    - "the gathering problem for two oblivious robots with unreliable compasses"
    - "asynchronous mobile robot gathering from symmetric configurations without global multiplicity detection"
    - "circle formation of weak mobile robots"

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)