human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "a local stochastic algorithm for separation in heterogeneous self organizing particle systems"):
  Abstract: We present and rigorously analyze the behavior of a distributed, stochastic algorithm for separation and integration in self-organizing particle systems, an abstraction of programmable matter. Such systems are composed of individual computational particles with limited memory, strictly local communication abilities, and modest computational power. We consider heterogeneous particle systems of two different colors and prove that these systems can collectively separate into different color classes or integrate, indifferent to color. We accomplish both behaviors with the same fully distributed, local, stochastic algorithm. Achieving separation or integration depends only on a single global parameter determining whether particles prefer to be next to other particles of the same color or not; this parameter is meant to represent external, environmental influences on the particle system. The algorithm is a generalization of a previous distributed, stochastic algorithm for compression (PODC '16), which can be viewed as a special case of separation where all particles have the same color. It is significantly more challenging to prove that the desired behavior is achieved in the heterogeneous setting, however, even in the bichromatic case we focus on. This requires combining several new techniques, including the cluster expansion from statistical physics, a new variant of the bridging argument of Miracle, Pascoe and Randall (RANDOM '11), the high-temperature expansion of the Ising model, and careful probabilistic arguments.

Includes members:
  Member "counting independent sets and colorings on random regular bipartite graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "zeros and approximations of holant polynomials on the complex plane")
  Member "a stochastic approach to shortcut bridging in programmable matter":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "mobile ram and shape formation by programmable particles")
  Member "algorithms for bis hard problems on expander graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "efficient algorithms for the potts model on small set expanders")
  Member "self organized segregation on the grid":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "improved intolerance intervals and size bounds for a schelling type spin system")
  Member "algorithmic pirogov sinai theory":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "efficient algorithms for the potts model on small set expanders")
  Member "line recovery by programmable particles":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "mobile ram and shape formation by programmable particles")
  Member "collaborative computation in self organizing particle systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "convex hull formation for programmable matter")
  Member "a markov chain algorithm for compression in self organizing particle systems":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "simulation of programmable matter systems using active tile based self assembly")

Question: Please tell me which class the source paper 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)