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 "diversity multiplexing tradeoff for the interference channel with a relay"):
  Abstract: We study the diversity-multiplexing tradeoff (DMT) for the slow fading interference channel with a relay (ICR). We derive four inner bounds on the DMT region: the first is based on the compress-and-forward (CF) relaying scheme, the second is based on the decode-and-forward (DF) relaying scheme, and the last two bounds are based on the half-duplex (HD) and full-duplex (FD) amplify-and-forward (AF) schemes. For the CF and DF schemes, we find conditions on the channel parameters and the multiplexing gains, under which the corresponding inner bound achieves the optimal DMT region. We also identify the cases in which the DMT region of the ICR corresponds to that of two parallel slow fading relay channels, implying that  interference does not decrease the DMT  for each pair, and that a single relay can be DMT-optimal for two pairs  simultaneously . For the HD-AF scheme, we derive conditions on the channel coefficients under which the proposed scheme achieves the optimal DMT for the AF-based relay channel. Finally, we identify the conditions under which adding a relay strictly enlarges the DMT region relative to the interference channel without a relay.

Includes members:
  Member "capacity theorems for the fading interference channel with a relay and feedback links":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on cooperation and interference in the weak interference regime full version with detailed proofs")
  Member "the diversity multiplexing tradeoff of the mimo half duplex relay channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "when are dynamic relaying strategies necessary in half duplex wireless networks")
  Member "the gaussian interference relay channel improved achievable rates and sum rate upperbounds using a potent relay":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "approximate capacity of fast fading interference channels with no instantaneous csit")
  Member "generalized degrees of freedom of the symmetric gaussian k user interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "mimo two way relay channel diversity multiplexing tradeoff analysis":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "technical report outage performance of full duplex mimo df relaying using zero forcing beamforming")
  Member "gaussian interference channel capacity to within one bit":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")

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)