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 "optimum low complexity decoder for spatial modulation"):
  Abstract: In this paper, a novel low-complexity detection algorithm for spatial modulation (SM), referred to as the minimum-distance of maximum-length (m-M) algorithm, is proposed and analyzed. The proposed m-M algorithm is a smart searching method that is applied for the SM tree-search decoders. The behavior of the m-M algorithm is studied for three different scenarios: i) perfect channel state information at the receiver side (CSIR), ii) imperfect CSIR of a fixed channel estimation error variance, and iii) imperfect CSIR of a variable channel estimation error variance. Moreover, the complexity of the m-M algorithm is considered as a random variable, which is carefully analyzed for all scenarios, using probabilistic tools. Based on a combination of the sphere decoder (SD) and ordering concepts, the m-M algorithm guarantees to find the maximum-likelihood (ML) solution with a significant reduction in the decoding complexity compared to SM-ML and existing SM-SD algorithms; it can reduce the complexity up to 94% and 85% in the perfect CSIR and the worst scenario of imperfect CSIR, respectively, compared to the SM-ML decoder. Monte Carlo simulation results are provided to support our findings as well as the derived analytical complexity reduction expressions.

Includes members:
  Member "index modulation techniques for 5g wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a survey on spatial modulation in emerging wireless systems research progresses and applications")
  Member "solutions to integrals involving the marcum q function and applications":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a semi linear approximation of the first order marcum q function with application to predictor antenna systems")
  Member "what will 5g be":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "5g network slicing using sdn and nfv a survey of taxonomy architectures and future challenges")
  Member "generalised sphere decoding for spatial modulation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a survey on spatial modulation in emerging wireless systems research progresses and applications")

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)