human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "random phaseless sampling for causal signals in shift invariant spaces a zero distribution perspective"
  Abstract: We proved that the phaseless sampling (PLS) 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 function $\varphi$ enjoys the full spark property (so does $e^{\textbf{i}\alpha \cdot}\varphi$). Stated another way, the PLS 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 generator $\phi$ such that the PLS of nonseparable causal (NC) signals in $V(\phi)$ can be achieved by random sampling. The condition is established from the generalized Haar condition (GHC) perspective. Based on the proposed reconstruction approach, it is proved that if the GHC holds then with probability $1$, the random sampling density (SD) $=3$ is sufficient for the PLS of NC signals in the complex-generated SISs. For the real-valued case we also prove that, if the GHC holds then with probability $1$, the random SD $=2$ is sufficient for the PLS of real-valued NC signals in the real-generated SISs. For the local reconstruction of highly oscillatory signals such as chirps, a great number of deterministic samples are required. Compared with deterministic sampling, the proposed random approach enjoys not only the greater sampling flexibility but the much smaller number of samples. To verify our results, numerical simulations were conducted to reconstruct highly oscillatory NC signals in the chirp-modulated SISs.

Question: Please tell me which class the center node 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)