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: "theory morphisms in church s type theory with quotation and evaluation"
  Abstract: ${\rm CTT}_{\rm qe}$ is a version of Church's type theory with global quotation and evaluation operators that is engineered to reason about the interplay of syntax and semantics and to formalize syntax-based mathematical algorithms. ${\rm CTT}_{\rm uqe}$ is a variant of ${\rm CTT}_{\rm qe}$ that admits undefined expressions, partial functions, and multiple base types of individuals. It is better suited than ${\rm CTT}_{\rm qe}$ as a logic for building networks of theories connected by theory morphisms. This paper presents the syntax and semantics of ${\rm CTT}_{\rm uqe}$, defines a notion of a theory morphism from one ${\rm CTT}_{\rm uqe}$ theory to another, and gives two simple examples that illustrate the use of theory morphisms in ${\rm CTT}_{\rm uqe}$.

Connected through hyperedge HE-1 (induced by source paper "towards specifying symbolic computation"):
  with members:
    - "hol light qe"
    - "incorporating quotation and evaluation into church s type theory"
    - "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"
    - "incorporating quotation and evaluation into church s type theory"
    - "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 "incorporating quotation and evaluation into church s type theory"):
  with members:
    - "hol light qe"
    - "formalizing mathematical knowledge as a biform theory graph a case study"
    - "modelling homogeneous generative meta programming"
    - "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"
    - "frameworks for reasoning about syntax that utilize 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:
    - "incorporating quotation and evaluation into church s type theory"
    - "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)