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 interference channel with a cognitive relay"):
  Abstract: The InterFerence Channel with a Cognitive Relay (IFC-CR) consists of the classical interference channel with two independent source-destination pairs whose communication is aided by an additional node, referred to as the cognitive relay, that has a priori knowledge of both sources' messages. This a priori message knowledge is termed cognition and idealizes the relay learning the messages of the two sources from their transmissions over a wireless channel. This paper presents new inner and outer bounds for the capacity region of the general memoryless IFC-CR that are shown to be tight for a certain class of channels. The new outer bound follows from arguments originally devised for broadcast channels among which Sato's observation that the capacity region of channels with non-cooperative receivers only depends on the channel output conditional marginal distributions. The new inner bound is shown to include all previously proposed coding schemes and it is thus the largest known achievable rate region to date. The new inner and outer bounds coincide for a subset of channel satisfying a strong interference condition. For these channels there is no loss in optimality if both destinations decode both messages. This result parallels analogous results for the classical IFC and for the cognitive IFC and is the first known capacity result for the general IFC-CR. Numerical evaluations of the proposed inner and outer bounds are presented for the Gaussian noise case.

Includes members:
  Member "the dof of the k user interference channel with a cognitive relay":
    also connected through other hyperedges:
      (none)
  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 its chain graph representation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "primary rate splitting achieves capacity for the gaussian cognitive interference channel")
  Member "a new capacity result for the z gaussian cognitive interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "multiuser cognitive radio networks an information theoretic perspective")
  Member "new results on the capacity of the gaussian cognitive interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "multiuser cognitive radio networks an information theoretic perspective")
  Member "symmetric capacity of the gaussian interference channel with an out of band relay to within 1 15 bits":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "capacity bounds for a class of interference relay channels")
  Member "outer bounds for the interference channel with a cognitive relay":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "capacity bounds for a class of interference relay channels")

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)