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 "distributed pattern formation in a ring"):
  Abstract: Motivated by concerns about diversity in social networks, we consider the following pattern formation problems in rings. Assume $n$ mobile agents are located at the nodes of an $n$-node ring network. Each agent is assigned a colour from the set $\{c_1, c_2, \ldots, c_q \}$. The ring is divided into $k$ contiguous {\em blocks} or neighbourhoods of length $p$. The agents are required to rearrange themselves in a distributed manner to satisfy given diversity requirements: in each block $j$ and for each colour $c_i$, there must be exactly $n_i(j) >0$ agents of colour $c_i$ in block $j$. Agents are assumed to be able to see agents in adjacent blocks, and move to any position in adjacent blocks in one time step. When the number of colours $q=2$, we give an algorithm that terminates in time $N_1/n^*_1 + k + 4$ where $N_1$ is the total number of agents of colour $c_1$ and $n^*_1$ is the minimum number of agents of colour $c_1$ required in any block. When the diversity requirements are the same in every block, our algorithm requires $3k+4$ steps, and is asymptotically optimal. Our algorithm generalizes for an arbitrary number of colours, and terminates in $O(nk)$ steps. We also show how to extend it to achieve arbitrary specific final patterns, provided there is at least one agent of every colour in every pattern.

Includes members:
  Member "schelling games on graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "graphical one sided markets")
  Member "hedonic diversity games":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "swap stability in schelling games on graphs")
  Member "schelling segregation with strategic agents":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "graphical one sided markets")
  Member "arbitrary pattern formation on infinite grid by asynchronous oblivious robots":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "positional encoding by robots with non rigid movements")
  Member "exponential segregation in a two dimensional schelling model with tolerant individuals":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "positive algorithmic bias cannot stop fragmentation in homophilic social networks")
  Member "simple and efficient local codes for distributed stable network construction":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "distributed computation and reconfiguration in actively dynamic networks")
  Member "an analysis of one dimensional schelling segregation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "positive algorithmic bias cannot stop fragmentation in homophilic social networks")
  Member "optimal deterministic ring exploration with oblivious asynchronous robots":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "dispersion of mobile robots the power of randomness")

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)