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: "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.

Connected through hyperedge HE-1 (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"
    - "beyond the bethe free energy of ldpc codes via polymer expansions"
    - "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-2 (induced by source paper "counting in graph covers a combinatorial characterization of the bethe entropy function"):
  with members:
    - "the bethe permanent of a nonnegative matrix"
    - "beyond log supermodularity lower bounds and the bethe partition function"
    - "central approximation in statistical physics and information theory"
    - "the bethe partition function of log supermodular graphical models"
    - "pseudocodewords from bethe permanents"
    - "connection between annealed free energy and belief propagation on random factor graph ensembles"
    - "normal factor graphs and holographic transformations"
    - "on the growth rate of the weight distribution of irregular doubly generalized ldpc codes"

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)