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 "time fractional user association in millimeter wave mimo networks"):
  Abstract: User association determines which base stations a user connects to, hence affecting the amount of network interference and consequently the network throughput. Conventional user association schemes, however, assume that user instantaneous rates are independent of user association. In this paper, we introduce a new load-aware user association scheme for millimeter wave (mmWave) MIMO networks which takes into account the dependency of network interference on user association. This consideration is well suited for mmWave communications, where the links are highly directional and vulnerable to small channel variations. We formulate our user association problem as a mixed integer nonlinear programming (MINLP) and solve it using the genetic algorithm. We show that the proposed method can improve network performance by moving the traffic of congested base stations to lightly-loaded base stations and adjusting the interference accordingly. Our simulations confirm that our scheme results in a higher network throughput compared to conventional user association techniques.

Includes members:
  Member "a survey of millimeter wave mmwave communications for 5g opportunities and challenges":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a distributed multi rf chain hybrid mmwave scheme for small cell systems")
  Member "probabilistic omnidirectional path loss models for millimeter wave outdoor communications":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "early acceptance matching game for user association in 5g cellular hetnet")
  Member "optimal user cell association for massive mimo wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "reinforcement learning based vehicle cell association algorithm for highly mobile millimeter wave communication")
  Member "spatially sparse precoding in millimeter wave mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "energy efficient hybrid precoding design for integrated multicast unicast millimeter wave communications with swipt")
  Member "distributed linear precoder optimization and base station selection for an uplink heterogeneous network":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "load balancing user association in millimeter wave mimo 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)