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: "multi branch tomlinson harashima precoding design for mu mimo systems theory and algorithms"
  Abstract: Tomlinson-Harashima precoding (THP) is a nonlinear processing technique employed at the transmit side which is a dual to the successive interference cancelation (SIC) detection at the receive side. Like SIC detection, the performance of THP strongly depends on the ordering of the precoded symbols. The optimal ordering algorithm, however, is impractical for multiuser MIMO (MU-MIMO) systems with multiple receive antennas due to the fact that the users are geographically distributed. In this paper, we propose a multi-branch THP (MB-THP) scheme and algorithms that employ multiple transmit processing and ordering strategies along with a selection scheme to mitigate interference in MU-MIMO systems. Two types of multi-branch THP (MB-THP) structures are proposed. The first one employs a decentralized strategy with diagonal weighted filters at the receivers of the users and the second uses a diagonal weighted filter at the transmitter. The MB-MMSE-THP algorithms are also derived based on an extended system model with the aid of an LQ decomposition, which is much simpler compared to the conventional MMSE-THP algorithms. Simulation results show that a better bit error rate (BER) performance can be achieved by the proposed MB-MMSE-THP precoder with a small computational complexity increase.

Connected through hyperedge HE-1 (induced by source paper "study of compressed randomized utv decompositions for low rank matrix approximations in data science"):
  with members:
    - "subspace orbit randomized decomposition for low rank matrix approximations"
    - "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"
    - "coherence pursuit fast simple and robust principal component analysis"
    - "practical sketching algorithms for low rank matrix approximation"
    - "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"
    - "fast randomized singular value thresholding for low rank optimization"

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 switched max link relay selection for cooperative multiple antenna systems"):
  with members:
    - "relay pair selection in buffer aided successive opportunistic relaying using a multi antenna source"
    - "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"
    - "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"
    - "virtual full duplex buffer aided relaying in the presence of inter relay interference"
    - "adaptive reduced rank receive processing based on minimum symbol error rate criterion for large scale multiple antenna systems"
    - "generalized design of low complexity block diagonalization type precoding algorithms for multiuser mimo systems"

Connected through hyperedge HE-4 (induced by source paper "a survey on mimo transmission with discrete input signals technical challenges advances and future trends"):
  with members:
    - "asymptotic performance analysis of a k hop amplify and forward relay mimo channel"
    - "iterative distributed minimum total mse approach for secure communications in mimo interference channels"
    - "asymptotic analysis of su mimo channels with transmitter noise and mismatched joint decoding"
    - "secure massive mimo transmission with an active eavesdropper"
    - "interference aligned space time transmission with diversity for the 2 times 2 x network"
    - "space time encoded miso broadcast channel with outdated csit an error rate and diversity performance analysis"
    - "high snr asymptotics of mutual information for discrete constellations with applications to bicm"
    - "differential distributed space time coding with imperfect synchronization in frequency selective channels"

Connected through hyperedge HE-5 (induced by source paper "study of joint mmse consensus and relay selection algorithms for distributed beamforming"):
  with members:
    - "widely linear precoding for large scale mimo with iqi algorithms and performance analysis"
    - "robust adaptive beamforming using a low complexity shrinkage based mismatch estimation algorithm"
    - "direction finding algorithms based on joint iterative subspace optimization"
    - "a new class of upper bounds on the log partition function"
    - "energy and spectral efficiency of very large multiuser mimo systems"
    - "network beamforming using relays with perfect channel information"

Connected through hyperedge HE-6 (induced by source paper "review of buffer aided distributed space time coding schemes and algorithms for cooperative wireless 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"
    - "adaptive distributed space time coding based on adjustable code matrices for cooperative mimo relaying systems"

Connected through hyperedge HE-7 (induced by source paper "study of relay selection for physical layer security in buffer aided relay networks based on the secrecy rate criterion"):
  with members:
    - "principles of physical layer security in multiuser wireless networks a survey"
    - "buffer aided relaying with adaptive link selection fixed and mixed rate transmission"
    - "multiuser diversity for secrecy communications using opportunistic jammer selection secure dof and jammer scaling law"

Connected through hyperedge HE-8 (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"
    - "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"
    - "adaptive reduced rank lcmv beamforming algorithms based on joint iterative optimization of filters design and analysis"

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.IT(Information Theory)