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 "complexity of model checking recursion schemes for fragments of the modal mu calculus"):
  Abstract: Ong has shown that the modal mu-calculus model checking problem#N#(equivalently, the alternating parity tree automaton (APT) acceptance problem)#N#of possibly-infinite ranked trees generated by order-n recursion schemes is#N#n-EXPTIME complete. We consider two subclasses of APT and investigate the#N#complexity of the respective acceptance problems. The main results are that,#N#for APT with a single priority, the problem is still n-EXPTIME complete;#N#whereas, for APT with a disjunctive transition function, the problem is#N#(n-1)-EXPTIME complete. This study was motivated by Kobayashi's recent work#N#showing that the resource usage verification of functional programs can be#N#reduced to the model checking of recursion schemes. As an application, we show#N#that the resource usage verification problem is (n-1)-EXPTIME complete.

Includes members:
  Member "the safe lambda calculus":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "reducing lambda terms with traversals")
  Member "the complexity of games on higher order pushdown automata":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "decision procedures for path feasibility of string manipulating programs with complex operations")
  Member "a finite semantics of simply typed lambda terms for infinite runs of automata":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "around finite second order coherence spaces")

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)