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 "concentration to zero bit error probability for regular ldpc codes on the binary symmetric channel proof by loop calculus"):
  Abstract: In this paper we consider regular low-density parity-check codes over a binary-symmetric channel in the decoding regime. We prove that up to a certain noise threshold the bit-error probability of the bit-sampling decoder converges in mean to zero over the code ensemble and the channel realizations. To arrive at this result we show that the bit-error probability of the sampling decoder is equal to the derivative of a Bethe free entropy. The method that we developed is new and is based on convexity of the free entropy and loop calculus. Convexity is needed to exchange limit and derivative and the loop series enables us to express the difference between the bit-error probability and the Bethe free entropy. We control the loop series using combinatorial techniques and a first moment method. We stress that our method is versatile and we believe that it can be generalized for LDPC codes with general degree distributions and for asymmetric channels.

Includes members:
  Member "the bethe free energy allows to compute the conditional entropy of graphical code instances a proof from the polymer expansion":
    also connected through other hyperedges:
      (none)
  Member "spatial coupling as a proof technique":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a simple proof of maxwell saturation for coupled scalar recursions")
  Member "beyond the bethe free energy of ldpc codes via polymer expansions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "loop calculus for non binary alphabets using concepts from information geometry")
  Member "decay of correlations for sparse graph error correcting codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a scaling law to predict the finite length performance of spatially coupled ldpc codes")
  Member "sharp bounds for optimal decoding of low density parity check codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "overlap matrix concentration in optimal bayesian inference")
  Member "the generalized area theorem and some of its consequences":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "reed muller codes theory and algorithms")
  Member "tight bounds for ldpc and ldgm codes under map decoding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "accuracy memory tradeoffs and phase transitions in belief propagation")

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)