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 "a new outer bound via interference localization and the degrees of freedom regions of mimo interference networks with no csit"):
  Abstract: The two-user multi-input, multi-output (MIMO) interference and cognitive radio channels are studied under the assumption of no channel state information at the transmitter (CSIT) from the degrees of freedom (DoF) region perspective. With $M_i$ and $N_i$ denoting the number of antennas at transmitter $i$ and receiver $i$ respectively, the DoF regions of the MIMO interference channel were recently characterized by Huang et al., Zhu and Guo, and by the authors of this paper for all values of numbers of antennas except when $\min(M_1,N_1) > N_2 > M_2$ (or $\min(M_2,N_2) > N_1 > M_1$). This latter case was solved more recently by Zhu and Guo who provided a tight outer-bound. Here, a simpler and more widely applicable proof of that outer-bound is given based on the idea of interference localization. Using it, the DoF region is also established for the class of MIMO cognitive radio channels when $\min(M_1+M_2,N_1) > N_2 > M_2$ (with the second transmitter cognitive) -- the only class for which the inner and outer bounds previously obtained by the authors were not tight -- thereby completing the DoF region characterization of the general 2-user MIMO cognitive radio channel as well.

Includes members:
  Member "the degrees of freedom of mimo interference channels without state information at transmitters":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "k user symmetric m times n mimo interference channel under finite precision csit a gdof perspective")
  Member "isotropic mimo interference channels without csit the loss of degrees of freedom":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "elements of cellular blind interference alignment aligned frequency reuse wireless index coding and interference diversity")
  Member "on degrees of freedom region of mimo networks without csit":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the degrees of freedom region of temporally correlated mimo networks with delayed csit")
  Member "the degrees of freedom regions of mimo broadcast interference and cognitive radio channels with no csit":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "k user symmetric m times n mimo interference channel under finite precision csit a gdof perspective")
  Member "degrees of freedom of the mimo interference channel with cooperation and cognition":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "cognitive radio networks an information theoretic perspective")
  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)