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 achieving ergodic mimo capacity within a constant gap"
  Abstract: This work addresses the question of achieving capacity with lattice codes in multi-antenna block fading channels when the number of fading blocks tends to infinity. A design criterion based on the normalized minimum determinant is proposed for division algebra multiblock space-time codes over fading channels; this plays a similar role to the Hermite invariant for Gaussian channels. It is shown that this criterion is sufficient to guarantee transmission rates within a constant gap from capacity both for slow fading channels and ergodic fading channels. This performance is achieved both under maximum likelihood decoding and naive lattice decoding. In the case of independent identically distributed Rayleigh fading, it is also shown that the error probability vanishes exponentially fast. In contrast to the standard approach in the literature which employs random lattice ensembles, the existence results in this paper are derived from number theory. First the gap to capacity is shown to depend on the discriminant of the chosen division algebra; then class field theory is applied to build families of algebras with small discriminants. The key element in the construction is the choice of a sequence of division algebras whose centers are number fields with small root discriminants.

Connected through hyperedge HE-1 (induced by source paper "on the separability of ergodic fading mimo channels a lattice coding approach"):
  with members:
    - "lattice coding and decoding for multiple antenna ergodic fading channels"
    - "polar codes and polar lattices for independent fading channels"
    - "precoded integer forcing universally achieves the mimo capacity to within a constant gap"
    - "dispersion analysis of infinite constellations in ergodic fading channels"
    - "integer forcing linear receivers"
    - "compute and forward harnessing interference through structured codes"

Connected through hyperedge HE-2 (induced by source paper "lattice coding and decoding for multiple antenna ergodic fading channels"):
  with members:
    - "polar codes and polar lattices for independent fading channels"
    - "precoded integer forcing universally achieves the mimo capacity to within a constant gap"
    - "dispersion analysis of infinite constellations in ergodic fading channels"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "lattice codes for the gaussian relay channel decode and forward and compress and forward"
    - "integer forcing linear receivers"
    - "compute and forward harnessing interference through structured codes"

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"
    - "algebraic lattice codes achieve the capacity of the compound block fading channel"
    - "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 "algebraic lattice codes for linear fading channels"):
  with members:
    - "lattice coding and decoding for multiple antenna ergodic fading channels"
    - "polar codes and polar lattices for independent fading channels"
    - "division algebra codes achieve mimo block fading channel capacity within a constant gap"
    - "precoded integer forcing universally achieves the mimo capacity to within a constant gap"

Connected through hyperedge HE-5 (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"
    - "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"
    - "algebraic lattice codes achieve the capacity of the compound block fading channel"
    - "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"
    - "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 for fading wiretap channels"):
  with members:
    - "probability estimates for fading and wiretap channels from ideal class zeta functions"
    - "number field lattices achieve gaussian and rayleigh channel capacity within a constant gap"
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "on secrecy capacity of fast fading mimome wiretap channels with statistical csit"
    - "on secrecy capacity of fast fading multiple input wiretap channels with statistical csit"
    - "strong secrecy on the binary erasure wiretap channel using large girth ldpc codes"
    - "an error probability approach to mimo wiretap channels"
    - "strong secrecy from channel resolvability"

Connected through hyperedge HE-8 (induced by source paper "algebraic lattice codes achieve the capacity of the compound block fading channel"):
  with members:
    - "adaptive compute and forward with lattice codes over algebraic integers"
    - "construction a of lattices over number fields and block fading wiretap coding"
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "precoded integer forcing universally achieves the mimo capacity to within a constant gap"
    - "achieving awgn channel capacity with lattice gaussian coding"
    - "dispersion analysis of infinite constellations in ergodic fading channels"
    - "fundamental limits of infinite constellations in mimo fading channels"

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)