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: "the quadratic gaussian rate distortion function for source uncorrelated distortions"
  Abstract: We characterize the rate-distortion function for zero-mean stationary Gaussian sources under the MSE fidelity criterion and subject to the additional constraint that the distortion is uncorrelated to the input. The solution is given by two equations coupled through a single scalar parameter. This has a structure similar to the well known water-filling solution obtained without the uncorrelated distortion restriction. Our results fully characterize the unique statistics of the optimal distortion. We also show that, for all positive distortions, the minimum achievable rate subject to the uncorrelation constraint is strictly larger than that given by the un-constrained rate-distortion function. This gap increases with the distortion and tends to infinity and zero, respectively, as the distortion tends to zero and infinity.

Connected through hyperedge HE-1 (induced by source paper "capacity bounds for communication systems with quantization and spectral constraints"):
  with members:
    - "tradeoff between delay and high snr capacity in quantized mimo systems"
    - "optimal errors and phase transitions in high dimensional generalized linear models"
    - "on low resolution adcs in practical 5g millimeter wave massive mimo systems"
    - "on mimo channel capacity with output quantization constraints"
    - "throughput analysis of massive mimo uplink with low resolution adcs"
    - "a general framework for low resolution receivers for mimo channels"
    - "additivity of information in multilayer networks via additive gaussian noise transforms"
    - "generalized expectation consistent signal recovery for nonlinear measurements"

Connected through hyperedge HE-2 (induced by source paper "a characterization of the minimal average data rate that guarantees a given closed loop performance level"):
  with members:
    - "the entropy gain of linear time invariant filters and some of its implications"
    - "fundamental inequalities and identities involving mutual and directed informations in closed loop systems"
    - "improved upper bounds to the causal quadratic rate distortion function for gaussian stationary sources"
    - "feedback capacity of stationary gaussian channels"

Connected through hyperedge HE-3 (induced by source paper "improved upper bounds to the causal quadratic rate distortion function for gaussian stationary sources"):
  with members:
    - "achieving the gaussian rate distortion function by prediction"
    - "on delayed sequential coding of correlated sources"

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)