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: "denoising based turbo compressed sensing"
  Abstract: Turbo compressed sensing (Turbo-CS) is an efficient iterative algorithm for sparse signal recovery with partial orthogonal sensing matrices. In this paper, we extend the Turbo-CS algorithm to solve compressed sensing problems involving more general signal structure, including compressive image recovery and low-rank matrix recovery. A main difficulty for such an extension is that the original Turbo-CS algorithm requires prior knowledge of the signal distribution that is usually unavailable in practice. To overcome this difficulty, we propose to redesign the Turbo-CS algorithm by employing a generic denoiser that does not depend on the prior distribution and hence the name denoising-based Turbo-CS (D-Turbo-CS). We then derive the extrinsic information for a generic denoiser by following the Turbo-CS principle. Based on that, we optimize the parametric extrinsic denoisers to minimize the output mean-square error (MSE). Explicit expressions are derived for the extrinsic SURE-LET denoiser used in compressive image denoising and also for the singular value thresholding (SVT) denoiser used in low-rank matrix denoising. We find that the dynamics of D-Turbo-CS can be well described by a scaler recursion called MSE evolution, similar to the case for Turbo-CS. Numerical results demonstrate that D-Turbo-CS considerably outperforms the counterpart algorithms in both reconstruction quality and running time.

Connected through hyperedge HE-1 (induced by source paper "random access for massive machine type communications"):
  with members:
    - "beamwidth control for noma in hybrid mmwave communication systems"
    - "design of non orthogonal beamspace multiple access for cellular internet of things"
    - "on the performance gain of noma over oma in uplink single cell systems"
    - "multi beam noma for hybrid mmwave systems"
    - "joint pilot and payload power control for uplink mimo noma with mrc sic receivers"
    - "reliability based windowed decoding for spatially coupled ldpc codes"
    - "short packet downlink transmission with non orthogonal multiple access"
    - "a multi beam noma framework for hybrid mmwave systems"

Connected through hyperedge HE-2 (induced by source paper "reliable ofdm transmission with ultra low resolution adc"):
  with members:
    - "joint channel estimation decoding with frequency selective channels and few bit adcs"
    - "low complexity multiuser qam detection for uplink 1 bit massive mimo"
    - "a general framework for low resolution receivers for mimo channels"
    - "uplink multiuser massive mimo systems with low resolution adcs a coding theoretic approach"
    - "bayesian optimal data detector for mmwave ofdm system with low resolution adc"
    - "generalized expectation consistent signal recovery for nonlinear measurements"
    - "channel estimation and data equalization in frequency selective mimo systems with one bit quantization"
    - "bayes optimal joint channel and data estimation for massive mimo with low precision adcs"

Connected through hyperedge HE-3 (induced by source paper "structured turbo compressed sensing for downlink massive mimo ofdm channel estimation"):
  with members:
    - "approximate message passing with nearest neighbor sparsity pattern learning"
    - "structured compressive sensing based spatio temporal joint channel estimation for fdd massive mimo"
    - "channel estimation in broadband millimeter wave mimo systems with few bit adcs"
    - "fundamental limits of training based multiuser mimo systems"
    - "turbo compressed sensing with partial dft sensing matrix"
    - "spatially common sparsity based adaptive channel estimation and feedback for fdd massive mimo"
    - "compressive sensing with prior support quality information and application to massive mimo channel estimation with temporal correlation"
    - "on the performance of turbo signal recovery with partial dft sensing matrices"

Connected through hyperedge HE-4 (induced by source paper "tarm a turbo type algorithm for affine rank minimization"):
  with members:
    - "rigorous dynamics of expectation propagation based signal recovery from unitarily invariant measurements"
    - "state evolution for approximate message passing with non separable functions"
    - "an overview of low rank matrix recovery from incomplete observations"
    - "turbo compressed sensing with partial dft sensing matrix"
    - "from denoising to compressed sensing"
    - "matrix recipes for hard thresholding methods"
    - "the dynamics of message passing on dense graphs with applications to compressed sensing"
    - "guaranteed rank minimization via singular value projection"

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)