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 "lower bounds on the rate distortion function of individual ldgm codes"):
  Abstract: We consider lossy compression of a binary symmetric source by means of a low-density generator-matrix code. We derive two lower bounds on the rate distortion function which are valid for any low-density generator-matrix code with a given node degree distribution L(x) on the set of generators and for any encoding algorithm. These bounds show that, due to the sparseness of the code, the performance is strictly bounded away from the Shannon rate-distortion function. In this sense, our bounds represent a natural generalization of Gallager's bound on the maximum rate at which low-density parity-check codes can be used for reliable transmission. Our bounds are similar in spirit to the technique recently developed by Dimakis, Wainwright, and Ramchandran, but they apply to individual codes.

Includes members:
  Member "lower bounds on the rate distortion function of ldgm codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on locally decodable source coding")
  Member "binary quantization using belief propagation with decimation over factor graphs of ldgm codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "successive wyner ziv coding for the binary ceo problem under logarithmic loss")
  Member "analysis of ldgm and compound codes for lossy compression and binning":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "analytical framework of ldgm based iterative quantization with decimation")
  Member "low density codes achieve the rate distortion bound":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "ratq a universal fixed length quantizer for stochastic optimization")
  Member "low density constructions can achieve the wyner ziv and gelfand pinsker bounds":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "analytical framework of ldgm based iterative quantization with decimation")
  Member "lossy source encoding via message passing and decimation over generalized codewords of ldgm codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "low density majority codes and the problem of graceful degradation")
  Member "iterative quantization using codes on graphs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on privacy amplification lossy compression and their duality to channel coding")

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)