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: "close encounters of the binary kind signal reconstruction guarantees for compressive hadamard sampling with haar wavelet basis"
  Abstract: We investigate the problems of 1-D and 2-D signal recovery from subsampled Hadamard measurements using Haar wavelet sparsity prior. These problems are of interest in, e.g., computational imaging applications relying on optical multiplexing or single-pixel imaging. However, the realization of such modalities is often hindered by the coherence between the Hadamard and Haar bases. The variable and multilevel density sampling strategies solve this issue by adjusting the subsampling process to the local and multilevel coherence, respectively, between the two bases; hence enabling successful signal recovery. In this work, we compute an explicit sample-complexity bound for Hadamard-Haar systems as well as uniform and non-uniform recovery guarantees; a seemingly missing result in the related literature. We explore the faithfulness of the numerical simulations to the theoretical results and show in a practically relevant instance, e.g., single-pixel camera, that the target signal can be obtained from a few Hadamard measurements.

Connected through hyperedge HE-1 (induced by source paper "the troublesome kernel why deep learning for inverse problems is typically unstable"):
  with members:
    - "uniform recovery in infinite dimensional compressed sensing and applications to structured binary sampling"
    - "on instabilities of deep learning in image reconstruction does ai come at a cost"
    - "learning the invisible a hybrid deep learning shearlet framework for limited angle computed tomography"
    - "adversarial attacks and defences a survey"
    - "image reconstruction by domain transform manifold learning"
    - "cnn based projected gradient descent for consistent ct image reconstruction"
    - "optimal approximation of continuous functions by very deep relu networks"
    - "deep convolutional neural network for inverse problems in imaging"

Connected through hyperedge HE-2 (induced by source paper "non uniform recovery guarantees for binary measurements and infinite dimensional compressed sensing"):
  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"
    - "compressed sensing with local structure uniform recovery guarantees for the sparsity in levels class"
    - "structure dependent sampling in compressed sensing theoretical guarantees for tight frames"
    - "breaking the coherence barrier a new theory for compressed sensing"
    - "lensless imaging by compressive sensing"

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)