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 "semantically secure lattice codes for the gaussian wiretap channel"):
  Abstract: We propose a new scheme of wiretap lattice coding that achieves semantic security and strong secrecy over the Gaussian wiretap channel. The key tool in our security proof is the flatness factor, which characterizes the convergence of the conditional output distributions corresponding to different messages and leads to an upper bound on the information leakage. We not only introduce the notion of secrecy-good lattices, but also propose the flatness factor as a design criterion of such lattices. Both the modulo-lattice Gaussian channel and genuine Gaussian channel are considered. In the latter case, we propose a novel secrecy coding scheme based on the discrete Gaussian distribution over a lattice, which achieves the secrecy capacity to within a half nat under mild conditions. No a priori distribution of the message is assumed, and no dither is used in our proposed schemes.

Includes members:
  Member "secret key generation from gaussian sources using lattice hashing":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "group secret key generation using algebraic rings in wireless networks")
  Member "on the eavesdropper s correct decision in gaussian and fading wiretap channels using lattice codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the secrecy gain of ell modular lattices")
  Member "decoding by sampling a randomized lattice algorithm for bounded distance decoding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on low complexity lattice reduction algorithms for large scale mimo detection the blessing of sequential reduction")
  Member "achieving the secrecy capacity of wiretap channels using polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "explicit codes for the wiretap channel a unified design framework")
  Member "strong secrecy on the binary erasure wiretap channel using large girth ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "explicit codes for the wiretap channel a unified design framework")
  Member "strong secrecy from channel resolvability":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "securing distributed function approximation via coding for continuous compound channels")
  Member "the gaussian many to one interference channel with confidential messages":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "generalizing multiple access wiretap and wiretap ii channel models achievable rates and cost of strong secrecy")
  Member "strong secrecy and reliable byzantine detection in the presence of an untrusted relay":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "byzantine multiple access")

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)