human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "closed form word error rate analysis for successive interference cancellation decoders"):
  Abstract: We consider the estimation of an integer vector $\hbx\in \mathbb{Z}^n$ from the linear observation $\y=\A\hbx+\v$, where $\A\in\mathbb{R}^{m\times n}$ is a random matrix with independent and identically distributed (i.i.d.) standard Gaussian $\mathcal{N}(0,1)$ entries, and $\v\in \mathbb{R}^m$ is a noise vector with i.i.d. $\mathcal{N}(0,\sigma^2 )$ entries with given $\sigma$. In digital communications, $\hbx$ is typically uniformly distributed over an $n$-dimensional box $\mathcal{B}$. For this estimation problem, successive interference cancellation (SIC) decoders are popular due to their low complexity, and a detailed analysis of their word error rates (WERs) is highly useful. In this paper, we derive closed-form WER expressions for two cases: (1) $\hbx\in \mathbb{Z}^n$ is fixed and (2) $\hbx$ is uniformly distributed over $\mathcal{B}$. We also investigate some of their properties in detail and show that they agree closely with simulated word error probabilities.

Includes members:
  Member "effects of some lattice reductions on the success probability of the zero forcing decoder":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the kz reduction")
  Member "success probability of the babai estimators for box constrained integer linear models":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on low complexity lattice reduction algorithms for large scale mimo detection the blessing of sequential reduction")
  Member "effects of the lll reduction on the success probability of the babai point and on the complexity of sphere decoding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "effects of some lattice reductions on the success probability of the zero forcing decoder")
  Member "column reordering for box constrained integer least squares problems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "sustain scalable unsupervised scoring for tensors and its application to phenotyping")
  Member "lll reduction achieves the receive diversity in mimo decoding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on low complexity lattice reduction algorithms for large scale mimo detection the blessing of sequential reduction")
  Member "on the limitations of the naive lattice decoding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "markov chain monte carlo methods for lattice gaussian sampling lattice reduction and decoding optimization")

Question: Please tell me which class the source paper 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)