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: "nonlinear compressed sensing based on composite mappings and its pointwise linearization"
  Abstract: Classical compressed sensing (CS) allows us to recover structured signals from far few linear measurements than traditionally prescribed, thereby efficiently decreasing sampling rates. However, if there exist nonlinearities in the measurements, is it still possible to recover sparse or structured signals from the nonlinear measurements? The research of nonlinear CS is devoted to answering this question. In this paper, unlike the existing research angles of nonlinear CS, we study it from the perspective of mapping decomposition, and propose a new concept, namely, nonlinear CS based on composite mappings. Through the analysis of two forms of a nonlinear composite mapping Phi, i.e., Phi(x) = F(Ax) and Phi(x) = AF(x), we give the requirements respectively for the sensing matrix A and the nonlinear mapping F when reconstructing all sparse signals exactly from the nonlinear measurements Phi(x). Besides, we also provide a special pointwise linearization method, which can turn the nonlinear composite mapping Phi, at each point in its domain, into an equivalent linear composite mapping. This linearization method can guarantee the exact recovery of all given sparse signals even if Phi is not an injection for all sparse signals. It may help us build an algorithm framework for the composite nonlinear CS in which we can take full advantage of the existing recovery algorithms belonging to linear CS.

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)