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 ldgm codes"):
  Abstract: A recent line of work has focused on the use of low-density generator matrix (LDGM) codes for lossy source coding. In this paper, wedevelop a generic technique for deriving lower bounds on the rate-distortion functions of binary linear codes, with particular interest on the effect of bounded degrees. The underlying ideas can be viewing as the source coding analog of the classical result of Gallager, providing bounds for channel coding over the binary symmetric channel using bounded degree LDPC codes. We illustrate this method for different random ensembles of LDGM codes, including the check-regular ensemble and bit-check-regular ensembles, by deriving explicit lower bounds on their rate-distortion performance as a function of the degrees.

Includes members:
  Member "lower bounds on the rate distortion function of individual 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 "iterative quantization using codes on graphs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on privacy amplification lossy compression and their duality to channel coding")
  Member "approximating the satisfiability threshold for random k xor formulas":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "low density graph codes that are optimal for source channel coding and binning")

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)