human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "a definition scheme for quantitative bisimulation"
  Abstract: FuTS, state-to-function transition systems are generalizations of labeled transition systems and of familiar notions of quantitative semantical models as continuous-time Markov chains, interactive Markov chains, and Markov automata. A general scheme for the definition of a notion of strong bisimulation associated with a FuTS is proposed. It is shown that this notion of bisimulation for a FuTS coincides with the coalgebraic notion of behavioral equivalence associated to the functor on Set given by the type of the FuTS. For a series of concrete quantitative semantical models the notion of bisimulation as reported in the literature is proven to coincide with the notion of quantitative bisimulation obtained from the scheme. The comparison includes models with orthogonal behaviour, like interactive Markov chains, and with multiple levels of behavior, like Markov automata. As a consequence of the general result relating FuTS bisimulation and behavioral equivalence we obtain, in a systematic way, a coalgebraic underpinning of all quantitative bisimulations discussed.

Connected through hyperedge HE-1 (induced by source paper "quantitative aspects of programming languages and systems over the past 2 4 years and beyond"):
  with members:
    - "paws a tool for the analysis of weighted systems"
    - "divide and conquer variable set separation in hybrid systems reachability analysis"
    - "logical characterization of trace metrics"
    - "design and optimisation of the flyfast front end for attribute based coordination"
    - "language based abstractions for dynamical systems"
    - "limit your consumption finding bounds in average energy games"
    - "mela modelling in ecology with location attributes"
    - "logical characterization of bisimulation metrics"

Connected through hyperedge HE-2 (induced by source paper "structural operational semantics for non deterministic processes with quantitative aspects"):
  with members:
    - "killing epsilons with a dagger a coalgebraic study of systems with algebraic label structure"
    - "behavioural equivalences for coalgebras with unobservable moves"
    - "distributive laws and decidable properties of sos specifications"
    - "on coalgebras with internal moves"
    - "gsos for non deterministic processes with quantitative aspects"
    - "coalgebraic weak bisimulation from recursive equations over monads"
    - "weak bisimulations for labelled transition systems weighted over semirings"
    - "tree rules in probabilistic transition system specifications with negative and quantitative premises"

Question: Please tell me which class the center node 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)