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: "plane formation by synchronous mobile robots in the three dimensional euclidean space"
  Abstract: Creating a swarm of mobile computing entities frequently called robots, agents or sensor nodes, with self-organization ability is a contemporary challenge in distributed computing. Motivated by this, we investigate the plane formation problem that requires a swarm of robots moving in the three dimensional Euclidean space to land on a common plane. The robots are fully synchronous and endowed with visual perception. But they do not have identifiers, nor access to the global coordinate system, nor any means of explicit communication with each other. Though there are plenty of results on the agreement problem for robots in the two dimensional plane, for example, the point formation problem, the pattern formation problem, and so on, this is the first result for robots in the three dimensional space. This paper presents a necessary and sufficient condition for fully-synchronous robots to solve the plane formation problem that does not depend on obliviousness i.e., the availability of local memory at robots. An implication of the result is somewhat counter-intuitive: The robots cannot form a plane from most of the semi-regular polyhedra, while they can form a plane from every regular polyhedron (except a regular icosahedron), whose symmetry is usually considered to be higher than any semi-regular polyhedrdon.

Connected through hyperedge HE-1 (induced by source paper "coding theory for noiseless channels realized by anonymous oblivious mobile robots"):
  with members:
    - "exploration of finite 2d square grid by a metamorphic robotic system"
    - "turingmobile a turing machine of oblivious mobile robots with limited visibility and its applications"
    - "getting close without touching near gathering for autonomous mobile robots"
    - "optimal grid exploration by asynchronous oblivious robots"
    - "leader election problem versus pattern formation problem"

Connected through hyperedge HE-2 (induced by source paper "arbitrary pattern formation on infinite grid by asynchronous oblivious robots"):
  with members:
    - "arbitrary pattern formation by asynchronous opaque robots with lights"
    - "plane formation by synchronous mobile robots without chirality"
    - "asynchronous arbitrary pattern formation the effects of a rigorous approach"
    - "distributed computing by mobile robots uniform circle formation"
    - "the gathering problem for two oblivious robots with unreliable compasses"
    - "leader election problem versus pattern formation problem"

Connected through hyperedge HE-3 (induced by source paper "exploration of finite 2d square grid by a metamorphic robotic system"):
  with members:
    - "on the transformation capability of feasible mechanisms for programmable matter"
    - "turingmobile a turing machine of oblivious mobile robots with limited visibility and its applications"
    - "shape formation by programmable particles"
    - "universal coating for programmable matter"
    - "connectivity preserving network transformers"
    - "optimal grid exploration by asynchronous oblivious robots"

Connected through hyperedge HE-4 (induced by source paper "ring exploration with myopic luminous robots"):
  with members:
    - "optimally gathering two robots"
    - "optimal grid exploration by asynchronous oblivious robots"

Connected through hyperedge HE-5 (induced by source paper "fault induced dynamics of oblivious robots on a line"):
  with members:
    - "come together multi agent geometric consensus gathering rendezvous clustering aggregation"
    - "erratic extremism causes dynamic consensus a new model for one dimensional opinion dynamics"
    - "distributed computing by mobile robots uniform circle formation"
    - "fault and byzantine tolerant self stabilizing mobile robots gathering feasibility study"
    - "distributed computing by mobile robots solving the uniform circle formation problem"
    - "certified impossibility results for byzantine tolerant mobile robots"
    - "the random bit complexity of mobile robots scattering"
    - "the gathering problem for two oblivious robots with unreliable compasses"

Connected through hyperedge HE-6 (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"
    - "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-7 (induced by source paper "line recovery by programmable particles"):
  with members:
    - "on the runtime of universal coating for programmable matter"
    - "improved leader election for self organizing programmable matter"
    - "universal coating for programmable matter"
    - "a markov chain algorithm for compression in self organizing particle systems"
    - "an algorithmic framework for shape formation problems in self organizing particle systems"
    - "leader election and shape formation with self organizing programmable matter"

Connected through hyperedge HE-8 (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"
    - "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)