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 "isotropic mimo interference channels without csit the loss of degrees of freedom"):
  Abstract: This paper studies two-user MIMO interference channel with isotropic fading. We assume that users are equipped with arbitrary number of antennas and the channel state information (CSI) is available at receivers only. An outer bound is obtained for the degree of freedom region, which suggests the loss of degrees of freedom due to the lack of CSI at transmitters under many circumstances.

Includes members:
  Member "the approximate capacity of the many to one and one to many gaussian interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "diversity multiplexing tradeoff in fading interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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-3 (induced by source paper "the diversity multiplexing tradeoff of the mimo z interference channel")
  Member "on the degrees of freedom of the k user gaussian interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "real interference alignment exploiting the potential of single antenna systems")
  Member "on degrees of freedom region of mimo networks without csit":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the degrees of freedom region of temporally correlated mimo networks with delayed csit")
  Member "degrees of freedom of the k user m times n mimo interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "noma an information theoretic perspective")
  Member "generalized degrees of freedom of the symmetric gaussian k user interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "the two user gaussian compound interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "wireless network coding with local network views coded layer scheduling")

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)