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: "energy efficient hybrid precoding design for integrated multicast unicast millimeter wave communications with swipt"
  Abstract: In this paper, we investigate the energy-efficient hybrid precoding design for integrated multicast-unicast millimeter wave (mmWave) system, where the simultaneous wireless information and power transform is considered at receivers. We adopt two sparse radio frequency chain antenna structures at the base station (BS), i.e., fully-connected and subarray structures, and design the codebook-based analog precoding according to the different structures. Then, we formulate a joint digital multicast, unicast precoding and power splitting ratio optimization problem to maximize the energy efficiency of the system, while the maximum transmit power at the BS and minimum harvested energy at receivers are considered. Due to its difficulty to directly solve the formulated problem, we equivalently transform the fractional objective function into a subtractive form one and propose a two-loop iterative algorithm to solve it. For the outer loop, the classic Bi-section iterative algorithm is applied. For the inner loop, we transform the formulated problem into a convex one by successive convex approximation techniques and propose an iterative algorithm to solve it. Meanwhile, to reduce the complexity of the inner loop, we develop a zero forcing (ZF) technique-based low complexity iterative algorithm. Specifically, the ZF technique is applied to cancel the inter-unicast interference and the first order Taylor approximation is used for the convexification of the non-convex constraints in the original problem. Finally, simulation results are provided to compare the performance of the proposed algorithms under different schemes.

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)