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: "diversity of low density lattices"
  Abstract: The non-ergodic fading channel is a useful model for various wireless communication channels in both indoor and outdoor environments. Building on Poltyrev's work on infinite lattice constellations for the Gaussian channel, we derive a Poltyrev outage limit (POL) for lattices in presence of block fading. We prove that the diversity order of this POL is equal to the number of degrees of freedom in the channel. Further, we describe full-diversity constructions of real lattices defined by their integer-check matrix, i.e., the inverse of their generator matrix. In the first construction suited to maximum-likelihood decoding, these lattices are defined by sparse (low-density) or non-sparse integer-check matrices. Based on a special structure of the lattice binary image, a second full-diversity lattice construction is described for sparse integer-check matrices in the context of iterative probabilistic decoding. Full diversity is theoretically proved in both cases. We also propose a method to construct lattices for diversity order 4 suitable for iterative probabilistic decoding. Computer simulation results for diversity order L = 2 and L = 4 confirm that the proposed low-density lattices attain the maximal diversity order. The newly defined POL is used during this simulation to declare an outage error without decoding, which drastically improves the decoding runtime.

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)