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: "on interpolation and symbol elimination in theory extensions"
  Abstract: In this paper we study possibilities of interpolation and symbol elimination in extensions of a theory $\mathcal{T}_0$ with additional function symbols whose properties are axiomatised using a set of clauses. We analyze situations in which we can perform such tasks in a hierarchical way, relying on existing mechanisms for symbol elimination in $\mathcal{T}_0$. This is for instance possible if the base theory allows quantifier elimination. We analyze possibilities of extending such methods to situations in which the base theory does not allow quantifier elimination but has a model completion which does. We illustrate the method on various examples.

Connected through hyperedge HE-1 (induced by source paper "nil learning nonlinear interpolants"):
  with members:
    - "sharper and simpler nonlinear interpolants for program verification"
    - "interpolation synthesis for quadratic polynomial inequalities and combination with euf"
    - "generating non linear interpolants by semidefinite programming"
    - "interpolation in local theory extensions"

Connected through hyperedge HE-2 (induced by source paper "parametric systems verification and synthesis"):
  with members:
    - "on invariant synthesis for parametric systems"
    - "decidability of verification of safety properties of spatial families of linear hybrid automata"

Connected through hyperedge HE-3 (induced by source paper "on invariant synthesis for parametric systems"):
  with members:
    - "backward reachability of array based systems by smt solving termination and invariant synthesis"
    - "interpolation in local theory extensions"

Connected through hyperedge HE-4 (induced by source paper "quantifier elimination for database driven verification"):
  with members:
    - "formal modeling and smt based parameterized verification of data aware bpmn"
    - "verification of data aware processes via array based systems extended version"
    - "verification of hierarchical artifact systems"

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)