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: "hierarchical restricted isometry property for kronecker product measurements"
  Abstract: Hierarchically sparse signals and Kronecker product structured measurements arise naturally in a variety of applications. The simplest example of a hierarchical sparsity structure is two-level $(s,\sigma)$-hierarchical sparsity which features $s$-block-sparse signals with $\sigma$-sparse blocks. For a large class of algorithms recovery guarantees can be derived based on the restricted isometry property (RIP) of the measurement matrix and model-based variants thereof. We show that given two matrices $\mathbf{A}$ and $\mathbf{B}$ having the standard $s$-sparse and $\sigma$-sparse RIP their Kronecker product $\mathbf{A}\otimes\mathbf{B}$ has two-level $(s,\sigma)$-hierarchically sparse RIP (HiRIP). This result can be recursively generalized to signals with multiple hierarchical sparsity levels and measurements with multiple Kronecker product factors. As a corollary we establish the efficient reconstruction of hierarchical sparse signals from Kronecker product measurements using the HiHTP algorithm. We argue that Kronecker product measurement matrices allow to design large practical compressed sensing systems that are deterministically certified to reliably recover signals in a stable fashion. We elaborate on their motivation from the perspective of applications.

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)