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 "diversity multiplexing tradeoff for the multiple antenna wire tap channel"):
  Abstract: In this paper the fading multiple antenna (MIMO) wire-tap channel is investigated under short term power constraints. The secret diversity gain and the secret multiplexing gain are defined. Using these definitions, the secret diversitymultiplexing tradeoff (DMT) is calculated analytically for no transmitter side channel state information (CSI) and for full CSI. When there is no CSI at the transmitter, under the assumption of Gaussian codebooks, it is shown that the eavesdropper steals both transmitter and receiver antennas, and the secret DMT depends on the remaining degrees of freedom. When CSI is available at the transmitter (CSIT), the eavesdropper steals only transmitter antennas. This dependence on the availability of CSI is unlike the DMT results without secrecy constraints, where the DMT remains the same for no CSI and full CSI at the transmitter under short term power constraints. A zero-forcing type scheme is shown to achieve the secret DMT when CSIT is available.

Includes members:
  Member "opportunistic secrecy with a strict delay constraint":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the security analysis of a cooperative incremental relaying protocol in the presence of an active eavesdropper")
  Member "interference alignment for secrecy":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "adding common randomness can remove the secrecy constraints in communication networks")
  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 "secure transmission with multiple antennas ii the mimome wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "multi antenna jamming in covert communication")
  Member "secured communication over frequency selective fading channels a practical vandermonde precoding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "securing ofdm based wireless links using temporal artificial noise injection")
  Member "towards the secrecy capacity of the gaussian mimo wire tap channel the 2 2 1 channel":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "interplay between noma and other emerging technologies a survey")
  Member "on the compound mimo broadcast channels with confidential messages":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the secrecy capacity of compound gaussian mimo wiretap channels")
  Member "on the delay limited secrecy capacity of fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "secret key aided scheme for securing untrusted df relaying 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)