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: "ursa a system for uniform reduction to sat"
  Abstract: There are a huge number of problems, from various areas, being solved by#N#reducing them to SAT. However, for many applications, translation into SAT is#N#performed by specialized, problem-specific tools. In this paper we describe a#N#new system for uniform solving of a wide class of problems by reducing them to#N#SAT. The system uses a new specification language URSA that combines imperative#N#and declarative programming paradigms. The reduction to SAT is defined#N#precisely by the semantics of the specification language. The domain of the#N#approach is wide (e.g., many NP-complete problems can be simply specified and#N#then solved by the system) and there are problems easily solvable by the#N#proposed system, while they can be hardly solved by using other programming#N#languages or constraint programming systems. So, the system can be seen not#N#only as a tool for solving problems by reducing them to SAT, but also as a#N#general-purpose constraint solving system (for finite domains). In this paper,#N#we also describe an open-source implementation of the described approach. The#N#performed experiments suggest that the system is competitive to#N#state-of-the-art related modelling systems.

Connected through hyperedge HE-1 (induced by source paper "translation of algorithmic descriptions of discrete functions to sat with applications to cryptanalysis problems"):
  with members:
    - "on cryptographic attacks using backdoors for sat"
    - "encoding cryptographic functions to sat using transalg system"
    - "using monte carlo method for searching partitionings of hard variants of boolean satisfiability problem"
    - "circuit complexity and decompositions of global constraints"

Connected through hyperedge HE-2 (induced by source paper "computer assisted proving of combinatorial conjectures over finite domains a case study of a chess conjecture"):
  with members:
    - "extending acl2 with smt solvers"
    - "learning assisted automated reasoning with flyspeck"
    - "integrating testing and interactive theorem proving"

Connected through hyperedge HE-3 (induced by source paper "encoding cryptographic functions to sat using transalg system"):
  with members:
    - "transalg a tool for translating procedural descriptions of discrete functions to sat"

Connected through hyperedge HE-4 (induced by source paper "transalg a tool for translating procedural descriptions of discrete functions to sat"):
  with members:
    - "on estimating total time to solve sat in distributed computing environments application to the sat home project"

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)