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: "robust transceiver design for miso interference channel with energy harvesting"
  Abstract: In this paper, we consider the multiuser multiple-input single-output (MISO) interference channel where the received signal is divided into two parts for information decoding and energy harvesting (EH), respectively. The transmit beamforming vectors and receive power splitting (PS) ratios are jointly designed in order to minimize the total transmission power subject to both signal-to-interference-plus-noise ratio (SINR) and EH constraints. Most joint beamforming and power splitting (JBPS) designs assume that perfect channel state information (CSI) is available; however CSI errors are inevitable in practice. To overcome this limitation, we study the robust JBPS design problem assuming a norm-bounded error (NBE) model for the CSI. Three different solution approaches are proposed for the robust JBPS problem, each one leading to a different computational algorithm. Firstly, an efficient semidefinite relaxation (SDR)-based approach is presented to solve the highly non-convex JBPS problem, where the latter can be formulated as a semidefinite programming (SDP) problem. A rank-one recovery method is provided to recover a robust feasible solution to the original problem. Secondly, based on second order cone programming (SOCP) relaxation, we propose a low complexity approach with the aid of a closed-form robust solution recovery method. Thirdly, a new iterative method is also provided which can achieve near-optimal performance when the SDR-based algorithm results in a higher-rank solution. We prove that this iterative algorithm monotonically converges to a Karush-Kuhn-Tucker (KKT) solution of the robust JBPS problem. Finally, simulation results are presented to validate the robustness and efficiency of the proposed algorithms.

Connected through hyperedge HE-1 (induced by source paper "decentralized robust transceiver designs for miso swipt interference channel"):
  with members:
    - "reel bf design achieving the sdp bound for downlink beamforming with arbitrary shaping constraints"
    - "joint optimization of power and data transfer in multiuser mimo systems"
    - "communications and signals design for wireless power transmission"
    - "joint transceiver design algorithms for multiuser miso relay systems with energy harvesting"
    - "energy harvesting wireless communications a review of recent advances"
    - "robust beamforming for secure communication in systems with wireless information and power transfer"
    - "simultaneous wireless information and power transfer in modern communication systems"
    - "wireless networks with rf energy harvesting a contemporary survey"

Connected through hyperedge HE-2 (induced by source paper "joint transceiver design algorithms for multiuser miso relay systems with energy harvesting"):
  with members:
    - "a general design framework for mimo wireless energy transfer with limited feedback"
    - "distributed power splitting for swipt in relay interference channels using game theory"
    - "collaborative wireless energy and information transfer in interference channel"
    - "wireless networks with rf energy harvesting a contemporary survey"
    - "full duplex wireless powered relay with self energy recycling"
    - "multiuser miso beamforming for simultaneous wireless information and power transfer"
    - "joint transmit beamforming and receive power splitting for miso swipt systems"
    - "beamforming for miso interference channels with qos and rf energy transfer"

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)