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 "load optimization with user association in cooperative and load coupled lte networks"):
  Abstract: We extend the problem of optimizing user association for load balancing in cellular networks along two dimensions. First, we consider joint transmission (JT), which is one of the coordinated multipoint (CoMP) techniques, with which a user may be simultaneously served by multiple base stations. Second, we account for, mathematically, the coupling relation between the base stations' load levels that are dependent on each other due to inter-cell interference. We formulate two optimization problems, sum load minimization (MinSumL) and maximum load minimization (MinMaxL). We prove that both MinSumL and MinMaxL are NP-hard. We propose a mixed integer linear programming (MILP) based scheme by means of linearization. This approach also leads to a bounding scheme for performance benchmarking. Then, we derive a set of partial optimality conditions. Fulfillment of the conditions will guarantee performance improvement for both MinSumL and MinMaxL. A solution algorithm is then derived based on the conditions. Simulation results are provided to demonstrate the effectiveness of the approaches.

Includes members:
  Member "load balancing via joint transmission in heterogeneous lte modeling and computation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "user centric performance optimization with remote radio head cooperation in c ran")
  Member "joint downlink base station association and power control for max min fairness computation and complexity":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "max min fairness user scheduling and power allocation in full duplex ofdma systems")
  Member "a stochastic geometry framework for analyzing pairwise cooperative cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "area spectral efficiency and sinr scaling laws in multi antenna cellular networks")
  Member "optimal user association for massive mimo empowered ultra dense wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "leveraging synergy of 5g sdwn and multi layer resource management for network optimization")
  Member "a tractable model for noncoherent joint transmission base station cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "edge computing enabled cell free massive mimo systems")
  Member "what will 5g be":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "5g network slicing using sdn and nfv a survey of taxonomy architectures and future challenges")
  Member "on association cells in random heterogeneous networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "millimeter wave integrated access and backhaul in 5g performance analysis and design insights")
  Member "analysis of cell load coupling for lte network planning and optimization":
    also connected through other hyperedges:
      - Hyperedge HE-8 (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)