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 "on the capacity region and the generalized degrees of freedom region for the mimo interference channel with feedback"):
  Abstract: In this paper, we study the effect of feedback on the two-user MIMO interference channel. The capacity region of the MIMO interference channel with feedback is characterized within a constant number of bits, where this constant is independent of the channel matrices. Further, it is shown that the capacity region of the MIMO interference channel with feedback and its reciprocal interference channel are within a constant number of bits. Finally, the generalized degrees of freedom region for the MIMO interference channel with feedback is characterized.

Includes members:
  Member "capacity of all nine models of channel output feedback for the two user interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the symmetric k user interference channels with limited feedback")
  Member "sum capacity of interference channels with a local view impact of distributed decisions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "dof region of the decentralized mimo broadcast channel unicode x2014 how many informed antennas do we need")
  Member "fundamental limits of cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "area spectral efficiency and sinr scaling laws in multi antenna cellular networks")
  Member "the capacity region of the mimo interference channel and its reciprocity to within a constant gap":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "towards an extremal network theory robust gdof gain of transmitter cooperation over tin")
  Member "on achieving local view capacity via maximal independent graph scheduling":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the degrees of freedom of two unicast wireless networks with delayed csit")
  Member "multi user mimo with outdated csi training feedback and scheduling":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the capacity and degrees of freedom regions of two user mimo interference channels with limited receiver cooperation")
  Member "interference channels with rate limited feedback":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "capacity results for intermittent x channels with delayed channel state feedback")
  Member "the approximate capacity of the many to one and one to many gaussian interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-8 (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)