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 "iterative distributed minimum total mse approach for secure communications in mimo interference channels"):
  Abstract: In this paper, we consider the problem of jointly designing transmit precoding (TPC) matrix and receive filter matrix subject to both secrecy and per-transmitter power constraints in the multiple-input multiple-output (MIMO) interference channel, where    $K$    legitimate transmitter–receiver pairs communicate in the presence of an external eavesdropper. Explicitly, we jointly design the TPC and receive filter matrices based on the minimum total mean-squared error (MSE) criterion under a given and feasible information-theoretic degrees of freedom. More specifically, we formulate this problem by minimizing the total MSEs of the signals communicated between the legitimate transmitter–receiver pairs, while ensuring that the MSE of the signals decoded by the eavesdropper remains higher than a certain threshold. We demonstrate that the joint design of the TPC and receive filter matrices subject to both secrecy and transmit power constraints can be accomplished by an efficient iterative distributed algorithm. The convergence of the proposed iterative algorithm is characterized as well. Furthermore, the performance of the proposed algorithm, including both its secrecy rate and MSE, is characterized with the aid of numerical results. We demonstrate that the proposed algorithm outperforms the traditional interference alignment algorithm in terms of both the achievable secrecy rate and the MSE. As a benefit, secure communications can be guaranteed by the proposed algorithm for the MIMO interference channel even in the presence of a sophisticated/strong eavesdropper, whose number of antennas is much higher than that of each legitimate transmitter and receiver.

Includes members:
  Member "distributed energy spectral efficiency optimization for partial full interference alignment in multi user multi relay multi cell mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a survey of multi objective optimization in wireless sensor networks metrics algorithms and open problems")
  Member "fifty years of mimo detection the road to large scale mimos":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "model driven deep learning for joint mimo channel estimation and signal detection")
  Member "secure degrees of freedom of one hop wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "towards an algebraic network information theory simultaneous joint typicality decoding")
  Member "degrees of freedom of the three user rank deficient mimo interference channel":
    also connected through other hyperedges:
      (none)
  Member "limited feedback based interference alignment for interfering multi access channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "distributed energy spectral efficiency optimization for partial full interference alignment in multi user multi relay multi cell mimo systems")
  Member "enhancing secrecy with multi antenna transmission in wireless ad hoc networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "enhancing physical layer security of random caching in large scale multi antenna heterogeneous wireless networks")
  Member "filter design with secrecy constraints the mimo gaussian wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "an overview of physical layer security with finite alphabet signaling")
  Member "interference alignment for secrecy":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "adding common randomness can remove the secrecy constraints in communication networks")

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)