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: "exact phase transitions in random constraint satisfaction problems"
  Abstract: In this paper we propose a new type of random CSP model, called Model RB, which is a revision to the standard Model B. It is proved that phase transitions from a region where almost all problems are satisfiable to a region where almost all problems are unsatisfiable do exist for Model RB as the number of variables approaches infinity. Moreover, the critical values at which the phase transitions occur are also known exactly. By relating the hardness of Model RB to Model B, it is shown that there exist a lot of hard instances in Model RB.

Connected through hyperedge HE-1 (induced by source paper "estimating the density of states of boolean satisfiability problems on classical and quantum computing platforms"):
  with members:
    - "how biased is your model concentration inequalities information and model bias"
    - "relaxed survey propagation for the weighted maximum satisfiability problem"
    - "the good old davis putnam procedure helps counting models"

Connected through hyperedge HE-2 (induced by source paper "unweighted stochastic local search can be effective for random csp benchmarks"):
  with members:
    - "many hard examples in exact phase transitions with application to generating hard satisfiable instances"

Connected through hyperedge HE-3 (induced by source paper "numvc an efficient local search algorithm for minimum vertex cover"):
  with members:
    - "new inference rules for max sat"
    - "dynamic local search for the maximum clique problem"
    - "a simple model to generate hard satisfiable instances"
    - "a novel evolutionary formulation of the maximum independent set problem"
    - "optimal schedules for parallelizing anytime algorithms the case of shared resources"

Connected through hyperedge HE-4 (induced by source paper "the satisfiability threshold for a seemingly intractable random constraint satisfaction problem"):
  with members:
    - "tight thresholds for cuckoo hashing via xorsat"
    - "relationship between clustering and algorithmic phase transitions in the random k xorsat model and its np complete extensions"
    - "a new upper bound for 3 sat"

Connected through hyperedge HE-5 (induced by source paper "phase transitions in knowledge compilation an experimental study"):
  with members:
    - "where are the really hard manipulation problems the phase transition in manipulating the veto rule"
    - "exact phase transition of backtrack free search with implications on the power of greedy algorithms"
    - "and or multi valued decision diagrams aomdds for graphical models"
    - "a knowledge compilation map"
    - "the good old davis putnam procedure helps counting models"

Connected through hyperedge HE-6 (induced by source paper "counting solutions of constraint satisfiability problems exact phase transitions and approximate algorithm"):
  with members:
    - "a new upper bound for 3 sat"
    - "the good old davis putnam procedure helps counting models"

Connected through hyperedge HE-7 (induced by source paper "a probabilistic attack on np complete problems"):
  with members:
    - "the phase transition in exact cover"

Connected through hyperedge HE-8 (induced by source paper "a simple model to generate hard satisfiable instances"):
  with members:
    - "hiding satisfying assignments two are better than one"
    - "many hard examples in exact phase transitions with application to generating hard satisfiable instances"

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