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 subcarrier and power allocation methods in wireless powered communication network for ofdm systems"
  Abstract: In this paper, we investigate wireless powered communication network for OFDM systems, where a hybrid access point (H-AP) broadcasts energy signals to users in the downlink, and the users transmit information signals to the H-AP in the uplink based on an orthogonal frequency division multiple access scheme. We consider a fullduplex H-AP which simultaneously transmits energy signals and receives information signals. In this scenario, we address a joint subcarrier scheduling and power allocation problem to maximize the sum-rate under two cases: perfect self-interference cancelation (SIC) where the H-AP fully eliminates its self interference (SI) and imperfect SIC where the residual SI exist. In general, the problems for both cases are non-convex due to the subcarrier scheduling, and thus it requires an exhaustive search method, which is prohibitively complicated to obtain the globally optimal solution. In order to reduce the complexity, for the perfect SIC scenario, we jointly optimize subcarrier scheduling and power allocation by applying the Lagrange duality method. Next, for the imperfect SIC case, the problem is more complicated due to the SI at the H-AP. To solve the problem, we propose an iterative algorithm based on the projected gradient method. Simulation results show that the proposed algorithm for the case of perfect SIC exhibits only negligible sum-rate performance loss compared to the optimal algorithm, and the proposed iterative algorithm for the imperfect SIC case offers a significant performance gain over conventional schemes.

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)