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: "a markov chain algorithm for compression in self organizing particle systems"
  Abstract: We consider programmable matter as a collection of simple computational elements (or particles) with limited (constant-size) memory that self-organize to solve system-wide problems of movement, configuration, and coordination. Here, we focus on the compression problem, in which the particle system gathers as tightly together as possible, as in a sphere or its equivalent in the presence of some underlying geometry. More specifically, we seek fully distributed, local, and asynchronous algorithms that lead the system to converge to a configuration with small perimeter. We present a Markov chain based algorithm that solves the compression problem under the geometric amoebot model, for particle systems that begin in a connected configuration with no holes. The algorithm takes as input a bias parameter λ, where λ > 1 corresponds to particles favoring inducing more lattice triangles within the particle system. We show that for all λ > 5, there is a constant α > 1 such that at stationarity with all but exponentially small probability the particles are α-compressed, meaning the perimeter of the system configuration is at most α ⋅ pmin, where pmin is the minimum possible perimeter of the particle system. We additionally prove that the same algorithm can be used for expansion for small values of λ in particular, for all 0

Connected through hyperedge HE-1 (induced by source paper "simulation of programmable matter systems using active tile based self assembly"):
  with members:
    - "a stochastic approach to shortcut bridging in programmable matter"
    - "the non cooperative tile assembly model is not intrinsically universal or capable of bounded turing machine simulation"
    - "improved leader election for self organizing programmable matter"
    - "universal coating for programmable matter"
    - "computing in continuous space with self assembling polygonal tiles"
    - "universal computation with arbitrary polyomino tiles in non cooperative self assembly"
    - "the power of duples in self assembly it s not so hip to be square"
    - "the two handed tile assembly model is not intrinsically universal"

Connected through hyperedge HE-2 (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"
    - "line recovery by programmable particles"
    - "shape formation by programmable particles"
    - "improved leader election for self organizing programmable matter"
    - "universal coating for programmable matter"

Connected through hyperedge HE-3 (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"
    - "line recovery by programmable particles"
    - "collaborative computation in self organizing particle systems"
    - "exponential segregation in a two dimensional schelling model with tolerant individuals"

Connected through hyperedge HE-4 (induced by source paper "a stochastic approach to shortcut bridging in programmable matter"):
  with members:
    - "improved leader election for self organizing programmable matter"
    - "universal coating for programmable matter"
    - "leader election and shape formation with self organizing programmable matter"
    - "parallel computation using active self assembly"
    - "active self assembly of algorithmic shapes and patterns in polylogarithmic time"
    - "intrinsic universality and the computational power of self assembly"

Connected through hyperedge HE-5 (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"
    - "line recovery by programmable particles"
    - "improved leader election for self organizing programmable matter"
    - "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"
    - "leader election and shape formation with self organizing programmable matter"

Connected through hyperedge HE-6 (induced by source paper "improved leader election for self organizing programmable matter"):
  with members:
    - "on the runtime of 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"
    - "parallel computation using active self assembly"
    - "fast algorithmic self assembly of simple shapes using random agitation"
    - "active self assembly of algorithmic shapes and patterns in polylogarithmic time"
    - "intrinsic universality and the computational power of self assembly"
    - "a distributed algorithm for gathering many fat mobile robots in the plane"

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"
    - "an algorithmic framework for shape formation problems in self organizing particle systems"
    - "plane formation by synchronous mobile robots in the three dimensional euclidean space"
    - "leader election and shape formation with self organizing programmable matter"

Connected through hyperedge HE-8 (induced by source paper "collaborative computation in self organizing particle systems"):
  with members:
    - "on the runtime of universal coating for programmable matter"
    - "an algorithmic framework for shape formation problems in self organizing particle systems"
    - "active self assembly of algorithmic shapes and patterns in polylogarithmic time"
    - "intrinsic universality and the computational power of self assembly"

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)