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: "optimal power allocation for a massive mimo relay aided secure communication"
  Abstract: In this paper, we address the problem of optimal power allocation at the relay in two-hop secure communications under practical conditions. To guarantee secure communication during the long-distance transmission, the massive MIMO (M-MIMO) relaying techniques are explored to significantly enhance wireless security. The focus of this paper is on the analysis and design of optimal power assignment for a decode-and-forward (DF) M-MIMO relay, so as to maximize the secrecy outage capacity and minimize the interception probability, respectively. Our study reveals the condition for a nonnegative the secrecy outage capacity, obtains closed-form expressions for optimal power, and presents the asymptotic characteristics of secrecy performance. Finally, simulation results validate the effectiveness of the proposed schemes.

Connected through hyperedge HE-1 (induced by source paper "secrecy wireless information and power transfer challenges and opportunities"):
  with members:
    - "physical layer security in three tier wireless sensor networks a stochastic geometry approach"
    - "secure massive mimo transmission with an active eavesdropper"
    - "large scale mimo relaying techniques for physical layer security af or df"
    - "multi antenna relay aided wireless physical layer security"
    - "enhancing wireless information and power transfer by exploiting multi antenna techniques"
    - "robust beamforming for secure communication in systems with wireless information and power transfer"
    - "secure and green swipt in distributed antenna networks with limited backhaul capacity"
    - "secure beamforming for mimo broadcasting with wireless information and power 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)