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 partitioning for less overhead in mimo interference channels"):
  Abstract: This paper presents a study on multiple-antenna interference channels, accounting for general overhead as a function of the number of users and antennas in the network. The model includes both perfect and imperfect channel state information based on channel estimation in the presence of noise. Three low complexity methods are proposed for reducing the impact of overhead in the sum network throughput by partitioning users into orthogonal groups. The first method allocates spectrum to the groups equally, creating an imbalance in the sum rate of each group. The second proposed method allocates spectrum unequally among the groups to provide rate fairness. Finally, geographic grouping is proposed for cases where some receivers do not observe significant interference from other transmitters. For each partitioning method, the optimal solution not only requires a brute force search over all possible partitions, but also requires full channel state information, thereby defeating the purpose of partitioning. We therefore propose greedy methods to solve the problems, requiring no instantaneous channel knowledge. Simulations show that the proposed greedy methods switch from time-division to interference alignment as the coherence time of the channel increases, and have a small loss relative to optimal partitioning only at moderate coherence times.

Includes members:
  Member "interference alignment for the k user mimo interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "achievable dof delay trade offs for the k user mimo interference channel with delayed csit")
  Member "cooperative algorithms for mimo interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the capacity and optimal signaling for gaussian mimo channels under interference constraints full version")
  Member "exploiting channel correlations simple interference alignment schemes with no csit":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "achievable dof delay trade offs for the k user mimo interference channel with delayed csit")
  Member "on feasibility of interference alignment in mimo interference networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "joint optimization of signal design and resource allocation in wireless d2d edge computing")
  Member "performance of interference alignment in clustered wireless ad hoc networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "generalized interference alignment part ii application to wireless secrecy")
  Member "mode switching for the multi antenna broadcast channel based on delay and channel quantization":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "delay performance of the multiuser miso downlink under imperfect csi and finite length coding")
  Member "isotropic mimo interference channels without csit the loss of degrees of freedom":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "elements of cellular blind interference alignment aligned frequency reuse wireless index coding and interference diversity")
  Member "on feasibility of interference alignment in mimo interference networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "joint optimization of signal design and resource allocation in wireless d2d edge computing")

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)