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: "joint beamforming design and power allocation for full duplex noma cognitive relay systems"
  Abstract: In this paper, we consider a non-orthogonal multiple access cognitive radio network, where a full-duplex multi-antenna relay assists transmission from a base station (BS) to a cognitive far user, whereas, at the same time, the BS transmits to a cognitive near user. Our objective is to enlarge the far-near user rate region by maximizing the rate of the near user under a constraint that the rate of the far user is above a certain threshold. To this end, a non-convex joint optimization problem of relay beamforming and the transmit powers at the BS and cognitive relay is solved as a semi-definite relaxation problem, in conjunction with an efficiently solvable line-search approach. For comparisons, we also consider low complexity fixed beamformer design, where the optimum power allocation between the BS and cognitive relay is solved. Our results demonstrate that the proposed joint optimization can significantly reduce the impact of the residual self-interference at the FD relay and inter-user interference in the near user case.

Connected through hyperedge HE-1 (induced by source paper "capacity analysis for full duplex self backhauled small cells"):
  with members:
    - "exploiting full half duplex user relaying in noma systems"
    - "scheduling and power allocation in self backhauled full duplex small cells"
    - "full duplex multi antenna relay assisted cooperative non orthogonal multiple access"
    - "joint backhaul access analysis of full duplex self backhauling heterogeneous networks"
    - "sum rate analysis and optimization of self backhauling based full duplex radio access system"
    - "analysis of massive mimo enabled downlink wireless backhauling for full duplex small cells"
    - "optimal multiuser transmit beamforming a difficult problem with a simple solution structure"
    - "what will 5g be"

Connected through hyperedge HE-2 (induced by source paper "antenna selection in full duplex cooperative noma systems"):
  with members:
    - "exploiting full half duplex user relaying in noma systems"
    - "full duplex multi antenna relay assisted cooperative non orthogonal multiple access"
    - "a survey on non orthogonal multiple access for 5g networks research challenges and future trends"
    - "antenna selection for mimo noma networks"
    - "low complexity end to end performance optimization in mimo full duplex relay systems"
    - "experiment driven characterization of full duplex wireless systems"
    - "a quantitative measure of fairness and discrimination for resource allocation in shared computer systems"

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)