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: "multi objective resource allocation in full duplex swipt systems"
  Abstract: In this paper, we investigate the resource allocation algorithm design for full-duplex simultaneous wireless information and power transfer (FD-SWIPT) systems. The considered system comprises a FD radio base station, multiple single-antenna half-duplex (HD) users, and multiple energy harvesters equipped with multiple antennas. We propose a multi-objective optimization framework to study the trade-off between uplink transmit power minimization, downlink transmit power minimization, and total harvested energy maximization. The considered optimization framework takes into account heterogeneous quality of service requirements for uplink and downlink communication and wireless power transfer. The non-convex multi-objective optimization problem is transformed into an equivalent rank-constrained semidefinite program (SDP) and solved optimally by SDP relaxation under certain general conditions. The solution of the proposed framework results in a set of Pareto optimal resource allocation policies. Numerical results unveil an interesting trade-off between the considered conflicting system design objectives and reveal the improved power efficiency facilitated by FD in SWIPT systems compared to traditional HD systems.

Connected through hyperedge HE-1 (induced by source paper "multi objective optimization for energy and spectral efficiency tradeoff in in band full duplex ibfd communication"):
  with members:
    - "optimal joint power and subcarrier allocation for full duplex multicarrier non orthogonal multiple access systems"
    - "resource allocation in ofdma networks with half duplex and imperfect full duplex users"
    - "power efficient resource allocation for full duplex radio distributed antenna networks"
    - "throughput analysis for full duplex wireless networks with imperfect self interference cancellation"

Connected through hyperedge HE-2 (induced by source paper "interference exploitation in full duplex communications trading interference power for both uplink and downlink power savings"):
  with members:
    - "probabilistically robust swipt for secrecy misome systems"
    - "unraveling the rank one solution mystery of robust miso downlink transmit optimization a verifiable sufficient condition via a new duality result"
    - "transmit precoding for interference exploitation in the underlay cognitive radio z channel"
    - "energy efficient symbol level precoding in multiuser miso based on relaxed detection region"
    - "symbol level multiuser miso precoding for multi level adaptive modulation"
    - "constructive interference through symbol level precoding for multi level modulation"
    - "constructive multiuser interference in symbol level precoding for the miso downlink channel"
    - "a geometrical based throughput bound analysis for device to device communications in cellular networks"

Connected through hyperedge HE-3 (induced by source paper "robust chance constrained optimization for power efficient and secure swipt systems"):
  with members:
    - "probabilistically robust swipt for secrecy misome systems"
    - "robust resource allocation for mimo wireless powered communication networks based on a non linear eh model"
    - "robust an aided beamforming and power splitting design for secure miso cognitive radio with swipt"
    - "safe and secure wireless power transfer networks challenges and opportunities in rf based systems"
    - "wireless powered communication networks an overview"
    - "secrecy wireless information and power transfer challenges and opportunities"
    - "ambient rf energy harvesting in ultra dense small cell networks performance and trade offs"
    - "secrecy transmit beamforming for heterogeneous networks"

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)