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 "measurement matrix design for phase retrieval based on mutual information"):
  Abstract: In phase retrieval problems, a signal of interest (SOI) is reconstructed based on the magnitude of a linear transformation of the SOI observed with additive noise. The linear transform is typically referred to as a measurement matrix. Many works on phase retrieval assume that the measurement matrix is a random Gaussian matrix, which, in the noiseless scenario with sufficiently many measurements, guarantees invertability of the transformation between the SOI and the observations, up to an inherent phase ambiguity. However, in many practical applications, the measurement matrix corresponds to an underlying physical setup, and is therefore deterministic, possibly with structural constraints. In this paper, we study the design of deterministic measurement matrices, based on maximizing the mutual information between the SOI and the observations. We characterize necessary conditions for the optimality of a measurement matrix, and analytically obtain the optimal matrix in the low signal-to-noise ratio regime. Practical methods for designing general measurement matrices and masked Fourier measurements are proposed. Simulation tests demonstrate the performance gain achieved by the suggested techniques compared to random Gaussian measurements for various phase recovery algorithms.

Includes members:
  Member "non convex phase retrieval from stft measurements":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "toward a mathematical theory of the crystallographic phase retrieval problem")
  Member "stft phase retrieval uniqueness guarantees and recovery algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "toward a mathematical theory of the crystallographic phase retrieval problem")
  Member "intensity only optical compressive imaging using a multiply scattering material and a double phase retrieval approach":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "deep s 3 pr simultaneous source separation and phase retrieval using deep generative models")
  Member "almost lossless analog compression without phase information":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "almost lossless analog signal separation and probabilistic uncertainty relations")
  Member "phase retrieval via wirtinger flow theory and algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "finding the sparsest vectors in a subspace theory algorithms and applications")
  Member "phasecode fast and efficient compressive phase retrieval based on sparse graph codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "stronger l2 l2 compressed sensing without iterating")
  Member "phase retrieval from coded diffraction patterns":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "phase retrieval of low rank matrices by anchored regression")
  Member "phase retrieval stability and recovery guarantees":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "consensus based optimization on the sphere ii convergence to global minimizers and machine 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)