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 "signal processing and optimal resource allocation for the interference channel"):
  Abstract: Abstract   In this article, several design and complexity issues of the optimal physical layer resource allocation problem for generic interference channels are surveyed. The computational complexity, the convexity as well as the duality of the optimal resource allocation problem is discussed. Various existing algorithms for resource allocation are presented and compared. Open research problems are discussed throughout the article.

Includes members:
  Member "joint power and admission control via linear programming deflation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "joint long term admission control and beamforming in green downlink networks offline and online approaches")
  Member "on the degrees of freedom achievable through interference alignment in a mimo interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "centralized and decentralized cache aided interference management in heterogeneous parallel channels")
  Member "linear transceiver design for a mimo interfering broadcast channel achieving max min fairness":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "load balancing user association in millimeter wave mimo networks")
  Member "averaged iterative water filling algorithm robustness and convergence":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a parallel decomposition method for nonconvex stochastic multi agent optimization problems")
  Member "robust linear precoder design for multi cell downlink transmission":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "non orthogonal unicast and broadcast transmission via joint beamforming and ldm in cellular networks")
  Member "rate region frontiers for n user interference channel with interference as noise":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "full duplex radio for uplink downlink wireless access with spatially random nodes")
  Member "balancing egoism and altruism on the interference channel the mimo case":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "optimized transmission with improper gaussian signaling in the k user miso interference channel")
  Member "capacity regions and sum rate capacities of vector gaussian interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on the capacity and degrees of freedom regions of two user mimo interference channels with limited receiver cooperation")

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)