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: "sound and complete axiomatizations of coalgebraic language equivalence"
  Abstract: Coalgebras provide a uniform framework for studying dynamical systems, including several types of automata. In this article, we make use of the coalgebraic view on systems to investigate, in a uniform way, under which conditions calculi that are sound and complete with respect to behavioral equivalence can be extended to a coarser coalgebraic language equivalence, which arises from a generalized powerset construction that determinizes coalgebras. We show that soundness and completeness are established by proving that expressions modulo axioms of a calculus form the rational fixpoint of the given type functor. Our main result is that the rational fixpoint of the functor FT, where T is a monad describing the branching of the systems (e.g., non-determinism, weights, probability, etc.), has as a quotient the rational fixpoint of the determinized type functor F, a lifting of F to the category of T-algebras. We apply our framework to the concrete example of weighted automata, for which we present a new sound and complete calculus for weighted language equivalence. As a special case, we obtain nondeterministic automata in which we recover Rabinovich’s sound and complete calculus for language equivalence.

Connected through hyperedge HE-1 (induced by source paper "toward a uniform theory of effectful state machines"):
  with members:
    - "presenting distributive laws"
    - "towards a coalgebraic chomsky hierarchy"
    - "coalgebraic characterizations of context free languages"
    - "generalizing determinization from automata to coalgebras"
    - "reactive turing machines"
    - "non deterministic kleene coalgebras"

Connected through hyperedge HE-2 (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"
    - "generalizing determinization from automata to coalgebras"
    - "nominal coalgebraic data types with applications to lambda calculus"
    - "semantics of higher order recursion schemes"
    - "simulations of weighted tree automata"

Connected through hyperedge HE-3 (induced by source paper "graded monads and graded logics for the linear time branching time spectrum"):
  with members:
    - "convex language semantics for nondeterministic probabilistic automata"
    - "coalgebraic trace semantics via forgetful logics"
    - "a linear time branching time spectrum of behavioral specification theories"
    - "automata theory in nominal sets"
    - "coalgebraic trace semantics for continuous probabilistic transition systems"
    - "from branching to linear time coalgebraically"
    - "generalizing determinization from automata to coalgebras"
    - "generic trace logics"

Connected through hyperedge HE-4 (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"
    - "coalgebraic characterizations of context free languages"
    - "generalizing determinization from automata to coalgebras"
    - "on the specification of operations on the rational behaviour of systems"
    - "semantics of higher order recursion schemes"
    - "non deterministic kleene coalgebras"
    - "the category theoretic solution of recursive program schemes"

Connected through hyperedge HE-5 (induced by source paper "proper semirings and proper convex functors"):
  with members:
    - "relating coalgebraic notions of bisimulation"
    - "a focused sequent calculus framework for proof search in pure type systems"
    - "simulation vs equivalence"

Connected through hyperedge HE-6 (induced by source paper "quantitative simulations by matrices"):
  with members:
    - "coalgebraic trace semantics via forgetful logics"
    - "coalgebraic infinite traces and kleisli simulations"
    - "coinduction up to in a fibrational setting"
    - "coalgebraic trace semantics for continuous probabilistic transition systems"
    - "computation of the greatest simulations and bisimulations between fuzzy automata"
    - "bisimulations for fuzzy automata"
    - "simulation vs equivalence"
    - "generic trace semantics via coinduction"

Connected through hyperedge HE-7 (induced by source paper "stream differential equations specification formats and solution methods"):
  with members:
    - "presenting distributive laws"
    - "coalgebraic characterizations of context free languages"
    - "automatic sequences and zip specifications"
    - "well definedness of streams by transformation and termination"
    - "representations of stream processors using nested fixed points"
    - "rational streams coalgebraically"

Connected through hyperedge HE-8 (induced by source paper "a complete quantitative deduction system for the bisimilarity distance on markov chains"):
  with members:
    - "mixed powerdomains for probability and nondeterminism"
    - "approximating a behavioural pseudometric without discount for probabilistic systems"

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)