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 "almost lossless analog signal separation and probabilistic uncertainty relations"):
  Abstract: We propose an information-theoretic framework for analog signal separation. Specifically, we consider the problem of recovering two analog signals, modeled as general random vectors, from the noiseless sum of linear measurements of the signals. Our framework is inspired by the groundbreaking work of Wu and Verd\'u (2010) on analog compression and encompasses, inter alia, inpainting, declipping, superresolution, the recovery of signals corrupted by impulse noise, and the separation of (e.g., audio or video) signals into two distinct components. The main results we report are general achievability bounds for the compression rate, i.e., the number of measurements relative to the dimension of the ambient space the signals live in, under either measurability or H\"older continuity imposed on the separator. Furthermore, we find a matching converse for sources of mixed discrete-continuous distribution. For measurable separators our proofs are based on a new probabilistic uncertainty relation which shows that the intersection of generic subspaces with general subsets of sufficiently small Minkowski dimension is empty. H\"older continuous separators are dealt with by introducing the concept of regularized probabilistic uncertainty relations. The probabilistic uncertainty relations we develop are inspired by embedding results in dynamical systems theory due to Sauer et al. (1991) and--conceptually--parallel classical Donoho-Stark and Elad-Bruckstein uncertainty principles at the heart of compressed sensing theory. Operationally, the new uncertainty relations take the theory of sparse signal separation beyond traditional sparsity--as measured in terms of the number of non-zero entries--to the more general notion of low description complexity as quantified by Minkowski dimension. Finally, our approach also allows to significantly strengthen key results in Wu and Verd\'u (2010).

Includes members:
  Member "almost lossless analog compression without phase information":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "measurement matrix design for phase retrieval based on mutual information")
  Member "information theoretic limits of matrix completion":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "rate distortion theory for general sets and measures")
  Member "almost lossless analog signal separation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "almost lossless analog compression without phase information")
  Member "uncertainty relations and sparse signal recovery for pairs of general signal sets":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "sparse representation in fourier and local bases using prosparse a probabilistic analysis")
  Member "sharp recovery bounds for convex demixing with applications":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the convex geometry of blind deconvolution and matrix completion")
  Member "probabilistic recovery guarantees for sparsely corrupted signals":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "uniform recovery bounds for structured random matrices in corrupted compressed sensing")
  Member "compressed sensing and matrix completion with constant proportion of corruptions":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "gradient descent with early stopping is provably robust to label noise for overparameterized neural networks")
  Member "recovery of sparsely corrupted signals":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "metrics for evaluating the efficiency of compressing sensing techniques")

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)