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: "on the phase transition of corrupted sensing"
  Abstract: In \cite{FOY2014}, a sharp phase transition has been numerically observed when a constrained convex procedure is used to solve the corrupted sensing problem. In this paper, we present a theoretical analysis for this phenomenon. Specifically, we establish the threshold below which this convex procedure fails to recover signal and corruption with high probability. Together with the work in \cite{FOY2014}, we prove that a sharp phase transition occurs around the sum of the squares of spherical Gaussian widths of two tangent cones. Numerical experiments are provided to demonstrate the correctness and sharpness of our results.

Connected through hyperedge HE-1 (induced by source paper "recovery of structured signals from corrupted non linear measurements"):
  with members:
    - "corrupted sensing with sub gaussian measurements"
    - "stable recovery of structured signals from corrupted sub gaussian measurements"
    - "convex recovery of a structured signal from independent random linear measurements"
    - "the generalized lasso with non linear observations"
    - "corrupted sensing novel guarantees for separating structured signals"
    - "living on the edge phase transitions in convex programs with random data"
    - "sharp recovery bounds for convex demixing with applications"

Connected through hyperedge HE-2 (induced by source paper "stable recovery of structured signals from corrupted sub gaussian measurements"):
  with members:
    - "corrupted sensing with sub gaussian measurements"
    - "data recovery from corrupted observations via l1 minimization"
    - "corrupted sensing novel guarantees for separating structured signals"
    - "living on the edge phase transitions in convex programs with random data"
    - "sharp recovery bounds for convex demixing with applications"
    - "probabilistic recovery guarantees for sparsely corrupted signals"
    - "compressed sensing and matrix completion with constant proportion of corruptions"
    - "stable restoration and separation of approximately sparse signals"

Connected through hyperedge HE-3 (induced by source paper "corrupted sensing with sub gaussian measurements"):
  with members:
    - "corrupted sensing novel guarantees for separating structured signals"
    - "sharp recovery bounds for convex demixing with applications"
    - "probabilistic recovery guarantees for sparsely corrupted signals"
    - "compressed sensing and matrix completion with constant proportion of corruptions"
    - "stable restoration and separation of approximately sparse signals"
    - "recovery of sparsely corrupted signals"

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)