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 "efficient ldpc codes over gf q for lossy data compression"):
  Abstract: In this paper we consider the lossy compression of a binary symmetric source. We present a scheme that provides a low complexity lossy compressor with near optimal empirical performance. The proposed scheme is based on b-reduced ultra-sparse LDPC codes over GF(q). Encoding is performed by the Reinforced Belief Propagation algorithm, a variant of Belief Propagation. The computational complexity at the encoder is O(≪ d ≫ .n.q. log 2  q), where ≪ d ≫ is the average degree of the check nodes. For our code ensemble, decoding can be performed iteratively following the inverse steps of the leaf removal algorithm. For a sparse parity-check matrix the number of needed operations is O(n).

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 "lower bounds on the rate distortion function of individual ldgm codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on locally decodable source coding")
  Member "encoding for the blackwell channel with reinforced belief propagation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "polar codes for broadcast channels")
  Member "binary quantization using belief propagation with decimation over factor graphs of ldgm codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (induced by source paper "analytical framework of ldgm based iterative quantization with decimation")
  Member "low density constructions can achieve the wyner ziv and gelfand pinsker bounds":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "analytical framework of ldgm based iterative quantization with decimation")
  Member "design and analysis of nonbinary ldpc codes for arbitrary discrete memoryless channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "lattice coding for downlink multiuser transmission")
  Member "statistical mechanical approach to lossy data compression theory and practice":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "linear complexity lossy compressor for binary redundant memoryless sources")

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)