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 "behavioural equivalences for timed systems"):
  Abstract: Timed transition systems are behavioural models that include an explicit treatment of time flow and are used to formalise the semantics of several foundational process calculi and automata. Despite their relevance, a general mathematical characterisation of timed transition systems and their behavioural theory is still missing. We introduce the first uniform framework for timed behavioural models that encompasses known behavioural equivalences such as timed bisimulations, timed language equivalences as well as their weak and time-abstract counterparts. All these notions of equivalences are naturally organised by their discriminating power in a spectrum. We prove that this result does not depend on the type of the systems under scrutiny: it holds for any generalisation of timed transition system. We instantiate our framework to timed transition systems and their quantitative extensions such as timed probabilistic systems.

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 "lax functors and coalgebraic weak bisimulation":
    also connected through other hyperedges:
      (none)
  Member "gsos for non deterministic processes with quantitative aspects":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "lean and full congruence formats for recursion")
  Member "structural operational semantics for non deterministic processes with quantitative aspects":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "quantitative aspects of programming languages and systems over the past 2 4 years and beyond")
  Member "coalgebraic weak bisimulation from recursive equations over monads":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "behavioural equivalences for coalgebras with unobservable moves")
  Member "coinduction up to in a fibrational setting":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "codensity games for bisimilarity")

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)