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: "ground interpolation for the theory of equality"
  Abstract: Theory interpolation has found several successful applications in model#N#checking. We present a novel method for computing interpolants for ground#N#formulas in the theory of equality. The method produces interpolants from#N#colored congruence graphs representing derivations in that theory. These graphs#N#can be produced by conventional congruence closure algorithms in a#N#straightforward manner. By working with graphs, rather than at the level of#N#individual proof steps, we are able to derive interpolants that are pleasingly#N#simple (conjunctions of Horn clauses) and smaller than those generated by other#N#tools. Our interpolation method can be seen as a theory-specific implementation#N#of a cooperative interpolation game between two provers. We present a generic#N#version of the interpolation game, parametrized by the theory T, and define a#N#general method to extract runs of the game from proofs in T and then generate#N#interpolants from these runs.

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

Connected through hyperedge HE-2 (induced by source paper "proof tree preserving interpolation"):
  with members:
    - "efficient interpolant generation in satisfiability modulo linear integer arithmetic"

Connected through hyperedge HE-3 (induced by source paper "quantifier free interpolation of a theory of arrays"):
  with members:
    - "from strong amalgamability to modularity of quantifier free interpolation"
    - "new results on rewrite based satisfiability procedures"
    - "efficient generation of craig interpolants in satisfiability modulo theories"
    - "interpolation in local theory extensions"

Connected through hyperedge HE-4 (induced by source paper "from strong amalgamability to modularity of quantifier free interpolation"):
  with members:
    - "quantifier free interpolation of a theory of arrays"
    - "interpolation in local theory extensions"

Connected through hyperedge HE-5 (induced by source paper "efficient interpolant generation in satisfiability modulo linear integer arithmetic"):
  with members:
    - "efficient generation of craig interpolants in satisfiability modulo theories"

Connected through hyperedge HE-6 (induced by source paper "efficient generation of craig interpolants in satisfiability modulo theories"):
  with members:
    - "interpolation in local theory extensions"
    - "interpolant based transition relation approximation"
    - "the octagon abstract domain"

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)