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 "user arrival in mimo interference alignment networks"):
  Abstract: In this paper we analyze a constant multiple-input multiple-output interference channel where a set of active users are cooperating through interference alignment while a set of secondary users desire access to the channel. We find the minimum number of secondary transmit antennas required so that a secondary user can use the channel without affecting the sum rate of the active users, under a zero-forcing equalization assumption. When the secondary users have enough antennas, we derive several secondary user precoders that approximately maximize the secondary users' sum rate without changing the sum rate of the active users. When the secondary users do not have enough antennas, we perform numerical optimization to find secondary user precoders that cause minimum degradation to the sum rate of the active users. Through simulations, we confirm that i) with enough antennas at the secondary users, gains equivalent to the case of all the users cooperating through interference alignment is obtainable, and ii) when the secondary users do not have enough antennas, large rate losses at the active users can be avoided.channels

Includes members:
  Member "settling the feasibility of interference alignment for the mimo interference channel the symmetric square case":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "generalized interference alignment part i theoretical framework")
  Member "mimo interference alignment over correlated channels with imperfect csi":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the feasibility of interference alignment in compounded mimo broadcast channels with antenna correlation and mixed user classes")
  Member "cooperative algorithms for mimo interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the capacity and optimal signaling for gaussian mimo channels under interference constraints full version")
  Member "interference alignment as a rank constrained rank minimization":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "generalized low rank optimization for topological cooperation in ultra dense networks")
  Member "on feasibility of interference alignment in mimo interference networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "joint optimization of signal design and resource allocation in wireless d2d edge computing")
  Member "interference alignment with analog channel state feedback":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the feasibility of interference alignment in compounded mimo broadcast channels with antenna correlation and mixed user classes")
  Member "interference alignment under limited feedback for mimo interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "opportunistic downlink interference alignment for multi cell mimo networks")
  Member "on feasibility of interference alignment in mimo interference networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "joint optimization of signal design and resource allocation in wireless d2d edge computing")

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)