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 "the secrecy capacity of compound gaussian mimo wiretap channels"):
  Abstract: Strong secrecy capacity of compound wiretap channels is studied. The known lower bounds for the secrecy capacity of compound finite-state memoryless channels under discrete alphabets are extended to arbitrary uncertainty sets and continuous alphabets under the strong secrecy criterion. The conditions under which these bounds are tight are given. Under the saddle-point condition, the compound secrecy capacity is shown to be equal to that of the worst-case channel. Based on this, the compound Gaussian MIMO wiretap channel is studied under the spectral norm constraint and without the degradedness assumption. First, it is assumed that only the eavesdropper channel is unknown, but is known to have a bounded spectral norm (maximum channel gain). The compound secrecy capacity is established in a closed form and the optimal signaling is identified: the compound capacity equals the worst-case channel capacity thus establishing the saddle-point property; the optimal signaling is Gaussian and on the eigenvectors of the legitimate channel and the worst-case eavesdropper is isotropic. The eigenmode power allocation somewhat resembles the standard water-filling but is not identical to it. More general uncertainty sets are considered and the existence of a maximum element is shown to be sufficient for a saddle-point to exist, so that signaling on the worst-case channel achieves the compound capacity of the whole class of channels. The case of rank-constrained eavesdropper is considered and the respective compound secrecy capacity is established. Subsequently, the case of additive uncertainty in the legitimate channel, in addition to the unknown eavesdropper channel, is studied. Its compound secrecy capacity and the optimal signaling are established in a closed-form as well, revealing the same saddle-point property.

Includes members:
  Member "on the continuity of the secrecy capacity of compound and arbitrarily varying wiretap channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the arbitrarily varying channel with colored gaussian noise")
  Member "secrecy results for compound wiretap channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "secure polar coding with delayed wiretapping information")
  Member "finite snr diversity multiplexing tradeoff via asymptotic analysis of large mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "short packet communications over multiple antenna rayleigh fading channels")
  Member "mimo wiretap channels with arbitrarily varying eavesdropper channel states":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "coding schemes for achieving strong secrecy at negligible cost")
  Member "secure transmission with multiple antennas ii the mimome wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "multi antenna jamming in covert communication")
  Member "on the compound mimo broadcast channels with confidential messages":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the continuity of the secrecy capacity of compound and arbitrarily varying wiretap channels")
  Member "transmitter optimization for achieving secrecy capacity in gaussian mimo wiretap channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a rotation based method for precoding in gaussian mimome channels")
  Member "the secrecy capacity of the mimo wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "angle aware user cooperation for secure massive mimo in rician fading channel")

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)