human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "multi objective optimization for energy and spectral efficiency tradeoff in in band full duplex ibfd communication"):
  Abstract: The problem of joint power and sub-channel allocation to maximize energy efficiency (EE) and spectral efficiency (SE) simultaneously in in-band full-duplex (IBFD) orthogonal frequency-division multiple access (OFDMA) network is addressed considering users' QoS in both uplink and downlink. The resulting optimization problem is a non-convex mixed-integer non-linear program (MINLP) which is generally difficult to solve. In order to strike a balance between the EE and SE, we restate this problem as a multi-objective optimization problem (MOOP) which aims at maximizing system's throughput and minimizing system's power consumption, simultaneously. To this end, the \epsilon constraint method is adopted to transform the MOOP into single-objective optimization problem (SOOP). The underlying problem is solved via an efficient solution based on the majorization minimization (MM) approach. Furthermore, in order to handle binary subchannel allocation variable constraints, a penalty function is introduced. Simulation results unveil interesting tradeoffs between EE and SE.

Includes members:
  Member "optimal joint power and subcarrier allocation for full duplex multicarrier non orthogonal multiple access systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "joint trajectory and resource allocation design for energy efficient secure uav communication systems")
  Member "resource allocation in ofdma networks with half duplex and imperfect full duplex users":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "max min fairness user scheduling and power allocation in full duplex ofdma systems")
  Member "multi objective resource allocation in full duplex swipt systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "interference exploitation in full duplex communications trading interference power for both uplink and downlink power savings")
  Member "power efficient resource allocation for full duplex radio distributed antenna networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "joint trajectory and resource allocation design for energy efficient secure uav communication systems")
  Member "throughput analysis for full duplex wireless networks with imperfect self interference cancellation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "performance trade off between uplink and downlink in full duplex communications")

Question: Please tell me which class the source paper 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)