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 "on the stability of sparse convolutions"):
  Abstract: We give a stability result for sparse convolutions on $\ell^2(G)\times \ell^1(G)$ for torsion-free discrete Abelian groups $G$ such as $\mathbb{Z}$. It turns out, that the torsion-free property prevents full cancellation in the convolution of sparse sequences and hence allows to establish stability in each entry, that is, for any fixed entry of the convolution the resulting linear map is injective with an universal lower norm bound, which only depends on the support cardinalities of the sequences. This can be seen as a reverse statement of the famous Young inequality for sparse convolutions. Our result hinges on a compression argument in additive set theory.

Includes members:
  Member "sparse model uncertainties in compressed sensing with application to convolutions and sporadic communication":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "simultaneous structures in convex signal recovery revisiting the convex combination of norms")
  Member "stable recovery from the magnitude of symmetrized fourier measurements":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "blind deconvolution with additional autocorrelations via convex programs")
  Member "the restricted isometry property for time frequency structured random matrices":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fast binary embeddings and quantized compressed sensing with structured matrices")
  Member "restricted isometries for partial random circulant matrices":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "random quadratic forms with dependence applications to restricted isometry and beyond")

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)