human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "deciding kleene algebras in coq"):
  Abstract: We present a reflexive tactic for deciding the equational theory of Kleene#N#algebras in the Coq proof assistant. This tactic relies on a careful#N#implementation of efficient finite automata algorithms, so that it solves#N#casual equations instantaneously and properly scales to larger expressions. The#N#decision procedure is proved correct and complete: correctness is established#N#w.r.t. any model by formalising Kozen's initiality theorem; a counter-example#N#is returned when the given equation does not hold. The correctness proof is#N#challenging: it involves both a precise analysis of the underlying automata#N#algorithms and a lot of algebraic reasoning. In particular, we have to#N#formalise the theory of matrices over a Kleene algebra. We build on the recent#N#addition of firstorder typeclasses in Coq in order to work efficiently with the#N#involved algebraic structures.

Includes members:
  Member "nonuniform coercions via unification hints":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "theory presentation combinators")
  Member "a formally verified compiler back end":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a survey on theorem provers in formal methods")

Question: Please tell me which class the source paper 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)