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 "endofunctors modelling higher order behaviours"):
  Abstract: In this paper we show how the abstract behaviours of higher-order systems can be modelled as final coalgebras of suitable behavioural functors. These functors have the challenging peculiarity to be circularly defined with their own final coalgebra. Our main contribution is a general construction for defining these functors, solving this circularity which is the essence of higher-order behaviours. This characterisation is syntax agnostic. To achieve this property, we shift from term passing to behaviour passing: in the former higher-order is expressed by passing around syntactic objects (such as terms or processes) as representations of behaviours whereas the former ditches the syntactic encoding altogether and works directly with behaviours i.e. semantic objects. From this perspective, the former can be seen as syntactic higher-order whereas the later as semantic higher-order.

Includes members:
  Member "behavioural equivalences for coalgebras with unobservable moves":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a coalgebraic take on regular and omega regular behaviours")
  Member "gsos for non deterministic processes with quantitative aspects":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "behavioural equivalences for timed systems")
  Member "structural operational semantics for non deterministic processes with quantitative aspects":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "quantitative aspects of programming languages and systems over the past 2 4 years and beyond")
  Member "weak bisimulations for labelled transition systems weighted over semirings":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "behavioural equivalences for timed systems")
  Member "first steps in synthetic guarded domain theory step indexing in the topos of trees":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "diamonds are not forever liveness in reactive programming with guarded recursion")
  Member "generic trace semantics via coinduction":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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)