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 intensionality and intensional recursion"
  Abstract: Intensionality is a phenomenon that occurs in logic and computation. In the  most general sense, a function is intensional if it operates at a level finer than  (extensional) equality. This is a familiar setting for computer scientists, who  often study different programs or processes that are interchangeable, i.e. extensionally  equal, even though they are not implemented in the same way, so  intensionally distinct. Concomitant with intensionality is the phenomenon of  intensional recursion, which refers to the ability of a program to have access  to its own code. In computability theory, intensional recursion is enabled by  Kleene’s Second Recursion Theorem.   This thesis is concerned with the crafting of a logical toolkit through which  these phenomena can be studied. Our main contribution is a framework in  which mathematical and computational constructions can be considered either  extensionally, i.e. as abstract values, or intensionally, i.e. as fine-grained descriptions  of their construction. Once this is achieved, it may be used to analyse  intensional recursion.   To begin, we turn to type theory. We construct a modal λ-calculus, called Intensional  PCF, which supports non-functional operations at modal types. Moreover,  by adding Lob's rule from provability logic to the calculus, we obtain a  type-theoretic interpretation of intensional recursion. The combination of these  two features is shown to be consistent through a confluence argument.   Following that, we begin searching for a semantics for Intensional PCF. We  argue that 1-category theory is not sufficient, and propose the use of P-categories  instead. On top of this setting we introduce exposures, which are P-categorical  structures that function as abstractions of well-behaved intensional devices. We  produce three examples of these structures, based on Godel numberings on  Peano arithmetic, realizability theory, and homological algebra.   The language of exposures leads us to a P-categorical analysis of intensional  recursion, through the notion of intensional fixed points. This, in turn, leads  to abstract analogues of classic intensional results in logic and computability,  such as Godel's Incompleteness Theorem, Tarski's Undefinability Theorem, and  Rice's Theorem. We are thus led to the conclusion that exposures are a useful  framework, which we propose as a solid basis for a theory of intensionality.   In the final chapters of the thesis we employ exposures to endow Intensional  PCF with an appropriate semantics. It transpires that, when interpreted in the  P-category of assemblies on the PCA K1, the Lob rule can be interpreted as  the type of Kleene’s Second Recursion Theorem.

Connected through hyperedge HE-1 (induced by source paper "hol light qe"):
  with members:
    - "incorporating quotation and evaluation into church s type theory"
    - "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"

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)