human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "user selection in mimo interfering broadcast channels"):
  Abstract: Interference alignment aims to achieve maximum degrees of freedom in an interference system. For achieving Interference alignment in interfering broadcast systems a closed-form solution is proposed in which is an extension of the grouping scheme in . In a downlink scenario where there are a large number of users, the base station is required to select a subset of users such that the sum rate is maximized. To search for the optimal user subset using brute-force approach is computationally exhaustive because of the large number of possible user subset combinations. We propose a user selection algorithm achieving sum rate close to that of optimal solution. The algorithm employs coordinate ascent approach and exploits orthogonality between the desired signal space and the interference channel space in the reciprocal system to select the user at each step. For the sake of completeness, we have also extended the sum rate approach based algorithm to Interfering broadcast channel. The complexity of both these algorithms is shown to be linear with respect to the total number of users as compared to exponential in brute-force search.

Includes members:
  Member "conditional entropy based user selection for multiuser mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "objective information theory a sextuple model and 9 kinds of metrics")
  Member "on the achievable dof and user scaling law of opportunistic interference alignment in 3 transmitter mimo interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "opportunistic downlink interference alignment for multi cell mimo networks")
  Member "downlink interference alignment":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimality of treating inter cell interference as noise under finite precision csit")
  Member "approaching the capacity of wireless networks through distributed interference alignment":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fundamental limits of dynamic interference management with flexible message assignments")
  Member "a distributed dynamic frequency allocation algorithm":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "interference avoidance game in the gaussian interference channel sub optimal and optimal schemes")

Question: Please tell me which class the source paper 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)