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 "study of joint mmse consensus and relay selection algorithms for distributed beamforming"):
  Abstract: This work presents joint minimum mean-square error (MMSE) consensus algorithm and relay selection algorithms for distributed beamforming. We propose joint MMSE consensus relay and selection schemes with a total power constraint and local communications among the relays for a network with cooperating sensors. We also devise greedy relay selection algorithms based on the MMSE consensus approach that optimize the network performance. Simulation results show that the proposed scheme and algorithms outperform existing techniques for distributed beamforming.

Includes members:
  Member "widely linear precoding for large scale mimo with iqi algorithms and performance analysis":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "study of coarse quantization aware block diagonalization algorithms for mimo systems with low resolution")
  Member "robust adaptive beamforming using a low complexity shrinkage based mismatch estimation algorithm":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "study of coarse quantization aware block diagonalization algorithms for mimo systems with low resolution")
  Member "direction finding algorithms based on joint iterative subspace optimization":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "study of coarse quantization aware block diagonalization algorithms for mimo systems with low resolution")
  Member "multi branch tomlinson harashima precoding design for mu mimo systems theory and algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "study of compressed randomized utv decompositions for low rank matrix approximations in data science")
  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 "energy and spectral efficiency of very large multiuser mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "downlink secrecy rate of one bit massive mimo system with active eavesdropping")
  Member "network beamforming using relays with perfect channel information":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "capitalizing backscatter aided hybrid relay communications with wireless energy harvesting")

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)