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 "user assignment with distributed large intelligent surface lis systems"):
  Abstract: In this paper, we consider a wireless communication system where a large intelligent surface (LIS) is deployed comprising a number of small and distributed LIS-Units. Each LIS-Unit has a separate signal process unit (SPU) and is connected to a central process unit (CPU) that coordinates the behaviors of all the LIS-Units. With such a LIS system, we consider the user assignments both for sum-rate and minimal user-rate maximizations. That is, assuming $M$ LIS-Units deployed in the LIS system, the objective is to select $K$ ($K\!\leq\!M$) best LIS-Units to serve $K$ autonomous users simultaneously. Based on the nice property of effective inter-user interference suppression of the LIS-Units, the optimal user assignments can be effectively found through classical linear assignment problems (LAPs) defined on a bipartite graph. To be specific, the optimal user assignment for sum-rate and user-rate maximizations can be solved by linear sum assignment problem (LSAP) and linear bottleneck assignment problem (LBAP), respectively. The elements of the cost matrix are constructed based on the received signal strength (RSS) measured at each of the $M$ LIS-Units for all the $K$ users. Numerical results show that, the proposed user assignments are close to optimal user assignments both under line-of-sight (LoS) and scattering environments.

Includes members:
  Member "the potential of using large antenna arrays on intelligent surfaces":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "large intelligent surface lis based communications new features and system layouts")
  Member "reciprocity calibration for massive mimo proposal modeling and validation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "amplitude and phase estimation for absolute calibration of massive mimo front ends")
  Member "massive mimo for next generation wireless systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "joint power control and lsfd for wireless powered cell free massive mimo")
  Member "what will 5g be":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "5g network slicing using sdn and nfv a survey of taxonomy architectures and future challenges")
  Member "scaling up mimo opportunities and challenges with very large arrays":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "downlink secrecy rate of one bit massive mimo system with active eavesdropping")

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)