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: "capacity regions and sum rate capacities of vector gaussian interference channels"
  Abstract: The capacity regions of vector, or multiple-input multiple-output, Gaussian interference channels are established for very strong interference and aligned strong interference. Furthermore, the sum-rate capacities are established for Z interference, noisy interference, and mixed (aligned weak/intermediate and aligned strong) interference. These results generalize known results for scalar Gaussian interference channels.

Connected through hyperedge HE-1 (induced by source paper "signal processing and optimal resource allocation for the interference channel"):
  with members:
    - "joint power and admission control via linear programming deflation"
    - "on the degrees of freedom achievable through interference alignment in a mimo interference channel"
    - "linear transceiver design for a mimo interfering broadcast channel achieving max min fairness"
    - "averaged iterative water filling algorithm robustness and convergence"
    - "robust linear precoder design for multi cell downlink transmission"
    - "rate region frontiers for n user interference channel with interference as noise"
    - "balancing egoism and altruism on the interference channel the mimo case"
    - "dynamic resource allocation in cognitive radio networks"

Connected through hyperedge HE-2 (induced by source paper "on the capacity and degrees of freedom regions of two user mimo interference channels with limited receiver cooperation"):
  with members:
    - "leveraging physical layer capabilites distributed scheduling in interference networks with local views"
    - "a survey on device to device communication in cellular networks"
    - "on the capacity region and the generalized degrees of freedom region for the mimo interference channel with feedback"
    - "fundamental limits of cooperation"
    - "the capacity region of the mimo interference channel and its reciprocity to within a constant gap"
    - "on achieving local view capacity via maximal independent graph scheduling"
    - "multi user mimo with outdated csi training feedback and scheduling"
    - "interference channels with source cooperation"

Connected through hyperedge HE-3 (induced by source paper "on the optimality of treating interference as noise compound interference networks"):
  with members:
    - "on the optimality of treating interference as noise a combinatorial optimization perspective"
    - "on the optimality of treating interference as noise general message sets"
    - "on the optimality of treating interference as noise"
    - "index coding an interference alignment perspective"
    - "achievable and crystallized rate regions of the interference channel with interference as noise"
    - "wireless network information flow a deterministic approach"
    - "on the degrees of freedom of the compound mimo broadcast channels with finite states"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"

Connected through hyperedge HE-4 (induced by source paper "on the optimality of treating interference as noise general message sets"):
  with members:
    - "on the optimality of treating interference as noise"
    - "wireless network information flow a deterministic approach"
    - "the capacity region of the mimo interference channel and its reciprocity to within a constant gap"
    - "interference alignment from degrees of freedom to constant gap capacity approximations"
    - "a digital interface for gaussian relay and interference networks lifting codes from the discrete superposition model"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "capacity bounds for the gaussian interference channel"
    - "the two user gaussian interference channel a deterministic view"

Connected through hyperedge HE-5 (induced by source paper "on the capacity region and the generalized degrees of freedom region for the mimo interference channel with feedback"):
  with members:
    - "capacity of all nine models of channel output feedback for the two user interference channel"
    - "sum capacity of interference channels with a local view impact of distributed decisions"
    - "fundamental limits of cooperation"
    - "the capacity region of the mimo interference channel and its reciprocity to within a constant gap"
    - "on achieving local view capacity via maximal independent graph scheduling"
    - "multi user mimo with outdated csi training feedback and scheduling"
    - "interference channels with rate limited feedback"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"

Connected through hyperedge HE-6 (induced by source paper "noisy interference sum rate capacity for vector gaussian interference channels"):
  with members:
    - "capacity region of vector gaussian interference channels with generally strong interference"
    - "optimal beamforming in interference networks with perfect local channel information"
    - "cooperative interference management with miso beamforming"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "capacity bounds for the gaussian interference channel"
    - "new outer bounds on the capacity region of gaussian interference channels"
    - "gaussian interference channel capacity to within one bit"
    - "the capacity region of a class of discrete degraded interference channels"

Connected through hyperedge HE-7 (induced by source paper "on precoding for constant k user mimo gaussian interference channel with finite constellation inputs"):
  with members:
    - "real interference alignment exploiting the potential of single antenna systems"
    - "linear precoder design for mimo interference channels with finite alphabet signaling"
    - "interference alignment for the mimo interference channel with delayed local csit"
    - "two user gaussian interference channel with finite constellation input and fdma"
    - "achievable rates in two user interference channels with finite inputs and very strong interference"
    - "interference alignment for the k user mimo interference channel"
    - "linear transceiver design for interference alignment complexity and computation"
    - "mimo precoding with x and y codes"

Connected through hyperedge HE-8 (induced by source paper "capacity region of vector gaussian interference channels with generally strong interference"):
  with members:
    - "noisy interference sum rate capacity for vector gaussian interference channels"
    - "mimo z interference channels capacity under strong and noisy interference"

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)