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 "singletons for simpletons revisiting windowed backoff using chernoff bounds"):
  Abstract: Backoff algorithms are used in many distributed systems where multiple devices contend for a shared resource. For the classic balls-into-bins problem, the number of singletons---those bins with a single ball---is important to the analysis of several backoff algorithms; however, existing analyses employ advanced probabilistic tools to obtain concentration bounds. Here, we show that standard Chernoff bounds can be used instead, and the simplicity of this approach is illustrated by re-analyzing some well-known backoff algorithms.

Includes members:
  Member "the energy complexity of broadcast":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "competitive broadcast against adaptive adversary in multi channel radio networks")
  Member "exponential separations in the energy complexity of leader election":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "competitive broadcast against adaptive adversary in multi channel radio networks")
  Member "scalable wake up of multi channel single hop radio networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "packet latency of deterministic broadcasting in adversarial multiple access channels")
  Member "fast and robust compressive phase retrieval with sparse graph codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "stronger l2 l2 compressed sensing without iterating")
  Member "unbounded contention resolution in multiple access channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "information gathering in ad hoc radio networks")
  Member "a jamming resistant mac protocol for multi hop wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "deepwifi cognitive wifi with deep learning")

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)