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: "sparsely spread cdma a statistical mechanics based analysis"
  Abstract: Sparse code division multiple access (CDMA), a variation on the standard CDMA method in which the spreading (signature) matrix contains only a relatively small number of nonzero elements, is presented and analysed using methods of statistical physics. The analysis provides results on the performance of maximum likelihood decoding for sparse spreading codes in the large system limit. We present results for both cases of regular and irregular spreading matrices for the binary additive white Gaussian noise channel (BIAWGN) with a comparison to the canonical (dense) random spreading code. © 2007 IOP Publishing Ltd.

Connected through hyperedge HE-1 (induced by source paper "fundamental limits of low density spreading noma with fading"):
  with members:
    - "what will 5g be"
    - "five disruptive technology directions for 5g"
    - "spectral efficiency of random time hopping cdma"
    - "analysis of belief propagation for non linear problems the example of cdma or how to prove tanaka s formula"
    - "randomly spread cdma asymptotics via statistical physics"

Connected through hyperedge HE-2 (induced by source paper "precoding for the sparsely spread mc cdma downlink with discrete alphabet inputs"):
  with members:
    - "optimal multiuser transmit beamforming a difficult problem with a simple solution structure"
    - "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"

Connected through hyperedge HE-3 (induced by source paper "radio resource allocation for multicarrier low density spreading multiple access"):
  with members:
    - "analysis of belief propagation for non linear problems the example of cdma or how to prove tanaka s formula"

Connected through hyperedge HE-4 (induced by source paper "low density code domain noma better be regular"):
  with members:
    - "scma codebook design"

Connected through hyperedge HE-5 (induced by source paper "performance improvement of iterative multiuser detection for large sparsely spread cdma systems by spatial coupling"):
  with members:
    - "iterative multiuser detection and decoding with spatially coupled interleaving"
    - "thresholds of spatially coupled systems via lyapunov s method"
    - "a simple proof of threshold saturation for coupled scalar recursions"
    - "chains of mean field models"
    - "a phenomenological study on threshold improvement via spatial coupling"
    - "wave like solutions of general one dimensional spatially coupled systems"
    - "threshold saturation on channels with memory via spatial coupling"
    - "information theoretically optimal compressed sensing via spatial coupling and approximate message passing"

Connected through hyperedge HE-6 (induced by source paper "non adaptive pooling strategies for detection of rare faulty items"):
  with members:
    - "compressed sensing under matrix uncertainty optimum thresholds and robust approximate message passing"
    - "non adaptive group testing explicit bounds and novel algorithms"
    - "compressed sensing of approximately sparse signals phase transitions and optimal reconstruction"
    - "boolean compressed sensing and noisy group testing"
    - "compressed sensing with sparse structured matrices"
    - "information theoretically optimal compressed sensing via spatial coupling and approximate message passing"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"
    - "multiple access demodulation in the lifted signal graph with spatial coupling"

Connected through hyperedge HE-7 (induced by source paper "spectral efficiency of random time hopping cdma"):
  with members:
    - "what will 5g be"
    - "bounds on the sum capacity of synchronous binary cdma channels"
    - "tight bounds on the capacity of binary input random cdma systems"
    - "analysis of belief propagation for non linear problems the example of cdma or how to prove tanaka s formula"
    - "randomly spread cdma asymptotics via statistical physics"
    - "channel uncertainty in ultra wideband communication systems"

Connected through hyperedge HE-8 (induced by source paper "estimating random variables from random sparse observations"):
  with members:
    - "group testing with random pools optimal two stage algorithms"
    - "detailed network measurements using sparse graph counters the theory"
    - "analysis of belief propagation for non linear problems the example of cdma or how to prove tanaka s formula"
    - "maxwell construction the hidden bridge between iterative and maximum a posteriori decoding"
    - "the generalized area theorem and some of its consequences"
    - "tight bounds for ldpc and ldgm codes under map decoding"
    - "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)