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 "improper gaussian signaling for multiple access channels in underlay cognitive radio"):
  Abstract: This paper characterizes the achievable rate region of an unlicensed multiple-access channel (MAC) that coexists with a licensed point-to-point user, following the underlay cognitive radio paradigm. We assume that every transceiver except the secondary base station has one antenna, and that the primary user (PU) is protected by a minimum rate constraint. In contrast to the conventional assumption of proper Gaussian signaling, we allow the secondary users (SUs) to transmit improper Gaussian signals, which are correlated with their complex conjugate. In this setting, we show that a given point of the rate region boundary is attained by an improper signal if the sum of the interference channel gains (in an equivalent canonical model) is above a certain threshold. We derive an efficient algorithm to compute every point of the rate region boundary achieved by improper Gaussian signaling. The proposed algorithm exploits a single-user representation of the secondary MAC along with new results on the optimality of improper signaling in the single-user case when the PU is corrupted by improper noise.

Includes members:
  Member "rate region boundary of the siso z interference channel with improper signaling":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "two user simo interference channel with tin improper signaling versus time sharing")
  Member "improper gaussian signaling in full duplex relay channels with residual self interference":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "full duplex relaying with improper gaussian signaling over nakagami m fading channels")
  Member "underlay spectrum sharing techniques with in band full duplex systems using improper gaussian signaling":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "full duplex relaying with improper gaussian signaling over nakagami m fading channels")
  Member "benefits of improper signaling for underlay cognitive radio":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "multiple importance sampling for efficient symbol error rate estimation")
  Member "improper signaling for symbol error rate minimization in k user interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "full duplex relaying with improper gaussian signaling over nakagami m fading channels")
  Member "optimized transmission with improper gaussian signaling in the k user miso interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "two user simo interference channel with tin improper signaling versus time sharing")
  Member "transmit optimization with improper gaussian signaling for interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "two user simo interference channel with tin improper signaling versus time sharing")
  Member "on ergodic sum capacity of fading cognitive multiple access and broadcast channels":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "deep learning for distributed optimization applications to wireless resource management")

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)