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: "tail behavior of sphere decoding complexity in random lattices"
  Abstract: We analyze the (computational) complexity distribution of sphere-decoding (SD) for random infinite lattices. In particular, we show that under fairly general assumptions on the statistics of the lattice basis matrix, the tail behavior of the SD complexity distribution is solely determined by the inverse volume of a fundamental region of the underlying lattice. Particularizing this result to N × M, N ≥ M, i.i.d. Gaussian lattice basis matrices, we find that the corresponding complexity distribution is of Pareto-type with tail exponent given by N − M + 1. We furthermore show that this tail exponent is not improved by lattice-reduction, which includes layer-sorting as a special case.

Connected through hyperedge HE-1 (induced by source paper "achieving a vanishing snr gap to exact lattice decoding at a subexponential complexity"):
  with members:
    - "on the proximity factors of lattice reduction aided decoding"
    - "efficient soft input soft output tree detection via an improved path metric"
    - "sphere decoding complexity exponent for decoding full rate codes over the quasi static mimo channel"
    - "decoding by sampling a randomized lattice algorithm for bounded distance decoding"
    - "faster recursions in sphere decoding"
    - "finite snr diversity multiplexing tradeoff via asymptotic analysis of large mimo systems"
    - "mimo detection for high order qam based on a gaussian tree approximation"
    - "dmt optimality of lr aided linear decoders for a general class of channels lattice designs and system models"

Connected through hyperedge HE-2 (induced by source paper "sphere decoding complexity exponent for decoding full rate codes over the quasi static mimo channel"):
  with members:
    - "efficient soft input soft output tree detection via an improved path metric"
    - "lattice sequential decoder for coded mimo channel performance and complexity analysis"
    - "decoding by sampling a randomized lattice algorithm for bounded distance decoding"
    - "faster recursions in sphere decoding"
    - "lattice sequential decoding for last coded mimo channels achievable rate dmt and complexity analysis"
    - "mimo detection for high order qam based on a gaussian tree approximation"
    - "dmt optimality of lr aided linear decoders for a general class of channels lattice designs and system models"
    - "soft input soft output single tree search sphere decoding"

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)