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: "power loading in parallel diversity channels based on statistical channel information"
  Abstract: In this paper, we show that there exists an arbitrary number of power allocation schemes that achieve capacity in systems operating in parallel channels comprised of single-input multiple-output (SIMO) Nakagami-m fading subchannels when the number of degrees of freedom L (e.g., the number of receive antennas) tends to infinity. Statistical waterfilling -- i.e., waterfilling using channel statistics rather than instantaneous channel knowledge -- is one such scheme. We further prove that the convergence of statistical waterfilling to the optimal power loading scheme is at least O(1/(L log(L))), whereas convergence of other schemes is at worst O(1/log(L)). To validate and demonstrate the practical use of our findings, we evaluate the mutual information of example SIMO parallel channels using simulations as well as new measured ultrawideband channel data.

Connected through hyperedge HE-1 (induced by source paper "difference antenna selection and power allocation for wireless cognitive systems"):
  with members:
    - "exploiting multi antennas for opportunistic spectrum sharing in cognitive radio networks"
    - "on peak versus average interference power constraints for protecting primary users in cognitive radio networks"
    - "on the capacity of a class of mimo cognitive radios"
    - "weighted sum rate optimization for cognitive radio mimo broadcast channels"

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)