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 "on the capacity of the cognitive interference channel with a common cognitive message"):
  Abstract: In this paper the cognitive interference channel with a common message, a variation of the classical cognitive interference channel in which the cognitive message is decoded at both receivers, is studied. For this channel model new outer and inner bounds are developed as well as new capacity results for both the discrete memoryless and the Gaussian case. The outer bounds are derived using bounding techniques originally developed by Sato for the classical interference channel and Nair and El Gamal for the broadcast channel. A general inner bound is obtained combining rate-splitting, superposition coding and binning. Inner and outer bounds are shown to coincide in the "very strong interference" and the "primary decodes cognitive" regimes. The first regime consists of channels in which there is no loss of optimality in having both receivers decode both messages while in the latter regime interference pre-cancellation at the cognitive receiver achieves capacity. Capacity for the Gaussian channel is shown to within a constant additive gap and a constant multiplicative factor.

Includes members:
  Member "inner and outer bounds for the gaussian cognitive interference channel and new capacity results":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "cognitive radio networks an information theoretic perspective")
  Member "an achievable region for a general multi terminal network and the corresponding chain graph representation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the capacity of the semi deterministic cognitive interference channel with a common cognitive message and approximate capacity for the gaussian case")
  Member "the capacity of the interference channel with a cognitive relay in very strong interference":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "cooperation for interference management a gdof perspective")
  Member "capacity to within 3 bits for a class of gaussian interference channels with a cognitive relay":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "cooperation for interference management a gdof perspective")
  Member "a new capacity result for the z gaussian cognitive interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "fundamental limits of communications in interference networks part i basic structures")
  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-6 (induced by source paper "multiuser cognitive radio networks an information theoretic perspective")
  Member "on the capacity of the interference channel with a cognitive relay":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "multi user cognitive interference channels a survey and new capacity results")
  Member "new results on the capacity of the gaussian cognitive interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "multiuser cognitive radio networks an information theoretic perspective")

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)