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 "the role of asymptotic functions in network optimization and feasibility studies"):
  Abstract: Solutions to network optimization problems have greatly benefited from developments in nonlinear analysis, and, in particular, from developments in convex optimization. A key concept that has made convex and nonconvex analysis an important tool in science and engineering is the notion of asymptotic function, which is often hidden in many influential studies on nonlinear analysis and related fields. Therefore, we can also expect that asymptotic functions are deeply connected to many results in the wireless domain, even though they are rarely mentioned in the wireless literature. In this study, we show connections of this type. By doing so, we explain many properties of centralized and distributed solutions to wireless resource allocation problems within a unified framework, and we also generalize and unify existing approaches to feasibility analysis of network designs. In particular, we show sufficient and necessary conditions for mappings widely used in wireless communication problems (more precisely, the class of standard interference mappings) to have a fixed point. Furthermore, we derive fundamental bounds on the utility and the energy efficiency that can be achieved by solving a large family of max-min utility optimization problems in wireless networks.

Includes members:
  Member "performance limits of solutions to network utility maximization problems":
    also connected through other hyperedges:
      (none)
  Member "elementary properties of positive concave mappings with applications to network planning and optimization":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a note on decoding order in optimizing multi cell noma")
  Member "power and load coupling in cellular networks for energy optimization":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a note on decoding order in optimizing multi cell noma")
  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 "data offloading in load coupled networks a utility maximization framework":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a note on decoding order in optimizing multi cell noma")
  Member "toward energy efficient 5g wireless communications technologies":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "beamforming optimization for physical layer security in miso wireless networks")
  Member "analysis of cell load coupling for lte network planning and optimization":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a note on decoding order in optimizing multi cell noma")
  Member "base station selection for energy efficient network operation with the majorization minimization algorithm":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a note on decoding order in optimizing multi cell noma")

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)