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 "analytical framework of ldgm based iterative quantization with decimation"):
  Abstract: While iterative quantizers based on low-density generator-matrix (LDGM) codes have been shown to be able to achieve near-ideal distortion performance with comparatively moderate block length and computational complexity requirements, their analysis remains difficult due to the presence of decimation steps. In this paper, considering the use of LDGM-based quantizers in a class of symmetric source coding problems, with the alphabet being either binary or non-binary, it is proved rigorously that, as long as the degree distribution satisfies certain conditions that can be evaluated with density evolution (DE), the belief propagation (BP) marginals used in the decimation step have vanishing mean-square error compared to the exact marginals when the block length and iteration count goes to infinity, which potentially allows near-ideal distortion performances to be achieved. This provides a sound theoretical basis for the degree distribution optimization methods previously proposed in the literature and already found to be effective in practice.

Includes members:
  Member "polar codes are optimal for lossy source coding":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "polar codes and their quantum domain counterparts")
  Member "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "reed muller codes theory and algorithms")
  Member "average entropy functions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "partition symmetrical entropy functions")
  Member "design and analysis of ldgm based codes for mse quantization":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "design of nested ldgm ldpc codes for compress and forward in relay channel")
  Member "the case for structured random codes in network capacity theorems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "lattice codes achieve the capacity of common message gaussian broadcast channels with coded side information")
  Member "low density graph codes that are optimal for source channel coding and binning":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "decoding complexity of irregular ldgm ldpc codes over the bisom channels")
  Member "binary quantization using belief propagation with decimation over factor graphs of ldgm codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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-8 (induced by source paper "efficient ldpc codes over gf q for lossy data compression")

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)