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: "on oracle type local recovery guarantees in compressed sensing"
  Abstract: We present improved sampling complexity bounds for stable and robust sparse recovery in compressed sensing. Our unified analysis based on 1 minimization encompasses the case where (i) the measurements are block-structured samples in order to reflect the structured acquisition that is often encountered in applications; (ii) where the signal has an arbitrary structured sparsity, by results depending on its support S. Within this framework and under a random sign assumption, the number of measurements needed by 1 minimization can be shown to be of the same order than the one required by an oracle least-squares estimator. Moreover, these bounds can be minimized by adapting the variable density sampling to a given prior on the signal support and to the coherence of the measurements. We illustrate both numerically and analytically that our results can be successfully applied to recover Haar wavelet coefficients that are sparse in levels from random Fourier measurements in dimension one and two, which can be of particular interest in imaging problems. Finally, a preliminary numerical investigation shows the potential of this theory for devising adaptive sampling strategies in sparse polynomial approximation.

Connected through hyperedge HE-1 (induced by source paper "close encounters of the binary kind signal reconstruction guarantees for compressive hadamard sampling with haar wavelet basis"):
  with members:
    - "linear reconstructions and the analysis of the stable sampling rate"
    - "uniform recovery in infinite dimensional compressed sensing and applications to structured binary sampling"
    - "multilevel illumination coding for fourier transform interferometry in fluorescence spectroscopy"
    - "compressive single pixel fourier transform imaging using structured illumination"
    - "compressive hyperspectral imaging fourier transform interferometry meets single pixel camera"
    - "compressive imaging using fast transform coding"
    - "compressed sensing with local structure uniform recovery guarantees for the sparsity in levels class"
    - "compressed sensing with structured sparsity and structured acquisition"

Connected through hyperedge HE-2 (induced by source paper "do log factors matter on optimal wavelet approximation and the foundations of compressed sensing"):
  with members:
    - "uniform recovery in infinite dimensional compressed sensing and applications to structured binary sampling"
    - "robustness to unknown error in sparse regularization"
    - "compressed sensing with local structure uniform recovery guarantees for the sparsity in levels class"
    - "compressed sensing with structured sparsity and structured acquisition"
    - "structure dependent sampling in compressed sensing theoretical guarantees for tight frames"
    - "stable recovery of low dimensional cones in hilbert spaces one rip to rule them all"
    - "on the absence of the rip in real world applications of compressed sensing and the rip in levels"
    - "spread spectrum compressed sensing mri using chirp radio frequency pulses"

Connected through hyperedge HE-3 (induced by source paper "uniform recovery in infinite dimensional compressed sensing and applications to structured binary sampling"):
  with members:
    - "linear reconstructions and the analysis of the stable sampling rate"
    - "robustness to unknown error in sparse regularization"
    - "compressed sensing with local structure uniform recovery guarantees for the sparsity in levels class"
    - "stable recovery of low dimensional cones in hilbert spaces one rip to rule them all"
    - "breaking the coherence barrier a new theory for compressed sensing"

Connected through hyperedge HE-4 (induced by source paper "anisotropic compressed sensing for non cartesian mri acquisitions"):
  with members:
    - "infinite dimensional compressed sensing from anisotropic measurements and applications to inverse problems in pde"
    - "ripless compressed sensing from anisotropic measurements"
    - "breaking the coherence barrier a new theory for compressed sensing"
    - "a probabilistic and ripless theory of compressed sensing"

Connected through hyperedge HE-5 (induced by source paper "a variable density sampling scheme for compressive fourier transform interferometry"):
  with members:
    - "multilevel illumination coding for fourier transform interferometry in fluorescence spectroscopy"
    - "compressive single pixel fourier transform imaging using structured illumination"
    - "multispectral compressive imaging strategies using fabry p erot filtered sensors"
    - "compressed sensing with structured sparsity and structured acquisition"
    - "breaking the coherence barrier a new theory for compressed sensing"
    - "an analysis of block sampling strategies in compressed sensing"
    - "a panorama on multiscale geometric representations intertwining spatial directional and frequency selectivity"

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)