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: "algebraic lattice codes achieve the capacity of the compound block fading channel"
  Abstract: We propose a lattice coding scheme that achieves the capacity of the compound block-fading channel. Our lattice construction exploits the multiplicative structure of number fields and their group of units to absorb ill-conditioned channel realizations. To shape the constellation, a discrete Gaussian distribution over the lattice points is applied. A by-product of our results is the proof that the lattice Gaussian distribution is capacity-achieving in the AWGN channel for any signal-to-noise ratio.

Connected through hyperedge HE-1 (induced by source paper "ring compute and forward over block fading channels"):
  with members:
    - "boosted kz and lll algorithms"
    - "polynomially solvable instances of the shortest and closest vector problems with applications to compute and forward"
    - "universal lattice codes for mimo channels"
    - "adaptive compute and forward with lattice codes over algebraic integers"
    - "construction a of lattices over number fields and block fading wiretap coding"
    - "lattices over eisenstein integers for compute and forward"
    - "an algebraic approach to physical layer network coding"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"

Connected through hyperedge HE-2 (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"
    - "lda lattices without dithering achieve capacity on the gaussian channel"
    - "almost universal codes for fading wiretap channels"
    - "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-3 (induced by source paper "multilevel code construction for compound fading channels"):
  with members:
    - "polar codes and polar lattices for independent fading channels"
    - "almost universal codes achieving ergodic mimo capacity within a constant gap"
    - "precoded integer forcing universally achieves the mimo capacity to within a constant gap"
    - "polar coding for fading channels binary and exponential channel cases"
    - "universal polar codes"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"

Connected through hyperedge HE-4 (induced by source paper "random ensembles of lattices from generalized reductions"):
  with members:
    - "adaptive compute and forward with lattice codes over algebraic integers"
    - "construction a of lattices over number fields and block fading wiretap coding"
    - "lattice index codes from algebraic number fields"
    - "semantically secure lattice codes for the gaussian wiretap channel"

Connected through hyperedge HE-5 (induced by source paper "polar codes and polar lattices for independent fading channels"):
  with members:
    - "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"
    - "achieving awgn channel capacity with lattice gaussian coding"
    - "polar coding for fading channels binary and exponential channel cases"

Connected through hyperedge HE-6 (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"
    - "almost universal codes for fading wiretap channels"
    - "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-7 (induced by source paper "almost universal codes achieving ergodic mimo capacity within a constant gap"):
  with members:
    - "polar codes and polar lattices for independent fading channels"
    - "almost universal codes for fading wiretap channels"
    - "division algebra codes achieve mimo block fading channel capacity within a constant gap"
    - "number field lattices achieve gaussian and rayleigh channel capacity within a constant gap"
    - "precoded integer forcing universally achieves the mimo capacity to within a constant gap"
    - "inverse determinant sums and connections between fading channel information theory and algebra"
    - "dispersion analysis of infinite constellations in ergodic fading channels"
    - "fast decodable asymmetric space time codes from division algebras"

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)