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: "performance trade off between uplink and downlink in full duplex communications"
  Abstract: In this paper, we formulate two multi-objective optimization problems (MOOPs) in orthogonal frequency-division multiple access (OFDMA)-based in-band full-duplex (IBFD) wireless communications.~The aim of this study is to exploit the performance trade-off between uplink and downlink where a wireless radio simultaneously transmits and receives in the same frequency.~We consider maximizing the system throughput as the first MOOP and minimizing the system aggregate power consumption as the second MOOP between uplink and downlink,~while taking into account the impact of self-interference~(SI)~and quality of service provisioning.~We study the throughput and the transmit power trade-off between uplink and downlink via solving these two problems.~Each MOOP is a non-convex mixed integer non-linear programming~(MINLP)~which is generally intractable. In order to circumvent this difficulty, a penalty function is introduced to reformulate the problem into a mathematically tractable form.~Subsequently,~each MOOP is transformed into a single-objective optimization problem~(SOOP)~via the weighted Tchebycheff method which is addressed by majorization-minimization~(MM)~approach. Simulation results demonstrate an interesting trade-off between the considered competing objectives.

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)