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: "dispersion of infinite constellations in fast fading channels"
  Abstract: In this work we extend the setting of communication without power constraint, proposed by Poltyrev, to fast fading channels with channel state information (CSI) at the receiver. The optimal codewords density, or actually the optimal normalized log density (NLD), is considered. Poltyrev's capacity for this channel is the highest achievable NLD, at possibly large block length, that guarantees a vanishing error probability. For a given finite block length n and a fixed error probability, there is a gap between the highest achievable NLD and Poltyrev's capacity. As in other channels, this gap asymptotically vanishes as the square root of the channel dispersion V over n, multiplied by the inverse Q-function of the allowed error probability. This dispersion, derived in the paper, equals the dispersion of the power constrained fast fading channel at the high SNR regime. Connections to the error exponent of the peak power constrained fading channel are also discussed.

Connected through hyperedge HE-1 (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"
    - "achieving awgn channel capacity with lattice gaussian coding"

Connected through hyperedge HE-2 (induced by source paper "towards massive ultra reliable and low latency wireless the art of sending short packets"):
  with members:
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "variable length convolutional coding for short blocklengths with decision feedback"
    - "unified scaling of polar codes error exponent scaling exponent moderate deviations and error floors"
    - "finite snr bounds on the sum rate capacity of rayleigh block fading multiple access channels with no a priori csi"
    - "finite length scaling for polar codes"
    - "diversity versus multiplexing at finite blocklength"
    - "optimum power control at finite blocklength"
    - "ultra reliable communication in 5g wireless systems"

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)