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 stochastic approach to shortcut bridging in programmable matter"
  Abstract: In a self-organizing particle system, an abstraction of programmable matter, simple computational elements called particles with limited memory and communication self-organize to solve system-wide problems of movement, coordination, and configuration. In this paper, we consider a stochastic, distributed, local, asynchronous algorithm for “shortcut bridging”, in which particles self-assemble bridges over gaps that simultaneously balance minimizing the length and cost of the bridge. Army ants of the genus Eciton have been observed exhibiting a similar behavior in their foraging trails, dynamically adjusting their bridges to satisfy an efficiency trade-off using local interactions. Using techniques from Markov chain analysis, we rigorously analyze our algorithm, show it achieves a near-optimal balance between the competing factors of path length and bridge cost, and prove that it exhibits a dependence on the angle of the gap being “shortcut” similar to that of the ant bridges. We also present simulation results that qualitatively compare our algorithm with the army ant bridging behavior. Our work gives a plausible explanation of how convergence to globally optimal configurations can be achieved via local interactions by simple organisms (e.g., ants) with some limited computational power and access to random bits. The proposed algorithm also demonstrates the robustness of the stochastic approach to algorithms for programmable matter, as it is a surprisingly simple extension of our previous stochastic algorithm for compression.

Connected through hyperedge HE-1 (induced by source paper "mobile ram and 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"
    - "turingmobile a turing machine of oblivious mobile robots with limited visibility and its applications"
    - "line recovery by programmable particles"
    - "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 "simulation of programmable matter systems using active tile based self assembly"):
  with members:
    - "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"
    - "a markov chain algorithm for compression in self organizing particle systems"
    - "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-3 (induced by source paper "deterministic leader election in programmable matter"):
  with members:
    - "distributed leader election and computation of local identifiers for 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"
    - "a markov chain algorithm for compression in self organizing particle systems"

Connected through hyperedge HE-4 (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"
    - "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"
    - "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-5 (induced by source paper "a markov chain algorithm for compression in self organizing particle systems"):
  with members:
    - "line recovery by programmable particles"
    - "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)