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: "capitalizing backscatter aided hybrid relay communications with wireless energy harvesting"
  Abstract: In this work, we employ multiple energy harvesting relays to assist information transmission from a multi-antenna hybrid access point (HAP) to a receiver. All the relays are wirelessly powered by the HAP in the power-splitting (PS) protocol. We introduce the novel concept of hybrid relay communications, which allows each relay to switch between two radio modes, i.e., the active RF communications and the passive backscatter communications, according to its channel and energy conditions. We envision that the complement transmissions in two radio modes can be exploited to improve the overall relay performance. As such, we aim to jointly optimize the HAP's beamforming, individual relays' radio mode, the PS ratio, and the relays' collaborative beamforming to enhance the throughput performance at the receiver. The resulting formulation becomes a combinatorial and non-convex problem. Thus, we firstly propose a convex approximation to the original problem, which serves as a lower bound of the relay performance. Then, we design an iterative algorithm that decomposes the binary relay mode optimization from the other operating parameters. In the inner loop of the algorithm, we exploit the structural properties to optimize the relay performance with the fixed relay mode in the alternating optimization framework. In the outer loop, different performance metrics are derived to guide the search for a set of passive relays to further improve the relay performance. Simulation results verify that the hybrid relaying communications can achieve 20% performance improvement compared to the conventional relay communications with all active relays.

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)