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 "on deriving nested calculi for intuitionistic logics from semantic systems"):
  Abstract: This paper shows how to derive nested calculi from labelled calculi for propositional intuitionistic logic and first-order intuitionistic logic with constant domains, thus connecting the general results for labelled calculi with the more refined formalism of nested sequents. The extraction of nested calculi from labelled calculi obtains via considerations pertaining to the elimination of structural rules in labelled derivations. Each aspect of the extraction process is motivated and detailed, showing that each nested calculus inherits favorable proof-theoretic properties from its associated labelled calculus.

Includes members:
  Member "automating agential reasoning proof calculi and syntactic decidability for stit logics":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "syntactic cut elimination for intuitionistic fuzzy logic via linear nested sequents")
  Member "syntactic interpolation for tense logics and bi intuitionistic logic via nested sequents":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "syntactic cut elimination for intuitionistic fuzzy logic via linear nested sequents")
  Member "grammar logics in nested sequent calculus proof theory and decision procedures":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "automating agential reasoning proof calculi and syntactic decidability for stit logics")
  Member "on the correspondence between display postulates and deep inference in nested sequent calculi for tense logics":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "automating agential reasoning proof calculi and syntactic decidability for stit logics")

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)