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: "a joint resource allocation scheme for multi user full duplex ofdma systems"
  Abstract: Full-duplex is a promising technology and great system performance enhancement can be achieved especially when we apply it to base stations. In this paper, we consider a Multi-User OFDMA network consisting of one Full-duplex base station, several uplink users, and a number of downlink users. A joint subcarrier, downlink user and uplink user mapping and power allocation optimization problem is investigated. In detail, we first decompose the 3-dimensional mapping problem into three 2-dimensional sub-problems and solve them by iteratively using classical Hungarian Method. Then, based on the dual method, we sequentially solve the power allocation and 3-dimensional mapping problem at each dual point. And the optimal solution to the dual problem is derived by using sub-gradient method. Unlike existing methods that only solve one sub-problem but with a high computation complexity, we tackle both of them and successfully reducing computation complexity from exponential to polynomial order. Numerical simulations are conducted to verify the proposed system.

Connected through hyperedge HE-1 (induced by source paper "resource allocation for a full duplex base station aided ofdma system"):
  with members:
    - "in band full duplex wireless challenges and opportunities"

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)