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 "stable blind deconvolution over the reals from additional autocorrelations"):
  Abstract: Recently the one-dimensional time-discrete blind deconvolution problem was shown to be solvable uniquely, up to a global phase, by a semi-definite program for almost any signal, provided its autocorrelation is known. We will show in this work that under a sufficient zero separation of the corresponding signal in the $z-$domain, a stable reconstruction against additive noise is possible. Moreover, the stability constant depends on the signal dimension and on the signals magnitude of the first and last coefficients. We give an analytical expression for this constant by using spectral bounds of Vandermonde matrices.

Includes members:
  Member "improved recovery guarantees for phase retrieval from coded diffraction patterns":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "complex phase retrieval from subgaussian measurements")
  Member "blind demixing and deconvolution at near optimal rate":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the convex geometry of blind deconvolution and matrix completion")
  Member "reconstruction of signals from their autocorrelation and cross correlation vectors with applications to phase retrieval and blind channel estimation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "noncoherent short packet communication via modulation on conjugated zeros")
  Member "explicit frames for deterministic phase retrieval via phaselift":
    also connected through other hyperedges:
      (none)
  Member "rapid robust and reliable blind deconvolution via nonconvex optimization":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a deterministic convergence framework for exact non convex phase retrieval")
  Member "sparse model uncertainties in compressed sensing with application to convolutions and sporadic communication":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "simultaneous structures in convex signal recovery revisiting the convex combination of norms")
  Member "on the stability of sparse convolutions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "blind deconvolution with additional autocorrelations via convex programs")
  Member "fundamental limits of blind deconvolution part i ambiguity kernel":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "blind phaseless short time fourier transform recovery")

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)