human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "lewis meets brouwer constructive strict implication"):
  Abstract: Abstract   C.I. Lewis invented modern modal logic as a theory of “strict implication”    ⥽   . Over the classical propositional calculus one can as well work with the unary box connective. Intuitionistically, however, the strict implication has greater expressive power than    □    and allows to make distinctions invisible in the ordinary syntax. In particular, the logic determined by the most popular semantics of intuitionistic    K    becomes a proper extension of the minimal normal logic of the binary connective. Even an extension of this minimal logic with the “strength” axiom, classically near-trivial, preserves the distinction between the binary and the unary setting. In fact, this distinction has been discovered by the functional programming community in their study of “arrows” as contrasted with “idioms”. Our particular focus is on arithmetical interpretations of intuitionistic    ⥽    in terms of preservativity in extensions of    HA   , i.e., Heyting’s Arithmetic.

Includes members:
  Member "a light modality for recursion":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a generalized modality for recursion")
  Member "guard your daggers and traces properties of guarded co recursion":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a metalanguage for guarded iteration")
  Member "guarded dependent type theory with coinductive types":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "diamonds are not forever liveness in reactive programming with guarded recursion")
  Member "programming and reasoning with guarded recursion for coinductive types":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the size change principle for mixed inductive and coinductive types")
  Member "sequent calculus in the topos of trees":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "coinduction in uniform foundations for corecursive proof search with horn clauses")
  Member "constructive modalities with provability smack":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "fitch style modal lambda calculi")
  Member "epistemic updates on algebras":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "rough concepts")
  Member "first steps in synthetic guarded domain theory step indexing in the topos of trees":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "diamonds are not forever liveness in reactive programming with guarded recursion")

Question: Please tell me which class the source paper 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)