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 "new generalizations of the bethe approximation via asymptotic expansion"):
  Abstract: The Bethe approximation, discovered in statistical physics, gives an efficient algorithm called belief propagation (BP) for ap proximating a partition function. BP empirically gives an accurate approximation for many problems, e.g., low-density parity-check codes, compressed sensing, etc. Recently, Vontobel gives a novel characterization of the Bethe approximation using graph cover. In this paper, a new approximation based on the Bethe approximation is proposed. The new approximation is derived from Vontobel’s characterization using graph cover, and expressed by using the edge zeta function, which is related with the Hessian of the Bethe free energy as shown by Watanabe and Fukumizu. On some conditions, it is proved that the new approximation is asymptotically better than the Bethe approximation.

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 "central approximation in statistical physics and information theory":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "counting in graph covers a combinatorial characterization of the bethe entropy function")
  Member "partition functions of normal factor graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "codes on graphs models for elementary algebraic topology and statistical physics")
  Member "discrete geometric analysis of message passing algorithm on graphs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "loop calculus for non binary alphabets using concepts from information geometry")
  Member "loop calculus and belief propagation for q ary alphabet loop tower":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "gauges loops and polynomials for partition functions of graphical models")

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)