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: "interference exploitation precoding made practical closed form solutions with optimal performance"
  Abstract: In this paper, we propose closed-form precoding schemes with optimal performance for constructive interference (CI) exploitation in the multiuser multiple-input single-output (MU-MISO) downlink. We first consider an optimization where we maximize the distance between the constructive region and the detection thresholds. The cases of both strict and non-strict phase rotation are considered and can further be formulated as convex optimization problems. For optimization with strict phase rotation, we mathematically derive the optimal beamforming structure with Lagrangian and Karush-Kuhn-Tucker (KKT) conditions. By formulating its dual problem, the optimization problem is further shown to be equivalent to a quadratic programming (QP) over a simplex, which can be solved more efficiently. We then extend our analysis to the case of non-strict phase rotation, where it is mathematically shown that a K-dimensional optimization for non-strict phase rotation is equivalent to a 2K-dimensional optimization for strict phase rotation in terms of the problem formulation. The connection with the conventional zero-forcing (ZF) precoding is also discussed. Based on the above analysis, we further propose an iterative closed-form scheme to obtain the optimal beamforming matrix, where within each iteration a closed-form solution can be obtained. Numerical results validate our analysis and the optimality of the proposed iterative scheme, and further show that the proposed closed-form scheme is more efficient than the conventional QP algorithms with interior-point methods, which motivates the use of CI beamforming in practical wireless systems.

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)