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: "low density codes achieve the rate distortion bound"
  Abstract: We propose a new construction for low-density source codes with multiple parameters that can be tuned to optimize the performance of the code. In addition, we introduce a set of analysis techniques for deriving upper bounds for the expected distortion of our construction, as well as more general low-density constructions. We show that (with an optimal encoding algorithm) our codes achieve the rate-distortion bound for a binary symmetric source and Hamming distortion. Our methods also provide rigorous upper bounds on the minimum distortion achievable by previously proposed low-density constructions.

Connected through hyperedge HE-1 (induced by source paper "ratq a universal fixed length quantizer for stochastic optimization"):
  with members:
    - "error feedback fixes signsgd and other gradient compression schemes"
    - "nuqsgd improved communication efficiency for data parallel sgd via nonuniform quantization"
    - "inference under information constraints ii communication constraints and shared randomness"
    - "vqsgd vector quantized stochastic gradient descent"
    - "distributed learning with sublinear communication"
    - "open problem the oracle complexity of convex optimization with limited memory"
    - "geometric lower bounds for distributed parameter estimation under communication constraints"
    - "sparsified sgd with memory"

Connected through hyperedge HE-2 (induced by source paper "optimal lempel ziv based lossy compression for memoryless data how to make the right mistakes"):
  with members:
    - "lossy compression of discrete sources via the viterbi algorithm"
    - "lower bounds on the rate distortion function of ldgm codes"

Connected through hyperedge HE-3 (induced by source paper "limited rate channel state feedback for multicarrier block fading channels"):
  with members:
    - "channel state feedback schemes for multiuser mimo ofdm downlink"
    - "limited feedback beamforming over temporally correlated channels"

Connected through hyperedge HE-4 (induced by source paper "lossy compression in near linear time via efficient random codebooks and databases"):
  with members:
    - "an implementable scheme for universal lossy compression of discrete markov sources"
    - "rate distortion via markov chain monte carlo"
    - "lossy source encoding via message passing and decimation over generalized codewords of ldgm codes"

Connected through hyperedge HE-5 (induced by source paper "lower bounds on the rate distortion function of ldgm codes"):
  with members:
    - "lower bounds on the rate distortion function of individual ldgm codes"
    - "binary quantization using belief propagation with decimation over factor graphs of ldgm codes"
    - "analysis of ldgm and compound codes for lossy compression and binning"
    - "low density constructions can achieve the wyner ziv and gelfand pinsker bounds"
    - "iterative quantization using codes on graphs"
    - "approximating the satisfiability threshold for random k xor formulas"

Connected through hyperedge HE-6 (induced by source paper "lower bounds on the rate distortion function of individual ldgm codes"):
  with members:
    - "lower bounds on the rate distortion function of ldgm codes"
    - "binary quantization using belief propagation with decimation over factor graphs of ldgm codes"
    - "analysis of ldgm and compound codes for lossy compression and binning"
    - "low density constructions can achieve the wyner ziv and gelfand pinsker bounds"
    - "lossy source encoding via message passing and decimation over generalized codewords of ldgm codes"
    - "iterative quantization using codes on graphs"

Connected through hyperedge HE-7 (induced by source paper "hash property and coding theorems for sparse matrices and maximum likelihood coding"):
  with members:
    - "construction of codes for wiretap channel and secret key agreement from correlated source outputs by using sparse matrices"
    - "hash property and fixed rate universal coding theorems"
    - "lower bounds on the rate distortion function of ldgm codes"
    - "lower bounds on the rate distortion function of individual ldgm codes"
    - "low density constructions can achieve the wyner ziv and gelfand pinsker bounds"

Connected through hyperedge HE-8 (induced by source paper "low density graph codes that are optimal for source channel coding and binning"):
  with members:
    - "analysis of ldgm and compound codes for lossy compression and binning"
    - "low density constructions can achieve the wyner ziv and gelfand pinsker bounds"
    - "capacity achieving ensembles for the binary erasure channel with bounded complexity"
    - "lossy source encoding via message passing and decimation over generalized codewords of ldgm codes"
    - "iterative quantization using codes on graphs"
    - "approximating the satisfiability threshold for random k xor formulas"

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)