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 interpolant generation in satisfiability modulo linear integer arithmetic"
  Abstract: The problem of computing Craig interpolants in SAT and SMT has recently#N#received a lot of interest, mainly for its applications in formal verification.#N#Efficient algorithms for interpolant generation have been presented for some#N#theories of interest ---including that of equality and uninterpreted functions,#N#linear arithmetic over the rationals, and their combination--- and they are#N#successfully used within model checking tools. For the theory of linear#N#arithmetic over the integers (LA(Z)), however, the problem of finding an#N#interpolant is more challenging, and the task of developing efficient#N#interpolant generators for the full theory LA(Z) is still the objective of#N#ongoing research. In this paper we try to close this gap. We build on previous#N#work and present a novel interpolation algorithm for SMT(LA(Z)), which exploits#N#the full power of current state-of-the-art SMT(LA(Z)) solvers. We demonstrate#N#the potential of our approach with an extensive experimental evaluation of our#N#implementation of the proposed algorithm in the MathSAT SMT solver.

Connected through hyperedge HE-1 (induced by source paper "proof tree preserving interpolation"):
  with members:
    - "ground interpolation for the theory of equality"

Connected through hyperedge HE-2 (induced by source paper "generalised interpolation by solving recursion free horn clauses"):
  with members:
    - "interpolant based transition relation approximation"

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)