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 i fundamental limits"
  Abstract: Spectral efficiency for asynchronous code division multiple access (CDMA) with random spreading is calculated in the large system limit allowing for arbitrary chip waveforms and frequency-flat fading. Signal-to-interference and noise ratios (SINRs) for suboptimal receivers, such as the linear minimum mean square error (MMSE) detectors, are derived. The approach is general and optionally allows even for statistics obtained by undersampling the received signal. All performance measures are given as a function of the chip waveform and the delay distribution of the users in the large system limit. It turns out that synchronizing users on a chip level impairs performance for all chip waveforms with bandwidth greater than the Nyquist bandwidth, e.g., positive roll-off factors. For example, with the pulse shaping demanded in the UMTS standard, user synchronization reduces spectral efficiency up to 12% at 10 dB normalized signal-to-noise ratio. The benefits of asynchronism stem from the finding that the excess bandwidth of chip waveforms actually spans additional dimensions in signal space, if and only if the users are desynchronized at chip-level. The analysis of linear MMSE detectors shows that the limiting interference effects can be decoupled both in the user domain and in the frequency domain such that the concept of effective interference spectral density arises. This generalizes and refines Tse and Hanly's concept of effective interference. In Part II, the analysis is extended to any linear detector that admits a representation as multistage detector and guidelines for the design of low complexity multistage detectors with universal weights are provided.

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 ii design criteria"

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 ii design criteria"

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)