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 "new inner and outer bounds for the discrete memoryless cognitive interference channel and some capacity results"):
  Abstract: The cognitive interference channel is an interference channel in which one transmitter is non-causally provided with the message of the other transmitter. This channel model has been extensively studied in the past years and capacity results for certain classes of channels have been proved. In this paper we present new inner and outer bounds for the capacity region of the cognitive interference channel as well as new capacity results. Previously proposed outer bounds are expressed in terms of auxiliary random variables for which no cardinality constraint is known. Consequently it is not possible to evaluate such outer bounds explicitly for a given channel model. The outer bound we derive is based on an idea originally devised by Sato for the broadcast channel and does not contain auxiliary random variables, allowing it to be more easily evaluated. The inner bound we derive is the largest known to date and is explicitly shown to include all previously proposed achievable rate regions. This comparison highlights which features of the transmission scheme - which includes rate-splitting, superposition coding, a broadcast channel-like binning scheme, and Gel'fand Pinsker coding - are most effective in approaching capacity. We next present new capacity results for a class of discrete memoryless channels that we term the "better cognitive decoding regime" which includes all previously known regimes in which capacity results have been derived as special cases. Finally, we determine the capacity region of the semi-deterministic cognitive interference channel, in which the signal at the cognitive receiver is a deterministic function of the channel inputs.

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 "interference channels with one cognitive transmitter":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "multiuser cognitive radio networks an information theoretic perspective")
  Member "state of the cognitive interference channel a new unified inner bound":
    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 "cognitive interference channels with confidential messages":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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 "on the capacity of interference channels with one cooperating transmitter":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "cognitive radio networks an information theoretic perspective")
  Member "cognitive radio an information theoretic perspective":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "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)