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: "proof tree preserving interpolation"
  Abstract: Craig interpolation in SMT is difficult because, e. g., theory combination and integer cuts introduce mixed literals, i. e., literals containing local symbols from both input formulae. In this paper, we present a scheme to compute Craig interpolants in the presence of mixed literals. Contrary to existing approaches, this scheme neither limits the inferences done by the SMT solver, nor does it transform the proof tree before extracting interpolants. Our scheme works for the combination of uninterpreted functions and linear arithmetic but is extendable to other theories. The scheme is implemented in the interpolating SMT solver SMTInterpol.

Connected through hyperedge HE-1 (induced by source paper "efficient interpolation for the theory of arrays"):
  with members:
    - "weakly equivalent arrays"
    - "quantifier free interpolation of a theory of arrays"
    - "ground interpolation for the theory of equality"

Connected through hyperedge HE-2 (induced by source paper "a survey of satisfiability modulo theory"):
  with members:
    - "how to compute worst case execution time by optimization modulo theory and a clever encoding of program semantics"
    - "generating non linear interpolants by semidefinite programming"
    - "invariant generation through strategy iteration in succinctly represented control flow graphs"
    - "pagai a path sensitive static analyzer"
    - "succinct representations for abstract interpretation"
    - "optimization in smt with la q cost functions"
    - "on using floating point computations to help an exact linear arithmetic decision procedure"
    - "a quantifier elimination algorithm for linear real arithmetic"

Connected through hyperedge HE-3 (induced by source paper "resolution proof transformation for compression and interpolation"):
  with members:
    - "interpolant based transition relation approximation"
    - "a scalable algorithm for minimal unsatisfiable core extraction"

Connected through hyperedge HE-4 (induced by source paper "weakly equivalent arrays"):
  with members:
    - "quantifier free interpolation of a theory of arrays"
    - "new results on rewrite based satisfiability procedures"

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)