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 "k user symmetric m times n mimo interference channel under finite precision csit a gdof perspective"):
  Abstract: Generalized Degrees of Freedom (GDoF) are characterized for the symmetric $K$-user Multiple Input Multiple Output (MIMO) Interference Channel (IC) under the assumption that the channel state information at the transmitters (CSIT) is limited to finite precision. In this symmetric setting, each transmitter is equipped with $M$ antennas, each receiver is equipped with $N$ antennas, each desired channel (i.e., a channel between a transmit antenna and a receive antenna belonging to the same user) has strength $\sim P$, while each undesired channel has strength $\sim P^\alpha$, where $P$ is a nominal SNR parameter. The result generalizes a previous GDoF characterization for the SISO setting $(M=N=1)$ and is enabled by a significant extension of the Aligned Image Sets bound that is broadly useful. GDoF per user take the form of a $W$-curve with respect to $\alpha$ for fixed values of $M$ and $N$. Under finite precision CSIT, in spite of the presence of multiple antennas, all the benefits of interference alignment are lost.

Includes members:
  Member "sum set inequalities from aligned image sets instruments for robust gdof bounds":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "dof region of the decentralized mimo broadcast channel unicode x2014 how many informed antennas do we need")
  Member "aligned image sets and the generalized degrees of freedom of symmetric mimo interference channel with partial csit":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "towards an extremal network theory robust gdof gain of transmitter cooperation over tin")
  Member "gdof of the k user symmetric miso bc bridging the gap between finite precision and perfect csit":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimality of simple layered superposition coding in the 3 user miso bc with finite precision csit")
  Member "gdof of the miso bc bridging the gap between finite precision and perfect csit":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "rate splitting multiple access for downlink communication systems bridging generalizing and outperforming sdma and noma")
  Member "generalized degrees of freedom of the symmetric k user interference channel under finite precision csit":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimality of treating inter cell interference as noise under finite precision csit")
  Member "the degrees of freedom of mimo interference channels without state information at transmitters":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the degrees of freedom of k user siso interference and x channels 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-7 (induced by source paper "aligned image sets and the generalized degrees of freedom of symmetric mimo interference channel with partial csit")
  Member "generalized degrees of freedom of the symmetric gaussian k user interference channel":
    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)