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 "the primal versus the dual ising model"):
  Abstract: We represent the Ising model of statistical physics by Forney factor graphs in the primal and in the dual domains. By analogy with Kirchhoff's voltage and current laws, we show that in the primal Forney factor graph, the dependency among the variables is along the cycles, whereas in the dual Forney factor graph, the dependency is on the cutsets. In the primal (resp. dual) domain, dependent variables can be computed via their fundamental cycles (resp. fundamental cutsets). In each domain, we propose an importance sampling algorithm to estimate the partition function. In the primal domain, the proposal distribution is defined on a spanning tree, and computations are done on the cospanning tree. In contrast, in the dual domain, computations are done on a spanning tree of the model, and the proposal distribution is defined on the cospanning tree.

Includes members:
  Member "codes on graphs models for elementary algebraic topology and statistical physics":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a factor graph approach to algebraic topology with applications to kramers wannier duality")
  Member "a factor graph approach to algebraic topology with applications to kramers wannier duality":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "codes on graphs models for elementary algebraic topology and statistical physics")
  Member "on stochastic estimation of partition function":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a factor graph approach to algebraic topology with applications to kramers wannier duality")
  Member "partition function of the ising model via factor graph duality":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "codes on graphs models for elementary algebraic topology and statistical physics")
  Member "a new class of upper bounds on the log partition function":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "visual semantic information pursuit a survey")
  Member "normal factor graphs and holographic transformations":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "codes on graphs models for elementary algebraic topology and statistical physics")

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)