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 analytical and geometric lattice design criteria for wiretap coset codes"):
  Abstract: This paper considers physical layer security and the design of secure coset codes for wiretap channels, where information is not to be leaked to an eavesdropper having a degraded channel. The eavesdropper's bounds for correct decoding probability and information are first revisited, and a new variant of the information bound is derived. The new bound is valid for a general channel with any fading and Gaussian noise. From these bounds, it is explicit that both the information and probability are upper bounded by the average flatness factor, i.e., the expected theta function of the faded lattice related to the eavesdropper. Taking the minimization of the average flatness factor as a design criterion, simple geometric heuristics to minimize it in the low signal-to-noise ratio (SNR) regime in Gaussian and Rayleigh fast fading channels are motivated. It is concluded that in the Gaussian channel, the security boils down to the sphere packing density of the eavesdropper's lattice, whereas in the Rayleigh fading channel a full-diversity well-rounded lattice with a dense sphere packing will provide the best secrecy. The proposed criteria are backed up by extensive numerical experiments.

Includes members:
  Member "performance of lattice coset codes on a usrp testbed":
    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 "well rounded lattices for reliability and security in rayleigh fading siso 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 "decoding in compute and forward relaying real lattices and the flatness of lattice sums":
    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 "almost universal codes for fading wiretap channels":
    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 "locally diverse constellations from the special orthogonal group":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "lattice coding for rician fading channels from hadamard rotations")
  Member "construction a of lattices over number fields and block fading wiretap coding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "lattice coding for downlink multiuser transmission")
  Member "probability estimates for fading and wiretap channels from ideal class zeta functions":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "semantically secure lattice codes for compound mimo 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)