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: "efficient computation of pareto optimal beamforming vectors for the miso interference channel with successive interference cancellation"
  Abstract: We study the two-user multiple-input single-output (MISO) Gaussian interference channel where the transmitters have perfect channel state information and employ single-stream beamforming. The receivers are capable of performing successive interference cancellation, so when the interfering signal is strong enough, it can be decoded, treating the desired signal as noise, and subtracted from the received signal, before the desired signal is decoded. We propose efficient methods to compute the Pareto-optimal rate points and corresponding beamforming vector pairs, by maximizing the rate of one link given the rate of the other link. We do so by splitting the original problem into four subproblems corresponding to the combinations of the receivers' decoding strategies-either decode the interference or treat it as additive noise. We utilize recently proposed parameterizations of the optimal beamforming vectors to equivalently reformulate each subproblem as a quasi-concave problem, which we solve very efficiently either analytically or via scalar numerical optimization. The computational complexity of the proposed methods is several orders-of-magnitude less than the complexity of the state-of-the-art methods. We use the proposed methods to illustrate the effect of the strength and spatial correlation of the channels on the shape of the rate region.

Connected through hyperedge HE-1 (induced by source paper "beam design and user scheduling for nonorthogonal multiple access with multiple antennas based on pareto optimality"):
  with members:
    - "a minorization maximization method for optimizing sum rate in the downlink of non orthogonal multiple access systems"
    - "the application of mimo to non orthogonal multiple access"
    - "fairness for non orthogonal multiple access in 5g systems"
    - "uplink non orthogonal multiple access for 5g wireless networks"
    - "on the performance of non orthogonal multiple access in 5g systems with randomly deployed users"
    - "beamforming on the miso interference channel with multi user decoding capability"

Connected through hyperedge HE-2 (induced by source paper "achievable outage rate regions for the miso interference channel"):
  with members:
    - "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"
    - "exchange economy in two user multiple input single output interference channels"
    - "mimo diversity in the presence of double scattering"

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)