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: "partially linear estimation with application to sparse signal recovery from measurement pairs"
  Abstract: We address the problem of estimating a random vector from two sets of measurements and , such that the estimator is linear in . We show that the partially linear minimum mean-square error (PLMMSE) estimator does not require knowing the joint distribution of and in full, but rather only its second-order moments. This renders it of potential interest in various applications. We further show that the PLMMSE method is minimax-optimal among all estimators that solely depend on the second-order statistics of and . We demonstrate our approach in the context of recovering a signal, which is sparse in a unitary dictionary, from noisy observations of it and of a filtered version. We show that in this setting PLMMSE estimation has a clear computational advantage, while its performance is comparable to state-of-the-art algorithms. We apply our approach both in static and in dynamic estimation applications. In the former category, we treat the problem of image enhancement from blurred/noisy image pairs. We show that PLMMSE estimation performs only slightly worse than state-of-the art algorithms, while running an order of magnitude faster. In the dynamic setting, we provide a recursive implementation of the estimator and demonstrate its utility in tracking maneuvering targets from position and acceleration measurements.

Connected through hyperedge HE-1 (induced by source paper "recent progress in image deblurring"):
  with members:
    - "image deblurring using derivative compressed sensing for optical imaging application"
    - "image deblurring and super resolution by adaptive sparse domain selection and adaptive regularization"
    - "an iterative shrinkage approach to total variation image restoration"
    - "solving inverse problems with piecewise linear estimators from gaussian mixture models to structured sparsity"
    - "iterative shrinkage approach to restoration of optical imagery"

Connected through hyperedge HE-2 (induced by source paper "exploiting statistical dependencies in sparse representations for signal recovery"):
  with members:
    - "structured compressed sensing from theory to applications"
    - "on mmse and map denoising under sparse representation modeling over a unitary dictionary"
    - "block sparse signals uncertainty relations and efficient recovery"
    - "model based compressive sensing"
    - "message passing algorithms for compressed sensing i motivation and construction"
    - "bayesian compressive sensing via belief propagation"

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)