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: "a light modality for recursion"
  Abstract: We investigate the interplay between a modality for controlling the behaviour of recursive functional programs on infinite structures which are completely silent in the syntax. The latter means that programs do not contain "marks" showing the application of the introduction and elimination rules for the modality. This shifts the burden of controlling recursion from the programmer to the compiler. To do this, we introduce a typed lambda calculus a la Curry with a silent modality and guarded recursive types. The typing discipline guarantees normalisation and can be transformed into an algorithm which infers the type of a program.

Connected through hyperedge HE-1 (induced by source paper "lewis meets brouwer constructive strict implication"):
  with members:
    - "guard your daggers and traces properties of guarded co recursion"
    - "guarded dependent type theory with coinductive types"
    - "programming and reasoning with guarded recursion for coinductive types"
    - "sequent calculus in the topos of trees"
    - "constructive modalities with provability smack"
    - "epistemic updates on algebras"
    - "first steps in synthetic guarded domain theory step indexing in the topos of trees"
    - "canonized rewriting and ground ac completion modulo shostak theories design and implementation"

Connected through hyperedge HE-2 (induced by source paper "a generalized modality for recursion"):
  with members:
    - "the guarded lambda calculus programming and reasoning with guarded recursion for coinductive types"
    - "guarded dependent type theory with coinductive types"
    - "a bifibrational reconstruction of lawvere s presheaf hyperdoctrine"
    - "guarded cubical type theory path equality for guarded recursion"
    - "first steps in synthetic guarded domain theory step indexing in the topos of trees"

Connected through hyperedge HE-3 (induced by source paper "on sessions and infinite data"):
  with members:
    - "programming and reasoning with guarded recursion for coinductive types"

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)