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 "on the throughput of large but finite mimo networks using schedulers"):
  Abstract: This paper studies the sum throughput of the multi-user multiple-input-single-output networks in the cases with a large-but-finite number of transmit antennas and users. Considering continuous and bursty communication scenarios with different users’ data request probabilities, we derive quasi-closed-form expressions for the maximum achievable throughput of the networks using optimal schedulers. The results are obtained in various cases with different levels of interference cancellation. Also, we develop an efficient scheduling scheme using genetic algorithms (GAs) and evaluate the effect of different parameters, such as channel/precoding models, number of antennas/users, scheduling costs, and power amplifiers’ efficiency, on the system performance. Finally, we use the recent results on the achievable rates of finite block-length codes to analyze the system performance in the cases with short packets. As demonstrated, the proposed GA-based scheduler reaches (almost) the same throughput as in the exhaustive search-based optimal scheduler, with substantially less implementation complexity. Moreover, the power amplifiers’ inefficiency and the scheduling delay affect the performance of the scheduling-based systems significantly.

Includes members:
  Member "tomlinson harashima precoding for multiuser mimo systems with quantized csi feedback and user scheduling":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "tomlinson harashima precoded rate splitting for multiuser mimo systems")
  Member "network mimo with linear zero forcing beamforming large system analysis impact of channel estimation and reduced complexity scheduling":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "joint user selection power allocation and precoding design with imperfect csit for multi cell mu mimo downlink systems")
  Member "multi user mimo scheduling in the fourth generation cellular uplink":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "reconfigurable wireless networks")
  Member "multi cell mimo downlink with cell cooperation and fair scheduling a large system limit analysis":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "joint user selection power allocation and precoding design with imperfect csit for multi cell mu mimo downlink systems")
  Member "user scheduling for heterogeneous multiuser mimo systems a subspace viewpoint":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "an overview on resource allocation techniques for multi user mimo systems")
  Member "sum rates rate allocation and user scheduling for multi user mimo vector perturbation precoding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "an overview on resource allocation techniques for multi user mimo systems")
  Member "maximum sum rate of mimo multiuser scheduling with linear receivers":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "impact of residual transmit rf impairments on training based mimo systems")

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)