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 "almost everywhere injectivity conditions for the matrix recovery problem"):
  Abstract: Matrix recovery is raised in many areas. In this paper, we build up a framework for almost everywhere matrix recovery which means to recover almost all the $P\in {\mathcal M}\subset {\mathbb H}^{p\times q}$ from $Tr(A_jP), j=1,\ldots,N$ where $A_j\in V_j\subset {\mathbb H}^{p\times q}$. We mainly focus on the following question: how many measurements are needed to recover almost all the matrices in ${\mathcal M}$? For the case where both ${\mathcal M}$ and $V_j$ are algebraic varieties, we use the tools from algebraic geometry to study the question and present some results to address it under many different settings.

Includes members:
  Member "on the 2d phase retrieval problem":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fourier phase retrieval uniqueness and algorithms")
  Member "generalized phase retrieval measurement number matrix recovery and beyond":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "solving complex quadratic systems with full rank random matrices")
  Member "optimal injectivity conditions for bilinear inverse problems with applications to identifiability of deconvolution problems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the convex geometry of blind deconvolution and matrix completion")
  Member "phase transitions in phase retrieval":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "almost everywhere matrix recovery")
  Member "low rank matrix recovery from rank one measurements":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the convex geometry of blind deconvolution and matrix completion")
  Member "rank minimization over finite fields fundamental limits and coding theoretic interpretations":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "subspace aware index codes")
  Member "phaselift exact and stable signal recovery from magnitude measurements via convex programming":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "deep s 3 pr simultaneous source separation and phase retrieval using deep generative models")
  Member "phase retrieval via matrix completion":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "finding the sparsest vectors in a subspace theory algorithms and applications")

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)