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: "semantics of higher order recursion schemes"
  Abstract: Higher-order recursion schemes are recursive equations defining new#N#operations from given ones called "terminals". Every such recursion scheme is#N#proved to have a least interpreted semantics in every Scott's model of#N#\lambda-calculus in which the terminals are interpreted as continuous#N#operations. For the uninterpreted semantics based on infinite \lambda-terms we#N#follow the idea of Fiore, Plotkin and Turi and work in the category of sets in#N#context, which are presheaves on the category of finite sets. Fiore et al#N#showed how to capture the type of variable binding in \lambda-calculus by an#N#endofunctor H\lambda and they explained simultaneous substitution of#N#\lambda-terms by proving that the presheaf of \lambda-terms is an initial#N#H\lambda-monoid. Here we work with the presheaf of rational infinite#N#\lambda-terms and prove that this is an initial iterative H\lambda-monoid. We#N#conclude that every guarded higher-order recursion scheme has a unique#N#uninterpreted solution in this monoid.

Connected through hyperedge HE-1 (induced by source paper "on the behaviour of coalgebras with side effects and algebras with effectful iteration"):
  with members:
    - "a new foundation for finitary corecursion and iterative algebras"
    - "proper semirings and proper convex functors"
    - "proper functors and fixed points for finite behaviour"
    - "regular behaviours with names"
    - "sound and complete axiomatizations of coalgebraic language equivalence"
    - "generalizing determinization from automata to coalgebras"
    - "nominal coalgebraic data types with applications to lambda calculus"
    - "simulations of weighted tree automata"

Connected through hyperedge HE-2 (induced by source paper "a new foundation for finitary corecursion and iterative algebras"):
  with members:
    - "proper functors and fixed points for finite behaviour"
    - "towards a coalgebraic chomsky hierarchy"
    - "sound and complete axiomatizations of coalgebraic language equivalence"
    - "coalgebraic characterizations of context free languages"
    - "generalizing determinization from automata to coalgebras"
    - "on the specification of operations on the rational behaviour of systems"
    - "non deterministic kleene coalgebras"
    - "the category theoretic solution of recursive program schemes"

Connected through hyperedge HE-3 (induced by source paper "proper functors and fixed points for finite behaviour"):
  with members:
    - "free iterative and iteration k semialgebras"
    - "simulation vs equivalence"
    - "simulations of weighted tree automata"

Connected through hyperedge HE-4 (induced by source paper "sound and complete axiomatizations of coalgebraic language equivalence"):
  with members:
    - "non deterministic kleene coalgebras"
    - "free iterative and iteration k semialgebras"
    - "simulation vs equivalence"
    - "simulations of weighted tree automata"
    - "generic trace semantics via coinduction"

Connected through hyperedge HE-5 (induced by source paper "nominal coalgebraic data types with applications to lambda calculus"):
  with members:
    - "a dependent nominal type theory"

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)