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 "quantitative simulations by matrices"):
  Abstract: Abstract   We introduce notions of simulation between semiring-weighted automata as models of quantitative systems. Our simulations are instances of the categorical/coalgebraic notions previously studied by Hasuo—hence soundness against language inclusion comes for free—but are concretely presented as matrices that are subject to linear inequality constraints. Pervasiveness of these formalisms allows us to exploit existing algorithms in: searching for a simulation, and hence verifying quantitative correctness that is formulated as language inclusion. Transformations of automata that aid search for simulations are introduced, too. This verification workflow is implemented for the plus-times and max-plus semirings. Furthermore, an extension to weighted tree automata is presented and implemented.

Includes members:
  Member "coalgebraic trace semantics via forgetful logics":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "tree automata as algebras minimisation and determinisation")
  Member "coalgebraic infinite traces and kleisli simulations":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "guarded and unguarded iteration for generalized processes")
  Member "coinduction up to in a fibrational setting":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "codensity games for bisimilarity")
  Member "coalgebraic trace semantics for continuous probabilistic transition systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "graded monads and graded logics for the linear time branching time spectrum")
  Member "sound and complete axiomatizations of coalgebraic language equivalence":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "toward a uniform theory of effectful state machines")
  Member "computation of the greatest simulations and bisimulations between fuzzy automata":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "polynomial time algorithms for computing distances of fuzzy transition systems")
  Member "bisimulations for fuzzy automata":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "polynomial time algorithms for computing distances of fuzzy transition systems")
  Member "simulation vs equivalence":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "proper semirings and proper convex functors")

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)