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 "detection and estimation algorithms in massive mimo systems"):
  Abstract: This book chapter reviews signal detection and parameter estimation techniques for multiuser multiple-antenna wireless systems with a very large number of antennas, known as massive multi-input multi-output (MIMO) systems. We consider both centralized antenna systems (CAS) and distributed antenna systems (DAS) architectures in which a large number of antenna elements are employed and focus on the uplink of a mobile cellular system. In particular, we focus on receive processing techniques that include signal detection and parameter estimation problems and discuss the specific needs of massive MIMO systems. Simulation results illustrate the performance of detection and estimation algorithms under several scenarios of interest. Key problems are discussed and future trends in massive MIMO systems are pointed out.

Includes members:
  Member "blind adaptive interference suppression based on set membership constrained constant modulus algorithms with dynamic bounds":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "study of sparsity aware set membership adaptive algorithms with adjustable penalties")
  Member "scalable synchronization and reciprocity calibration for distributed multiuser mimo":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "amplitude and phase estimation for absolute calibration of massive mimo front ends")
  Member "scaling up mimo opportunities and challenges with very large arrays":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "downlink secrecy rate of one bit massive mimo system with active eavesdropping")
  Member "adaptive distributed space time coding based on adjustable code matrices for cooperative mimo relaying systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "study of cloud aided multi way multiple antenna relaying with best user link selection and joint ml detection")
  Member "a new class of upper bounds on the log partition function":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "visual semantic information pursuit a survey")
  Member "uplink comp under a constrained backhaul and imperfect channel knowledge":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "making cell free massive mimo competitive with mmse processing and centralized implementation")

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)