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: "constructive modalities with provability smack"
  Abstract: I overview the work of the Tbilisi school on intuitionistic modal logics of well-founded/scattered structures and its connections with contemporary Theoretical Computer Science. Fixed-point theorems and their consequences are of particular interest.

Connected through hyperedge HE-1 (induced by source paper "lewis meets brouwer constructive strict implication"):
  with members:
    - "a light modality for recursion"
    - "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"
    - "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 "fitch style modal lambda calculi"):
  with members:
    - "denotational semantics for guarded dependent type theory"
    - "internal universes in models of homotopy type theory"
    - "the guarded lambda calculus programming and reasoning with guarded recursion for coinductive types"
    - "dual context calculi for modal logic"
    - "the many worlds of modal λ calculi i curry howard for necessity possibility and time"
    - "guarded dependent type theory with coinductive types"
    - "cut elimination and proof search for bi intuitionistic tense logic"

Connected through hyperedge HE-3 (induced by source paper "the guarded lambda calculus programming and reasoning with guarded recursion for coinductive types"):
  with members:
    - "cubical type theory a constructive interpretation of the univalence axiom"
    - "programming and reasoning with guarded recursion for coinductive types"
    - "first steps in synthetic guarded domain theory step indexing in the topos of trees"

Connected through hyperedge HE-4 (induced by source paper "guard your daggers and traces properties of guarded co recursion"):
  with members:
    - "guard your daggers and traces on the equational properties of guarded co recursion"
    - "first steps in synthetic guarded domain theory step indexing in the topos of trees"

Connected through hyperedge HE-5 (induced by source paper "sequent calculus in the topos of trees"):
  with members:
    - "programming and reasoning with guarded recursion for coinductive types"
    - "guard your daggers and traces on the equational properties of guarded co recursion"
    - "first steps in synthetic guarded domain theory step indexing in the topos of trees"
    - "terminating calculi for propositional dummett logic with subformula property"
    - "logical step indexed logical relations"

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)