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 "anonymous processors with synchronous shared memory"):
  Abstract: We investigate anonymous processors computing in a synchronous manner and communicating via read-write shared memory. This system is known as a parallel random access machine (PRAM). It is parameterized by a number of processors~$n$ and a number of shared memory cells. We consider the problem of assigning unique integer names from the interval $[1,n]$ to all $n$ processors of a PRAM. We develop algorithms for each of the eight specific cases determined by which of the following independent properties hold: (1) concurrently attempting to write distinct values into the same memory cell either is allowed or not, (2) the number of shared variables either is unlimited or it is a constant independent of $n$, and (3) the number of processors~$n$ either is known or it is unknown. Our algorithms terminate almost surely, they are Las Vegas when $n$ is known, they are Monte Carlo when $n$ is unknown, and they always use the $O(n\log n)$ expected number of random bits. We show lower bounds on time, depending on whether the amounts of shared memory are constant or unlimited. In view of these lower bounds, all the Las Vegas algorithms we develop are asymptotically optimal with respect to their expected time, as determined by the available shared memory. Our Monte Carlo algorithms are correct with probabilities that are $1-n^{-\Omega(1)}$, which is best possible when terminating almost surely and using $O(n\log n)$ random bits.

Includes members:
  Member "naming a channel with beeps":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "distributed voting in beep model")
  Member "asynchronous exclusive selection":
    also connected through other hyperedges:
      (none)
  Member "leader election for anonymous asynchronous agents in arbitrary networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "almost logarithmic time space optimal leader election in population protocols")
  Member "naming and counting in anonymous unknown dynamic networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "distributed computation and reconfiguration in actively dynamic networks")
  Member "anonymous meeting in networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "want to gather no need to chatter")
  Member "on the importance of having an identity or is consensus really universal":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "efficient randomized test and set implementations")

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)