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: "on the semantics of reflect as a basis for a reflective theorem prover"
  Abstract: This paper explores the semantics of a combinatory fragment of reFLect, the lambda-calculus underlying a functional language used by Intel Corporation for hardware design and verification. ReFLect is similar to ML, but has a primitive data type whose elements are the abstract syntax trees of reFLect expressions themselves. Following the LCF paradigm, this is intended to serve as the object language of a higher-order logic theorem prover for specification and reasoning - but one in which object- and meta-languages are unified. The aim is to intermix program evaluation and logical deduction through reflection mechanisms. We identify some difficulties with the semantics of reFLect as currently defined, and propose a minimal modification of the type system that avoids these problems.

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"
    - "theory morphisms in church s type theory with quotation and evaluation"
    - "towards the formal specification and verification of maple programs"

Connected through hyperedge HE-2 (induced by source paper "incorporating quotation and evaluation into church s type theory"):
  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"
    - "modelling homogeneous generative meta programming"
    - "incorporating quotation and evaluation into church s type theory syntax and semantics"
    - "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-3 (induced by source paper "hol light qe"):
  with members:
    - "incorporating quotation and evaluation into church s type theory"
    - "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"
    - "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 "control flow analysis for sf combinator calculus"):
  with members:
    - "confusion in the church turing thesis"
    - "deciding k cfa is complete for exptime"
    - "flow analysis linearity and ptime"
    - "cfa2 a context free approach to control flow analysis"

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)