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 "hol light qe"):
  Abstract: We are interested in algorithms that manipulate mathematical expressions in mathematically meaningful ways. Expressions are syntactic, but most logics do not allow one to discuss syntax. ${\rm CTT}_{\rm qe}$ is a version of Church's type theory that includes quotation and evaluation operators, akin to quote and eval in the Lisp programming language. Since the HOL logic is also a version of Church's type theory, we decided to add quotation and evaluation to HOL Light to demonstrate the implementability of ${\rm CTT}_{\rm qe}$ and the benefits of having quotation and evaluation in a proof assistant. The resulting system is called HOL Light QE. Here we document the design of HOL Light QE and the challenges that needed to be overcome. The resulting implementation is freely available.

Includes members:
  Member "incorporating quotation and evaluation into church s type theory":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "towards specifying symbolic computation")
  Member "on the semantics of intensionality and intensional recursion":
    also connected through other hyperedges:
      (none)
  Member "formalizing mathematical knowledge as a biform theory graph a case study":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "biform theories project description")
  Member "incorporating quotation and evaluation into church s type theory syntax and semantics":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "incorporating quotation and evaluation into church s type theory")
  Member "on the semantics of reflect as a basis for a reflective theorem prover":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "towards specifying symbolic computation")
  Member "the formalization of syntax based mathematical algorithms using quotation and evaluation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "biform theories project description")
  Member "tactics for reasoning modulo ac in coq":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "incorporating quotation and evaluation into church s type theory")

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)