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 "well rounded lattices for coset coding in mimo wiretap channels"):
  Abstract: The concept of well-rounded lattices has recently found important applications in the setting of a fading single-input single-output (SISO) wiretap channel. It has been shown that, under this setup, the property of being well-rounded is critical for minimizing the eavesdropper's probability of correct decoding in lower SNR regimes. The superior performance of coset codes constructed from well-rounded lattices has been illustrated in several simulations. #R##N#In the present article, this work is extended to fading multiple-input multiple-output (MIMO) wiretap channels, and similar design criteria as in the SISO case are derived. Further, explicit coset codes for Rayleigh fading MIMO wiretap channels are designed. In particular, it is shown through extensive simulations that sublattices of the well-known Alamouti code and Golden code which meet our design criteria perform better than scalar multiples of the code lattice for the same parameters.

Includes members:
  Member "on analytical and geometric lattice design criteria for wiretap coset codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "well rounded lattices towards optimal coset codes for gaussian and fading wiretap channels")
  Member "information bounds and flatness factor approximation for fading wiretap mimo channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "well rounded lattices towards optimal coset codes for gaussian and fading wiretap channels")
  Member "well rounded lattices for reliability and security in rayleigh fading siso channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "well rounded lattices towards optimal coset codes for gaussian and fading wiretap channels")
  Member "decoding in compute and forward relaying real lattices and the flatness of lattice sums":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "well rounded lattices towards optimal coset codes for gaussian and fading wiretap channels")
  Member "almost universal codes for fading wiretap channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "well rounded lattices towards optimal coset codes for gaussian and fading wiretap channels")
  Member "probability estimates for fading and wiretap channels from ideal class zeta functions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "semantically secure lattice codes for compound mimo channels")
  Member "a comparison of skewed and orthogonal lattices in gaussian wiretap channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "well rounded lattices towards optimal coset codes for gaussian and fading wiretap channels")
  Member "semantically secure lattice codes for the gaussian wiretap channel":
    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)