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: "achieving awgn channel capacity with lattice gaussian coding"
  Abstract: We propose a new coding scheme using only one lattice that achieves the $\frac{1}{2}\log(1+\SNR)$ capacity of the additive white Gaussian noise (AWGN) channel with lattice decoding, when the signal-to-noise ratio $\SNR>e-1$. The scheme applies a discrete Gaussian distribution over an AWGN-good lattice, but otherwise does not require a shaping lattice or dither. Thus, it significantly simplifies the default lattice coding scheme of Erez and Zamir which involves a quantization-good lattice as well as an AWGN-good lattice. Using the flatness factor, we show that the error probability of the proposed scheme under minimum mean-square error (MMSE) lattice decoding is almost the same as that of Erez and Zamir, for any rate up to the AWGN channel capacity. We introduce the notion of good constellations, which carry almost the same mutual information as that of continuous Gaussian inputs. We also address the implementation of Gaussian shaping for the proposed lattice Gaussian coding scheme.

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"
    - "almost universal codes for fading wiretap channels"

Connected through hyperedge HE-2 (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-3 (induced by source paper "exploring and experimenting with shaping designs for next generation optical communications"):
  with members:
    - "experimental comparison of probabilistic shaping methods for unrepeated fiber transmission"
    - "golden angle modulation"
    - "impact of 4d channel distribution on the achievable rates in coherent optical communication experiments"
    - "on probabilistic shaping of quadrature amplitude modulation for the nonlinear fiber channel"
    - "constellation shaping for wdm systems using 256qam 1024qam with probabilistic optimization"
    - "experimental demonstration of capacity increase and rate adaptation by probabilistically shaped 64 qam"
    - "ldpc coded modulation with probabilistic shaping for optical fiber systems"

Connected through hyperedge HE-4 (induced by source paper "multilevel ldpc lattices with efficient encoding and decoding and a generalization of construction d"):
  with members:
    - "ldpc lattice codes for full duplex relay channels"
    - "lda lattices without dithering achieve capacity on the gaussian channel"
    - "construction of capacity achieving lattice codes polar lattices"
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "connections between construction d and related constructions of lattices"
    - "on the performance of 1 level ldpc lattices"
    - "strong secrecy on the binary erasure wiretap channel using large girth ldpc codes"
    - "integer forcing linear receivers"

Connected through hyperedge HE-5 (induced by source paper "probabilistic shaping and non binary codes"):
  with members:
    - "leech constellations of construction a lattices"
    - "experimental demonstration of capacity increase and rate adaptation by probabilistically shaped 64 qam"
    - "constant composition distribution matching"
    - "how to achieve the capacity of asymmetric channels"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

Connected through hyperedge HE-6 (induced by source paper "polar codes and polar lattices for the heegard berger problem"):
  with members:
    - "polar codes for distributed hierarchical source coding"
    - "polar lattices for lossy compression"
    - "construction of capacity achieving lattice codes polar lattices"
    - "polar codes are optimal for lossy source coding"

Connected through hyperedge HE-7 (induced by source paper "polar codes and polar lattices for independent fading channels"):
  with members:
    - "algebraic lattice codes achieve the capacity of the compound block fading channel"
    - "polar codes for broadcast channels"
    - "almost universal codes achieving ergodic mimo capacity within a constant gap"
    - "construction of capacity achieving lattice codes polar lattices"
    - "number field lattices achieve gaussian and rayleigh channel capacity within a constant gap"
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "how to achieve the capacity of asymmetric channels"
    - "polar coding for fading channels binary and exponential channel cases"

Connected through hyperedge HE-8 (induced by source paper "leech constellations of construction a lattices"):
  with members:
    - "some goodness properties of lda lattices"
    - "encoding and indexing of lattice codes"
    - "lda lattices without dithering achieve capacity on the gaussian channel"
    - "low dimensional shaping for high dimensional lattice codes"
    - "construction of capacity achieving lattice codes polar lattices"
    - "on the performance of 1 level ldpc lattices"
    - "finite dimensional infinite constellations"
    - "turbo lattices construction and error decoding performance"

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)