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 "multiuser cognitive radio networks an information theoretic perspective"):
  Abstract: Achievable rate regions and outer bounds are derived for three-user interference channels where the transmitters cooperate in a unidirectional manner via a noncausal message-sharing mechanism. The three-user channel facilitates different ways of message-sharing between the primary and secondary (or cognitive) transmitters. Three natural extensions of unidirectional message-sharing from two users to three users are introduced: (i) Cumulative message sharing; (ii) primary-only message sharing; and (iii) cognitive-only message sharing. To emphasize the notion of interference management, channels are classified based on different rate-splitting strategies at the transmitters. The techniques of superposition coding and Gel’fand–Pinsker’s binning are employed to derive an achievable rate region for each of the cognitive interference channels. The results are specialized to the Gaussian channel, which enables a visual comparison of the achievable rate regions through simulations and help us achieve some additional rate points under extreme assumptions. We also provide key insights into the role of rate-splitting at the transmitters as an aid to better interference management at the receivers.

Includes members:
  Member "on the sum rate of a 2 x 2 interference network":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the sum capacity of the gaussian x channel in the mixed interference regime")
  Member "capacity to within 3 bits for a class of gaussian interference channels with a cognitive relay":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "cooperation for interference management a gdof perspective")
  Member "the capacity of the semi deterministic cognitive interference channel and its application to constant gap results for the gaussian channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "inner and outer bounds for the gaussian cognitive interference channel and new capacity results")
  Member "new results on the capacity of the gaussian cognitive interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "inner and outer bounds for the gaussian cognitive interference channel and new capacity results")
  Member "new inner and outer bounds for the discrete memoryless cognitive interference channel and some capacity results":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "multi phase smart relaying and cooperative jamming in secure cognitive radio networks")
  Member "interference channels with one cognitive transmitter":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "fundamental limits of communications in interference networks part i basic structures")
  Member "on the capacity of a class of mimo cognitive radios":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fifty years of mimo detection the road to large scale mimos")
  Member "the gaussian mac with conferencing encoders":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "duality of a source coding problem and the semi deterministic broadcast channel with rate limited cooperation")

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)