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 "biform theories project description"):
  Abstract: A biform theory is a combination of an axiomatic theory and an algorithmic theory that supports the integration of reasoning and computation. These are ideal for specifying and reasoning about algorithms that manipulate mathematical expressions. However, formalizing biform theories is challenging since it requires the means to express statements about the interplay of what these algorithms do and what their actions mean mathematically. This paper describes a project to develop a methodology for expressing, manipulating, managing, and generating mathematical knowledge as a network of biform theories. It is a subproject of MathScheme, a long-term project at McMaster University to produce a framework for integrating formal deduction and symbolic computation.

Includes members:
  Member "hol light qe":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "towards specifying symbolic computation")
  Member "incorporating quotation and evaluation into church s type theory":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "towards specifying symbolic computation")
  Member "theory morphisms in church s type theory with quotation and evaluation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "towards specifying symbolic computation")
  Member "formalizing mathematical knowledge as a biform theory graph a case study":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "incorporating quotation and evaluation into church s type theory")
  Member "realms a structure for consolidating knowledge about mathematical theories":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a new style of proof for mathematics organized as a network of axiomatic theories")
  Member "a universal machine for biform theory graphs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "interoperability in the opendreamkit project the math in the middle approach")
  Member "the formalization of syntax based mathematical algorithms using quotation and evaluation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "incorporating quotation and evaluation into church s type theory")
  Member "theory presentation combinators":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "building on the diamonds between theories theory presentation combinators")

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)