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 "secure mimo communications under quantized channel feedback in the presence of jamming"):
  Abstract: We consider the problem of secure communications in a MIMO setting in the presence of an adversarial jammer equipped with $n_j$ transmit antennas and an eavesdropper equipped with $n_e$ receive antennas. A multiantenna transmitter, equipped with $n_t$ antennas, desires to secretly communicate a message to a multiantenna receiver equipped with $n_r$ antennas. We propose a transmission method based on artificial noise and linear precoding and a two-stage receiver method employing beamforming. Under this strategy, we first characterize the achievable secrecy rates of communication and prove that the achievable secure degrees-of-freedom (SDoF) is given by $d_s = n_r - n_j$ in the perfect channel state information (CSI) case. Second, we consider quantized CSI feedback using Grassmannian quantization of a function of the direct channel matrix and derive sufficient conditions for the quantization bit rate scaling as a function of transmit power for maintaining the achievable SDoF $d_s$ with perfect CSI and for having asymptotically zero secrecy rate loss due to quantization. Numerical simulations are also provided to support the theory.

Includes members:
  Member "on the design of artificial noise aided secure multi antenna transmission in slow fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "physical layer security in the finite blocklength regime over fading channels")
  Member "interference alignment with quantized grassmannian feedback in the k user constant mimo interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on channel state feedback model and overhead in theoretical and practical views")
  Member "robust beamforming for security in mimo wiretap channels with imperfect csi":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "non orthogonal multiple access for 5g and beyond")
  Member "secrecy degrees of freedom of mimo broadcast channels with delayed csit":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "achievable dof regions of three user mimo broadcast channel with delayed csit")
  Member "secure transmission with artificial noise over fading channels achievable rate and optimal power allocation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "secure massive mimo communication with low resolution dacs")
  Member "interference alignment under limited feedback for mimo interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "opportunistic downlink interference alignment for multi cell mimo networks")
  Member "the secrecy capacity of the mimo wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "angle aware user cooperation for secure massive mimo in rician fading channel")
  Member "mimo broadcast channels with finite rate feedback":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "dl based csi feedback and cooperative recovery in massive mimo")

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)