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 "beyond the bethe free energy of ldpc codes via polymer expansions"):
  Abstract: The loop series provides a formal way to write down corrections to the Bethe entropy (and/or free energy) of graphical models. We provide methods to rigorously control such expansions for low-density parity-check codes used over a highly noisy binary symmetric channel. We prove that in the asymptotic limit of large size, with high probability, the Bethe expression gives an exact formula for the entropy (per bit) of the input word conditioned on the output of the channel. Our methods also apply to more general models.

Includes members:
  Member "counting in graph covers a combinatorial characterization of the bethe entropy function":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "pseudocodeword based decoding of quantum stabilizer codes")
  Member "polymer expansions for cycle ldpc codes":
    also connected through other hyperedges:
      (none)
  Member "decay of correlations for sparse graph error correcting codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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-3 (induced by source paper "overlap matrix concentration in optimal bayesian inference")
  Member "tight bounds for ldpc and ldgm codes under map decoding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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)