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: "decentralized robust transceiver designs for miso swipt interference channel"
  Abstract: This paper considers a $K$-user multiple-input single-output (MISO) interference channels for simultaneous wireless information and power transfer (SWIPT), where each multi-antenna transmitter serves a single-antenna receiver per user pair. All receivers perform simultaneously information processing and energy harvesting (EH) based on the receive power-splitting (PS) architectures. Assuming imperfect channel state information (CSI) at the transmitters, we develop an optimal robust transceiver design scheme that minimizes the total transmission power under the worst-case signal-to-interference-plus-noise ratio (SINR) and energy harvesting (EH) constraints at the receivers, by jointly optimizing transmit beamforming and receive PS ratio per receiver. When the CSI uncertainties are bounded by ellipsoidal regions, it is shown that the worst-case SINR and EH constraints per receiver can be recast into quadratic matrix inequality forms. Leveraging semidefinite relaxation technique, the intended robust beamforming and PS (BFPS) problem can be relaxed as a tractable (centralized) semidefinite program (SDP). More importantly, relying on the state-of-the-art alternating direction method of multipliers (ADMM) in convex optimization, we propose a {\em decentralized} algorithm capable of computing the optimal robust BFPS scheme with local CSI and limited information exchange among the transmitters. It is shown the proposed decentralized algorithm is guaranteed to converge to the optimal centralized solution. Numerical results are provided to demonstrate the merits of the proposed approaches.

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)