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 "satisfiability threshold for power law random 2 sat in configuration model"):
  Abstract: The Random Satisfiability problem has been intensively studied for decades. For a number of reasons the focus of this study has mostly been on the model, in which instances are sampled uniformly at random from a set of formulas satisfying some clear conditions, such as fixed density or the probability of a clause to occur. However, some non-uniform distributions are also of considerable interest. In this paper we consider Random 2-SAT problems, in which instances are sampled from a wide range of non-uniform distributions. #R##N#The model of random SAT we choose is the so-called configuration model, given by a distribution $\xi$ for the degree (or the number of occurrences) of each variable. Then to generate a formula the degree of each variable is sampled from $\xi$, generating several \emph{clones} of the variable. Then 2-clauses are created by choosing a random paritioning into 2-element sets on the set of clones and assigning the polarity of literals at random. #R##N#Here we consider the random 2-SAT problem in the configuration model for power-law-like distributions $\xi$. More precisely, we assume that $\xi$ is such that its right tail $F_{\xi}(x)$ satisfies the conditions $W\ell^{-\alpha}\le F_{\xi}(\ell)\le V\ell^{-\alpha}$ for some constants $V,W$. The main goal is to study the satisfiability threshold phenomenon depending on the parameters $\alpha,V,W$. We show that a satisfiability threshold exists and is determined by a simple relation between the first and second moments of $\xi$.

Includes members:
  Member "scale free random sat instances":
    also connected through other hyperedges:
      (none)
  Member "bounds on the satisfiability threshold for power law distributed random sat":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the satisfiability threshold for non uniform random 2 sat")
  Member "typical random 3 sat formulae and the satisfiability threshold":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "phase transition in matched formulas and a heuristic for biclique satisfiability")
  Member "survey propagation an algorithm for satisfiability":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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.DM(Discrete Mathematics)