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 mimo z interference channel"):
  Abstract: The fundamental generalized diversity-multiplexing tradeoff (GDMT) of the quasi-static fading MIMO Z interference channel (Z-IC) is established for the general Z-IC with an arbitrary number of antennas at each node under the assumptions of full channel state information at the transmitters (CSIT) and a short-term average power constraint. In the GDMT framework, the direct link signal-to-noise ratios (SNR) and cross-link interference-to-noise ratio (INR) are allowed to vary so that their ratios relative to a nominal SNR in the dB scale, i.e., the SNR/INR exponents, are fixed. It is shown that a simple Han-Kobayashi message-splitting/partial interference decoding scheme that uses only partial CSIT -- in which the second transmitter's signal depends only on its cross-link channel matrix and the first user's transmit signal doesn't need any CSIT whatsoever -- can achieve the full-CSIT GDMT of the MIMO Z-IC. The GDMT of the MIMO Z-IC under the No-CSIT assumption is also obtained for some range of multiplexing gains. The size of this range depends on the numbers of antennas at the four nodes and the SNR and INR exponents of the direct and cross links, respectively. For certain classes of channels including those in which the interfered receiver has more antennas than do the other nodes, or when the INR exponent is greater than a certain threshold, the GDMT of the MIMO Z-IC under the No-CSIT assumption is completely characterized.

Includes members:
  Member "the capacity region of the mimo interference channel and its reciprocity to within a constant gap":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "towards an extremal network theory robust gdof gain of transmitter cooperation over tin")
  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 diversity multiplexing tradeoff of the dynamic decode and forward protocol on a mimo half duplex relay channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "energy efficient resource allocation in machine to machine communications with multiple access and energy harvesting for iot")
  Member "the diversity multiplexing tradeoff of the symmetric mimo 2 user interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the diversity multiplexing tradeoff of the mimo half duplex relay channel")
  Member "capacity regions and sum rate capacities of vector gaussian interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "signal processing and optimal resource allocation for the interference channel")
  Member "diversity multiplexing tradeoff in fading interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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-7 (induced by source paper "the degrees of freedom of mimo interference channels without state information at transmitters")
  Member "the diversity multiplexing tradeoff for interference networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "a diversity multiplexing delay tradeoff of arq protocols in the z interference channel")

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)