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 "a framework for optimizing multi cell noma delivering demand with less resource"):
  Abstract: Non-orthogonal multiple access (NOMA) allows multiple users to simultaneously access the same time-frequency resource by using superposition coding and successive interference cancellation (SIC). Thus far, most papers on NOMA have focused on performance gain for one or sometimes two base stations. In this paper, we study multi-cell NOMA and provide a general framework for user clustering and power allocation, taking into account inter-cell interference, for optimizing resource allocation of NOMA in multi-cell networks of arbitrary topology. We provide a series of theoretical analysis, to algorithmically enable optimization approaches. The resulting algorithmic notion is very general. Namely, we prove that for any performance metric that monotonically increases in the cells' resource consumption, we have convergence guarantee for global optimum. We apply the framework with its algorithmic concept to a multi-cell scenario to demonstrate the gain of NOMA in achieving significantly higher efficiency.

Includes members:
  Member "energy aware wireless relay selection in load coupled ofdma cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a note on decoding order in optimizing multi cell noma")
  Member "load optimization with user association in cooperative and load coupled lte networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a note on decoding order in optimizing multi cell noma")
  Member "energy efficiency of distributed signal processing in wireless networks a cross layer analysis":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "downlink non orthogonal multiple access noma in poisson networks")
  Member "non orthogonal multiple access in multi cell networks theory performance and practical challenges":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "interplay between noma and other emerging technologies a survey")
  Member "optimal cell clustering and activation for energy saving in load coupled wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a note on decoding order in optimizing multi cell noma")
  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")

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)