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: "statistical analysis of multiantenna relay systems and power allocation algorithms in a relay with partial channel state information"
  Abstract: The performance of a dual-hop MIMO relay network is studied in this paper. The relay is assumed to have access to the statistical channel state information of its preceding and following channels, and it is assumed that fading at the antennas of the relay is correlated. The cumulative density function (cdf) of the received SNR at the destination is first studied, and closed-form expressions are derived for the asymptotic cases of the fully correlated and noncorrelated scenarios; moreover, the statistical characteristics of the SNR are further studied, and an approximate cdf of the SNR is derived for arbitrary correlation. The cdf is a multipartite function, which does not easily lend itself to further mathematical calculations, e.g., rate optimization. However, we use it to propose a simple power allocation algorithm, which we call “proportional power allocation.” The algorithm is explained in detail for the case of two antennas and three antennas at the relay, and the extension of the algorithm to a relay with an arbitrary number of the antennas is discussed. Although the proposed method is not claimed to be optimal, the result is indistinguishable from the benchmark obtained using exhaustive search. The simplicity of the algorithm combined with its precision is indeed attractive from the practical point of view.

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)