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 "joint spectrum allocation and structure optimization in green powered heterogeneous cognitive radio networks"):
  Abstract: We aim at maximizing the sum rate of secondary users (SUs) in OFDM-based Heterogeneous Cognitive Radio (CR) Networks using RF energy harvesting. Assuming SUs operate in a time switching fashion, each time slot is partitioned into three non-overlapping parts devoted for energy harvesting, spectrum sensing and data transmission. The general problem of joint resource allocation and structure optimization is formulated as a Mixed Integer Nonlinear Programming task which is NP-hard and intractable. Thus, we propose to tackle it by decomposing it into two subproblems. We first propose a sub-channel allocation scheme to approximately satisfy SUs' rate requirements and remove the integer constraints. For the second step, we prove that the general optimization problem is reduced to a convex optimization task. Considering the trade-off among fractions of each time slot, we focus on optimizing the time slot structures of SUs that maximize the total throughput while guaranteeing the rate requirements of both real-time and non-real-time SUs. Since the reduced optimization problem does not have a simple closed-form solution, we thus propose a near optimal closed-form solution by utilizing Lambert-W function. We also exploit iterative gradient method based on Lagrangian dual decomposition to achieve near optimal solutions. Simulation results are presented to validate the optimality of the proposed schemes.

Includes members:
  Member "backhaul aware user association and resource allocation for energy constrained hetnets":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "resource allocation and power control in cooperative small cell networks in frequency selective channels with backhaul constraint")
  Member "toward hierarchical mobile edge computing an auction based profit maximization approach":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "all one needs to know about fog computing and related edge computing paradigms a complete survey")
  Member "wireless networks with energy harvesting and power transfer joint power and time allocation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "sequencing and scheduling for multi user machine type communication")
  Member "optimal cooperative power allocation for energy harvesting enabled relay networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "joint power splitting and relay selection in energy harvesting communications for iot networks")
  Member "joint spectrum and power allocation for multi node cooperative wireless systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "content caching and distribution in smart grid enabled wireless networks")
  Member "on green energy powered cognitive radio networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "harvest or transmit policy for cognitive radio networks a learning theoretic approach")
  Member "qos aware base station selections for distributed mimo links in broadband wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "effective capacity in wireless networks a comprehensive survey")
  Member "maximizing system throughput by cooperative sensing in cognitive radio networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "energy efficient resource allocation in eh enabled cr networks for iot")

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.NI(Networking and Internet Architecture)