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 "kramers wannier duality and factor graphs"):
  Abstract: We consider the classical duality result of Kramers and Wannier, which expresses the partition function of the two-dimensional Ising model at low temperature in terms of the partition function of the two-dimensional Ising model at high temperature. Our main contribution is to gain new insights into this result by reproving it with the help of a simple normal-factor-graph duality theorem (with origins in coding theory), together with some elementary notions from algebraic topology. An important ingredient of our proof approach are normal-factor-graph representations of some notions from algebraic topology; a side contribution of this paper is to elaborate on such representations. In addition to the two-dimensional Ising model, we also discuss the three-dimensional Ising model and the Potts model.

Includes members:
  Member "a new class of upper bounds on the log partition function":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "visual semantic information pursuit a survey")
  Member "partition functions of normal factor graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "codes on graphs models for elementary algebraic topology and statistical physics")
  Member "normal factor graphs and holographic transformations":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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)