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: "optimal dynamic point selection for power minimization in multiuser downlink comp"
  Abstract: This paper examines a CoMP system where multiple base-stations (BS) employ coordinated beamforming to serve multiple mobile-stations (MS). Under the dynamic point selection mode, each MS can be assigned to only one BS at any time. This work then presents a solution framework to optimize the BS associations and coordinated beamformers for all MSs. With target signal-to-interference-plus-noise ratios at the MSs, the design objective is to minimize either the weighted sum transmit power or the per-BS transmit power margin. Since the original optimization problems contain binary variables indicating the BS associations, finding their optimal solutions is a challenging task. To circumvent this difficulty, we first relax the original problems into new optimization problems by expanding their constraint sets. Based on the nonconvex quadratic constrained quadratic programming framework, we show that these relaxed problems can be solved optimally. Interestingly, with the first design objective, the obtained solution from the relaxed problem is also optimal to the original problem. With the second design objective, a suboptimal solution to the original problem is then proposed, based on the obtained solution from the relaxed problem. Simulation results show that the resulting jointly optimal BS association and beamforming design significantly outperforms fixed BS association schemes.

Connected through hyperedge HE-1 (induced by source paper "robust resource allocation for pd noma based miso heterogeneous networks with comp technology"):
  with members:
    - "radio resource allocation for device to device underlay communication using hypergraph theory"
    - "user association in 5g networks a survey and an outlook"
    - "optimal joint power and subcarrier allocation for full duplex multicarrier non orthogonal multiple access systems"
    - "optimal stochastic coordinated beamforming for wireless cooperative networks with csi uncertainty"
    - "low complexity delay constrained beamforming for multi user mimo systems with imperfect csit"
    - "robust monotonic optimization framework for multicell miso systems"
    - "worst case sinr constrained robust coordinated beamforming for multicell wireless systems"
    - "probabilistic sinr constrained robust transmit beamforming a bernstein type inequality based conservative approach"

Connected through hyperedge HE-2 (induced by source paper "unified analytical volume distribution of poisson delaunay simplex and its application to coordinated multi point transmission"):
  with members:
    - "downlink coordinated joint transmission for mutual information accumulation"
    - "random cell association and void probability in poisson distributed cellular networks"
    - "deploying dense networks for maximal energy efficiency small cells meet massive mimo"
    - "optimal cell load and throughput in green small cell networks with generalized cell association"
    - "spectral efficiency scaling laws in dense random wireless networks with multiple receive antennas"
    - "what will 5g be"
    - "worst case user analysis in poisson voronoi cells"
    - "a tractable approach to coverage and rate in cellular networks"

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)