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 "lax functors and coalgebraic weak bisimulation"):
  Abstract: We generalize the work by Soboci\'nski on relational presheaves and their connection with weak (bi)simulation for labelled transistion systems to a coalgebraic setting. We show that the coalgebraic notion of saturation studied in our previous work can be expressed in the language of lax functors in terms of existence of a certain adjunction between categories of lax functors. This observation allows us to generalize the notion of the coalgebraic weak bisimulation to lax functors. We instantiate this definition on two examples of timed systems and show that it coincides with their time-abstract behavioural equivalence.

Includes members:
  Member "weak bisimulation for coalgebras over order enriched monads":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "up to techniques for branching bisimilarity")
  Member "behavioural equivalences for coalgebras with unobservable moves":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a coalgebraic take on regular and omega regular behaviours")
  Member "on coalgebras with internal moves":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a coalgebraic take on regular and omega regular behaviours")
  Member "coalgebraic weak bisimulation from recursive equations over monads":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "behavioural equivalences for timed systems")
  Member "stochastic timed automata":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "decisiveness of stochastic systems and its application to hybrid models")
  Member "relating coalgebraic notions of bisimulation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "infinite types infinite data infinite interaction")
  Member "generic trace semantics via coinduction":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "preservation of equations by monoidal monads")

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)