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: "incorporating quotation and evaluation into church s type theory"
  Abstract: Abstract       is a version of Church's type theory that includes quotation and evaluation operators that are similar to quote and eval in the Lisp programming language. With quotation and evaluation it is possible to reason in     about the interplay of the syntax and semantics of expressions and, as a result, to formalize syntax-based mathematical algorithms. We present the syntax and semantics of     as well as a proof system for    . The proof system is shown to be sound for all formulas and complete for formulas that do not contain evaluations. We give several examples that illustrate the usefulness of having quotation and evaluation in    .

Connected through hyperedge HE-1 (induced by source paper "towards specifying symbolic computation"):
  with members:
    - "hol light qe"
    - "theory morphisms in church s type theory with quotation and evaluation"
    - "on the semantics of reflect as a basis for a reflective theorem prover"
    - "towards the formal specification and verification of maple programs"

Connected through hyperedge HE-2 (induced by source paper "biform theories project description"):
  with members:
    - "hol light qe"
    - "theory morphisms in church s type theory with quotation and evaluation"
    - "formalizing mathematical knowledge as a biform theory graph a case study"
    - "realms a structure for consolidating knowledge about mathematical theories"
    - "a universal machine for biform theory graphs"
    - "the formalization of syntax based mathematical algorithms using quotation and evaluation"
    - "theory presentation combinators"
    - "the mathscheme library some preliminary experiments"

Connected through hyperedge HE-3 (induced by source paper "hol light qe"):
  with members:
    - "on the semantics of intensionality and intensional recursion"
    - "formalizing mathematical knowledge as a biform theory graph a case study"
    - "incorporating quotation and evaluation into church s type theory syntax and semantics"
    - "on the semantics of reflect as a basis for a reflective theorem prover"
    - "the formalization of syntax based mathematical algorithms using quotation and evaluation"
    - "tactics for reasoning modulo ac in coq"

Connected through hyperedge HE-4 (induced by source paper "formalizing mathematical knowledge as a biform theory graph a case study"):
  with members:
    - "theory morphisms in church s type theory with quotation and evaluation"
    - "incorporating quotation and evaluation into church s type theory syntax and semantics"
    - "the formalization of syntax based mathematical algorithms using quotation and evaluation"
    - "a scalable module system"

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)