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 "path category for free open morphisms from coalgebras with non deterministic branching"):
  Abstract: There are different categorical approaches to variations of transition systems and their bisimulations. One is coalgebra for a functor G, where a bisimulation is defined as a span of G-coalgebra homomorphism. Another one is in terms of path categories and open morphisms, where a bisimulation is defined as a span of open morphisms. This similarity is no coincidence: given a functor G, fulfilling certain conditions, we derive a path-category for pointed G-coalgebras and lax homomorphisms, such that the open morphisms turn out to be precisely the G-coalgebra homomorphisms. The above construction provides path-categories and trace semantics for free for different flavours of transition systems: (1) non-deterministic tree automata (2) regular nondeterministic nominal automata (RNNA), an expressive automata notion living in nominal sets (3) multisorted transition systems. This last instance relates to Lasota's construction, which is in the converse direction.

Includes members:
  Member "the power of convex algebras":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "preservation of equations by monoidal monads")
  Member "on path based coalgebras and weak notions of bisimulation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "relating apartness and bisimulation")
  Member "regular behaviours with names":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the behaviour of coalgebras with side effects and algebras with effectful iteration")
  Member "well pointed coalgebras":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "coalgebra learning via duality")
  Member "nominal coalgebraic data types with applications to lambda calculus":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the behaviour of coalgebras with side effects and algebras with effectful iteration")
  Member "history preserving bisimilarity for higher dimensional automata via open maps":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "weak morphisms of higher dimensional automata")
  Member "algebraic theories over nominal sets":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "regular behaviours with names")
  Member "generic trace semantics via coinduction":
    also connected through other hyperedges:
      - Hyperedge HE-8 (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.FL(Formal Languages and Automata Theory)