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: "achievable outage rate regions for the miso interference channel"
  Abstract: We consider the slow-fading two-user multiple-input single-output (MISO) interference channel. We want to understand which rate points can be achieved, allowing a non-zero outage probability. We do so by defining four different outage rate regions. The definitions differ on whether the rates are declared in outage jointly or individually and whether the transmitters have instantaneous or statistical channel state information (CSI). The focus is on the instantaneous CSI case with individual outage, where we propose a stochastic mapping from the rate point and the channel realization to the beamforming vectors. A major contribution is that we prove that the stochastic component of this mapping is independent of the actual channel realization.

Connected through hyperedge HE-1 (induced by source paper "stable throughput region of the two user interference channel"):
  with members:
    - "stable throughput and delay analysis of a random access network with queue aware transmission"
    - "stable throughput region of the two user broadcast channel"
    - "effect of energy harvesting on stable throughput in cooperative relay systems"
    - "multi user cognitive interference channels a survey and new capacity results"
    - "the stability region of the two user interference channel"
    - "relay assisted multiple access with multi packet reception capability and simultaneous transmission and reception"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"

Connected through hyperedge HE-2 (induced by source paper "multicell coordinated beamforming with rate outage constraint part i complexity analysis"):
  with members:
    - "signal processing and optimal resource allocation for the interference channel"
    - "multicell coordinated beamforming with rate outage constraint part ii efficient approximation algorithms"
    - "coordinated beamforming for multiuser miso interference channel under rate outage constraints"
    - "pareto characterization of the multicell mimo performance region with simple receivers"
    - "outage probability and outage based robust beamforming for mimo interference channels with imperfect channel state information"
    - "achieving global optimality for weighted sum rate maximization in the k user gaussian interference channel with multiple antennas"
    - "optimality properties distributed strategies and measurement based evaluation of coordinated multicell ofdma transmission"
    - "optimal beamforming in interference networks with perfect local channel information"

Connected through hyperedge HE-3 (induced by source paper "multicell coordinated beamforming with rate outage constraint part ii efficient approximation algorithms"):
  with members:
    - "signal processing and optimal resource allocation for the interference channel"
    - "multicell coordinated beamforming with rate outage constraint part i complexity analysis"
    - "coordinated beamforming for multiuser miso interference channel under rate outage constraints"
    - "outage probability and outage based robust beamforming for mimo interference channels with imperfect channel state information"
    - "distributed multicell beamforming design approaching pareto boundary with max min fairness"
    - "robust monotonic optimization framework for multicell miso systems"
    - "achieving global optimality for weighted sum rate maximization in the k user gaussian interference channel with multiple antennas"
    - "optimality properties distributed strategies and measurement based evaluation of coordinated multicell ofdma transmission"

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)