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 "approximate evaluation of marginal association probabilities with belief propagation"):
  Abstract: Data association, the problem of reasoning over correspondence between targets and measurements, is a fundamental problem in tracking. This paper presents a graphical model formulation of data association and applies an approximate inference method, belief propagation (BP), to obtain estimates of marginal association probabilities. We prove that BP is guaranteed to converge, and bound the number of iterations necessary. Experiments reveal a favourable comparison to prior methods in terms of accuracy and computational complexity.

Includes members:
  Member "loopy belief propagation for approximate inference an empirical study":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "analyzing differentiable fuzzy logic operators")
  Member "the bethe permanent of a nonnegative matrix":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "gauges loops and polynomials for partition functions of graphical models")
  Member "a new class of upper bounds on the log partition function":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "visual semantic information pursuit a survey")
  Member "approximating the permanent with fractional belief propagation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "gauges loops and polynomials for partition functions of graphical models")
  Member "approximating the permanent with belief propagation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "approximating the permanent by sampling from adaptive partitions")
  Member "max product for maximum weight matching convergence correctness and lp duality":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "my fair bandit distributed learning of max min fairness with multi player bandits")
  Member "belief propagation and beyond for particle tracking":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "approximating the permanent by sampling from adaptive partitions")

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.AI(Artificial Intelligence)