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 "large scale mimo secure transmission with finite alphabet inputs"):
  Abstract: In this paper, we investigate secure transmission over the large-scale multiple-antenna wiretap channel with finite alphabet inputs. First, we show analytically that a generalized singular value decomposition (GSVD) based design, which is optimal for Gaussian inputs, may exhibit a severe performance loss for finite alphabet inputs in the high signal-to-noise ratio (SNR) regime. In light of this, we propose a novel Per-Group-GSVD (PG-GSVD) design which can effectively compensate the performance loss caused by the GSVD design. More importantly, the computational complexity of the PG-GSVD design is by orders of magnitude lower than that of the existing design for finite alphabet inputs in [1] while the resulting performance loss is minimal. Numerical results indicate that the proposed PG-GSVD design can be efficiently implemented in large-scale multiple-antenna systems and achieves significant performance gains compared to the GSVD design.

Includes members:
  Member "secure massive mimo transmission with an active eavesdropper":
    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 "linear precoding for the mimo multiple access channel with finite alphabet inputs and statistical csi":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "millimeter wave massive mimo downlink per group communications with hybrid linear precoding")
  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 "linear precoder design for mimo interference channels with finite alphabet signaling":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "data aided secure massive mimo transmission under the pilot contamination attack")
  Member "on secrecy rate analysis of mimo wiretap channels driven by finite alphabet input":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "rethinking secure precoding via interference exploitation a smart eavesdropper perspective")
  Member "precoding by pairing subchannels to increase mimo capacity with discrete input alphabets":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a survey on mimo transmission with discrete input signals technical challenges advances and future trends")
  Member "secure communication in the low snr regime":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "secure transmission with large numbers of antennas and finite alphabet inputs")

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)