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: "average minimum transmit power to achieve sinr targets performance comparison of various user selection algorithms"
  Abstract: In multi-user communication from one base station (BS) to multiple users, the problem of minimizing the transmit power to achieve some target guaranteed performance (rates) at users has been well investigated in the literature. Similarly various user selection algorithms have been proposed and analyzed when the BS has to transmit to a subset of the users in the system, mostly for the objective of the sum rate maximization. #R##N#We study the joint problem of minimizing the transmit power at the BS to achieve specific signal-to-interference-and-noise ratio (SINR) targets at users in conjunction with user scheduling. The general analytical results for the average transmit power required to meet guaranteed performance at the users' side are difficult to obtain even without user selection due to joint optimization required over beamforming vectors and power allocation scalars. We study the transmit power minimization problem with various user selection algorithms, namely semi-orthogonal user selection (SUS), norm-based user selection (NUS) and angle-based user selection (AUS). When the SINR targets to achieve are relatively large, the average minimum transmit power expressions are derived for NUS and SUS for any number of users. For the special case when only two users are selected, similar expressions are further derived for AUS and a performance upper bound which serves to benchmark the performance of other selection schemes. Simulation results performed under various settings indicate that SUS is by far the better user selection criterion.

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)