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 "fairness and sum rate maximization via joint channel and power allocation in uplink scma networks"):
  Abstract: In this work, we consider a sparse code multiple access uplink network, where $J$ users simultaneously transmit data over $K$ subcarriers, such that $J > K$, with a constraint on the power transmitted by each user. To jointly optimize the codebook assignment and the transmitted power per subcarrier, two new iterative algorithms are proposed, the first one aims to maximize the sum-rate (Max-SR) of the network, while the second aims to maximize the minimum rate (Max-Min). In both cases, the optimization problem is of the mixed-integer nonlinear programming (MINLP) type, with non-convex objective functions. To address this issues, we employ an alternating optimization framework, where the codebook allocation problem is decoupled from the power allocation into two subproblems, and they are solved in an iterative alternating fashion. These subproblems are non-convex, therefore, we employ a sequential convex programming (SCP) method to solve them. An analysis of the convergence of the algorithms is provided. A comparison of the sum-rate and Jain's fairness index of the novel algorithms with three other algorithms proposed in the literature is presented for varying power budgets. The Max-SR algorithm outperforms the others in the sum-rate sense, while the Max-Min outperforms them in the fairness sense, achieving near perfect fairness.

Includes members:
  Member "single or multiple frames content delivery for next generation networks":
    also connected through other hyperedges:
      (none)
  Member "a survey on non orthogonal multiple access for 5g networks research challenges and future trends":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "effective capacity of noma with finite blocklength for low latency communications")
  Member "fundamental limits of low density spreading noma with fading":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "non orthogonal multiple access with orthogonal time frequency space signal transmission")
  Member "modeling and analysis of scma enhanced d2d and cellular hybrid network":
    also connected through other hyperedges:
      (none)
  Member "joint downlink base station association and power control for max min fairness computation and complexity":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "max min fairness user scheduling and power allocation in full duplex ofdma systems")
  Member "distributed pricing based user association for downlink heterogeneous cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "reinforcement learning based vehicle cell association algorithm for highly mobile millimeter wave communication")
  Member "scma for downlink multiple access of 5g wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "secure communications in a unified non orthogonal multiple access framework")
  Member "uplink contention based scma for 5g radio access":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "single or multiple frames content delivery for robust and secure communication in energy and spectrum efficient 5g 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)