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: "sat modulo monotonic theories"
  Abstract: We define the concept of a monotonic theory and show how to build efficient SMT (SAT Modulo Theory) solvers, including effective theory propagation and clause learning, for such theories. We present examples showing that monotonic theories arise from many common problems, e.g., graph properties such as reachability, shortest paths, connected components, minimum spanning tree, and max-flow/min-cut, and then demonstrate our framework by building SMT solvers for each of these theories. We apply these solvers to procedural content generation problems, demonstrating major speed-ups over state-of-the-art approaches based on SAT or Answer Set Programming, and easily solving several instances that were previously impractical to solve.

Connected through hyperedge HE-1 (induced by source paper "sat based atl satisfiability checking"):
  with members:
    - "fixpoint approximation of strategic abilities under imperfect information"
    - "reasoning about knowledge and strategies epistemic strategy logic"
    - "the expressive power of epistemic μ calculus"
    - "a decidable fragment of strategy logic"
    - "model checking atl under imperfect information and perfect recall semantics is undecidable"

Connected through hyperedge HE-2 (induced by source paper "fouriersat a fourier expansion based algebraic framework for solving hybrid boolean constraints"):
  with members:
    - "phase transition behavior of cardinality and xor constraints"
    - "on nonconvex optimization for machine learning gradients stochasticity and saddle points"
    - "combining the k cnf and xor phase transitions"
    - "variable elimination in the fourier domain"
    - "escaping from saddle points online stochastic gradient for tensor decomposition"
    - "analysis of boolean functions"

Connected through hyperedge HE-3 (induced by source paper "detecting incorrect behavior of cloud databases as an outsider"):
  with members:
    - "automated detection of serializability violations under weak consistency"
    - "on the quest for an acyclic graph"
    - "serializable snapshot isolation in postgresql"

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.LO(Logic in Computer Science)