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 "solving constraint satisfaction problems through belief propagation guided decimation"):
  Abstract: Message passing algorithms have proved surprisingly successful in solving hard constraint satisfaction problems on sparse random graphs. In such applications, variables are fixed sequentially to satisfy the constraints. Message passing is run after each step. Its outcome provides an heuristic to make choices at next step. This approach has been referred to as `decimation,' with reference to analogous procedures in statistical physics. #R##N#The behavior of decimation procedures is poorly understood. Here we consider a simple randomized decimation algorithm based on belief propagation (BP), and analyze its behavior on random k-satisfiability formulae. In particular, we propose a tree model for its analysis and we conjecture that it provides asymptotically exact predictions in the limit of large instances. This conjecture is confirmed by numerical simulations.

Includes members:
  Member "can rare sat formulae be easily recognized on the efficiency of message passing algorithms for k sat at large clause to variable ratios":
    also connected through other hyperedges:
      (none)
  Member "counting good truth assignments of random k sat formulae":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "counting solutions to random cnf formulas")
  Member "maxwell construction the hidden bridge between iterative and maximum a posteriori decoding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "reed muller codes theory and algorithms")
  Member "lossy source encoding via message passing and decimation over generalized codewords of ldgm codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "low density majority codes and the problem of graceful degradation")
  Member "life above threshold from list decoding to area theorem and mse":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "low density majority codes and the problem of graceful degradation")
  Member "threshold values of random k sat from the cavity method":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "hierarchical decomposition mechanism by konig egervary layer subgraph with application on vertex cover")
  Member "survey propagation an algorithm for satisfiability":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "pdp a general neural framework for learning constraint satisfaction solvers")

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)