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 "naming a channel with beeps"):
  Abstract: We consider a communication channel in which the only possible communication mode is transmitting beeps, which reach all the nodes instantaneously. Nodes are anonymous, in that they do not have any individual identifiers. The algorithmic goal is to randomly assign names to the nodes in such a manner that the names make a contiguous segment of positive integers starting from $1$. We give a Las Vegas naming algorithm for the case when the number of nodes $n$ is known, and a Monte Carlo algorithm for the case when the number of nodes $n$ is not known. The algorithms are provably optimal with respect to the expected time $O(n\log n)$, the number of used random bits $O(n\log n)$, and the probability of error.

Includes members:
  Member "randomized communication in radio networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "packet oblivious stable routing in multi hop wireless networks")
  Member "asynchronous broadcasting with bivalent beeps":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "distributed voting in beep model")
  Member "scalable wake up of multi channel single hop radio networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "singletons for simpletons revisiting windowed backoff using chernoff bounds")
  Member "feedback from nature simple randomised distributed algorithms for maximal independent set selection and greedy colouring":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "distributed voting in beep model")
  Member "the computational power of beeps":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "distributed voting in beep model")
  Member "anonymous processors with synchronous shared memory":
    also connected through other hyperedges:
      (none)
  Member "communicating with beeps":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "distributed voting in beep model")
  Member "randomized broadcast in radio networks with collision detection":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "competitive broadcast against adaptive adversary in multi channel radio networks")

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)