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 "relay channel with orthogonal components and structured interference known at the source"):
  Abstract: A relay channel with orthogonal components in which the destination is affected by an interference signal that is non-causally available only at the source is studied. The interference signal has structure in that it is produced by another transmitter communicating with its own destination. Moreover, the interferer is not willing to adjust its communication strategy to minimize the interference. Knowledge of the interferer's signal may be acquired by the source, for instance, by exploiting HARQ retransmissions on the interferer's link. The source can then utilize the relay not only for communicating its own message, but also for cooperative interference mitigation at the destination by informing the relay about the interference signal. Proposed transmission strategies are based on partial decode-and-forward (PDF) relaying and leverage the interference structure. Achievable schemes are derived for discrete memoryless models, Gaussian and Ricean fading channels. Furthermore, optimal strategies are identified in some special cases. Finally, numerical results bring insight into the advantages of utilizing the interference structure at the source, relay or destination.

Includes members:
  Member "bounds on the capacity of the relay channel with noncausal state at source":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the arbitrarily varying relay channel")
  Member "structured interference mitigation in two hop networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "lattice codes for the gaussian relay channel decode and forward and compress and forward")
  Member "capacity bounds and exact results for the cognitive z 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 "bounds on the capacity of the relay channel with noncausal state information at source":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on cooperative multiple access channels with delayed csi at transmitters")
  Member "lecture notes on network information theory":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the required number of antennas in a point to point large but finite mimo system outage limited scenario")
  Member "dirty paper coding for fading channels with partial transmitter side information":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the capacity of the carbon copy onto dirty paper channel")
  Member "writing on dirty paper with resizing and its application to quasi static fading broadcast channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the capacity of the carbon copy onto dirty paper channel")
  Member "on the fading paper achievable region of the fading mimo broadcast channel":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "ergodic fading mimo dirty paper and broadcast channels capacity bounds and lattice strategies")

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)