human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "stable embedding of grassmann manifold via gaussian random matrices"):
  Abstract: In this paper, we explore a volume-based stable embedding of multi-dimensional signals based on Grassmann manifold, via Gaussian random measurement matrices. The Grassmann manifold is a topological space in which each point is a linear vector subspace, and is widely regarded as an ideal model for multi-dimensional signals. In this paper, we formulate the linear subspace spanned by multi-dimensional signal vectors as points on the Grassmann manifold, and use the volume and the product of sines of principal angles (also known as the product of principal sines) as the generalized norm and distance measure for the space of Grassmann manifold. We prove a volume-preserving embedding property for points on the Grassmann manifold via Gaussian random measurement matrices, i.e., the volumes of all parallelotopes from a finite set in Grassmann manifold are preserved upon compression. This volume-preserving embedding property is a multi-dimensional generalization of the conventional stable embedding properties, which only concern the approximate preservation of lengths of vectors in certain unions of subspaces. Additionally, we use the volume-preserving embedding property to explore the stable embedding effect on a generalized distance measure of Grassmann manifold induced from volume. It is proved that the generalized distance measure, i.e., the product of principal sines between different points on the Grassmann manifold, is well preserved in the compressed domain via Gaussian random measurement matrices.Numerical simulations are also provided for validation.

Includes members:
  Member "new analysis of manifold embeddings and signal recovery from compressive measurements":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fast and provable admm for learning with generative priors")
  Member "achievable angles between two compressed sparse vectors under norm distance constraints imposed by the restricted isometry property a plane geometry approach":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "restricted isometry property of gaussian random projection for finite set of subspaces")
  Member "stable manifold embeddings with structured random matrices":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "quickly finding the best linear model in high dimensions")
  Member "structured compressed sensing from theory to applications":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "serial quantization for sparse time sequences")
  Member "time delay estimation from low rate samples a union of subspaces approach":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "sampling and super resolution of sparse signals beyond the fourier domain")
  Member "model based compressive sensing":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "compressed sensing with invertible generative models and dependent noise")
  Member "information theoretic bounds for compressed sensing":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "random access for massive machine type communications")
  Member "quantization bounds on grassmann manifolds and applications to mimo communications":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "high dimensional stochastic gradient quantization for communication efficient edge learning")

Question: Please tell me which class the source paper 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)