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 "energy efficient multi pair two way af full duplex massive mimo relaying"):
  Abstract: We consider multi-pair two-way amplify and forward (AF) relaying, where multiple full-duplex source-node pairs exchange information via a shared full-duplex massive multiple-input multiple-output (MIMO) relay. Most of the previous massive MIMO relay works maximize spectral efficiency (SE). We maximize global energy efficiency (GEE) with quality-of-service (QoS) constraints that are expressed as the rate required by source nodes. The problem is non-convex and is solved by approximating it as a pseudo-concave problem, which is then solved using the Dinkelbach method. We also consider the max-min EE problem which maximizes the EE of the worst energy efficient user. For solving the EE optimization, we derive approximate closed-form lower bounds for the ergodic achievable rate for maximal-ratio and zero-forcing processing at the relay by using minimum mean squared error channel estimation. We numerically show the accuracy of the derived lower bounds and the improved GEE with optimal power allocation, with and without QoS constraints.

Includes members:
  Member "a survey of multi objective optimization in wireless sensor networks metrics algorithms and open problems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "thirty years of machine learning the road to pareto optimal next generation wireless networks")
  Member "power allocation for multi pair massive mimo two way af relaying with linear processing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "impact of relay cooperation on the performance of large scale multipair two way relay networks")
  Member "joint beamforming optimization and power control for full duplex mimo two way relay channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "full duplex transmission optimization for bi directional mimo links with qos guarantees")
  Member "multipair full duplex relaying with massive arrays and linear processing":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "angle aware user cooperation for secure massive mimo in rician fading channel")
  Member "energy efficiency optimization in relay assisted mimo systems with perfect and statistical csi":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "energy efficiency fairness for multi pair wireless powered relaying systems")
  Member "scaling up mimo opportunities and challenges with very large arrays":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "downlink secrecy rate of one bit massive mimo system with active eavesdropping")
  Member "in band full duplex wireless challenges and opportunities":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "resource allocation for irs assisted full duplex cognitive radio systems")
  Member "green cellular networks a survey some research issues and challenges":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "spatial and temporal management of cellular hetnets with multiple solar powered drones")

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)