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: "adaptive reduced rank lcmv beamforming algorithms based on joint iterative optimization of filters design and analysis"
  Abstract: This paper presents reduced-rank linearly constrained minimum variance (LCMV) beamforming algorithms based on joint iterative optimization of filters. The proposed reduced-rank scheme is based on a constrained joint iterative optimization of filters according to the minimum variance criterion. The proposed optimization procedure adjusts the parameters of a projection matrix and an adaptive reducedrank filter that operates at the output of the bank of filters. We describe LCMV expressions for the design of the projection matrix and the reduced-rank filter. We then describe stochastic gradient and develop recursive least-squares adaptive algorithms for their efficient implementation along with automatic rank selection techniques. An analysis of the stability and the convergence properties of the proposed algorithms is presented and semi-analytical expressions are derived for predicting their mean squared error (MSE) performance. Simulations for a beamforming application show that the proposed scheme and algorithms outperform in convergence and tracking the existing full-rank and reduced-rank algorithms while requiring comparable complexity

Connected through hyperedge HE-1 (induced by source paper "study of coarse quantization aware block diagonalization algorithms for mimo systems with low resolution"):
  with members:
    - "throughput analysis of massive mimo uplink with low resolution adcs"
    - "branch and bound precoding for multiuser mimo systems with 1 bit quantization"
    - "widely linear precoding for large scale mimo with iqi algorithms and performance analysis"
    - "linear precoding with low resolution dacs for massive mu mimo ofdm downlink"
    - "iterative detection and decoding algorithms for mimo systems in block fading channels using ldpc codes"
    - "robust adaptive beamforming based on low rank and cross correlation techniques"
    - "quantized precoding for massive mu mimo"
    - "adaptive reduced rank receive processing based on minimum symbol error rate criterion for large scale multiple antenna systems"

Connected through hyperedge HE-2 (induced by source paper "joint agc and receiver design for large scale mu mimo systems with coarsely quantized signals and c rans"):
  with members:
    - "throughput analysis of massive mimo uplink with low resolution adcs"
    - "branch and bound precoding for multiuser mimo systems with 1 bit quantization"
    - "widely linear precoding for large scale mimo with iqi algorithms and performance analysis"
    - "uplink interference reduction in large scale antenna systems"
    - "full duplex cloud radio access network stochastic design and analysis"
    - "iterative detection and decoding algorithms for mimo systems in block fading channels using ldpc codes"
    - "robust adaptive beamforming based on low rank and cross correlation techniques"
    - "cloud radio access network virtualizing wireless access for dense heterogeneous systems"

Connected through hyperedge HE-3 (induced by source paper "study of adaptive activity aware constellation list based detection for massive machine type communications"):
  with members:
    - "branch and bound precoding for multiuser mimo systems with 1 bit quantization"
    - "widely linear precoding for large scale mimo with iqi algorithms and performance analysis"
    - "iterative detection and decoding algorithms for mimo systems in block fading channels using ldpc codes"
    - "robust adaptive beamforming based on low rank and cross correlation techniques"
    - "compressed sensing for wireless communications useful tips and tricks"
    - "adaptive reduced rank receive processing based on minimum symbol error rate criterion for large scale multiple antenna systems"
    - "robust adaptive beamforming using a low complexity shrinkage based mismatch estimation algorithm"
    - "direction finding algorithms based on joint iterative subspace optimization"

Connected through hyperedge HE-4 (induced by source paper "switched max link relay selection algorithms for buffer aided relay systems"):
  with members:
    - "sum rate maximization for linearly precoded downlink multiuser miso systems with partial csit a rate splitting approach"
    - "iterative detection and decoding algorithms for mimo systems in block fading channels using ldpc codes"
    - "adaptive reduced rank receive processing based on minimum symbol error rate criterion for large scale multiple antenna systems"

Connected through hyperedge HE-5 (induced by source paper "study of switched max link buffer aided relay selection for cooperative mimo systems"):
  with members:
    - "iterative detection and decoding algorithms for mimo systems in block fading channels using ldpc codes"
    - "adaptive reduced rank receive processing based on minimum symbol error rate criterion for large scale multiple antenna systems"

Connected through hyperedge HE-6 (induced by source paper "adaptive reduced rank receive processing based on minimum symbol error rate criterion for large scale multiple antenna systems"):
  with members:
    - "iterative detection and decoding algorithms for mimo systems in block fading channels using ldpc codes"
    - "robust adaptive beamforming using a low complexity shrinkage based mismatch estimation algorithm"
    - "massive mimo systems signal processing challenges and research trends"
    - "scaling up mimo opportunities and challenges with very large arrays"
    - "high rate space time coded large mimo systems low complexity detection and channel estimation"

Connected through hyperedge HE-7 (induced by source paper "multi user flexible coordinated beamforming using lattice reduction for massive mimo systems"):
  with members:
    - "robust adaptive beamforming using a low complexity shrinkage based mismatch estimation algorithm"
    - "multi branch tomlinson harashima precoding design for mu mimo systems theory and algorithms"
    - "generalized design of low complexity block diagonalization type precoding algorithms for multiuser mimo systems"
    - "blind adaptive interference suppression based on set membership constrained constant modulus algorithms with dynamic bounds"
    - "reduced rank doa estimation based on joint iterative subspace optimization and grid search"
    - "massive mimo systems signal processing challenges and research trends"
    - "scaling up mimo opportunities and challenges with very large arrays"
    - "adaptive distributed space time coding based on adjustable code matrices for cooperative mimo relaying systems"

Connected through hyperedge HE-8 (induced by source paper "coordinate tomlinson harashima precoding design for overloaded multi user mimo systems"):
  with members:
    - "robust adaptive beamforming using a low complexity shrinkage based mismatch estimation algorithm"
    - "multi branch tomlinson harashima precoding design for mu mimo systems theory and algorithms"
    - "generalized design of low complexity block diagonalization type precoding algorithms for multiuser mimo systems"
    - "blind adaptive interference suppression based on set membership constrained constant modulus algorithms with dynamic bounds"
    - "reduced rank doa estimation based on joint iterative subspace optimization and grid search"
    - "adaptive distributed space time coding based on adjustable code matrices for cooperative mimo relaying systems"
    - "lll reduction achieves the receive diversity in mimo 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.OH(Other Computer Science)