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: "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.

Connected through hyperedge HE-1 (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"
    - "achieving secrecy capacity of the gaussian wiretap channel with polar lattices"

Connected through hyperedge HE-2 (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"
    - "achieving secrecy capacity of the gaussian wiretap channel with polar lattices"
    - "universal hashing for information theoretic security"
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "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-3 (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-4 (induced by source paper "awgn goodness is enough capacity achieving lattice codes based on dithered probabilistic shaping"):
  with members:
    - "fundamental limits of communication with low probability of detection"
    - "covert communication over noisy channels a resolvability perspective"
    - "on probabilistic shaping of quadrature amplitude modulation for the nonlinear fiber channel"
    - "algebraic lattice codes achieve the capacity of the compound block fading channel"
    - "lda lattices without dithering achieve capacity on the gaussian channel"
    - "construction of capacity achieving lattice codes polar lattices"
    - "on the lattice smoothing parameter problem"
    - "semantically secure lattice codes for the gaussian wiretap channel"

Connected through hyperedge HE-5 (induced by source paper "universal lattice codes for mimo channels"):
  with members:
    - "random ensembles of lattices from generalized reductions"
    - "awgn goodness is enough capacity achieving lattice codes based on dithered probabilistic shaping"
    - "algebraic lattice codes achieve the capacity of the compound block fading channel"
    - "adaptive compute and forward with lattice codes over algebraic integers"
    - "construction a of lattices over number fields and block fading wiretap coding"
    - "almost universal codes achieving ergodic mimo capacity within a constant gap"
    - "number field lattices achieve gaussian and rayleigh channel capacity within a constant gap"
    - "semantically secure lattice codes for the gaussian wiretap channel"

Connected through hyperedge HE-6 (induced by source paper "well rounded lattices for coset coding in mimo wiretap channels"):
  with members:
    - "on analytical and geometric lattice design criteria for wiretap coset codes"
    - "information bounds and flatness factor approximation for fading wiretap mimo channels"
    - "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"
    - "probability estimates for fading and wiretap channels from ideal class zeta functions"
    - "a comparison of skewed and orthogonal lattices in gaussian wiretap channels"
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "inverse determinant sums and connections between fading channel information theory and algebra"

Connected through hyperedge HE-7 (induced by source paper "on analytical and geometric lattice design criteria for wiretap coset codes"):
  with members:
    - "performance of lattice coset codes on a usrp testbed"
    - "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"
    - "locally diverse constellations from the special orthogonal group"
    - "construction a of lattices over number fields and block fading wiretap coding"
    - "probability estimates for fading and wiretap channels from ideal class zeta functions"
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "inverse determinant sums and connections between fading channel information theory and algebra"

Connected through hyperedge HE-8 (induced by source paper "well rounded lattices for reliability and security in rayleigh fading siso channels"):
  with members:
    - "information bounds and flatness factor approximation for fading wiretap mimo channels"
    - "locally diverse constellations from the special orthogonal group"
    - "probability estimates for fading and wiretap channels from ideal class zeta functions"
    - "a comparison of skewed and orthogonal lattices in gaussian wiretap channels"
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "integer space time block codes for practical mimo systems"
    - "inverse determinant sums and connections between fading channel information theory and algebra"
    - "lattice code design for the rayleigh fading wiretap channel"

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)