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 "the overall balance between cooperation and interference for a class of wireless networks"):
  Abstract: This paper investigates the benefits of cooperation in large wireless networks with multiple sources and relays, where the nodes form an homogeneous Poisson point process. The source nodes may dispose of their nearest neighbor from the set of inactive nodes as their relay. Although cooperation can potentially lead to significant improvements on the asymptotic error probability of a communication pair, relaying causes additional interference in the network, increasing the average noise. We address the basic question: how should source nodes optimally balance cooperation vs. interference to guarantee reliability in all communication pairs. Based on the decode-and-forward (DF) scheme at the relays (which is near optimal when the relays are close to their corresponding sources), we derive closed-form approximations to the upper bounds on the error probability, averaging over all node positions. Surprisingly, in the small node-density regime, there is an almost binary behaviour that dictates --depending on network parameters-- the activation or not of all relay nodes.

Includes members:
  Member "cooperative strategies for interference limited wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "spatio temporal interference correlation and joint coverage in cellular networks")
  Member "study of gaussian relay channels with correlated noises":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "interference mitigation via relaying")
  Member "an overview of the transmission capacity of wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "smart radio environments empowered by ai reconfigurable meta surfaces an idea whose time has come")
  Member "interference and outage in clustered wireless ad hoc networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "smart radio environments empowered by ai reconfigurable meta surfaces an idea whose time has come")
  Member "fractional power control for decentralized wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "stability and metastability of traffic dynamics in uplink random access networks")
  Member "transmission capacity of ad hoc networks with spatial diversity":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "area spectral efficiency and sinr scaling laws in multi antenna cellular 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.IT(Information Theory)