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 lossless analog compression without phase information"):
  Abstract: We propose an information-theoretic framework for phase retrieval. Specifically, we consider the problem of recovering an unknown n-dimensional vector x up to an overall sign factor from m=Rn phaseless measurements with compression rate R and derive a general achievability bound for R. Surprisingly, it turns out that this bound on the compression rate is the same as the one for almost lossless analog compression obtained by Wu and Verd\'u (2010): Phaseless linear measurements are as good as linear measurements with full phase information in the sense that ignoring the sign of m measurements only leaves us with an ambiguity with respect to an overall sign factor of x.

Includes members:
  Member "information theoretic limits of matrix completion":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "rate distortion theory for general sets and measures")
  Member "phase retrieval via wirtinger flow theory and algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "finding the sparsest vectors in a subspace theory algorithms and applications")
  Member "almost lossless analog signal separation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "almost lossless analog signal separation and probabilistic uncertainty relations")
  Member "new conditions for sparse phase retrieval":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "almost optimal phaseless compressed sensing with sublinear decoding time")
  Member "sparse representation of a polytope and recovery of sparse signals and low rank matrices":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the importance of phase in complex compressive sensing")
  Member "phase retrieval stability and recovery guarantees":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "consensus based optimization on the sphere ii convergence to global minimizers and machine learning")
  Member "solving quadratic equations via phaselift when there are about as many equations as unknowns":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "phase retrieval of low rank matrices by anchored regression")
  Member "phaselift exact and stable signal recovery from magnitude measurements via convex programming":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "deep s 3 pr simultaneous source separation and phase retrieval using deep generative models")

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)