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 "interference channels with destination cooperation"):
  Abstract: Interference is a fundamental feature of the wireless channel. To better understand the role of cooperation in interference management, the two-user Gaussian interference channel where the destination nodes can cooperate by virtue of being able to both transmit and receive is studied. The sum capacity of this channel is characterized up to a constant number of bits. The coding scheme employed builds up on the superposition scheme of Han and Kobayashi for two-user interference channels without cooperation. New upperbounds to the sum capacity are also derived.

Includes members:
  Member "interference channels with source 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 "gaussian z interference channel with a relay link achievability region and asymptotic sum capacity":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the secrecy capacity region of the 2 user z interference channel with unidirectional transmitter 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 "transmission techniques for relay interference networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "cascade codes for distributed storage systems")
  Member "gaussian interference channel capacity to within one bit":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "wireless network information flow":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "perfect output feedback in the two user decentralized interference channel")
  Member "interference alignment and the degrees of freedom for the k user interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on off switched interference alignment for diversity multiplexing tradeoff improvement in the 2 user x network with two antennas")

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)