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: "asynchronous cdma systems with random spreading part ii design criteria"
  Abstract: Totally asynchronous code-division multiple-access (CDMA) systems are addressed. In Part I, the fundamental limits of asynchronous CDMA systems are analyzed in terms of spectral efficiency and SINR at the output of the optimum linear detector. The focus of Part II is the design of low-complexity implementations of linear multiuser detectors in systems with many users that admit a multistage representation, e.g., reduced rank multistage Wiener filters, polynomial expansion detectors, weighted linear parallel interference cancellers. The effects of excess bandwidth, chip-pulse shaping, and time delay distribution on CDMA with suboptimum linear receiver structures are investigated. Recursive expressions for universal weight design are given. The performance in terms of SINR is derived in the large-system limit and the performance improvement over synchronous systems is quantified. The considerations distinguish between two ways of forming discrete-time statistics: chip-matched filtering and oversampling.

Connected through hyperedge HE-1 (induced by source paper "optimal sequence and performance for desired user in asynchronous cdma system"):
  with members:
    - "optimal sequence and sinr for desired user in asynchronous cdma system"
    - "asynchronous cdma systems with random spreading part i fundamental limits"

Connected through hyperedge HE-2 (induced by source paper "optimal sequence and sinr for desired user in asynchronous cdma system"):
  with members:
    - "asynchronous cdma systems with random spreading part i fundamental limits"

Connected through hyperedge HE-3 (induced by source paper "applications of large random matrices in communications engineering"):
  with members:
    - "asymptotic analysis of map estimation via the replica method and applications to compressed sensing"
    - "on information rates of the fading wyner cellular model via the thouless formula for the strip"
    - "on certain large random hermitian jacobi matrices with applications to wireless communications"
    - "vector precoding for wireless mimo systems and its replica analysis"
    - "sharp bounds for optimal decoding of low density parity check codes"
    - "on slow fading non separable correlation mimo systems"
    - "analysis of cdma systems that are characterized by eigenvalue spectrum"
    - "tight bounds for ldpc and ldgm codes under map decoding"

Connected through hyperedge HE-4 (induced by source paper "asymptotic moments for interference mitigation in correlated fading channels"):
  with members:
    - "large system analysis of linear precoding in correlated miso broadcast channels under limited feedback"
    - "a deterministic equivalent for the analysis of correlated mimo multiple access channels"

Connected through hyperedge HE-5 (induced by source paper "virtual full duplex wireless communication via rapid on off division duplex"):
  with members:
    - "wireless network information flow a deterministic approach"
    - "capacity for half duplex line networks with two sources"
    - "rethinking information theory for mobile ad hoc networks"
    - "coding strategies for noise free relay cascades with half duplex constraint"
    - "neighbor discovery in wireless networks a multiuser detection approach"

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)