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 "mimo multiple access channel with an arbitrarily varying eavesdropper"):
  Abstract: A two-transmitter Gaussian multiple access wiretap channel with multiple antennas at each of the nodes is investigated. The channel matrices at the legitimate terminals are fixed and revealed to all the terminals, whereas the channel matrix of the eavesdropper is arbitrarily varying and only known to the eavesdropper. The secrecy degrees of freedom (s.d.o.f.) region under a strong secrecy constraint is characterized. A transmission scheme that orthogonalizes the transmit signals of the two users at the intended receiver and uses a single-user wiretap code is shown to be sufficient to achieve the s.d.o.f. region. The converse involves establishing an upper bound on a weighted-sum-rate expression. This is accomplished by using induction, where at each step one combines the secrecy and multiple-access constraints associated with an adversary eavesdropping a carefully selected group of sub-channels.

Includes members:
  Member "robust beamforming for security in mimo wiretap channels with imperfect csi":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "non orthogonal multiple access for 5g and beyond")
  Member "interference alignment for the multi antenna compound wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the secrecy degrees of freedom of multi antenna wiretap channels with delayed csit")
  Member "mimo wiretap channels with arbitrarily varying eavesdropper channel states":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "coding schemes for achieving strong secrecy at negligible cost")
  Member "on the secure degrees of freedom of the multiple access channel":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "adding common randomness can remove the secrecy constraints in communication networks")
  Member "distributed storage codes meet multiple access wiretap channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "rank minimization over finite fields fundamental limits and coding theoretic interpretations")
  Member "secure transmission with multiple antennas ii the mimome wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "multi antenna jamming in covert communication")
  Member "the secrecy capacity region of the gaussian mimo multi receiver wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "secure relaying in non orthogonal multiple access trusted and untrusted scenarios")
  Member "on the compound mimo broadcast channels with confidential messages":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "the secrecy capacity of compound gaussian mimo wiretap 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)