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: "dual context calculi for modal logic"
  Abstract: We show how to derive natural deduction systems for the necessity fragment of various constructive modal logics by exploiting a pattern found in sequent calculi. The resulting systems are dual-context systems, in the style pioneered by Girard, Barber, Plotkin, Pfenning, Davies, and others. This amounts to a full extension of the Curry-Howard-Lambek correspondence to the necessity fragments of a constructive variant of the modal logics K, K4, GL, T, and S4. We investigate the metatheory of these calculi, as well as their categorical semantics. Finally, we speculate on their computational interpretation.

Connected through hyperedge HE-1 (induced by source paper "understanding the expressive power of unhygienic substitution in metaprogramming via combinatory logic"):
  with members:
    - "modelling homogeneous generative meta programming"

Connected through hyperedge HE-2 (induced by source paper "modal dependent type theory and dependent right adjoints"):
  with members:
    - "the clocks they are adjunctions denotational semantics for clocked type theory"
    - "denotational semantics for guarded dependent type theory"
    - "internal universes in models of homotopy type theory"
    - "undecidability of equality in the free locally cartesian closed category extended version"
    - "fitch style modal lambda calculi"
    - "guarded dependent type theory with coinductive types"
    - "cubical type theory a constructive interpretation of the univalence axiom"
    - "programming and reasoning with guarded recursion for coinductive types"

Connected through hyperedge HE-3 (induced by source paper "modalities cohesion and information flow"):
  with members:
    - "types for information flow control labeling granularity and semantic models"
    - "the guarded lambda calculus programming and reasoning with guarded recursion for coinductive types"
    - "proving noninterference by a fully complete translation to the simply typed lambda calculus"

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

Connected through hyperedge HE-5 (induced by source paper "polymorphic context for contextual modality"):
  with members:
    - "fitch style modal lambda calculi"

Connected through hyperedge HE-6 (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"
    - "the many worlds of modal λ calculi i curry howard for necessity possibility and time"
    - "guarded dependent type theory with coinductive types"
    - "constructive modalities with provability smack"
    - "cut elimination and proof search for bi intuitionistic tense logic"

Connected through hyperedge HE-7 (induced by source paper "modularisation of sequent calculi for normal and non normal modalities"):
  with members:
    - "non normal modalities in variants of linear logic"
    - "modal logics with hard diamond free fragments"

Connected through hyperedge HE-8 (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"
    - "the many worlds of modal λ calculi i curry howard for necessity possibility and time"
    - "calculi for intuitionistic normal modal logic"

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)