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: "phaseless sampling and reconstruction of real valued signals in shift invariant spaces"
  Abstract: Sampling in shift-invariant spaces is a realistic model for signals with smooth spectrum. In this paper, we consider phaseless sampling and reconstruction of real-valued signals in a shift-invariant space from their magnitude measurements on the whole Euclidean space and from their phaseless samples taken on a discrete set with finite sampling density. We introduce an undirected graph to a signal and use connectivity of the graph to characterize whether the signal can be determined, up to a sign, from its magnitude measurements on the whole Euclidean space. Under the local complement property assumption on a shift-invariant space, we find a discrete set with finite sampling density such that signals in the shift-invariant space, that are determined from their magnitude measurements on the whole Euclidean space, can be reconstructed in a stable way from their phaseless samples taken on that discrete set. In this paper, we also propose a reconstruction algorithm which provides a suboptimal approximation to the original signal when its noisy phaseless samples are available only. Finally, numerical simulations are performed to demonstrate the robust reconstruction of box spline signals from their noisy phaseless samples.

Connected through hyperedge HE-1 (induced by source paper "random phaseless sampling for causal signals in shift invariant spaces a zero distribution perspective"):
  with members:
    - "measurement matrix design for phase retrieval based on mutual information"
    - "phase retrieval from multiple window short time fourier measurements"
    - "shift invariant and sampling spaces associated with the special affine fourier transform"
    - "phase retrieval of real valued signals in a shift invariant space"
    - "phaselift exact and stable signal recovery from magnitude measurements via convex programming"
    - "phase retrieval via matrix completion"

Connected through hyperedge HE-2 (induced by source paper "generalized haar condition based phaseless random sampling for compactly supported functions in shift invariant spaces"):
  with members:
    - "measurement matrix design for phase retrieval based on mutual information"
    - "phase retrieval from multiple window short time fourier measurements"

Connected through hyperedge HE-3 (induced by source paper "stable phaseless sampling and reconstruction of real valued signals with finite rate of innovations"):
  with members:
    - "phase retrieval of real valued signals in a shift invariant space"
    - "spatially distributed sampling and reconstruction"
    - "phase retrieval an overview of recent developments"
    - "phase retrieval for sparse signals"
    - "phaselift exact and stable signal recovery from magnitude measurements via convex programming"
    - "phase retrieval via matrix completion"

Connected through hyperedge HE-4 (induced by source paper "phase retrieval of real valued signals in a shift invariant space"):
  with members:
    - "phase retrieval from the magnitudes of affine linear measurements"
    - "prime phase retrieval via majorization minimization"
    - "nonlinear frames and sparse reconstructions in banach spaces"
    - "spatially distributed sampling and reconstruction"
    - "phase retrieval via wirtinger flow theory and algorithms"
    - "phase retrieval an overview of recent developments"
    - "phasecode fast and efficient compressive phase retrieval based on sparse graph codes"
    - "phase retrieval via structured modulations in paley wiener spaces"

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)