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: "sampling stationary signals subject to bitrate constraints"
  Abstract: A theory of minimizing distortion in reconstructing a stationary signal under a constraint on the number of bits per sample is developed. We first analyze the optimal sampling frequency required in order to achieve the optimal distortion-rate tradeoff for a stationary bandlimited signal. To this end, we consider a combined sampling and source coding problem in which an analog Gaussian source is reconstructed from its encoded sub-Nyquist samples. We show that for processes whose energy is not uniformly distributed over the spectral band, each point on the distortion-rate curve of the process corresponds to a sampling frequency smaller than the Nyquist rate. This characterization can be seen as an extension of the classical sampling theorem for bandlimited random processes in the sense that it describes the minimal amount of excess distortion in the reconstruction due to lossy compression of the samples, and provides the minimal sampling frequency $f_{DR}$ required in order to achieve that distortion. We compare the fundamental limits of combined source coding and sampling to the performance in pulse code modulation (PCM), where each sample is quantized by a scalar quantizer using a fixed number of bits.

Connected through hyperedge HE-1 (induced by source paper "tradeoffs between convergence speed and reconstruction accuracy in inverse problems"):
  with members:
    - "learning to learn by gradient descent by gradient descent"
    - "maximal sparsity with deep networks"
    - "onsager corrected deep learning for sparse linear inverse problems"
    - "accelerating eulerian fluid simulation with convolutional networks"
    - "raisr rapid and accurate image super resolution"
    - "fundamental distortion limits of analog to digital compression"
    - "a picture is worth a billion bits real time image reconstruction from dense binary pixels"
    - "sharp time data tradeoffs for linear inverse problems"

Connected through hyperedge HE-2 (induced by source paper "oblivious processing in a fronthaul constrained gaussian channel"):
  with members:
    - "distortion rate function of sub nyquist sampled gaussian sources"
    - "distributed mimo receiver achievable rates and upper bounds"

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)