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: "asymptotic analysis of general multiuser detectors in mimo ds cdma channels"
  Abstract: We analyze decoupling structures of MIMO DS-CDMA channels with general multiuser detector front ends, using the replica method, in order to compare the space-time spreading (STS) and time spreading (TS) schemes. In the many- user limit, a MIMO DS-CDMA channel with the STS scheme is decoupled into a bank of single-user SIMO channels. On the other hand, a MIMO DS-CDMA channel with the TS scheme is decoupled into a bank of single-user MIMO channels. In view of performance, the STS scheme outperforms the TS scheme in the fast fading situation if transmit spatial correlations exist. In terms of complexity, the STS scheme does not require any space-time coding. On the other hand, the TS scheme does require space-time coding in order to achieve comparable performance to the STS scheme. The STS scheme improves the performance of communications and reduces the complexity of transmitter and receiver architectures.

Connected through hyperedge HE-1 (induced by source paper "asymptotic performance analysis of a k hop amplify and forward relay mimo channel"):
  with members:
    - "asymptotic analysis of su mimo channels with transmitter noise and mismatched joint decoding"
    - "large system analysis of correlated mimo multiple access channels with arbitrary signaling in the presence of interference"
    - "asymptotic capacity and optimal precoding in mimo multi hop relay networks"
    - "ergodic capacity analysis of amplify and forward mimo dual hop systems"
    - "a typical reconstruction limit of compressed sensing based on lp norm minimization"
    - "tight bounds on the capacity of binary input random cdma systems"
    - "vector precoding for wireless mimo systems and its replica analysis"
    - "asymptotic mutual information statistics of separately correlated rician fading mimo channels"

Connected through hyperedge HE-2 (induced by source paper "asymptotic optimality of massive mimo systems using densely spaced transmit antennas"):
  with members:
    - "blind pilot decontamination"
    - "large system analysis of correlated mimo multiple access channels with arbitrary signaling in the presence of interference"
    - "scaling up mimo opportunities and challenges with very large arrays"
    - "on an achievable rate of large rayleigh block fading mimo channels with no csi"
    - "large system analysis of joint channel and data estimation for mimo ds cdma systems"
    - "a deterministic equivalent for the analysis of correlated mimo multiple access channels"
    - "vector precoding for wireless mimo systems and its replica analysis"
    - "analysis of cdma systems that are characterized by eigenvalue spectrum"

Connected through hyperedge HE-3 (induced by source paper "iterative lmmse channel estimation multiuser detection and decoding via spatial coupling"):
  with members:
    - "a generalization of threshold saturation application to spatially coupled bicm id"
    - "accelerating iterative detection for spatially coupled systems by collaborative training"
    - "approaching the rate distortion limit with spatial coupling belief propagation and decimation"
    - "iterative multiuser detection and decoding with spatially coupled interleaving"
    - "on an achievable rate of large rayleigh block fading mimo channels with no csi"
    - "thresholds of spatially coupled systems via lyapunov s method"
    - "a simple proof of threshold saturation for coupled scalar recursions"
    - "large system analysis of joint channel and data estimation for mimo ds cdma systems"

Connected through hyperedge HE-4 (induced by source paper "on an achievable rate of large rayleigh block fading mimo channels with no csi"):
  with members:
    - "large system analysis of joint channel and data estimation for mimo ds cdma systems"
    - "on the capacity of large mimo block fading channels"
    - "optimization of sequences in cdma systems a statistical mechanics approach"
    - "microscopic analysis for decoupling principle of linear vector channel"
    - "on the capacity and energy efficiency of training based transmissions over fading channels"
    - "analysis of cdma systems that are characterized by eigenvalue spectrum"
    - "randomly spread cdma asymptotics via statistical physics"

Connected through hyperedge HE-5 (induced by source paper "large system analysis of joint channel and data estimation for mimo ds cdma systems"):
  with members:
    - "tight bounds on the capacity of binary input random cdma systems"
    - "microscopic analysis for decoupling principle of linear vector channel"
    - "vector precoding for wireless mimo systems and its replica analysis"
    - "hierarchical decoupling principle of a mimo cdma channel in asymptotic limits"
    - "performance analysis of iterative channel estimation and multiuser detection in multipath ds cdma channels"
    - "analysis of cdma systems that are characterized by eigenvalue spectrum"
    - "randomly spread cdma asymptotics via statistical physics"

Connected through hyperedge HE-6 (induced by source paper "large system analysis of joint user selection and vector precoding for multiuser mimo downlink"):
  with members:
    - "large system analysis of joint channel and data estimation for mimo ds cdma systems"
    - "a greedy algorithm of data dependent user selection for fast fading gaussian vector broadcast channels"
    - "sum rates rate allocation and user scheduling for multi user mimo vector perturbation precoding"
    - "tight bounds on the capacity of binary input random cdma systems"
    - "vector precoding for wireless mimo systems and its replica analysis"
    - "analysis of cdma systems that are characterized by eigenvalue spectrum"
    - "randomly spread cdma asymptotics via statistical physics"

Connected through hyperedge HE-7 (induced by source paper "improvement of bp based cdma multiuser detection by spatial coupling"):
  with members:
    - "a phenomenological study on threshold improvement via spatial coupling"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"
    - "coupled graphical models and their thresholds"
    - "analysis of belief propagation for non linear problems the example of cdma or how to prove tanaka s formula"
    - "analysis of cdma systems that are characterized by eigenvalue spectrum"
    - "randomly spread cdma asymptotics via statistical physics"

Connected through hyperedge HE-8 (induced by source paper "inference from correlated patterns a unified theory for perceptron learning and linear vector channels"):
  with members:
    - "vector precoding for wireless mimo systems and its replica analysis"
    - "analysis of belief propagation for non linear problems the example of cdma or how to prove tanaka s formula"
    - "analysis of cdma systems that are characterized by eigenvalue spectrum"
    - "various solutions to the firing squad synchronization problems"
    - "improved message passing for inference in densely connected systems"
    - "belief propagation based multi user detection"

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)