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: "generalized orthogonal matching pursuit"
  Abstract: As a greedy algorithm to recover sparse signals from compressed measurements, orthogonal matching pursuit (OMP) algorithm has received much attention in recent years. In this paper, we introduce an extension of the OMP for pursuing efficiency in reconstructing sparse signals. Our approach, henceforth referred to as generalized OMP (gOMP), is literally a generalization of the OMP in the sense that multiple N indices are identified per iteration. Owing to the selection of multiple “correct” indices, the gOMP algorithm is finished with much smaller number of iterations when compared to the OMP. We show that the gOMP can perfectly reconstruct any K-sparse signals (K >; 1), provided that the sensing matrix satisfies the RIP with δNK <; [(√N)/(√K+3√N)]. We also demonstrate by empirical simulations that the gOMP has excellent recovery performance comparable to l1-minimization technique with fast processing speed and competitive computational complexity.

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 "low rank matrix completion a contemporary survey"):
  with members:
    - "generalized sparse and low rank optimization for ultra dense networks"
    - "neural collaborative filtering"
    - "geometric matrix completion with recurrent multi graph neural networks"
    - "overview of full dimension mimo in lte advanced pro"
    - "millimeter wave channel estimation via exploiting joint sparse and low rank structures"
    - "no spurious local minima in nonconvex low rank problems a unified geometric analysis"
    - "low rank matrix completion for topological interference management by riemannian pursuit"
    - "nips 2016 tutorial generative adversarial networks"

Connected through hyperedge HE-3 (induced by source paper "tree search network for sparse regression"):
  with members:
    - "theoretical linear convergence of unfolded ista and its practical weights and thresholds"
    - "amp inspired deep networks for sparse linear inverse problems"
    - "deep sparse coding using optimized linear expansion of thresholds"
    - "sparse representation for 3d shape estimation a convex relaxation approach"
    - "deep generative adversarial networks for compressed sensing automates mri"
    - "adaptive feature selection computationally efficient online sparse linear regression under rip"
    - "admm net a deep learning approach for compressive sensing mri"
    - "distributed compressive sensing a deep learning approach"

Connected through hyperedge HE-4 (induced by source paper "swift link a compressive beam alignment algorithm for practical mmwave radios"):
  with members:
    - "partially blind handovers for mmwave new radio aided by sub 6 ghz lte signaling"
    - "a novel millimeter wave channel simulator and applications for 5g wireless communications"
    - "a compressive channel estimation technique robust to synchronization impairments"
    - "compressive channel estimation and tracking for large arrays in mm wave picocells"
    - "hierarchical codebook design for beamforming training in millimeter wave communication"
    - "an overview of signal processing techniques for millimeter wave mimo systems"
    - "hybrid architectures with few bit adc receivers achievable rates and energy rate tradeoffs"
    - "channel estimation in broadband millimeter wave mimo systems with few bit adcs"

Connected through hyperedge HE-5 (induced by source paper "joint sparse recovery using signal space matching pursuit"):
  with members:
    - "nearly optimal bounds for orthogonal least squares"
    - "compressed sensing for wireless communications useful tips and tricks"
    - "a sharp restricted isometry constant bound of orthogonal matching pursuit"
    - "statistical recovery of simultaneously sparse time varying signals from multiple measurement vectors"
    - "recovery of sparse signals via generalized orthogonal matching pursuit a new analysis"
    - "subspace methods for joint sparse recovery"
    - "support recovery of sparse signals in the presence of multiple measurement vectors"
    - "sparse recovery with orthogonal matching pursuit under rip"

Connected through hyperedge HE-6 (induced by source paper "bayesian approach with extended support estimation for sparse regression"):
  with members:
    - "map support detection for greedy sparse signal recovery algorithms in compressive sensing"
    - "super resolution radar"
    - "from denoising to compressed sensing"
    - "rank awareness in joint sparse recovery"
    - "subspace pursuit for compressive sensing signal reconstruction"

Connected through hyperedge HE-7 (induced by source paper "greedy sparse signal recovery algorithm based on bit wise map detection"):
  with members:
    - "map support detection for greedy sparse signal recovery algorithms in compressive sensing"
    - "bayesian pursuit algorithms"
    - "sparse recovery with orthogonal matching pursuit under rip"
    - "subspace pursuit for compressive sensing signal reconstruction"
    - "iterative hard thresholding for compressed sensing"

Connected through hyperedge HE-8 (induced by source paper "preconditioned multiple orthogonal least squares and applications in ghost imaging via sparsity constraint"):
  with members:
    - "nearly optimal bounds for orthogonal least squares"
    - "perturbation analysis of orthogonal matching pursuit"
    - "subspace pursuit for compressive sensing signal reconstruction"

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)