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 cognitive interference channel with unidirectional destination cooperation"):
  Abstract: The cognitive interference channel with unidirectional destination cooperation (CIFC-UDC) is a variant of the 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 is an extension of the original CIFC to achieve a win-win solution under the coexistence condition. The CIFC-UDC comprises a broadcast channel (BC), a relay channel (RC), as well as a partially cooperative relay broadcast channel (PCRBC), and can be degraded to any one of them. In this paper, we propose a new achievable rate region for the dis-crete memoryless CIFC-UDC which improves the previous re-sults and includes the largest known rate regions of the BC, the RC, the PCRBC and the CIFC. A new outer bound is presented and proved to be tight for two classes of the CIFC-UDCs, result-ing in the characterization of the capacity region.

Includes members:
  Member "on the cognitive interference channel with unidirectional destination cooperation":
    also connected through other hyperedges:
      (none)
  Member "interference channels with destination cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "gdof of interference channel with limited cooperation under finite precision csit")
  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-2 (induced by source paper "on the cognitive interference channel with unidirectional destination cooperation")
  Member "interference mitigation through limited receiver cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "how much can d2d communication reduce content delivery latency in fog networks with edge caching")
  Member "rate regions for relay broadcast channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "sharp bounds for mutual covering")

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)