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: "efficient generation of craig interpolants in satisfiability modulo theories"
  Abstract: The problem of computing Craig Interpolants has recently received a lot of interest. In this paper, we address the problem of efficient generation of interpolants for some important fragments of first order logic, which are amenable for effective decision procedures, called Satisfiability Modulo Theory solvers. #R##N#We make the following contributions. #R##N#First, we provide interpolation procedures for several basic theories of interest: the theories of linear arithmetic over the rationals, difference logic over rationals and integers, and UTVPI over rationals and integers. #R##N#Second, we define a novel approach to interpolate combinations of theories, that applies to the Delayed Theory Combination approach. #R##N#Efficiency is ensured by the fact that the proposed interpolation algorithms extend state of the art algorithms for Satisfiability Modulo Theories. Our experimental evaluation shows that the MathSAT SMT solver can produce interpolants with minor overhead in search, and much more efficiently than other competitor solvers.

Connected through hyperedge HE-1 (induced by source paper "conquering the extensional scalability problem for value flow analysis frameworks"):
  with members:
    - "a scalable algorithm for minimal unsatisfiable core extraction"

Connected through hyperedge HE-2 (induced by source paper "optimization modulo theories with linear rational costs"):
  with members:
    - "ilp modulo theories"
    - "optimization in smt with la q cost functions"
    - "computing small unsatisfiable cores in satisfiability modulo theories"

Connected through hyperedge HE-3 (induced by source paper "quantifier free interpolation of a theory of arrays"):
  with members:
    - "ground interpolation for the theory of equality"
    - "from strong amalgamability to modularity of quantifier free interpolation"
    - "new results on rewrite based satisfiability procedures"
    - "interpolation in local theory extensions"

Connected through hyperedge HE-4 (induced by source paper "efficient interpolant generation in satisfiability modulo linear integer arithmetic"):
  with members:
    - "ground interpolation for the theory of equality"

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)