human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "semantically secure lattice codes for compound mimo channels"):
  with members:
    - "random ensembles of lattices from generalized reductions"
    - "optimal signaling for secure communications over gaussian mimo wiretap channels"
    - "universal lattice codes for mimo channels"
    - "a general formula for compound channel capacity"
    - "the secrecy capacity of compound gaussian mimo wiretap channels"
    - "the mimo wiretap channel decomposed"
    - "construction a of lattices over number fields and block fading wiretap coding"
    - "probability estimates for fading and wiretap channels from ideal class zeta functions"

Connected through hyperedge HE-2 (induced by source paper "well rounded lattices towards optimal coset codes for gaussian and fading wiretap channels"):
  with members:
    - "performance of lattice coset codes on a usrp testbed"
    - "on analytical and geometric lattice design criteria for wiretap coset codes"
    - "well rounded lattices for coset coding in mimo wiretap channels"
    - "information bounds and flatness factor approximation for fading wiretap mimo channels"
    - "theta series approximation with applications to compute and forward relaying"
    - "well rounded lattices for reliability and security in rayleigh fading siso channels"
    - "decoding in compute and forward relaying real lattices and the flatness of lattice sums"
    - "almost universal codes for fading wiretap channels"

Connected through hyperedge HE-3 (induced by source paper "semantic security on wiretap channels using universal hashing with fading applications"):
  with members:
    - "a capacity achieving coding scheme for the awgn channel with polynomial encoding and decoding complexity"
    - "finite blocklength bounds for wiretap channels"
    - "almost universal codes for fading wiretap channels"
    - "achieving secrecy capacity of the gaussian wiretap channel with polar lattices"
    - "universal hashing for information theoretic security"
    - "a cryptographic treatment of the wiretap channel"
    - "polynomial time semantically secure encryption achieving the secrecy capacity"
    - "strong secrecy from channel resolvability"

Connected through hyperedge HE-4 (induced by source paper "a survey of physical layer security techniques for 5g wireless networks and challenges ahead"):
  with members:
    - "secure massive mimo systems with limited rf chains"
    - "secure transmission with large numbers of antennas and finite alphabet inputs"
    - "probabilistically robust swipt for secrecy misome systems"
    - "exploiting full duplex receivers for achieving secret communications in multiuser miso networks"
    - "full duplex bidirectional secure communications under perfect and distributionally ambiguous eavesdropper s csi"
    - "safeguarding decentralized wireless networks using full duplex jamming receivers"
    - "physical layer security aware routing and performance tradeoffs in ad hoc networks"
    - "hybrid procoder and combiner design for secure transmission in mmwave mimo systems"

Connected through hyperedge HE-5 (induced by source paper "an overview of physical layer security with finite alphabet signaling"):
  with members:
    - "a survey of physical layer security techniques for 5g wireless networks and challenges ahead"
    - "physical layer cryptography through massive mimo"
    - "linear precoding of data and artificial noise in secure massive mimo systems"
    - "sum secrecy rate maximization for full duplex two way relay networks using alamouti based rank two beamforming"
    - "performance of lattice coset codes on universal software radio peripherals"
    - "secure m psk communication via directional modulation"
    - "finite blocklength bounds for wiretap channels"
    - "physical layer security in millimeter wave cellular networks"

Connected through hyperedge HE-6 (induced by source paper "physical layer security for rf satellite channels in the finite length regime"):
  with members:
    - "two way physical layer security protocol for gaussian channels"
    - "free space optical channel estimation for physical layer security"
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "information theoretic physical layer security for satellite channels"
    - "empirical and strong coordination via soft covering with polar codes"
    - "quantum inspired secure wireless communication protocol under spatial and local gaussian noise assumptions"
    - "secure wireless communication under spatial and local gaussian noise assumptions"
    - "joint power control in wiretap interference channels"

Connected through hyperedge HE-7 (induced by source paper "markov chain monte carlo methods for lattice gaussian sampling convergence analysis and enhancement"):
  with members:
    - "boosted kz and lll algorithms"
    - "lattice gaussian sampling by markov chain monte carlo bounded distance decoding and trapdoor sampling"
    - "sensitivity gains by mismatched probabilistic shaping for optical communication systems"
    - "polar codes and polar lattices for independent fading channels"
    - "on probabilistic shaping of quadrature amplitude modulation for the nonlinear fiber channel"
    - "achieving secrecy capacity of the gaussian wiretap channel with polar lattices"
    - "fifty years of mimo detection the road to large scale mimos"
    - "on the geometric ergodicity of metropolis hastings algorithms for lattice gaussian sampling"

Connected through hyperedge HE-8 (induced by source paper "markov chain monte carlo methods for lattice gaussian sampling lattice reduction and decoding optimization"):
  with members:
    - "boosted kz and lll algorithms"
    - "polar codes and polar lattices for independent fading channels"
    - "scan order in gibbs sampling models in which it matters and bounds on how much"
    - "achieving secrecy capacity of the gaussian wiretap channel with polar lattices"
    - "optimized markov chain monte carlo for signal detection in mimo systems an analysis of the stationary distribution and mixing time"
    - "markov chain monte carlo algorithms for lattice gaussian sampling"
    - "decoding by embedding correct decoding radius and dmt optimality"
    - "decoding by sampling part ii derandomization and soft output decoding"

Question: Please tell me which class the center node 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)