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 "combining the k cnf and xor phase transitions"):
  Abstract: The runtime performance of modern SAT solvers on random $k$-CNF formulas is deeply connected with the 'phase-transition' phenomenon seen empirically in the satisfiability of random $k$-CNF formulas. Recent universal hashing-based approaches to sampling and counting crucially depend on the runtime performance of SAT solvers on formulas expressed as the conjunction of both $k$-CNF and XOR constraints (known as $k$-CNF-XOR formulas), but the behavior of random $k$-CNF-XOR formulas is unexplored in prior work. In this paper, we present the first study of the satisfiability of random $k$-CNF-XOR formulas. We show empirical evidence of a surprising phase-transition that follows a linear trade-off between $k$-CNF and XOR constraints. Furthermore, we prove that a phase-transition for $k$-CNF-XOR formulas exists for $k = 2$ and (when the number of $k$-CNF constraints is small) for $k > 2$.

Includes members:
  Member "constrained sampling and counting universal hashing meets sat solving":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "faster creation of smaller test suites with snap")
  Member "aspects of statistical physics in computational complexity":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "problem solving at the edge of chaos entropy puzzles and the sudoku freezing transition")
  Member "distribution aware sampling and weighted model counting for sat":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the approximability of weighted model integration on dnf structures")
  Member "balancing scalability and uniformity in sat witness generator":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "quantitative verification of neural networks and its security applications")
  Member "a scalable approximate model counter":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "quantitative verification of neural networks and its security applications")
  Member "a scalable and nearly uniform generator of sat witnesses":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "constrained counting and sampling bridging the gap between theory and practice")
  Member "on the concentration of the number of solutions of random satisfiability formulas":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "counting solutions to random cnf formulas")

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)