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: "hierarchical decoupling principle of a mimo cdma channel in asymptotic limits"
  Abstract: We analyze an uplink of a fast flat fading MIMO-CDMA channel in the case where the data symbol vector for each user follows an arbitrary distribution. The spectral efficiency of the channel with CSI at the receiver is evaluated analytically with the replica method. The main result is that the hierarchical decoupling principle holds in the MIMO-CDMA channel, i.e., the MIMO-CDMA channel is decoupled into a bank of single-user MIMO channels in the many-user limit, and each single-user MIMO channel is further decoupled into a bank of scalar Gaussian channels in the many-antenna limit for a fading model with a limited number of scatterers.

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"
    - "asymptotic analysis of general multiuser detectors in mimo ds cdma channels"
    - "vector precoding for wireless mimo systems and its replica analysis"

Connected through hyperedge HE-2 (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"
    - "asymptotic analysis of general multiuser detectors in mimo ds cdma channels"
    - "vector precoding for wireless mimo systems and its replica analysis"
    - "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-3 (induced by source paper "microscopic analysis for decoupling principle of linear vector channel"):
  with members:
    - "randomly spread cdma asymptotics via statistical physics"

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)