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: "approximate message passing with nearest neighbor sparsity pattern learning"
  Abstract: We consider the problem of recovering clustered sparse signals with no prior knowledge of the sparsity pattern. Beyond simple sparsity, signals of interest often exhibits an underlying sparsity pattern which, if leveraged, can improve the reconstruction performance. However, the sparsity pattern is usually unknown a priori. Inspired by the idea of k-nearest neighbor (k-NN) algorithm, we propose an efficient algorithm termed approximate message passing with nearest neighbor sparsity pattern learning (AMP-NNSPL), which learns the sparsity pattern adaptively. AMP-NNSPL specifies a flexible spike and slab prior on the unknown signal and, after each AMP iteration, sets the sparse ratios as the average of the nearest neighbor estimates via expectation maximization (EM). Experimental results on both synthetic and real data demonstrate the superiority of our proposed algorithm both in terms of reconstruction performance and computational complexity.

Connected through hyperedge HE-1 (induced by source paper "structured turbo compressed sensing for downlink massive mimo ofdm channel estimation"):
  with members:
    - "denoising based turbo compressed sensing"
    - "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-2 (induced by source paper "compressive massive random access for massive machine type communications mmtc"):
  with members:
    - "massive connectivity with massive mimo part i device activity detection and channel estimation"
    - "a random access protocol for pilot allocation in crowded massive mimo systems"
    - "compressive sensing techniques for next generation wireless communications"
    - "grant free rateless multiple access a novel massive access scheme for internet of things"
    - "massive machine type communications in 5g physical and mac layer solutions"
    - "spatially common sparsity based adaptive channel estimation and feedback for fdd massive mimo"
    - "message passing algorithms for compressed sensing i motivation and construction"
    - "message passing algorithms for compressed sensing ii analysis and validation"

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)