human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "concentration to zero bit error probability for regular ldpc codes on the binary symmetric channel proof by loop calculus"):
  with members:
    - "the bethe free energy allows to compute the conditional entropy of graphical code instances a proof from the polymer expansion"
    - "spatial coupling as a proof technique"
    - "decay of correlations for sparse graph error correcting codes"
    - "sharp bounds for optimal decoding of low density parity check codes"
    - "the generalized area theorem and some of its consequences"
    - "tight bounds for ldpc and ldgm codes under map decoding"

Connected through hyperedge HE-2 (induced by source paper "loop calculus for non binary alphabets using concepts from information geometry"):
  with members:
    - "the bethe permanent of a nonnegative matrix"
    - "the matching polytope has exponential extension complexity"
    - "counting in graph covers a combinatorial characterization of the bethe entropy function"
    - "new generalizations of the bethe approximation via asymptotic expansion"
    - "primal view on belief propagation"
    - "connection between annealed free energy and belief propagation on random factor graph ensembles"
    - "partition functions of normal factor graphs"
    - "normal factor graphs and holographic transformations"

Connected through hyperedge HE-3 (induced by source paper "the bethe free energy allows to compute the conditional entropy of graphical code instances a proof from the polymer expansion"):
  with members:
    - "counting in graph covers a combinatorial characterization of the bethe entropy function"
    - "the bethe partition function of log supermodular graphical models"
    - "partition functions of normal factor graphs"
    - "decay of correlations for sparse graph error correcting codes"
    - "sharp bounds for optimal decoding of low density parity check codes"
    - "sufficient conditions for convergence of the sum product algorithm"
    - "loop calculus and belief propagation for q ary alphabet loop tower"
    - "tight bounds for ldpc and ldgm codes under map decoding"

Question: Please tell me which class the center node 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)