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 "distributed cluster formation and power bandwidth allocation for imperfect noma in dl hetnets"):
  Abstract: In this paper, we consider a non-ideal successive interference cancellation receiver-based imperfect non-orthogonal multiple access (NOMA) schemes whose performance is limited by three factors: 1) power disparity & sensitivity constraints; 2) intra-cluster interference (ICRI); and 3) intercell-interference (ICI). By quantifying the residual interference with a fractional error factor (FEF), we show that NOMA cannot always perform better than orthogonal multiple access (OMA) especially under certain receiver sensitivity and FEF levels. Assuming the existence of an offline/online ICI management scheme, the proposed solution accounts for the ICI which is shown to deteriorate the NOMA performance particularly when it becomes significant compared to the ICRI. Then, a distributed cluster formation (CF) and power-bandwidth allocation (PBA) approach are proposed for downlink heterogeneous networks (HetNets) operating on the imperfect NOMA. We develop a hierarchically distributed solution methodology, where BSs independently form clusters and distributively determine the power-bandwidth allowance of each cluster. A generic CF scheme is obtained by creating a multi-partite graph via partitioning user equipment with respect to their channel gains since NOMA performance is primarily determined by the channel gain disparity of cluster members. A sequential weighted bi-partite matching method is proposed for solving the resulted weighted multi-partite matching problem. Thereafter, we present a hierarchically distributed PBA approach which consists of the primary master, secondary masters, and slave problems. For a given cluster power and bandwidth pair, optimal power allocations and Lagrange multipliers of slave problems are derived in closed-form. While power allowance of clusters is updated by the secondary masters based on dual variables of slave problems, bandwidth proportions of clusters are iteratively allocated by the primary master as per the utility achieved by the secondary masters at the previous iteration. Finally, the proposed CF and PBA approaches under the operation of imperfect NOMA are investigated and compared to the OMA scheme by extensive simulations results in DL-HetNets.

Includes members:
  Member "optimal resource allocation for power efficient mc noma with imperfect channel state information":
    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 "on optimal power allocation for downlink non orthogonal multiple access systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "downlink analysis of noma enabled cellular networks with 3gpp inspired user ranking")
  Member "joint rate control and power allocation for non orthogonal multiple access systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a survey on non orthogonal multiple access for 5g networks research challenges and future trends")
  Member "sub channel assignment power allocation and user scheduling for non orthogonal multiple access networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "resource allocation in intelligent reflecting surface assisted noma systems")
  Member "optimal joint power and subcarrier allocation for full duplex multicarrier non orthogonal multiple access systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "joint trajectory and resource allocation design for energy efficient secure uav communication systems")
  Member "dynamic user clustering and power allocation for uplink and downlink non orthogonal multiple access noma systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "non orthogonal multiple access with orthogonal time frequency space signal transmission")
  Member "power and channel allocation for non orthogonal multiple access in 5g systems tractability and computation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "non orthogonal multiple access noma how it meets 5g and beyond")
  Member "non orthogonal multiple access noma for downlink multiuser mimo systems user clustering beamforming and power allocation":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "optical rate splitting multiple access for visible light 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.NI(Networking and Internet Architecture)