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: "efficient csl model checking using stratification"
  Abstract: For continuous-time Markov chains, the model-checking problem with respect to continuous-time stochastic logic (CSL) has been introduced and shown to be decidable by Aziz, Sanwal, Singhal and Brayton in 1996 (1, 2). Their proof can be turned into an ap- proximation algorithm with worse than exponential complexity. In 2000, Baier, Haverkort, Hermanns and Katoen (4, 5) presented an efficient polynomial-time approximation algo- rithm for the sublogic in which only binary until is allowed. In this paper, we propose such an efficient polynomial-time approximation algorithm for full CSL. The key to our method is the notion of stratified CTMCs with respect to the CSL prop- erty to be checked. On a stratified CTMC, the probability to satisfy a CSL path formula can be approximated by a transient analysis in polynomial time (using uniformization). We present a measure-preserving, linear-time and -space transformation of any CTMC into an equivalent, stratified one. This makes the present work the centerpiece of a broadly applicable full CSL model checker. Recently, the decision algorithm by Aziz et al. was shown to work only for stratified CTMCs. As an additional contribution, our measure-preserving transformation can be used to ensure the decidability for general CTMCs.

Connected through hyperedge HE-1 (induced by source paper "on probabilistic term rewriting"):
  with members:
    - "modular runtime complexity analysis of probabilistic while programs"
    - "bounded expectations resource analysis for probabilistic programs"
    - "a new proof rule for almost sure termination"
    - "termination analysis of probabilistic programs through positivstellensatz s"
    - "on the hardness of almost sure termination"
    - "nagoya termination tool"
    - "church a language for generative models"
    - "on constructor rewrite systems and the lambda calculus"

Connected through hyperedge HE-2 (induced by source paper "depending on session typed processes"):
  with members:
    - "parameterised multiparty session types"
    - "on equivalence and canonical forms in the lf type theory"

Connected through hyperedge HE-3 (induced by source paper "a combination framework for complexity"):
  with members:
    - "polynomial path orders"
    - "on constructor rewrite systems and the lambda calculus"
    - "bounded termination of monotonicity constraint transition systems"
    - "a new order theoretic characterisation of the polytime computable functions"
    - "polynomial path orders a maximal model"
    - "automated complexity analysis based on the dependency pair method"
    - "monotonicity constraints for termination in the integer domain"
    - "the derivational complexity induced by the dependency pair method"

Connected through hyperedge HE-4 (induced by source paper "feasible combinatorial matrix theory"):
  with members:
    - "formalizing randomized matching algorithms"

Connected through hyperedge HE-5 (induced by source paper "initiality for typed syntax and semantics"):
  with members:
    - "modules over relative monads for syntax and semantics"
    - "monads need not be endofunctors"
    - "extended initiality for typed abstract syntax"
    - "type classes for mathematics in type theory"
    - "initial semantics for higher order typed syntax in coq"
    - "modules over monads and linearity"

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)