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: "on the correspondence between display postulates and deep inference in nested sequent calculi for tense logics"
  Abstract: We consider two styles of proof calculi for a family of tense logics, presented in a formalism based on nested sequents. A nested sequent can be seen as a tree of traditional single-sided sequents. Our first style of calculi is what we call "shallow calculi", where inference rules are only applied at the root node in a nested sequent. Our shallow calculi are extensions of Kashima's calculus for tense logic and share an essential characteristic with display calculi, namely, the presence of structural rules called "display postulates". Shallow calculi enjoy a simple cut elimination procedure, but are unsuitable for proof search due to the presence of display postulates and other structural rules. The second style of calculi uses deep-inference, whereby inference rules can be applied at any node in a nested sequent. We show that, for a range of extensions of tense logic, the two styles of calculi are equivalent, and there is a natural proof theoretic correspondence between display postulates and deep inference. The deep inference calculi enjoy the subformula property and have no display postulates or other structural rules, making them a better framework for proof search.

Connected through hyperedge HE-1 (induced by source paper "automating agential reasoning proof calculi and syntactic decidability for stit logics"):
  with members:
    - "cut free calculi and relational semantics for temporal stit logics"
    - "grammar logics in nested sequent calculus proof theory and decision procedures"
    - "alternative axiomatics and complexity of deliberative stit theories"

Connected through hyperedge HE-2 (induced by source paper "on deriving nested calculi for intuitionistic logics from semantic systems"):
  with members:
    - "automating agential reasoning proof calculi and syntactic decidability for stit logics"
    - "syntactic interpolation for tense logics and bi intuitionistic logic via nested sequents"
    - "grammar logics in nested sequent calculus proof theory and decision procedures"

Connected through hyperedge HE-3 (induced by source paper "display to labelled proofs and back again for tense logics"):
  with members:
    - "syntactic interpolation for tense logics and bi intuitionistic logic via nested sequents"

Connected through hyperedge HE-4 (induced by source paper "inducing syntactic cut elimination for indexed nested sequents"):
  with members:
    - "a system of interaction and structure"

Connected through hyperedge HE-5 (induced by source paper "clausal resolution for modal logics of confluence"):
  with members:
    - "a system of interaction and structure"
    - "deciding regular grammar logics with converse through first order logic"

Connected through hyperedge HE-6 (induced by source paper "annotation free sequent calculi for full intuitionistic linear logic extended version"):
  with members:
    - "cut elimination and proof search for bi intuitionistic tense logic"

Connected through hyperedge HE-7 (induced by source paper "grammar logics in nested sequent calculus proof theory and decision procedures"):
  with members:
    - "cut elimination and proof search for bi intuitionistic tense logic"
    - "optimal and cut free tableaux for propositional dynamic logic with converse"
    - "a system of interaction and structure"
    - "deciding regular grammar logics with converse through first order 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)