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 "on the degrees of freedom of mimo multiple access channel with multiple eavesdroppers"):
  Abstract: Two-transmitter Gaussian multiple access wiretap channel with multiple antennas at the transmitters, legitimate receiver and eavesdroppers is studied. The existence of unknown number of eavesdroppers is assumed but with maximum number of antennas at any eavesdropper limited to a known value $N_E$. The channel matrices between the transmitters and the receiver is available everywhere, while the legitimate the legitimate transmitters and the legitimate receiver have no information about the eavesdroppers channels. A new upperbound is established and A new achievable DoF bound is provided and meets the upperbound. It is important to note that the same problem has been studied recently with arbitrarily varying eavesdropper channels and an upperbound has been derived. However, our achievable sum secure DoF exceeds their previously derived upperbound. Consequently, we revisited the uppperbound derivation and we re-derived a new mathematically robust upperbound.

Includes members:
  Member "mimo wiretap channels with arbitrarily varying eavesdropper channel states":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "coding schemes for achieving strong secrecy at negligible cost")
  Member "the secrecy capacity region of the gaussian mimo multi receiver wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "secure relaying in non orthogonal multiple access trusted and untrusted scenarios")
  Member "towards the secrecy capacity of the gaussian mimo wire tap channel the 2 2 1 channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "interplay between noma and other emerging technologies a survey")
  Member "secrecy in cooperative relay broadcast channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "broadcast channels with privacy leakage constraints")
  Member "the secrecy capacity of the mimo wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "angle aware user cooperation for secure massive mimo in rician fading channel")
  Member "achievable rates for the general gaussian multiple access wire tap channel with collective secrecy":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the secure degrees of freedom of the k user mac and 2 user interference channels")

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)