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 "generalized haar condition based phaseless random sampling for compactly supported functions in shift invariant spaces"):
  Abstract: It is proved that the phase retrieval (PR) in the linear-phase modulated shift-invariant space (SIS) $V(e^{\textbf{i}\alpha \cdot}\varphi), \alpha\neq0,$ is impossible even though the real-valued $\varphi$ enjoys the full spark property (so does $e^{\textbf{i}\alpha \cdot}\varphi$). Stated another way, the PR in the complex-generated SISs is essentially different from that in the real-generated ones. Motivated by this, we first establish the condition on the complex-valued $\phi$ such that the PR of compactly supported and nonseparable (CSN) functions in $V(\phi)$ can be achieved by random phaseless sampling. The condition is established from the perspective of the Lebesgue measure of the zero set of a related function system, or more precisely from the generalized Haar condition (GHC). Based on the proposed reconstruction approach, it is proved that if the GHC holds, then the PR of CSN functions in the complex-generated SISs can be achieved with probability $1$, provided that the phaseless random sampling density (SD) $\geq3$. For the real-generated case we also prove that, if the GHC holds then the PR of real-valued CSN functions can be achieved with the same probability if the random SD $\geq2$. Recall that the deterministic SD for PR depends on Haar condition(measured in terms of the cardinality of the corresponding zero set). Compared with deterministic sampling, the proposed random sampling enjoys not only the greater sampling flexibility but the lower SD. For the lower SD, the highly oscillatory signals such as chirps can be efficiently reconstructed. To verify our results, numerical simulations were conducted to reconstruct CSN functions in the chirp-modulated SISs.

Includes members:
  Member "measurement matrix design for phase retrieval based on mutual information":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "random phaseless sampling for causal signals in shift invariant spaces a zero distribution perspective")
  Member "phase retrieval from multiple window short time fourier measurements":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "random phaseless sampling for causal signals in shift invariant spaces a zero distribution perspective")
  Member "phaseless sampling and reconstruction of real valued signals in shift invariant spaces":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "random phaseless sampling for causal signals in shift invariant spaces a zero distribution perspective")

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)