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: "minimizing sum mse implies identical downlink and dual uplink power allocations"
  Abstract: In the multiuser downlink, power allocation for linear precoders that minimize the sum of mean squared errors under a sum power constraint is a non-convex problem. Many existing algorithms solve an equivalent convex problem in the virtual uplink and apply a transformation based on uplink-downlink duality to find a downlink solution. In this letter, we analyze the optimality criteria for the power allocation subproblem in the virtual uplink, and demonstrate that the optimal solution leads to identical power allocations in the downlink and virtual uplink. We thus extend the known duality results and, importantly, simplify the existing algorithms used for iterative transceiver design.

Connected through hyperedge HE-1 (induced by source paper "optimal shape gain quantization for multiuser mimo systems with linear precoding"):
  with members:
    - "bit allocation law for multiantenna channel feedback quantization single user case"
    - "bit allocation laws for multi antenna channel feedback quantization multi user case"
    - "mimo broadcast channels with finite rate feedback"

Connected through hyperedge HE-2 (induced by source paper "tranceiver design using linear precoding in a multiuser mimo system with limited feedback"):
  with members:
    - "limited feedback based block diagonalization for the mimo broadcast channel"
    - "antenna combining for the mimo downlink channel"
    - "mimo broadcast channels with block diagonalization and finite rate feedback"
    - "mimo broadcast channels with finite rate feedback"
    - "a feedback reduction technique for mimo broadcast channels"

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)