human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "on beamformer design for multiuser mimo interference channels"
  Abstract: This paper considers several linear beamformer design paradigms for multiuser time-invariant multiple-input multiple-output interference channels. Notably, interfe rence alignment and sum-rate based algorithms such as the maximum signal-to-interference-plus noise (max-SINR) algorithm are considered. Optimal linear beamforming under interference alignment consists of two layers; an inner precoder and decoder (or receive filter) accomplish interference alignment to eliminate inter-user interfere nce, and an outer precoder and decoder diagonalize the effective single-user channel resulting from the interferen ce alignment by the inner precoder and decoder. The relationship between this two-layer beamforming and the max-SINR algorithm is established at high signal-to-noise ratio. Also, the optimality of the max-SINR algorithm within the class of linear beamforming algorithms, and its local convergence with exponential rate, are established at high signal-to-noise ratio.

Connected through hyperedge HE-1 (induced by source paper "sub stream fairness and numerical correctness in mimo interference channels"):
  with members:
    - "signal processing and optimal resource allocation for the interference channel"
    - "on the degrees of freedom achievable through interference alignment in a mimo interference channel"
    - "contractive interference functions and rates of convergence of distributed power control laws"
    - "achieving global optimality for weighted sum rate maximization in the k user gaussian interference channel with multiple antennas"
    - "multiuser mimo downlink beamforming design based on group maximum sinr filtering"
    - "settling the feasibility of interference alignment for the mimo interference channel the symmetric square case"
    - "cooperative algorithms for mimo interference channels"
    - "interference alignment as a rank constrained rank minimization"

Connected through hyperedge HE-2 (induced by source paper "linear precoder design for mimo interference channels with finite alphabet signaling"):
  with members:
    - "mimo interference alignment over correlated channels with imperfect csi"
    - "precoding by pairing subchannels to increase mimo capacity with discrete input alphabets"
    - "user partitioning for less overhead in mimo interference channels"
    - "statistical eigenmode transmission over jointly correlated mimo channels"
    - "degrees of freedom of the k user m times n mimo interference channel"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-3 (induced by source paper "interference alignment as a rank constrained rank minimization"):
  with members:
    - "on the degrees of freedom achievable through interference alignment in a mimo interference channel"
    - "settling the feasibility of interference alignment for the mimo interference channel the symmetric square case"
    - "cooperative algorithms for mimo interference channels"
    - "on feasibility of interference alignment in mimo interference networks"
    - "linear transceiver design for interference alignment complexity and computation"
    - "the power of convex relaxation near optimal matrix completion"
    - "on feasibility of interference alignment in mimo interference networks"
    - "on the achievability of interference alignment in the k user constant mimo interference channel"

Question: Please tell me which class the center node 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)