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 "almost universal codes for fading wiretap channels"):
  Abstract: We consider a fading wiretap channel model where the transmitter has only statistical channel state information, and the legitimate receiver and eavesdropper have perfect channel state information. We propose a sequence of non-random lattice codes which achieve strong secrecy and semantic security over ergodic fading channels. The construction is almost universal in the sense that it achieves the same constant gap to secrecy capacity over Gaussian and ergodic fading models.

Includes members:
  Member "almost universal codes achieving ergodic mimo capacity within a constant gap":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the separability of ergodic fading mimo channels a lattice coding approach")
  Member "probability estimates for fading and wiretap channels from ideal class zeta functions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "semantically secure lattice codes for compound mimo channels")
  Member "number field lattices achieve gaussian and rayleigh channel capacity within a constant gap":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "polar codes and polar lattices for independent fading channels")
  Member "semantically secure lattice codes for the gaussian wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "semantically secure lattice codes for compound mimo channels")
  Member "on secrecy capacity of fast fading mimome wiretap channels with statistical csit":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "secrecy rate of distributed cooperative mimo in the presence of multi antenna eavesdropper")
  Member "on secrecy capacity of fast fading multiple input wiretap channels with statistical csit":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on secrecy capacity of fast fading mimome wiretap channels with statistical csit")
  Member "strong secrecy on the binary erasure wiretap channel using large girth ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "explicit codes for the wiretap channel a unified design framework")
  Member "an error probability approach to mimo wiretap channels":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "semantically secure lattice codes for compound mimo 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)