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: "partition function of the ising model via factor graph duality"
  Abstract: The partition function of a factor graph and the partition function of the dual factor graph are related to each other by the normal factor graph duality theorem. We apply this result to the classical problem of computing the partition function of the Ising model. In the one-dimensional case, we thus obtain an alternative derivation of the (well-known) analytical solution. In the two-dimensional case, we find that Monte Carlo methods are much more efficient on the dual graph than on the original graph, especially at low temperature.

Connected through hyperedge HE-1 (induced by source paper "codes on graphs models for elementary algebraic topology and statistical physics"):
  with members:
    - "a factor graph approach to algebraic topology with applications to kramers wannier duality"
    - "the primal versus the dual ising model"
    - "codes on graphs fundamentals"
    - "partition functions of normal factor graphs"
    - "normal factor graphs and holographic transformations"

Connected through hyperedge HE-2 (induced by source paper "a factor graph approach to algebraic topology with applications to kramers wannier duality"):
  with members:
    - "codes on graphs models for elementary algebraic topology and statistical physics"
    - "on stochastic estimation of partition function"
    - "a new class of upper bounds on the log partition function"
    - "partition functions of normal factor graphs"
    - "normal factor graphs and holographic transformations"

Connected through hyperedge HE-3 (induced by source paper "the primal versus the dual ising model"):
  with members:
    - "codes on graphs models for elementary algebraic topology and statistical physics"
    - "a factor graph approach to algebraic topology with applications to kramers wannier duality"
    - "on stochastic estimation of partition function"
    - "a new class of upper bounds on the log partition function"
    - "normal factor graphs and holographic transformations"

Connected through hyperedge HE-4 (induced by source paper "bitwise map algorithm for group testing based on holographic transformation"):
  with members:
    - "a new direction for counting perfect matchings"
    - "normal factor graphs and holographic transformations"
    - "note on noisy group testing asymptotic bounds and belief propagation reconstruction"

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)