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 "channel statistics based hybrid precoding for millimeter wave mimo systems with dynamic subarrays"):
  Abstract: This paper investigates the hybrid precoding design for millimeter wave (mmWave) multiple-input multiple-output (MIMO) systems with finite-alphabet inputs. The mmWave MIMO system employs partially-connected hybrid precoding architecture with dynamic subarrays, where each radio frequency (RF) chain is connected to a dynamic subset of antennas. We consider the design of analog and digital precoders utilizing statistical and/or mixed channel state information (CSI), which involve solving an extremely difficult problem in theory: First, designing the optimal partition of antennas over RF chains is a combinatorial optimization problem, whose optimal solution requires an exhaustive search over all antenna partitioning solutions; Second, the average mutual information under mmWave MIMO channels lacks closed-form expression and involves prohibitive computational burden; Third, the hybrid precoding problem with given partition of antennas is nonconvex with respect to the analog and digital precoders. To address these issues, this study first presents a simple criterion and the corresponding low complexity algorithm to design the optimal partition of antennas using statistical CSI. Then it derives the lower bound and its approximation for the average mutual information, in which the computational complexity is greatly reduced compared to calculating the average mutual information directly. In addition, it also shows that the lower bound with a constant shift offers a very accurate approximation to the average mutual information. This paper further proposes utilizing the lower bound approximation as a low-complexity and accurate alternative for developing a manifold-based gradient ascent algorithm to find near optimal analog and digital precoders. Several numerical results are provided to show that our proposed algorithm outperforms existing hybrid precoding algorithms.

Includes members:
  Member "secure transmission with large numbers of antennas and finite alphabet inputs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "downlink secrecy rate of one bit massive mimo system with active eavesdropping")
  Member "alternating minimization algorithms for hybrid precoding in millimeter wave mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "beamforming design for large scale antenna arrays using deep learning")
  Member "hybrid digital and analog beamforming design for large scale antenna arrays":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "beamforming design for large scale antenna arrays using deep learning")
  Member "dynamic subarrays for hybrid precoding in wideband mmwave mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "gmd based hybrid beamforming for large reconfigurable intelligent surface assisted millimeter wave massive mimo")
  Member "linear precoding for the mimo multiple access channel with finite alphabet inputs and statistical csi":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "millimeter wave massive mimo downlink per group communications with hybrid linear precoding")
  Member "spatially sparse precoding in millimeter wave mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "energy efficient hybrid precoding design for integrated multicast unicast millimeter wave communications with swipt")
  Member "mutual information and minimum mean square error in gaussian channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the information bottleneck problems models connections applications and information theoretic views")

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)