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 cognitive interference channel with unidirectional destination cooperation"):
  Abstract: The cognitive interference channel with unidirectional destination cooperation (CIFC-UDC) is a cognitive interference channel (CIFC) where the cognitive (secondary) destination not only decodes the information sent from its sending dual but also helps enhance the communication of the primary user. This channel model is an extension of the original CIFC to achieve a win-win solution under the coexistence condition. From an information-theoretic perspective, the CIFC-UDC comprises a broadcast channel (BC), a relay channel (RC) and a partially cooperative relay broadcast channel (PCRBC), and can be degraded to any one of them. Our main result is the establishment of a new unified achieva-ble rate region for the CIFC-UDC which is the largest known to date and can be explicitly shown to include the previous result proposed by Chu and the largest known rate regions for the BC, the RC and the PCRBC. In addition, an interesting viewpoint on the unidirectional destination cooperation in the CIFC-UDC is discussed: to enable the decoder of the primary user to perform interference mitigation can be considered as a complementary idea to the interference mitigation via Gel'fand-Pinsker precod-ing in the CIFC proposed by Devroye et al. Henceforth, by com-bing these two ideas, the interferences caused at both the desti-nations can be alleviated. Lastly, an outer bound is presented and proved to be tight for a class of the CIFC-UDC, resulting in the characterization of the capacity region for this class.

Includes members:
  Member "on the achievable rate regions for a class of cognitive radio channels interference channel with degraded message sets with unidirectional destination cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the capacity region of the cognitive interference channel with unidirectional destination cooperation")
  Member "interference mitigation through limited transmitter cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "exploiting computation replication for mobile edge computing a fundamental computation communication tradeoff study")
  Member "interference channels with one cognitive transmitter":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "multiuser cognitive radio networks an information theoretic perspective")
  Member "on the symmetric gaussian interference channel with partial unidirectional cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "novel outer bounds and capacity results for the interference channel with conferencing receivers")
  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 "rate regions for relay broadcast channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "sharp bounds for mutual covering")
  Member "cooperative relay broadcast channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "cooperative rate splitting for miso broadcast channel with user relaying and performance benefits over cooperative noma")

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)