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 path based coalgebras and weak notions of bisimulation"
  Abstract: It is well known that the theory of coalgebras provides an abstract definition of behavioural equivalence that coincides with strong bisimulation across a wide variety of state-based systems. Unfortunately, the theory in the presence of so-called silent actions is not yet fully developed. In this paper, we give a coalgebraic characterisation of branching bisimulation in the context of labelled transition systems and fully probabilistic systems. It is shown that recording executions (up to a notion of stuttering), rather than the set of successor states, from a state is sufficient to characterise branching bisimulation in both cases.

Connected through hyperedge HE-1 (induced by source paper "relating apartness and bisimulation"):
  with members:
    - "a simpler o m log n algorithm for branching bisimilarity on labelled transition systems"

Connected through hyperedge HE-2 (induced by source paper "bisimulation maps in presheaf categories"):
  with members:
    - "an intensionally fully abstract sheaf model for pi expanded version"
    - "what s in a game a theory of game models"
    - "what are the fundamental structures of concurrency we still don t know"
    - "innocent strategies as presheaves and interactive equivalences for ccs"
    - "hierarchical states in the compositional interchange format"

Connected through hyperedge HE-3 (induced by source paper "path category for free open morphisms from coalgebras with non deterministic branching"):
  with members:
    - "the power of convex algebras"
    - "regular behaviours with names"
    - "well pointed coalgebras"
    - "nominal coalgebraic data types with applications to lambda calculus"
    - "history preserving bisimilarity for higher dimensional automata via open maps"
    - "algebraic theories over nominal sets"
    - "generic trace semantics via coinduction"

Connected through hyperedge HE-4 (induced by source paper "a coalgebraic treatment of conditional transition systems with upgrades"):
  with members:
    - "bisimulation of labelled state to function transition systems coalgebraically"
    - "probabilistic bisimulation naturally on distributions"
    - "generic trace semantics via coinduction"

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)