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 "the diversity multiplexing tradeoff of the symmetric mimo 2 user interference channel"):
  Abstract: The fundamental diversity-multiplexing tradeoff (DMT) of the quasi-static fading, symmetric $2$-user MIMO interference channel (IC) with channel state information at the transmitters (CSIT) and a short term average power constraint is obtained. The general case is considered where the interference-to-noise ratio (INR) at each receiver scales differently from the signal-to-noise ratio (SNR) at the receivers. The achievability of the DMT is proved by showing that a simple Han-Kobayashi coding scheme can achieve a rate region which is within a constant (independent of SNR) number of bits from a set of upper bounds to the capacity region of the IC. In general, only part of the DMT curve with CSIT can be achieved by coding schemes which do not use any CSIT (No-CSIT). A result in this paper establishes a threshold for the INR beyond which the DMT with CSIT coincides with that with No-CSIT. Our result also settles one of the conjectures made in~\cite{EaOlCv}. Furthermore, the fundamental DMT of a class of non-symmetric ICs with No-CSIT is also obtained wherein the two receivers have different numbers of antennas.

Includes members:
  Member "the diversity multiplexing tradeoff of the mimo z interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "mimo z channel interference management")
  Member "outage analysis of block fading gaussian interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the capacity region of the wireless ergodic fading interference channel with partial csit to within one bit")
  Member "diversity multiplexing tradeoff in fading interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a diversity multiplexing delay tradeoff of arq protocols in the z interference channel")
  Member "diversity multiplexing tradeoff of the two user interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the diversity multiplexing tradeoff of the mimo z interference channel")
  Member "isotropic mimo interference channels without csit the loss of degrees of freedom":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "elements of cellular blind interference alignment aligned frequency reuse wireless index coding and interference diversity")
  Member "the degrees of freedom regions of mimo broadcast interference and cognitive radio channels with no csit":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "k user symmetric m times n mimo interference channel under finite precision csit a gdof perspective")
  Member "gaussian interference channel capacity to within one bit":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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)