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 region of the two user interference channel with a cognitive relay"):
  Abstract: This paper considers a variation of the classical two-user interference channel where the communication of two interfering source-destination pairs is aided by an additional node that has a priori knowledge of the messages to be transmitted, which is referred to as the it cognitive relay. For this Interference Channel with a Cognitive Relay (ICCR) In particular, for the class of injective semi-deterministic ICCRs, a sum-rate upper bound is derived for the general memoryless ICCR and further tightened for the Linear Deterministic Approximation (LDA) of the Gaussian noise channel at high SNR, which disregards the noise and focuses on the interaction among the users' signals. The capacity region of the symmetric LDA is completely characterized except for the regime of moderately weak interference and weak links from the CR to the destinations. The insights gained from the analysis of the LDA are then translated back to the symmetric Gaussian noise channel (GICCR). For the symmetric GICCR, an approximate characterization (to within a constant gap) of the capacity region is provided for a parameter regime where capacity was previously unknown. The approximately optimal scheme suggests that message cognition at a relay is beneficial for interference management as it enables simultaneous over the air neutralization of the interference at both destinations.

Includes members:
  Member "two birds and one stone gaussian interference channel with a shared out of band relay of limited rate":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "capacity bounds for a class of interference relay channels")
  Member "inner and outer bounds for the gaussian cognitive interference channel and new capacity results":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "cognitive radio networks an information theoretic perspective")
  Member "wireless network information flow a deterministic approach":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "best relay selection in gaussian half duplex diamond networks")
  Member "the capacity of the interference channel with a cognitive relay in very strong interference":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (induced by source paper "cooperation for interference management a gdof perspective")
  Member "the gaussian interference relay channel improved achievable rates and sum rate upperbounds using a potent relay":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "approximate capacity of fast fading interference channels with no instantaneous csit")
  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 "interference mitigation through limited transmitter cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "exploiting computation replication for mobile edge computing a fundamental computation communication tradeoff study")

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)