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 "max min fairness user scheduling and power allocation in full duplex ofdma systems"):
  Abstract: In a full-duplex (FD) multi-user network, the system performance is not only limited by the self-interference but also by the co-channel interference due to the simultaneous uplink and downlink transmissions. Joint design of the uplink/downlink transmission direction of users and the power allocation is crucial for achieving high system performance in the FD multi-user network. In this paper, we investigate the joint uplink/downlink transmission direction assignment (TDA), user paring (UP) and power allocation problem for maximizing the system max-min fairness (MMF) rate in a FD multi-user orthogonal frequency division multiple access (OFDMA) system. The problem is formulated with a two-time-scale structure where the TDA and the UP variables are for optimizing a long-term MMF rate while the power allocation is for optimizing an instantaneous MMF rate during each channel coherence interval. We show that the studied joint MMF rate maximization problem is NP-hard in general. To obtain high-quality suboptimal solutions, we propose efficient methods based on simple relaxation and greedy rounding techniques. Simulation results are presented to show that the proposed algorithms are effective and achieve higher MMF rates than the existing heuristic methods.

Includes members:
  Member "joint design of multi tap analog cancellation and digital beamforming for reduced complexity full duplex mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "full duplex hybrid a d beamforming with reduced complexity multi tap analog cancellation")
  Member "joint user scheduling and power optimization in full duplex cells with successive interference cancellation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "opportunistic temporal fair mode selection and user scheduling for full duplex systems")
  Member "user selection and power allocation in full duplex multicell networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimal centralized dynamic time division duplex")
  Member "user scheduling and optimal power allocation for full duplex cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "full duplex hybrid a d beamforming with reduced complexity multi tap analog cancellation")
  Member "throughput and coverage for a mixed full and half duplex small cell network":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "backhaul aware uplink communications in full duplex dbs aided hetnets")
  Member "resource allocation in ofdma networks with half duplex and imperfect full duplex users":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "multi objective optimization for energy and spectral efficiency tradeoff in in band full duplex ibfd communication")
  Member "optimizing df cognitive radio networks with full duplex enabled energy access points":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "secure routing with power optimization for ad hoc networks")
  Member "joint downlink base station association and power control for max min fairness computation and complexity":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "fairness and sum rate maximization via joint channel and power allocation in uplink scma networks")

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)