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: "line recovery by programmable particles"
  Abstract: Shape formation has been recently studied in distributed systems of programmable particles. In this paper we consider the shape recovery problem of restoring the shape when $f$ of the $n$ particles have crashed. We focus on the basic line shape, used as a tool for the construction of more complex configurations. #R##N#We present a solution to the line recovery problem by the non-faulty anonymous particles; the solution works regardless of the initial distribution and number $f<n-4$ of faults, of the local orientations of the non-faulty entities, and of the number of non-faulty entities activated in each round (i.e., semi-synchronous adversarial scheduler).

Connected through hyperedge HE-1 (induced by source paper "mobile ram and shape formation by programmable particles"):
  with members:
    - "a stochastic approach to shortcut bridging in programmable matter"
    - "on the runtime of universal coating for programmable matter"
    - "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"
    - "terminating distributed construction of shapes and patterns in a fair solution of automata"
    - "an algorithmic framework for shape formation problems in self organizing particle systems"

Connected through hyperedge HE-2 (induced by source paper "synchronous byzantine lattice agreement in o log f rounds"):
  with members:
    - "byzantine approximate agreement on graphs"
    - "byzantine lattice agreement in synchronous systems"
    - "byzantine generalized lattice agreement"
    - "linearizable state machine replication of state based crdts without logs"
    - "lattice agreement in message passing systems"
    - "population protocols with faulty interactions the impact of a leader"
    - "simple gradecast based algorithms"

Connected through hyperedge HE-3 (induced by source paper "deterministic leader election in programmable matter"):
  with members:
    - "distributed leader election and computation of local identifiers for programmable matter"
    - "a stochastic approach to shortcut bridging in programmable matter"
    - "on the runtime of universal coating for programmable matter"
    - "convex hull formation for programmable matter"
    - "shape formation by programmable particles"
    - "improved leader election for self organizing programmable matter"
    - "universal coating for programmable matter"
    - "a markov chain algorithm for compression in self organizing particle systems"

Connected through hyperedge HE-4 (induced by source paper "pushing lines helps efficient universal centralised transformations for programmable matter"):
  with members:
    - "on the runtime of universal coating for programmable matter"
    - "on the transformation capability of feasible mechanisms for programmable matter"
    - "shape formation by programmable particles"
    - "an algorithmic framework for shape formation problems in self organizing particle systems"
    - "simple and efficient local codes for distributed stable network construction"
    - "active self assembly of algorithmic shapes and patterns in polylogarithmic time"
    - "the computational power of population protocols"
    - "pspace completeness of sliding block puzzles and other problems through the nondeterministic constraint logic model of computation"

Connected through hyperedge HE-5 (induced by source paper "a local stochastic algorithm for separation in heterogeneous self organizing particle systems"):
  with members:
    - "counting independent sets and colorings on random regular bipartite graphs"
    - "a stochastic approach to shortcut bridging in programmable matter"
    - "algorithms for bis hard problems on expander graphs"
    - "self organized segregation on the grid"
    - "algorithmic pirogov sinai theory"
    - "collaborative computation in self organizing particle systems"
    - "a markov chain algorithm for compression in self organizing particle systems"
    - "exponential segregation in a two dimensional schelling model with tolerant individuals"

Connected through hyperedge HE-6 (induced by source paper "distributed leader election and computation of local identifiers for programmable matter"):
  with members:
    - "on the runtime of universal coating for programmable matter"
    - "shape formation by programmable particles"
    - "improved leader election for self organizing programmable matter"
    - "universal coating for programmable matter"
    - "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-7 (induced by source paper "shape formation by programmable particles"):
  with members:
    - "on the runtime of universal coating for programmable matter"
    - "on the transformation capability of feasible mechanisms 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"
    - "terminating distributed construction of shapes and patterns in a fair solution of automata"
    - "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 "a markov chain algorithm for compression in self organizing particle systems"):
  with members:
    - "a stochastic approach to shortcut bridging in programmable matter"
    - "an algorithmic framework for shape formation problems in self organizing particle systems"
    - "leader election and shape formation with self organizing programmable matter"
    - "active self assembly of algorithmic shapes and patterns in polylogarithmic time"

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)