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 "phase retrieval from binary measurements"):
  Abstract: We consider the problem of signal reconstruction from quadratic measurements that are encoded as    $+1$   or   $-1$    depending on whether they exceed a predetermined positive threshold or not. Binary measurements are fast to acquire and inexpensive in terms of hardware. We formulate the problem of signal reconstruction using a  consistency criterion , wherein one seeks to find a signal that is in agreement with the acquired measurements. To enforce consistency, we construct a convex cost using a one-sided quadratic penalty and minimize it using an iterative accelerated projected gradient-descent technique. The projected gradient-descent (PGD) scheme reduces the cost function in each iteration, whereas incorporating momentum into PGD, notwithstanding the lack of such a  descent property , exhibits faster convergence than PGD empirically. We refer to the resulting algorithm as  binary phase retrieval  (BPR). Considering additive white noise contamination prior to quantization, we also derive the Cramer–Rao Bound (CRB) for the binary encoding model. Experimental results demonstrate that the BPR algorithm yields a signal-to-reconstruction error ratio (SRER) of approximately 25 dB in the absence of noise. In the presence of noise prior to quantization, the SRER is within 2 to 3 dB of the CRB.

Includes members:
  Member "undersampled sparse phase retrieval via majorization minimization":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "quantization aware phase retrieval")
  Member "low rank phase retrieval":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "phase retrieval of low rank matrices by anchored regression")
  Member "phase retrieval using feasible point pursuit algorithms and cramer rao bound":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "scalable solvers of random quadratic equations via stochastic truncated amplitude flow")
  Member "solving random quadratic systems of equations is nearly as easy as solving linear systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "finding the sparsest vectors in a subspace theory algorithms and applications")
  Member "the generalized lasso with non linear observations":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "compressed sensing with 1d total variation breaking sample complexity barriers via non uniform recovery")
  Member "phase retrieval via wirtinger flow theory and algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "finding the sparsest vectors in a subspace theory algorithms and applications")
  Member "gespar efficient phase retrieval of sparse signals":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "serial quantization for sparse time sequences")
  Member "robust 1 bit compressed sensing and sparse logistic regression a convex programming approach":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "efficient active learning of sparse halfspaces with arbitrary bounded noise")

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)