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: "calculi for intuitionistic normal modal logic"
  Abstract: This paper provides a call-by-name and a call-by-value term calculus, both of which have a Curry-Howard correspondence to the box fragment of the intuitionistic modal logic IK. The strong normalizability and the confluency of the calculi are shown. Moreover, we define a CPS transformation from the call-by-value calculus to the call-by-name calculus, and show its soundness and completeness.

Connected through hyperedge HE-1 (induced by source paper "modality via iterated enrichment"):
  with members:
    - "dual context calculi for modal logic"
    - "fitch style modal lambda calculi"
    - "the many worlds of modal λ calculi i curry howard for necessity possibility and time"

Connected through hyperedge HE-2 (induced by source paper "system k a simple modal lambda calculus"):
  with members:
    - "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"

Connected through hyperedge HE-3 (induced by source paper "the many worlds of modal λ calculi i curry howard for necessity possibility and time"):
  with members:
    - "logical relations for monadic types"

Connected through hyperedge HE-4 (induced by source paper "cut elimination and proof search for bi intuitionistic tense logic"):
  with members:
    - "positive logic with adjoint modalities proof theory semantics and reasoning about information"

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)