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: "fundamental limits of infinite constellations in mimo fading channels"
  Abstract: The fundamental and natural connection between the infinite constellation (IC) dimension and the best diversity order it can achieve is investigated in this paper. In the first part of this work we develop an upper bound on the diversity order of IC's for any dimension and any number of transmit and receive antennas. By choosing the right dimensions, we prove in the second part of this work that IC's in general and lattices in particular can achieve the optimal diversity-multiplexing tradeoff of finite constellations. This work gives a framework for designing lattices for multiple-antenna channels using lattice decoding.

Connected through hyperedge HE-1 (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"
    - "almost universal codes achieving ergodic mimo capacity within a constant gap"
    - "number field lattices achieve gaussian and rayleigh channel capacity within a constant gap"

Connected through hyperedge HE-2 (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"
    - "almost universal codes achieving ergodic mimo capacity within a constant gap"
    - "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"

Connected through hyperedge HE-3 (induced by source paper "diversity of low density lattices"):
  with members:
    - "low density parity check codes for nonergodic block fading channels"
    - "low density lattice codes"

Connected through hyperedge HE-4 (induced by source paper "the jacobi mimo channel"):
  with members:
    - "finite snr diversity multiplexing tradeoff via asymptotic analysis of large mimo systems"
    - "random matrix model for nakagami hoyt fading"
    - "impact of spatial correlation on the finite snr diversity multiplexing tradeoff"

Connected through hyperedge HE-5 (induced by source paper "on the diversity multiplexing tradeoff of unconstrained multiple access channels"):
  with members:
    - "dmt optimality of lr aided linear decoders for a general class of channels lattice designs and system models"

Connected through hyperedge HE-6 (induced by source paper "dispersion of infinite constellations in fast fading channels"):
  with members:
    - "finite dimensional infinite constellations"

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)